Borderou de evaluare (job #2809273)

Utilizator 134_tufa_liliana_ionelaTufa Liliana Ionela 134_tufa_liliana_ionela Data 26 noiembrie 2021 15:38:52
Problema Algoritmul lui Dijkstra Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 50

Raport evaluator

Compilare: main.cpp: In member function 'std::vector<int> Graf::CodDisjoint(std::vector<std::pair<int, std::pair<int, int> > >)': main.cpp:207:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 207 | for(int i=0; i < operatii.size();i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In function 'void Disjoint()': main.cpp:239:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 239 | for(auto i=0; i<afisare.size(); i++) | ~^~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graf::CodDisjkstra(std::vector<std::vector<std::pair<int, int> > >)': main.cpp:262:31: warning: value computed is not used [-Wunused-value] 262 | vizitat[NodCurent]==true; | ~~~~~~~~~~~~~~~~~~^~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms184kbOK10
22ms184kbOK10
311ms262kbOK10
421ms319kbOK10
51001ms1404kbTime limit exceeded0
61000ms2347kbTime limit exceeded0
71002ms3670kbTime limit exceeded0
8164ms7827kbOK10
91004ms6942kbTime limit exceeded0
101003ms9326kbTime limit exceeded0
Punctaj total50

Ceva nu functioneaza?