Borderou de evaluare (job #2822475)

Utilizator MadalinaKopaczMadalina Kopacz MadalinaKopacz Data 23 decembrie 2021 23:49:53
Problema Algoritmul Bellman-Ford Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp: In function 'std::ostream& operator<<(std::ostream&, const Graf&)': main.cpp:175:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<muchie>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 175 | for (int j = 1; j < grafDat.lisAdiacenta[i].size(); ++j) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::BFS(int, std::vector<int>&, std::vector<int>&)': main.cpp:267:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<muchie>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 267 | for (int i = 1; i < lisAdiacenta[x].size(); ++i) | ~~^~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:257:12: warning: unused variable 'y' [-Wunused-variable] 257 | int x, y; | ^ main.cpp: In member function 'void Graf::DFS(int, std::vector<bool>&, std::stack<int>&)': main.cpp:281:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<muchie>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 281 | for(int i = 1; i < lisAdiacenta[x].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::biconexeDFS(int, int, std::vector<int>&, std::vector<int>&, std::stack<int>&, std::vector<std::vector<int> >&, int&, std::vector<bool>&)': main.cpp:311:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<muchie>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 311 | for (int i = 1; i < lisAdiacenta[x].size(); ++i) | ~~^~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::ctcDFS(int, std::vector<int>&, std::vector<int>&, std::stack<int>&, std::vector<bool>&, std::vector<std::vector<int> >&)': main.cpp:370:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<muchie>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 370 | for (int i = 1; i < lisAdiacenta[x].size(); i++) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In static member function 'static bool Graf::existaGraf(std::vector<int>&)': main.cpp:448:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 448 | for (int i = 0; i < copieGrade.size(); ++i) | ~~^~~~~~~~~~~~~~~~~~~ main.cpp:463:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 463 | if (fst > grade.size()) { //daca avem un grad mai mare decat numarul de noduri ramase | ~~~~^~~~~~~~~~~~~~ main.cpp:476:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 476 | if(j >= grade.size()) //atunci cand scadem 1 valorile nu vor mai fi ordonate decat daca sunt egale initial | ~~^~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::critConDFS(int, std::vector<bool>&, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<std::vector<int> >&)': main.cpp:496:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<muchie>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 496 | for (int i = 1; i < lisAdiacenta[x].size(); ++i) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graf::Dijkstra(int)': main.cpp:549:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<muchie>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 549 | for (int i = 1; i < lisAdiacenta[x].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graf::BellmanFord(int)': main.cpp:582:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<muchie>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 582 | for (int i = 1; i < lisAdiacenta[x].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<std::pair<int, std::pair<int, int> > > Graf::findLisMuchii()': main.cpp:610:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<muchie> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 610 | for(int i = 1; i < lisAdiacenta.size(); ++i) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::pair<int, std::vector<std::pair<int, int> > > Graf::Kruskal(std::vector<std::pair<int, std::pair<int, int> > >)':
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
12ms262kbOK55
22ms184kbOK55
32ms184kbOK55
42ms184kbOK55
52ms184kbOK55
62ms184kbOK510
72ms184kbOK5
864ms1830kbOK515
959ms2478kbOK5
102ms184kbOK5
11106ms2818kbOK520
12144ms5169kbOK5
13106ms4247kbOK5
14197ms6750kbOK5
15249ms8335kbOK515
16197ms6746kbOK5
1711ms331kbOK5
18297ms10661kbOK515
19359ms12566kbOK5
2016ms376kbOK5
Punctaj total100

Ceva nu functioneaza?