# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
304911 | model_code | Stations (IOI20_stations) | Java | 1722 ms | 45532 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
import java.util.ArrayList;
public class stations {
private static final int MAXN = 1000;
private int cnt;
private ArrayList<Integer>[] adj;
private int[] labels;
private void dfs(int v, int p, int d) {
if(d == 0) labels[v] = cnt++;
for (Integer i : adj[v]) if (i != p) dfs(i, v, d ^ 1);
if(d == 1) labels[v] = cnt++;
}
int[] label(int n, int k, int[] u, int[] v) {
cnt = 0;
adj = new ArrayList[n];
for (int i = 0; i < n; i++) {
adj[i] = new ArrayList<Integer>();
}
for (int i = 0; i < n - 1; i++) {
adj[u[i]].add(v[i]);
adj[v[i]].add(u[i]);
}
labels = new int[n];
dfs(0, -1, 0);
return labels;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |