Borderou de evaluare (job #2818108)

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

Raport evaluator

Compilare: main.cpp: In member function 'std::vector<int> Graph::getTopologicalSort()': main.cpp:169:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'const int' [-Wsign-compare] 169 | 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:542:12: warning: unused variable 'INF' [-Wunused-variable] 542 | const int INF = 1e9; | ^~~ main.cpp: In member function 'std::vector<int> Graph::eulerCycle()': main.cpp:716:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Graph::Neighbour>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 716 | 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
383ms765kbRaspuns corect!1010
4800ms4616kbTime limit exceeded00
5803ms9846kbTime limit exceeded00
6800ms27758kbTime limit exceeded00
7129ms7471kbRaspuns corect!100
8803ms39329kbTime limit exceeded0
9803ms24354kbTime limit exceeded00
10800ms42704kbTime limit exceeded0
Punctaj total30

Ceva nu functioneaza?