Borderou de evaluare (job #2527041)

Utilizator greenadexIulia Harasim greenadex Data 19 ianuarie 2020 15:58:20
Problema Algoritmul Bellman-Ford Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp: In member function 'std::vector<int> ShortestPathFinder::FindShortestPaths(int)': main.cpp:44:44: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if (num_times_in_queue[adj_node] >= graph_.size()) { main.cpp: In function 'int main()': main.cpp:86:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 1; i < result.size(); i++) { ~~^~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
12ms131kbOK55
22ms131kbOK55
33ms131kbOK55
43ms176kbOK55
54ms262kbOK55
63ms131kbOK510
722ms131kbOK5
8194ms1966kbOK515
972ms1835kbOK5
1029ms131kbOK5
11252ms3145kbOK520
12146ms3145kbOK5
13129ms3145kbOK5
14227ms4325kbOK5
15275ms5373kbOK515
16219ms4718kbOK5
17133ms262kbOK5
18362ms7483kbOK515
19425ms8138kbOK5
20155ms262kbOK5
Punctaj total100

Ceva nu functioneaza?