# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
537922 | 2022-03-15T21:51:45 Z | groshi | Stations (IOI20_stations) | C++17 | 790 ms | 664 KB |
#include<iostream> #include<vector> #include<algorithm> #include<stations.h> using namespace std; int kiedy=0; int odw[1010]; vector<int> Q[1010]; int moj_koniec[2000]; int bylam[2000]; void dfs(int x) { odw[x]=kiedy; kiedy++; bylam[x]=1; for(int i=0;i<Q[x].size();i++) { int pom=Q[x][i]; if(bylam[pom]!=0) continue; dfs(pom); } moj_koniec[odw[x]]=kiedy-1; } vector<int> label(int n,int k,vector<int> u,vector<int> v) { for(int i=0;i<=n+3;i++) { odw[i]=0; moj_koniec[i]=0; bylam[i]=0; } for(int i=0;i<=n+3;i++) Q[i].clear(); kiedy=0; for(int i=0;i<u.size();i++) { u[i]++; v[i]++; Q[u[i]].push_back(v[i]); Q[v[i]].push_back(u[i]); } dfs(1); vector<int> wypisz; for(int i=1;i<=n;i++) wypisz.push_back(odw[i]); return wypisz; } int find_next_station(int s,int t,vector<int> c) { sort(c.begin(),c.end()); if(t<s) return c[0]; if(t>moj_koniec[s]) return c[0]; for(int i=1;i<c.size();i++) { if(t>=c[i] && t<=moj_koniec[c[i]]) return c[i]; } return c[0]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 411 ms | 560 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 374 ms | 520 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 432 ms | 664 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 790 ms | 416 KB | Output is correct |
2 | Incorrect | 594 ms | 524 KB | Wrong query response. |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 456 ms | 652 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |