Pagini recente » Borderou de evaluare (job #551630) | Borderou de evaluare (job #2622968) | Borderou de evaluare (job #1657934) | Borderou de evaluare (job #2409041) | Borderou de evaluare (job #2968387)
Borderou de evaluare (job #2968387)
Raport evaluator
Compilare:
main.cpp: In member function 'std::pair<std::vector<int>, std::vector<int> > Graph::dijkstra(Node)':
main.cpp:32:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
32 | for (auto [startNeighbor, cost] : adjList[start]) {
| ^
main.cpp:39:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
39 | auto [_, node] = minNodes.top();
| ^
main.cpp:44:29: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
44 | for (const auto [neighbor, cost] : adjList[node]) {
| ^
main.cpp: In member function 'Cost Graph::shortestCycleFromNode(int)':
main.cpp:67:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
67 | auto [dist, startingPoint] = dijkstra(startNode);
| ^
main.cpp:76:23: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
76 | for (auto [neighbor, cost] : adjList[node]) {
| ^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 17ms | 184kb | OK | 10 |
| 2 | 4503ms | 450kb | Time limit exceeded | 0 |
| 3 | 4504ms | 360kb | Time limit exceeded | 0 |
| 4 | 4507ms | 380kb | Time limit exceeded | 0 |
| 5 | 4501ms | 970kb | Time limit exceeded | 0 |
| 6 | 4501ms | 1101kb | Time limit exceeded | 0 |
| 7 | 4501ms | 1130kb | Time limit exceeded | 0 |
| 8 | 4502ms | 1101kb | Time limit exceeded | 0 |
| 9 | 4500ms | 1118kb | Time limit exceeded | 0 |
| 10 | 4501ms | 1150kb | Time limit exceeded | 0 |
| Punctaj total | 10 |