Borderou de evaluare (job #2821965)

Utilizator Zamolxis25Sebastian Gradinaru Zamolxis25 Data 23 decembrie 2021 13:30:18
Problema Algoritmul Bellman-Ford Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 35

Raport evaluator

Compilare: main.cpp: In constructor 'Graf::Graf(int, int, bool, std::vector<std::vector<int> >&)': main.cpp:59:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 59 | for(int j = 0; j < adjacencyList[i].size(); j++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In constructor 'Graf::Graf(int, int, bool, std::vector<std::vector<int> >&, bool, std::vector<Graf::edge>&)': main.cpp:90:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 90 | for(int j = 0; j < adjacencyList[i].size(); j++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
12ms184kbOK55
22ms184kbOK55
32ms184kbOK55
42ms184kbOK55
56ms331kbOK55
62ms184kbOK510
72ms184kbOK5
8504ms2867kbTime limit exceeded00
9503ms3305kbTime limit exceeded0
106ms200kbOK5
11503ms4517kbTime limit exceeded00
12500ms6520kbTime limit exceeded0
13502ms6074kbTime limit exceeded0
14503ms10764kbTime limit exceeded0
15502ms11808kbTime limit exceeded00
16503ms11157kbTime limit exceeded0
1715ms356kbOK5
18502ms14376kbTime limit exceeded00
19502ms14970kbTime limit exceeded0
2030ms401kbOK5
Punctaj total35

Ceva nu functioneaza?