# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
959029 | 2024-04-07T11:50:02 Z | The_Samurai | Stations (IOI20_stations) | C++17 | 561 ms | 868 KB |
#include "stations.h" #include "bits/stdc++.h" using namespace std; std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) { vector<vector<int>> adj(n); vector<int> tin(n); vector<bool> vis(n + 1); for (int i = 0; i < n - 1; i++) { adj[u[i]].emplace_back(v[i]); adj[v[i]].emplace_back(u[i]); } int z = 0; auto dfs = [&](auto &dfs, int u) -> void { tin[u] = z++; vis[u] = true; for (int v: adj[u]) { if (vis[v]) continue; dfs(dfs, v); } }; dfs(dfs, 1); return tin; } int find_next_station(int s, int t, std::vector<int> c) { sort(c.begin(), c.end()); if (s > t) return c[0]; for (int i = c.size() - 1; i >= 0; i--) { if (c[i] <= t) return c[i]; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 321 ms | 864 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 290 ms | 852 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 341 ms | 868 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 561 ms | 684 KB | Output is correct |
2 | Correct | 423 ms | 684 KB | Output is correct |
3 | Incorrect | 377 ms | 684 KB | Wrong query response. |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 323 ms | 860 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |