結果

問題 No.2316 Freight Train
ユーザー AsahiAsahi
提出日時 2023-05-26 22:42:50
言語 Java21
(openjdk 21)
結果
AC  
実行時間 362 ms / 2,000 ms
コード長 6,910 bytes
コンパイル時間 2,693 ms
コンパイル使用メモリ 76,928 KB
実行使用メモリ 62,720 KB
最終ジャッジ日時 2023-08-26 12:52:23
合計ジャッジ時間 12,641 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
49,332 KB
testcase_01 AC 41 ms
49,832 KB
testcase_02 AC 41 ms
49,476 KB
testcase_03 AC 330 ms
59,808 KB
testcase_04 AC 185 ms
54,176 KB
testcase_05 AC 163 ms
53,644 KB
testcase_06 AC 112 ms
53,200 KB
testcase_07 AC 213 ms
53,580 KB
testcase_08 AC 240 ms
60,064 KB
testcase_09 AC 266 ms
57,336 KB
testcase_10 AC 216 ms
54,616 KB
testcase_11 AC 272 ms
62,720 KB
testcase_12 AC 277 ms
61,872 KB
testcase_13 AC 346 ms
59,648 KB
testcase_14 AC 334 ms
60,892 KB
testcase_15 AC 343 ms
60,392 KB
testcase_16 AC 337 ms
61,012 KB
testcase_17 AC 313 ms
60,616 KB
testcase_18 AC 316 ms
59,892 KB
testcase_19 AC 362 ms
59,692 KB
testcase_20 AC 298 ms
58,560 KB
testcase_21 AC 341 ms
61,340 KB
testcase_22 AC 347 ms
61,052 KB
testcase_23 AC 263 ms
57,680 KB
testcase_24 AC 312 ms
61,556 KB
testcase_25 AC 313 ms
60,928 KB
testcase_26 AC 260 ms
59,516 KB
testcase_27 AC 186 ms
54,436 KB
testcase_28 AC 39 ms
49,408 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

class Main{
    void solve(PrintWriter out, In in) {        
        int n = in.nextInt() , Q = in.nextInt();
        int [] par = in.IntArray(n);
        DSU dsu = new DSU(n);
        for(int i = 0 ; i < n ; i ++ ) {
            if(par[i] == -1) continue;
            dsu.unite(i,par[i]-1);
        }
        while(Q-->0) {
            int a = in.nextInt() , b = in.nextInt();
            a--;b--;
            out.println(dsu.same(a,b)?"Yes":"No");
        }
    }   
    /* Library */   
    class DSU {
        private int[] rank;
        private int [] parent;
        private int [] size;
        DSU(int n) {
            this.parent = new int[n];
            this.rank = new int[n];
            this.size = new int[n];
            for (int i = 0 ; i < n; i ++ ) {
                parent[i] = i;
                rank[i] = 0;
                size[i] = 1;
            }
        }
        int groups() {
            int count = 0;
            for(int i = 0;i < parent.length ; i ++ ) {
                if(i == find(i)) {
                    count++;
                }
            }
            return count;
        }
        int size(int x){
            return size[find(x)];
        }
        int find(int x) {
            if (x == parent[x]) {
                return x;
            } else {
                parent[x] = find(parent[x]);
                return parent[x];
            }
        }
        boolean same(int x, int y) {
            return find(x) == find(y);
        }
        void unite(int x, int y) {
            int xRoot = find(x);
            int yRoot = find(y);
            if (xRoot == yRoot) {
                return;
            }
            if (rank[xRoot] > rank[yRoot]) {
                parent[yRoot] = xRoot;
            } else if (rank[xRoot] < rank[yRoot]) {
                parent[xRoot] = yRoot;
            } else {
                parent[xRoot] = yRoot;
                rank[xRoot]++;
                size[yRoot] += size[xRoot];
            }
        }
    }
    /* ------- */
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        In in  = new In();
        new Main().solve(out,in);
        out.flush();
    }
    /* Const */
    final long MOD7 = 1000000007; final long MOD9 = 998244353 ;
    final int [] X4 = {0,1,0,-1}; final int [] Y4 = {-1,0,1,0};
    final int [] X8 = {-1,-1,0,1,1,1,0,-1}; final int [] Y8 = {0,1,1,1,0,-1,-1,-1};
    final int Inf = (int)1e9; final long Lnf = (long)1e18;
    final String yes = "Yes"; final String no = "No";
    /* ----- */
}
/* Class */

/* ----- */
class Pair{
    private int first ;
    private int second;
    Pair(int first,int second) {
        this.first = first;
        this.second = second;
    }
    int first()  { return this.first ; }
    int second() { return this.second; }
    @Override
    public String toString(){ return first()+" = "+second(); }
}
class PairII {
    private int first ;
    private int second ;
    private int third;
    PairII(int first, int second, int third) {
        this.first = first;
        this.second = second;
        this.third = third;
    }
    int first()  { return this.first ; }
    int second() { return this.second; }
    int third()  { return this.third ; }
    @Override
    public String toString(){ return first()+" = "+second()+" = "+third() ; }
}
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());
    }
    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;
    }
}
0