Pagini recente » Borderou de evaluare (job #175548) | Cod sursa (job #754757) | Borderou de evaluare (job #1502562) | Borderou de evaluare (job #350206) | Borderou de evaluare (job #2818108)
Borderou de evaluare (job #2818108)
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 |
| 1 | 2ms | 184kb | Raspuns corect! | 10 | 10 |
| 2 | 2ms | 184kb | Raspuns corect! | 10 | 10 |
| 3 | 83ms | 765kb | Raspuns corect! | 10 | 10 |
| 4 | 800ms | 4616kb | Time limit exceeded | 0 | 0 |
| 5 | 803ms | 9846kb | Time limit exceeded | 0 | 0 |
| 6 | 800ms | 27758kb | Time limit exceeded | 0 | 0 |
| 7 | 129ms | 7471kb | Raspuns corect! | 10 | 0 |
| 8 | 803ms | 39329kb | Time limit exceeded | 0 |
| 9 | 803ms | 24354kb | Time limit exceeded | 0 | 0 |
| 10 | 800ms | 42704kb | Time limit exceeded | 0 |
| Punctaj total | 30 |