Borderou de evaluare (job #2822482)

Utilizator MadalinaKopaczMadalina Kopacz MadalinaKopacz Data 23 decembrie 2021 23:57:38
Problema Parcurgere DFS - componente conexe Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 0

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
1203ms61177kbTime limit exceeded0
2204ms61161kbTime limit exceeded0
3204ms59039kbTime limit exceeded0
4202ms61190kbTime limit exceeded0
5204ms61161kbTime limit exceeded0
6204ms61198kbTime limit exceeded0
7203ms61177kbTime limit exceeded0
8202ms61206kbTime limit exceeded0
9203ms61177kbTime limit exceeded0
10200ms57892kbTime limit exceeded0
11202ms61489kbTime limit exceeded0
12203ms61202kbTime limit exceeded0
13203ms61091kbTime limit exceeded0
14202ms61145kbTime limit exceeded0
15202ms61382kbTime limit exceeded0
16203ms61116kbTime limit exceeded0
17202ms61104kbTime limit exceeded0
18202ms61169kbTime limit exceeded0
19202ms61120kbTime limit exceeded0
20201ms58953kbTime limit exceeded0
Punctaj total0

Ceva nu functioneaza?