# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
413196 | 2021-05-28T11:02:46 Z | losmi247 | Stations (IOI20_stations) | C++14 | 1125 ms | 528 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1005; int deg[N]; vector <int> label(int n,int k,vector <int> u,vector <int> v){ bool prvi = 1; for(int i = 0; i < n-1; i++) deg[u[i]]++, deg[v[i]]++; for(int i = 0; i < n; i++) if(deg[i] > 2) prvi = 0; if(prvi){ vector <int> l(n); for(int i = 0; i < n; i++) l[i] = i; return l; } } int find_next_station(int s,int t,vector <int> c){ if(s < t){ return s+1; } else{ return s-1; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 650 ms | 400 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 586 ms | 400 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 633 ms | 488 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1125 ms | 404 KB | Output is correct |
2 | Incorrect | 701 ms | 400 KB | Wrong query response. |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 584 ms | 528 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |