# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
522087 | 2022-02-03T19:52:16 Z | idas | Stations (IOI20_stations) | C++17 | 3000 ms | 2097156 KB |
#include <bits/stdc++.h> #define FAST_IO ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr) #define FOR(i, begin, end) for(int i = (begin); i < (end); i++) #define TSTS int ttt; cin >> ttt; while(ttt--) solve() #define all(x) (x).begin(), (x).end() #define le(vec) vec[vec.size()-1] #define sz(x) ((int)((x).size())) #define pb push_back #define s second #define f first using namespace std; typedef long long ll; typedef long double ld; typedef vector<int> vi; typedef map<int, int> mii; typedef pair<int, int> pii; typedef pair<long long, long long> pll; typedef pair<long double, long double> pdd; const int INF=1e9, MOD=1e9+7, mod=998244353; const ll LINF=1e18; void setIO() { FAST_IO; } void setIO(string s) { FAST_IO; freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); } const int N=1e3+10; int c[N], id; vi ad[N]; void dfs(int u, int pst) { c[u]=id; id--; for(auto x : ad[u]){ if(x==pst) continue; dfs(x, u); } } vi label(int n, int k, vi u, vi v) { FOR(i, 0, n-1) { ad[u[i]].pb(v[i]); ad[v[i]].pb(u[i]); } id=n-1; dfs(0, -1); vi ans(n); FOR(i, 0, n) ans[i]=c[i]; return ans; } int find_next_station(int s, int t, vi c) { if(s<t) return le(c); for(auto x : c){ if(x>=t) return x; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2226 ms | 2097156 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3017 ms | 320 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1950 ms | 2097156 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 288 KB | Invalid labels (values out of range). scenario=1, k=1000000000, vertex=1, label=-1 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3151 ms | 1582276 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |