Borderou de evaluare (job #2818104)

Utilizator vali_27Bojici Valentin vali_27 Data 15 decembrie 2021 11:03:56
Problema Ciclu Eulerian Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 20

Raport evaluator

Compilare: main.cpp: In member function 'std::vector<int> Graph::getTopologicalSort()': main.cpp:168:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'const int' [-Wsign-compare] 168 | return result.size() == N_NODES ? result : std::vector<int>(); // if cycle => empty | ~~~~~~~~~~~~~~^~~~~~~~~~ main.cpp: In static member function 'static void Graph::getMaxFlowBipartite(int, int, std::vector<std::pair<int, int> >&, int&)': main.cpp:541:12: warning: unused variable 'INF' [-Wunused-variable] 541 | const int INF = 1e9; | ^~~ main.cpp: In member function 'std::vector<int> Graph::eulerCycle()': main.cpp:704:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Graph::Neighbour>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 704 | for (int i = 0; !found_neighbour && i < la[top].size(); ++i) { | ~~^~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
12ms184kbRaspuns corect!1010
22ms184kbRaspuns corect!1010
3803ms761kbTime limit exceeded00
4804ms4460kbTime limit exceeded00
5800ms9621kbTime limit exceeded00
6800ms25477kbTime limit exceeded00
7130ms7471kbRaspuns corect!100
8800ms28160kbTime limit exceeded0
9803ms24350kbTime limit exceeded00
10800ms30720kbTime limit exceeded0
Punctaj total20

Ceva nu functioneaza?