Borderou de evaluare (job #2807589)

Utilizator oana_mireaMirea Oana-Gabriela oana_mirea Data 23 noiembrie 2021 22:56:00
Problema Algoritmul Bellman-Ford Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 0

Raport evaluator

Compilare: main.cpp: In member function 'void Graf::APM()': main.cpp:120:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 120 | for (int i = 0; i < lista_muchii.size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::Dijkstra()': main.cpp:187:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 187 | for(int i = 0; i < lista_ad[curr].size();i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::Bellman_Ford()': main.cpp:235:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 235 | for(int i = 0; i < lista_ad[curr].size();i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
12ms184kbIncorect00
22ms184kbIncorect00
32ms184kbIncorect00
42ms184kbIncorect00
511ms307kbIncorect00
66ms270kbIncorect00
7329ms782kbIncorect0
8503ms2060kbTime limit exceeded00
9392ms1908kbIncorect0
10501ms1130kbTime limit exceeded0
11503ms2879kbTime limit exceeded00
12503ms3182kbTime limit exceeded0
13502ms2863kbTime limit exceeded0
14502ms3907kbTime limit exceeded0
15502ms4476kbTime limit exceeded00
16502ms3919kbTime limit exceeded0
17503ms1040kbTime limit exceeded0
18501ms5410kbTime limit exceeded00
19501ms6037kbTime limit exceeded0
20503ms1134kbTime limit exceeded0
Punctaj total0

Ceva nu functioneaza?