Submission #71841385

---

Source Code Expand

import java.io.*;
import java.util.*;

public class Main {
    static class Edge {
        int to;
        int weight;

        public Edge(int to, int weight) {
            this.to = to;
            this.weight = weight;
        }
    }

    static ArrayList<Edge>[] adj;
    static StringBuilder output = new StringBuilder();

    public static void main(String[] args) {
        new Thread(null, new Runnable() {
            public void run() {
                try {
                    solve();
                } catch (Exception e) {
                    e.printStackTrace();
                }
            }
        }, "1", 1 << 27).start();
    }

    public static void solve() throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());

        int N = Integer.parseInt(st.nextToken());

        adj = new ArrayList[N + 1];
        for (int i = 0; i <= N; i++) {
            adj[i] = new ArrayList<>();
        }

        for (int i = 1; i <= N; i++) {
            String line = br.readLine();
            while (line != null && line.trim().isEmpty()) {
                line = br.readLine();
            }
            if (line == null) break;
            
            st = new StringTokenizer(line);
            int parent = Integer.parseInt(st.nextToken());
            int weight = Integer.parseInt(st.nextToken());

            adj[parent].add(new Edge(i, weight));
        }

        ArrayList<Integer> rootList = new ArrayList<>();
        rootList.add(0);
        processLayer(rootList);

        System.out.println(output.toString().trim());
    }

    static void processLayer(ArrayList<Integer> currentNodes) {
        Collections.sort(currentNodes);
        
        for (int u : currentNodes) {
            if (u != 0) {
                output.append(u).append(" ");
            }
        }

        class Transition implements Comparable<Transition> {
            long weight;
            int childNode;

            public Transition(long w, int c) {
                weight = w;
                childNode = c;
            }

            @Override
            public int compareTo(Transition o) {
                return Long.compare(this.weight, o.weight);
            }
        }

        ArrayList<Transition> allTransitions = new ArrayList<>();

        for (int u : currentNodes) {
            for (Edge e : adj[u]) {
                allTransitions.add(new Transition(e.weight, e.to));
            }
        }

        Collections.sort(allTransitions);

        int n = allTransitions.size();
        for (int i = 0; i < n; ) {
            long currentWeight = allTransitions.get(i).weight;
            ArrayList<Integer> nextNodes = new ArrayList<>();

            while (i < n && allTransitions.get(i).weight == currentWeight) {
                nextNodes.add(allTransitions.get(i).childNode);
                i++;
            }

            processLayer(nextNodes);
        }
    }
}

Submission Info

Compile Error

Note: Main.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.

Judge Result