Borderou de evaluare (job #2907355)

Utilizator gogurazvanRazvan Gogu gogurazvan Data 29 mai 2022 21:08:18
Problema Arbore partial de cost minim Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 60

Raport evaluator

Compilare: main.cpp: In member function 'void Graf::recursieDFS(int, bool*)': main.cpp:24:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, muchie_prop> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 24 | for(int i=0; i<vecin[nod].size(); ++i) | ~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::recursieDFSdistante(int, int*, int)': main.cpp:31:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, muchie_prop> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 31 | for(int i=0; i<vecin[nod].size(); ++i) | ~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::recursieDFS_sort(int, bool*, std::stack<int>&)': main.cpp:39:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, muchie_prop> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 39 | for(int i=0; i<vecin[nod].size(); ++i) | ~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::recursieCTC(int, int*, int*, std::stack<int>&, bool*, int&, int&, int*, int&)': main.cpp:55:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, muchie_prop> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 55 | for(int i=0; i<vecin[nod].size(); ++i){ | ~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::recursieBC(int, int*, int*, std::stack<int>&, int&, int&, int*, int&)': main.cpp:83:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, muchie_prop> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 83 | for(int i=0; i<vecin[nod].size(); ++i){ | ~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::BFS(int)': main.cpp:166:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, muchie_prop> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 166 | for(int i=0; i<vecin[nod].size(); ++i){ | ~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::Dijkstra(int, int*)': main.cpp:330:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, muchie_prop> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 330 | for( int j=0; j< vecin[p].size(); ++j ){ | ~^~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::APM(int&, std::pair<int, int>*)': main.cpp:372:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, muchie_prop> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 372 | for(int j=0; j<vecin[nod].size(); ++j){ | ~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::BellF(int&, std::pair<int, int>*)': main.cpp:411:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, muchie_prop> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 411 | for(int j=0; j<vecin[nod].size(); ++j){ | ~^~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
13ms2535kbCorect10
24ms2539kbCorect10
36ms2666kbCorect10
43ms2666kbCorect10
53ms2674kbCorect10
6161ms7421kbArborele selectat nu are costul minim0
7395ms10514kbArborele selectat nu are costul minim0
870ms4476kbArborele selectat nu are costul minim0
994ms4857kbCorect10
10502ms10911kbArborele selectat nu are costul minim0
Punctaj total60

Ceva nu functioneaza?