Borderou de evaluare (job #2820080)

Utilizator Dantelogus99Gruia Gabriel Dantelogus99 Data 19 decembrie 2021 20:53:09
Problema Ciclu Eulerian Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 0

Raport evaluator

Compilare: main.cpp:82: warning: ignoring '#pragma region Definitions' [-Wunknown-pragmas] 82 | #pragma region Definitions | main.cpp:166: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas] 166 | #pragma endregion | main.cpp: In constructor 'Graph::Graph(int, int, bool, bool)': main.cpp:57:9: warning: 'Graph::nrEdges' will be initialized after [-Wreorder] 57 | int nrEdges; | ^~~~~~~ main.cpp:53:10: warning: 'bool Graph::isDirected' [-Wreorder] 53 | bool isDirected; | ^~~~~~~~~~ main.cpp:64:5: warning: when initialized here [-Wreorder] 64 | Graph(int n = 0, int m = 0, bool d = false, bool w = false) : nrNodes(n), nrEdges(m), isDirected(d), isWeighted(w){} | ^~~~~ main.cpp: In member function 'void Graph::removeEdge(int, int)': main.cpp:115:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 115 | for (int i = 0; i < adjacencyList[src].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:120:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 120 | for (int i = 0; i < adjacencyList[dst].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
155ms65556kbMemory limit exceeded00
255ms65556kbMemory limit exceeded00
353ms65556kbMemory limit exceeded00
455ms65556kbMemory limit exceeded00
555ms65556kbMemory limit exceeded00
654ms65552kbMemory limit exceeded00
755ms65556kbMemory limit exceeded00
855ms65552kbMemory limit exceeded0
955ms65462kbKilled by Signal 900
1055ms65462kbKilled by Signal 90
Punctaj total0

Ceva nu functioneaza?