# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
402522 | 2021-05-11T22:05:49 Z | Dan4Life | Stations (IOI20_stations) | C++17 | 2 ms | 320 KB |
#include "stations.h" #include <bits/stdc++.h> using namespace std; #define pb push_back vector<int> adj[1001], col(1001); int lab = 0; void dfs(int s, int p) { if(col[s]!=-1)return; col[s]=lab; lab++; for(auto u : adj[s]) if(u!=p) dfs(u, s); } vector<int> label(int n, int k, vector<int> a, vector<int> b) { col.resize(n); lab=0; for(int i = 0; i < 1001; i++) adj[i].clear(), col[i]=-1; for (int i = 0; i < n; i++) { adj[a[i]].pb(b[i]); adj[b[i]].pb(a[i]); } for(int i = 0; i < n; i++){ if(adj[i].size()==1){ dfs(i, -1); break; } } for(auto u : col) cout << u << " "; cout << '\n'; return col; } int find_next_station(int s, int t, vector<int> c) { if(c.size()==1)return c[0]; for(int i = 0; i < (int)c.size(); i++) if(c[i]==t)return c[i]; if(t<s)return c[0]; return c[1]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 312 KB | Execution killed with signal 13 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 320 KB | Execution killed with signal 13 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 316 KB | Execution killed with signal 13 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 296 KB | Execution killed with signal 13 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 200 KB | Execution killed with signal 13 |
2 | Halted | 0 ms | 0 KB | - |