Borderou de evaluare (job #2820071)

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

Raport evaluator

Compilare: main.cpp:82: warning: ignoring '#pragma region Definitions' [-Wunknown-pragmas] 82 | #pragma region Definitions | main.cpp:163: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas] 163 | #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
12ms184kbRaspuns corect!1010
22ms184kbRaspuns corect!1010
36ms593kbRaspuns corect!1010
487ms6590kbRaspuns corect!1010
5173ms13430kbRaspuns corect!1010
6587ms40390kbRaspuns corect!1010
7116ms5767kbRaspuns corect!1020
8782ms53358kbRaspuns corect!10
9801ms20779kbTime limit exceeded00
10801ms63721kbTime limit exceeded0
Punctaj total80

Ceva nu functioneaza?