# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305996 | 2020-09-24T09:08:47 Z | llaki | Stations (IOI20_stations) | Java 11 | 1459 ms | 39652 KB |
import java.util.ArrayList; public class stations { int[] label(int n, int k, int[] u, int[] v) { ArrayList<Integer>[] G = new ArrayList[n]; for (int i = 0; i < G.length; i++) { G[i] = new ArrayList<>(); } for (int i = 0; i < u.length; i++) { G[u[i]].add(v[i]); G[v[i]].add(u[i]); } int leaf = -1; for (int i = 0; i < n; i++) { if (G[i].size() == 1) { leaf = i; break; } } int[] labels = new int[n]; int cur = 0; int node = leaf; int prev = -1; while (true) { labels[node] = cur; cur++; boolean found = false; for (int to : G[node]) { if (to == prev) continue; prev = node; node = to; found = true; break; } if (!found) break; } return labels; } int find_next_station(int s, int t, int[] c) { for (int nd : c) { if (s <= nd && nd <= t) return t; if (s >= nd && nd >= t) return t; } return -1; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1201 ms | 36184 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 157 ms | 14672 KB | Invalid labels (duplicates values). scenario=0, label=0 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1174 ms | 36784 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1459 ms | 39652 KB | Output is correct |
2 | Incorrect | 1361 ms | 34344 KB | Wrong query response. |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1183 ms | 36556 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |