Pagini recente » Borderou de evaluare (job #2838306) | Borderou de evaluare (job #415403) | Borderou de evaluare (job #387345) | Borderou de evaluare (job #2843272) | Borderou de evaluare (job #2907306)
Borderou de evaluare (job #2907306)
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:368: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]
368 | for(int j=0; j<vecin[nod].size(); ++j){
| ~^~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 4ms | 2273kb | Arborele selectat nu are costul minim | 0 |
2 | 6ms | 2535kb | Corect | 10 |
3 | 5ms | 2666kb | Arborele selectat nu are costul minim | 0 |
4 | 6ms | 2674kb | Arborele selectat nu are costul minim | 0 |
5 | 1ms | 184kb | Arborele selectat nu are costul minim | 0 |
6 | 265ms | 7245kb | Arborele selectat nu are costul minim | 0 |
7 | 317ms | 10215kb | Arborele selectat nu are costul minim | 0 |
8 | 68ms | 4456kb | Arborele selectat nu are costul minim | 0 |
9 | 52ms | 4808kb | Arborele selectat nu are costul minim | 0 |
10 | 462ms | 9236kb | Arborele selectat nu are costul minim | 0 |
Punctaj total | 10 |