Borderou de evaluare (job #2821970)

Utilizator Zamolxis25Sebastian Gradinaru Zamolxis25 Data 23 decembrie 2021 13:39:33
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
8504ms2863kbTime limit exceeded00
9503ms3325kbTime limit exceeded0
106ms331kbOK5
11503ms4587kbTime limit exceeded00
12504ms6561kbTime limit exceeded0
13503ms6029kbTime limit exceeded0
14504ms10788kbTime limit exceeded0
15502ms11706kbTime limit exceeded00
16503ms11223kbTime limit exceeded0
176ms331kbOK5
18502ms14278kbTime limit exceeded00
19502ms14970kbTime limit exceeded0
2016ms331kbOK5
Punctaj total35

Ceva nu functioneaza?