Borderou de evaluare (job #2802837)

Utilizator PopescuMihneaPopescu Mihnea-Valentin PopescuMihnea Data 18 noiembrie 2021 21:16:48
Problema Algoritmul Bellman-Ford Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 10

Raport evaluator

Compilare: main.cpp: In member function 'void graf::havelhakimi()': main.cpp:383:33: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare] 383 | for (unsigned int i=0; i<=vmax; ++i) | ~^~~~~~ main.cpp:384:37: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare] 384 | for (unsigned int j=0; j<ap[i]; ++j) | ~^~~~~~ main.cpp: In member function 'void graf::disjoint()': main.cpp:575:29: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare] 575 | for (unsigned int i=0; i<=n; ++i) | ~^~~ main.cpp: In member function 'void graf::dijkstra()': main.cpp:654:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 654 | for (int i=0; i<lista_vecini[nod].size(); ++i) | ~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void graf::Bellman_Ford()': main.cpp:684:9: warning: variable 't' set but not used [-Wunused-but-set-variable] 684 | int t[this->n+1]; | ^
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
11ms184kbOK55
21ms184kbOK55
31ms184kbIncorect00
41ms184kbIncorect00
510ms307kbIncorect00
61ms184kbIncorect00
71ms184kbIncorect0
8503ms1339kbTime limit exceeded00
9500ms1376kbTime limit exceeded0
101ms184kbIncorect0
11500ms2134kbTime limit exceeded00
12502ms2465kbTime limit exceeded0
13503ms2101kbTime limit exceeded0
14502ms3194kbTime limit exceeded0
15500ms3858kbTime limit exceeded00
16503ms3252kbTime limit exceeded0
176ms184kbIncorect0
18502ms4767kbTime limit exceeded00
19502ms5472kbTime limit exceeded0
2011ms307kbIncorect0
Punctaj total10

Ceva nu functioneaza?