# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
336007 | 2020-12-14T13:20:34 Z | richyrich | Stations (IOI20_stations) | C++17 | 3000 ms | 2097156 KB |
#include "stations.h" #include <vector> #include <bits/stdc++.h> using namespace std; const int N = 1e4+3; const int inf = 1e9; int ans[N], timer; vector<vector<int>> adj; void dfs(int x, int par) { for(int y : adj[x]) { if(y==par) continue; dfs(y, x); } ans[x] = timer++; } std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) { timer = 0; adj.resize(n); for(int i = 0; i < u.size(); i++) { adj[u[i]].push_back(v[i]), adj[v[i]].push_back(u[i]); } for(int i = 0; i < n; i++) { if(adj[i].size()==1) { dfs(i, -1); break; } } std::vector<int> labels(n); for(int i = 0; i < n; i++) labels[i] = ans[i]; return labels; } int find_next_station(int s, int t, std::vector<int> c) { int n = c.size(); if(s > t) return c[0]; else return c[n-1]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2989 ms | 2097156 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3039 ms | 492 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1634 ms | 2097156 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 943 ms | 864 KB | Output is correct |
2 | Incorrect | 678 ms | 864 KB | Wrong query response. |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2843 ms | 2097156 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |