Borderou de evaluare (job #2907169)

Utilizator Ssebi1Dancau Sebastian Ssebi1 Data 29 mai 2022 01:10:02
Problema Floyd-Warshall/Roy-Floyd Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp: In function 'std::ostream& operator<<(std::ostream&, Graf&)': main.cpp:78:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 78 | for (int j = 1; j < graf.matriceAdiacenta[i].size(); j++) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::DFS(int, std::vector<int>&)': main.cpp:230:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 230 | 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:279:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 279 | 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:318:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 318 | 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:363:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 363 | 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:522:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 522 | for (int i = 1; i < matriceAdiacenta[nod].size(); i++) { // parcurgem nodurile adiacente nodului curent | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In function 'void infoarena_dfs()': main.cpp:555:15: warning: unused variable 'S' [-Wunused-variable] 555 | int N, M, S; | ^ main.cpp: In function 'void leetcode_CriticalConnections()': main.cpp:581:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 581 | for (int i = 0; i < result.size(); i++) { | ~~^~~~~~~~~~~~~~~ main.cpp: In member function 'int Graf::disjoint(int, int, int, std::vector<int>&, std::vector<int>&)': main.cpp:445:1: warning: control reaches end of non-void function [-Wreturn-type] 445 | } | ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
11ms184kbOK10
21ms184kbOK10
31ms184kbOK10
41ms184kbOK10
51ms184kbOK10
613ms184kbOK10
75ms303kbOK10
86ms208kbOK10
96ms221kbOK10
105ms307kbOK10
Punctaj total100

Ceva nu functioneaza?