# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
342380 | 2021-01-02T03:19:10 Z | Ta180m | 기지국 (IOI20_stations) | C++17 | 3000 ms | 2097156 KB |
#include "stations.h" #include <bits/stdc++.h> #define f first #define s second using namespace std; using ll = long long; using ii = pair<int, int>; constexpr int MX = 1e5+5; int cnt = 1; vector<int> labels, G[MX]; void dfs(int u, int p) { for (int v : G[u]) if (v != p) dfs(v, u); labels[u] = cnt++; } std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) { for (int i = 0; i < n-1; ++i) { G[u[i]].push_back(v[i]); G[v[i]].push_back(u[i]); } labels.resize(n); dfs(0, -1); // for (int x : labels) cout << x << '\n'; return labels; } int find_next_station(int s, int t, std::vector<int> c) { if (t <= c[0]) return c[0]; for (int i = 1; i < c.size(); ++i) { if (t > c[i-1] && t <= c[i]) return c[i]; } // cout << s << ' ' << t; // for (int x : c) cout << ' ' << x; // cout << '\n'; return c.back(); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3123 ms | 2097156 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3042 ms | 2944 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1620 ms | 2097156 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 846 ms | 5664 KB | Output is correct |
2 | Runtime error | 1232 ms | 2097152 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 2896 ms | 2097156 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |