# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
419075 | 2021-06-06T11:47:19 Z | NintsiChkhaidze | Stations (IOI20_stations) | C++14 | 970 ms | 608 KB |
#include "stations.h" #include <bits/stdc++.h> #define pb push_back using namespace std; vector <int> vec[1005]; int cnt,in[1005],out[1005]; void dfs(int x,int p){ in[x] = ++cnt; for (int j=0;j<vec[x].size();j++){ int to = vec[x][j]; if (to == p) continue; dfs(to,x); } out[x] = cnt; } vector<int> label(int n, int k, vector<int> u, vector<int> v) { vector<int> labels; for (int i=0;i<1001;i++){ vec[i].clear(); in[i] = out[i] = 0; } for (int i=0;i<u.size();i++){ vec[u[i]].pb(v[i]); vec[v[i]].pb(u[i]); } cnt=0; dfs(0,0); for (int i=0;i<n;i++) labels.pb(in[i]*1000 + out[i]); return labels; } int find_next_station(int s, int t, vector<int> c) { int Ins = (s/1000),Int = (t/1000),Out = (t%1000); if (Ins < Int){ for (int i=1;i<c.size();i++) if (Int >= (c[i]/1000) && (c[i]%1000) >= Out) return c[i]; } return c[0]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 440 KB | Invalid labels (values out of range). scenario=0, k=1000, vertex=0, label=1010 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 384 KB | Invalid labels (values out of range). scenario=0, k=1000, vertex=0, label=1996 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 460 KB | Invalid labels (values out of range). scenario=4, k=1000000, vertex=585, label=1001000 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 969 ms | 400 KB | Output is correct |
2 | Correct | 778 ms | 400 KB | Output is correct |
3 | Correct | 724 ms | 544 KB | Output is correct |
4 | Correct | 3 ms | 464 KB | Output is correct |
5 | Correct | 5 ms | 608 KB | Output is correct |
6 | Correct | 1 ms | 472 KB | Output is correct |
7 | Correct | 730 ms | 400 KB | Output is correct |
8 | Correct | 970 ms | 520 KB | Output is correct |
9 | Correct | 703 ms | 596 KB | Output is correct |
10 | Correct | 688 ms | 544 KB | Output is correct |
11 | Correct | 7 ms | 604 KB | Output is correct |
12 | Correct | 8 ms | 468 KB | Output is correct |
13 | Correct | 5 ms | 596 KB | Output is correct |
14 | Correct | 4 ms | 464 KB | Output is correct |
15 | Correct | 2 ms | 468 KB | Output is correct |
16 | Correct | 669 ms | 508 KB | Output is correct |
17 | Correct | 521 ms | 508 KB | Output is correct |
18 | Correct | 628 ms | 528 KB | Output is correct |
19 | Correct | 535 ms | 516 KB | Output is correct |
20 | Correct | 577 ms | 516 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 595 ms | 528 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |