Borderou de evaluare (job #2907536)

Utilizator Ssebi1Dancau Sebastian Ssebi1 Data 30 mai 2022 17:27:00
Problema Marmelada Status done
Runda Arhiva de probleme Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp: In function 'std::ostream& operator<<(std::ostream&, Graf&)': main.cpp:97:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 97 | for (int j = 1; j < graf.matriceAdiacenta[i].size(); j++) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::bfs_marmelada(int, std::vector<std::vector<std::pair<int, int> > >&, std::vector<int>&, std::vector<int>&)': main.cpp:221:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 221 | for (int i = 0; i < matriceAdiacenta2[nodUrm].size(); i++) { // parcurgem fiecare nod adiacent al nodului curent | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::DFS(int, std::vector<int>&)': main.cpp:273:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 273 | for (int i = 1; i < matriceAdiacenta[nod].size(); i++) { // parcurgem nodurile adiacente nodului curent | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<std::vector<int> > Graf::muchiiCritice_neeficient()': main.cpp:322:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 322 | for (int j = 1; j < this->matriceAdiacenta[nod].size(); j++) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::MuchieCritica(int, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<std::vector<int> >&)': main.cpp:361:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 361 | for (int i = 1; i < matriceAdiacenta[nod].size(); i++) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::dfs_pamant(int, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<int>&)': main.cpp:395:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 395 | for (int i = 1; i < matriceAdiacenta[nod].size(); i++) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::sortare_topologica(int, std::vector<int>&, std::vector<int>&)': main.cpp:438:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 438 | for (int i = 1; i < matriceAdiacenta[nod].size(); i++) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::DFS_darb(int, std::vector<int>&, int&, int&, int&)': main.cpp:595:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 595 | for (int i = 1; i < matriceAdiacenta[nod].size(); i++) { // parcurgem nodurile adiacente nodului curent | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<std::vector<int> > Graf::APM(std::vector<std::vector<int> >)': main.cpp:668:23: warning: comparison of integer expressions of different signedness: 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare] 668 | while (sol.size() < this->nrNoduri - 1) { | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Graf::hamilton(std::vector<std::vector<std::pair<int, int> > >)': main.cpp:703:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 703 | for (int k = 0; k < matriceAdiacentaCosturi[j].size(); k++) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:715:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 715 | for (int i = 0; i < matriceAdiacentaCosturi[0].size(); i++) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Graf::BFS_amici2(int, std::vector<std::vector<int> >&)': main.cpp:734:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 734 | for (int i = 0; i < matriceAdiacenta2[nodUrm].size(); i++) { // parcurgem fiecare nod adiacent al nodului curent | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In function 'void infoarena_dfs()': main.cpp:774:15: warning: unused variable 'S' [-Wunused-variable] 774 | int N, M, S;
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
11ms184kbRaspuns corect1020
21ms184kbRaspuns corect10
31ms184kbRaspuns corect1010
41ms184kbRaspuns corect1010
53ms397kbRaspuns corect1010
61ms184kbRaspuns corect1010
713ms1609kbRaspuns corect1010
8118ms6602kbRaspuns corect1010
9253ms11624kbRaspuns corect1010
10175ms14389kbRaspuns corect1010
Punctaj total100

Ceva nu functioneaza?