Borderou de evaluare (job #2821975)

Utilizator Zamolxis25Sebastian Gradinaru Zamolxis25 Data 23 decembrie 2021 13:43:14
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
9503ms3297kbTime limit exceeded0
106ms225kbOK5
11504ms4595kbTime limit exceeded00
12500ms6631kbTime limit exceeded0
13502ms6000kbTime limit exceeded0
14503ms10743kbTime limit exceeded0
15503ms11800kbTime limit exceeded00
16503ms11161kbTime limit exceeded0
1711ms249kbOK5
18502ms14340kbTime limit exceeded00
19503ms14970kbTime limit exceeded0
2030ms401kbOK5
Punctaj total35

Ceva nu functioneaza?