結果

問題 No.1817 Reversed Edges
ユーザー shojin_proshojin_pro
提出日時 2022-01-21 21:56:34
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,967 bytes
コンパイル時間 4,249 ms
コンパイル使用メモリ 80,240 KB
実行使用メモリ 83,676 KB
最終ジャッジ日時 2024-11-25 23:54:59
合計ジャッジ時間 14,565 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
37,196 KB
testcase_01 AC 51 ms
37,072 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 AC 54 ms
37,268 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 426 ms
65,820 KB
testcase_23 AC 533 ms
66,060 KB
testcase_24 AC 584 ms
83,676 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {
    static FastScanner sc = new FastScanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    static StringBuilder sb = new StringBuilder();
    static long mod = (long) 1e9 + 7;

    
    public static void main(String[] args) throws Exception {
        solve();
        pw.flush();
    }

    static ArrayList<ArrayList<Integer>> arr = new ArrayList<>();
    static int[] depth;
    public static void solve() {
        int n = sc.nextInt();
        depth = new int[n];
        Arrays.fill(depth,-1);
        for(int i = 0; i < n; i++){
            arr.add(new ArrayList<>());
        }
        for(int i = 0; i < n-1; i++){
            int s = sc.nextInt()-1;
            int t = sc.nextInt()-1;
            arr.get(s).add(t);
            arr.get(t).add(s);
        }
        depth[0] = 0;
        dfs(0,0);
        for(int v : depth) pw.println(v);
    }
    
    static void dfs(int step, int now){
        for(int next : arr.get(now)){
            if(depth[next] == -1){
                depth[next] = step+1;
                dfs(step+1,next);
            }
        }
    }

    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

        public static void save_sort(long[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static long[] shuffle(long[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                long randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;

    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public FastScanner(FileReader in) {
        reader = new BufferedReader(in);
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        return a;
    }

    public int[] nextIntArray(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = nextInt();
        return a;
    }

    public long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    }
}
0