Borderou de evaluare (job #2822201)

Utilizator Dantelogus99Gruia Gabriel Dantelogus99 Data 23 decembrie 2021 18:21:27
Problema Parcurgere DFS - componente conexe Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp:202: warning: ignoring '#pragma region Definitions' [-Wunknown-pragmas] 202 | #pragma region Definitions | main.cpp:1002: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas] 1002 | #pragma endregion | main.cpp:1019: warning: ignoring '#pragma region Public_Methods_Calls' [-Wunknown-pragmas] 1019 | #pragma region Public_Methods_Calls | main.cpp:1179: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas] 1179 | #pragma endregion | main.cpp: In constructor 'Graph::Graph(int, int, bool, bool, bool)': main.cpp:74:9: warning: 'Graph::nrEdges' will be initialized after [-Wreorder] 74 | int nrEdges; | ^~~~~~~ main.cpp:69:10: warning: 'bool Graph::isDirected' [-Wreorder] 69 | bool isDirected; | ^~~~~~~~~~ main.cpp:82:5: warning: when initialized here [-Wreorder] 82 | Graph(int n = 0, int m = 0, bool d = false, bool w = false, bool f = false) : nrNodes(n), nrEdges(m), isDirected(d), isWeighted(w), isFlowing(f) {} | ^~~~~ main.cpp: In member function 'void Graph::removeEdge(int, int)': main.cpp:376:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 376 | for (int i = 0; i < adjacencyList[src].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:381:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 381 | for (int i = 0; i < adjacencyList[dst].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::TarjanDFS(int, std::vector<int>&, std::vector<int>&, std::stack<int>&, std::vector<bool>&, std::vector<std::vector<int> >&)': main.cpp:703:12: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else] 703 | if (discOrder[edge.dest]) // if the adjacent node had been processed and is part of the current traversal path | ^ main.cpp: In member function 'void Graph::HavelHakimi(std::vector<int>&, bool&)': main.cpp:814:24: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 814 | if (degrees[0] > degrees.size() - 1) main.cpp: In function 'int main()': main.cpp:1009:23: warning: unused variable 'start' [-Wunused-variable] 1009 | int nodes, edges, start, operations; | ^~~~~ main.cpp:1009:30: warning: unused variable 'operations' [-Wunused-variable] 1009 | int nodes, edges, start, operations; | ^~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms184kbOK5
22ms184kbOK5
32ms184kbOK5
416ms1372kbOK5
52ms184kbOK5
62ms184kbOK5
72ms184kbOK5
82ms184kbOK5
92ms184kbOK5
102ms184kbOK5
1140ms3399kbOK5
1230ms2580kbOK5
1349ms3858kbOK5
1458ms4730kbOK5
1568ms5259kbOK5
1687ms6443kbOK5
17118ms16433kbOK5
1844ms8183kbOK5
1949ms8302kbOK5
20116ms9691kbOK5
Punctaj total100

Ceva nu functioneaza?