Pagini recente » Borderou de evaluare (job #2194340) | Borderou de evaluare (job #308705) | Borderou de evaluare (job #82042) | Borderou de evaluare (job #1497314) | Borderou de evaluare (job #2822482)
Borderou de evaluare (job #2822482)
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 |
1 | 203ms | 61177kb | Time limit exceeded | 0 |
2 | 204ms | 61161kb | Time limit exceeded | 0 |
3 | 204ms | 59039kb | Time limit exceeded | 0 |
4 | 202ms | 61190kb | Time limit exceeded | 0 |
5 | 204ms | 61161kb | Time limit exceeded | 0 |
6 | 204ms | 61198kb | Time limit exceeded | 0 |
7 | 203ms | 61177kb | Time limit exceeded | 0 |
8 | 202ms | 61206kb | Time limit exceeded | 0 |
9 | 203ms | 61177kb | Time limit exceeded | 0 |
10 | 200ms | 57892kb | Time limit exceeded | 0 |
11 | 202ms | 61489kb | Time limit exceeded | 0 |
12 | 203ms | 61202kb | Time limit exceeded | 0 |
13 | 203ms | 61091kb | Time limit exceeded | 0 |
14 | 202ms | 61145kb | Time limit exceeded | 0 |
15 | 202ms | 61382kb | Time limit exceeded | 0 |
16 | 203ms | 61116kb | Time limit exceeded | 0 |
17 | 202ms | 61104kb | Time limit exceeded | 0 |
18 | 202ms | 61169kb | Time limit exceeded | 0 |
19 | 202ms | 61120kb | Time limit exceeded | 0 |
20 | 201ms | 58953kb | Time limit exceeded | 0 |
Punctaj total | 0 |