# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
432804 | 2021-06-18T13:27:07 Z | Rouge_Hugo | Stations (IOI20_stations) | C++14 | 845 ms | 592 KB |
#include<bits/stdc++.h> #include "stations.h" #define ll long long #define fi first #define se second #define pb push_back using namespace std; const int N=1009; int la[N]; vector<int>v[N];int re=-1; void dfs(int x,int p) { la[x]=++re; for(auto it:v[x]) { if(it==p)continue; dfs(it,x); } } vector<int> label(int n, int k,vector<int> U, vector<int> V) { vector<int> l(n); for(int i=0;i<n-1;i++) { v[U[i]].pb(V[i]); v[V[i]].pb(U[i]); } int root=0; for(int i=0;i<n;i++)if(v[i].size()==1)root=i;re=0; dfs(root,-1); for(int i=0;i<n;i++)l[i]=la[i]; memset(la,0,sizeof la);for(int i=0;i<n;i++)v[i].clear(); return l; } int find_next_station(int s, int t, std::vector<int> c) { if(s<t) { return c[1]; } return c[0]; } /* 1 5 1000000 0 1 1 2 1 3 2 4 2 2 0 1 1 3 3 */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 569 ms | 584 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 476 ms | 528 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 518 ms | 592 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 845 ms | 400 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 572 ms | 520 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |