#905693 (Java21) No.2427 Tree Distance Two

提出ソース
結果

問題	No.2427 Tree Distance Two
ユーザー	Asahi
提出日時	2023-08-18 22:35:38
言語	Java21 (openjdk 21)
結果	TLE
実行時間	-
コード長	12,488 bytes
コンパイル時間	3,034 ms
コンパイル使用メモリ	92,356 KB
実行使用メモリ	342,280 KB
最終ジャッジ日時	2024-05-06 04:56:31
合計ジャッジ時間	13,166 ms
ジャッジサーバーID （参考情報）	judge3 / judge5
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	46 ms 42,436 KB
testcase_01	AC	46 ms 37,096 KB
testcase_02	AC	48 ms 37,352 KB
testcase_03	TLE	-
testcase_04	AC	52 ms 37,232 KB
testcase_05	TLE	-
testcase_06	AC	48 ms 37,172 KB
testcase_07	TLE	-
testcase_08	--	-
testcase_09	--	-
testcase_10	--	-
testcase_11	--	-
testcase_12	--	-
testcase_13	--	-
testcase_14	--	-
testcase_15	--	-
testcase_16	--	-
testcase_17	--	-
testcase_18	--	-
testcase_19	--	-
testcase_20	--	-
testcase_21	--	-
testcase_22	--	-
testcase_23	--	-
testcase_24	--	-
testcase_25	--	-
testcase_26	--	-
testcase_27	--	-
testcase_28	--	-
testcase_29	--	-
testcase_30	--	-
testcase_31	--	-
testcase_32	--	-
testcase_33	--	-
testcase_34	--	-
権限があれば一括ダウンロードができます
ソースコード

raw source code
import java.util.*; 
import java.io.*;
import java.lang.reflect.Array;
import java.math.*;
import java.util.stream.*;

class Main{
    // Const //
    static final int MOD7 = 1000000007;
    static final int MOD9 = 998244353 ;
    static final int  inf = (1  << 30);
    static final long lnf = (1L << 60);
    final String yes = "Yes";
    final String no  = "No" ;
    final int [] dy4 = {-1,0,1,0};
    final int [] dx4 = {0,1,0,-1};
    final int [] dy8 = {-1,-1,-1,0,1,1,1,0};
    final int [] dx8 = {-1,0,1,1,1,0,-1,-1};
    // Variables //
    Map<Long , String> memo = new HashMap<>();
    // Solve //
    void solve() {   
        int n = in.nextInt();
        List<Integer> [] G = new ArrayList[n];
        for(int i = 0 ; i < n ; i ++ ) {
            G[i] = new ArrayList<>();
        }
        for(int i = 0 ; i < n - 1 ; i ++ ) {
            int u = in.nextInt() , v = in.nextInt();
            u--;v--;
            G[u].add(v);
            G[v].add(u);
        }
        Set<Pair<Integer,Integer>> dist = new HashSet<>();
        int [] cnt = new int[n]; 
        for(int i = 0 ; i < n ; i ++ ) {
            for(int dist_1 : G[i]) {
                for(int dist_2 : G[dist_1]) {
                    int u = i , v = dist_2;
                    //out.println(i+"::"+u+" "+v);
                    if(v < u) {
                        int tmp = v ;
                        v = u ;
                        u = tmp;
                    }
                    var p = new Pair<>(u , v);
                    if(dist.contains(p)) continue;
                    dist.add(p);
                    cnt[u]++;
                    cnt[v]++;
                }
            }
        }
        for(int i = 0 ; i < n ; i ++ ) {
            out.println(cnt[i] - 2);
        }
    }

    // Function //
    int [] bfs(int start , List<Integer>[] G) {
        int [] dist = new int[G.length];
        Arrays.fill(dist , inf);
        dist[start] = 0 ;
        Queue<Integer> Q = new ArrayDeque<>();
        Q.add(start);
        while(!Q.isEmpty()) {
            int now = Q.poll();
            for(int next : G[now]) {
                if(dist[next] < dist[now] + 1) continue;
                dist[next] = dist[now] + 1 ;
                Q.add(next);
            }
        }
        return dist;
    }
    // Main //
    public static void main(String[] args) {
        new Main().solve();
        out.flush();
    }
    // Interface //
    static PrintWriter out = new PrintWriter(System.out);
    static In in = new In();
    static Debug debug = new Debug();
}
// Class //
class SCC {
    private int V;
    private List<Integer>[] graph;
    private List<Integer>[] reverseGraph;
    private boolean[] visited;
    private Stack<Integer> stack;
    private int groups = 0 ;
 
    public SCC(int V) {
        this.V = V;
        graph = new ArrayList[V];
        reverseGraph = new ArrayList[V];
        for (int i = 0; i < V; i++) {
            graph[i] = new ArrayList<>();
            reverseGraph[i] = new ArrayList<>();
        }
        visited = new boolean[V];
        stack = new Stack<>();
    }
 
    public void addEdge(int u, int v) {
        graph[u].add(v);
        reverseGraph[v].add(u);
    }

    public int group() {
        return groups;
    }
 
    private void dfsFirstPass(int v) {
        visited[v] = true;
        for (int neighbor : graph[v]) {
            if (!visited[neighbor]) {
                dfsFirstPass(neighbor);
            }
        }
        stack.push(v);
    }
 
    private void dfsSecondPass(int v, List<Integer> scc) {
        visited[v] = true;
        scc.add(v);
        for (int neighbor : reverseGraph[v]) {
            if (!visited[neighbor]) {
                dfsSecondPass(neighbor, scc);
            }
        }
    }
 
    public List<List<Integer>> getSCC() {
        Arrays.fill(visited, false);
        for (int i = 0; i < V; i++) {
            if (!visited[i]) {
                groups ++ ;
                dfsFirstPass(i);
            }
        }
 
        Arrays.fill(visited, false);
        List<List<Integer>> sccs = new ArrayList<>();
        while (!stack.isEmpty()) {
            int v = stack.pop();
            if (!visited[v]) {
                List<Integer> scc = new ArrayList<>();
                dfsSecondPass(v, scc);
                sccs.add(scc);
            }
        }
 
        return sccs;
    }
}
// Tuple // 
class Pair<T extends Comparable<T>, U extends Comparable<U>> implements Comparable<Pair<T, U>> {

    private final T first;
    private final U second;

    Pair(T first, U second) {
        this.first = first;
        this.second = second;
    }

    T first() {
        return first;
    }

    U second() {
        return second;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        Pair<?, ?> pair = (Pair<?, ?>) o;
        return Objects.equals(first, pair.first) && Objects.equals(second, pair.second);
    }

    @Override
    public int hashCode() {
        return Objects.hash(first, second);
    }

    @Override
    public int compareTo(Pair<T, U> other) {
        T f  = this.first  , F  = other.first;
        U s  = this.second , S  = other.second;
        int First_Result  = f.compareTo(F);
        int Second_Result = s.compareTo(S);
        return First_Result == 0 ? Second_Result : First_Result ;
    }

    @Override
    public String toString() {
        return "(" + this.first + " , " + this.second + ")";
    }
}

class Triple<T extends Comparable<T>, U extends Comparable<U>, V extends Comparable<V>> implements Comparable<Triple<T, U, V>> {
    
    private final T first;
    private final U second;
    private final V third;

    Triple(T first, U second, V third) {
        this.first = first;
        this.second = second;
        this.third = third;
    }

    T first() {
        return first;
    }

    U second() {
        return second;
    }

    V third() {
        return third;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        Triple<?, ?, ?> triple = (Triple<?, ?, ?>) o;
        return Objects.equals(first, triple.first) 
            && Objects.equals(second, triple.second)
            && Objects.equals(third, triple.third) ;
    }


    @Override
    public int hashCode() {
        return Objects.hash(first, second, third);
    }

    @Override
    public int compareTo(Triple<T, U, V> other) {
        T f  = this.first  , F  = other.first;
        U s  = this.second , S  = other.second;
        V t  = this.third  , T  = other.third;
        int First_Result  = f.compareTo(F);
        int Second_Result = s.compareTo(S);
        int Third_Result  = t.compareTo(T);
        return Second_Result == 0 ? (First_Result == 0 ? Third_Result : First_Result ) : Second_Result;
    }

    @Override
    public String toString() {
        return "(" + this.first + " , " + this.second + " , " + this.third + ")";
    }
}
// Debug //
class Debug {

    private PrintWriter out = new PrintWriter(System.out);

    public void display(int [] a) { out.println(Arrays.toString(a)); fl();}
    public void display(long [] a) { out.println(Arrays.toString(a)); fl();}
    public void display(double [] a) { out.println(Arrays.toString(a)); fl();}
    public void display(String [] a) { out.println(Arrays.toString(a)); fl();}
    public void display(char [] a) { out.println(Arrays.toString(a)); fl();}
    public void display(boolean [] a) { char [] c = conv(a); display(c); fl();}
    public void display(int [][] a) { for(int i = 0 ; i < a.length ; i ++ ) out.println(Arrays.toString(a[i])); fl();}
    public void display(long [][] a) { for(int i = 0 ; i < a.length ; i ++ ) out.println(Arrays.toString(a[i])); fl();}
    public void display(double [][] a) { for(int i = 0 ; i < a.length ; i ++ ) out.println(Arrays.toString(a[i])); fl();}
    public void display(String [][] a) { for(int i = 0 ; i < a.length ; i ++ ) out.println(Arrays.toString(a[i])); fl();}
    public void display(char [][] a) { for(int i = 0 ; i < a.length ; i ++ ) out.println(Arrays.toString(a[i])); fl();}
    public void display(boolean [][] a) { char [][] c = new char [a.length][a[0].length] ; for(int i = 0 ; i < a.length ; i ++ ) c[i] = conv(a[i]) ; display(c); fl();}
    private char [] conv(boolean [] a) { char [] c = new char[a.length] ; for(int i = 0 ; i < a.length ; i ++ ) c[i] = a[i] ? 'O' : 'X' ; return c ; }
    private void fl() { out.flush(); }
}

// Input // 
class In{

    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }

    private int readByte() { 
        if (hasNextByte()) return buffer[ptr++]; else return -1;
    }

    private static boolean isPrintableChar(int c) { 
        return 33 <= c && c <= 126;
    }

    public boolean hasNext() { 
        while(hasNextByte() && !isPrintableChar(buffer[ptr])) {
            ptr++; 
        }
        return hasNextByte();
    }

    String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    double nextDouble() { 
        return Double.parseDouble(next());
    }
    char nextChar() {
        return next().charAt(0);
    }
    int [] IntArray(int n) {
        final int [] Array = new int [n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = nextInt();
        }
        return Array;
    }
    int [][] IntArray(int n , int m) {
        final int [][] Array = new int [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = IntArray(m);
        }
        return Array;
    }   
    long [] LongArray(int n) {
        final long [] Array = new long [n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = nextLong();
        }
        return Array;
    }
    long [][] LongArray(int n , int m) {
        final long [][] Array = new long [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = LongArray(m);
        }
        return Array;
    }
    String [] StringArray(int n) {
        final String [] Array = new String [n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = next();
        }
        return Array;
    }
    char [] CharArray(int n) {
        final char [] Array = new char[n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = next().charAt(0);
        }
        return Array;
    }
    char [][] CharArray(int n , int m) {
        final char [][] Array = new char [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = next().toCharArray();
        }
        return Array;
    }
    char [][] CharArray2(int n , int m) {
        final char [][] Array = new char [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            for(int j = 0 ; j < n ; j ++ ) {
                Array[i][j] = next().charAt(0);
            }
        }
        return Array;
    }
}
yukicoder

結果

テストケース

ソースコード
