#463870 (Java21) No.1023 Cyclic Tour

• 問題: No.1023 Cyclic Tour
• ユーザー: 37zigen
• 提出日時: 2020-04-14 01:35:49
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 477 ms / 2,000 ms
• コード長: 4,378 bytes
• コンパイル時間: 2,719 ms
• コンパイル使用メモリ: 79,920 KB
• 実行使用メモリ: 102,912 KB
• 最終ジャッジ日時: 2024-10-01 07:43:40
• 合計ジャッジ時間: 23,217 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	73 ms; 51,484 KB
testcase_01	AC	55 ms; 49,948 KB
testcase_02	AC	54 ms; 50,164 KB
testcase_03	AC	55 ms; 50,124 KB
testcase_04	AC	308 ms; 71,612 KB
testcase_05	AC	306 ms; 70,704 KB
testcase_06	AC	299 ms; 71,472 KB
testcase_07	AC	299 ms; 71,892 KB
testcase_08	AC	256 ms; 68,664 KB
testcase_09	AC	290 ms; 70,272 KB
testcase_10	AC	294 ms; 70,500 KB
testcase_11	AC	328 ms; 77,024 KB
testcase_12	AC	304 ms; 70,224 KB
testcase_13	AC	281 ms; 70,136 KB
testcase_14	AC	259 ms; 70,532 KB
testcase_15	AC	283 ms; 70,476 KB
testcase_16	AC	323 ms; 70,832 KB
testcase_17	AC	335 ms; 76,392 KB
testcase_18	AC	375 ms; 70,704 KB
testcase_19	AC	340 ms; 71,260 KB
testcase_20	AC	423 ms; 79,752 KB
testcase_21	AC	422 ms; 81,772 KB
testcase_22	AC	448 ms; 81,324 KB
testcase_23	AC	432 ms; 79,204 KB
testcase_24	AC	446 ms; 79,152 KB
testcase_25	AC	421 ms; 80,208 KB
testcase_26	AC	417 ms; 80,748 KB
testcase_27	AC	442 ms; 80,628 KB
testcase_28	AC	434 ms; 82,180 KB
testcase_29	AC	361 ms; 79,576 KB
testcase_30	AC	390 ms; 80,244 KB
testcase_31	AC	400 ms; 81,748 KB
testcase_32	AC	451 ms; 86,516 KB
testcase_33	AC	425 ms; 81,376 KB
testcase_34	AC	336 ms; 71,872 KB
testcase_35	AC	332 ms; 73,752 KB
testcase_36	AC	442 ms; 79,440 KB
testcase_37	AC	425 ms; 83,992 KB
testcase_38	AC	382 ms; 83,908 KB
testcase_39	AC	454 ms; 79,252 KB
testcase_40	AC	411 ms; 80,352 KB
testcase_41	AC	411 ms; 79,876 KB
testcase_42	AC	402 ms; 79,400 KB
testcase_43	AC	261 ms; 71,760 KB
testcase_44	AC	378 ms; 74,108 KB
testcase_45	AC	477 ms; 84,108 KB
testcase_46	AC	316 ms; 88,212 KB
testcase_47	AC	360 ms; 102,912 KB
testcase_48	AC	377 ms; 81,876 KB
testcase_49	AC	390 ms; 81,976 KB
testcase_50	AC	396 ms; 81,736 KB
testcase_51	AC	382 ms; 81,920 KB
testcase_52	AC	421 ms; 80,984 KB

ソースコード

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.NoSuchElementException;

class DJSet {
	int n;
	int[] upper;
	public DJSet(int n) {
		this.n=n;
		upper=new int[n];
		Arrays.fill(upper, -1);
	}
	int root(int x) {
		return upper[x]<0?x:(upper[x]=root(upper[x]));
	}
	boolean equiv(int x,int y) {
		return root(x)==root(y);
	}
	void setUnion(int x,int y) {
		x=root(x);y=root(y);
		if(x==y) return;
		if (upper[x]<upper[y]) {
			x^=y;y^=x;x^=y;
		}
		if (upper[x]==upper[y]) --upper[y];
		upper[x]=y;
	}
}

public class Main {
	
	void dfs_uni(int cur,int par,ArrayList<Integer>[] g,int[] col) {
		col[cur]=1;
		for (int dst:g[cur]) {
			if (col[dst]==1) {
				System.out.println("Yes");
				System.exit(0);
			}
			if (col[dst]==0) dfs_uni(dst,cur,g,col);
		}
		col[cur]=2;
	}
	
	void dfs_bi(int cur,int par,ArrayList<Integer>[] g,int[] col) {
		col[cur]=1;
		for (int dst:g[cur]) {
			if (dst==par) continue;
			if (col[dst]!=0) {
				System.out.println("Yes");
				System.exit(0);
			}
			if (col[dst]==0) dfs_bi(dst,cur,g,col);
		}
		col[cur]=2;
	}
	
	void run() {
		FastScanner sc=new FastScanner();
		PrintWriter pw=new PrintWriter(System.out);
		
		int N=sc.nextInt();
		int M=sc.nextInt();
		ArrayList<Integer>[] g=new ArrayList[N];
		ArrayList<Integer>[] g2=new ArrayList[N];
		DJSet ds=new DJSet(N);
		int[] a=new int[M];
		int[] b=new int[M];
		int[] c=new int[M];
		for (int i=0;i<N;++i) g[i]=new ArrayList<>();
		for (int i=0;i<N;++i) g2[i]=new ArrayList<>();
		for (int i=0;i<M;++i) {
			a[i]=sc.nextInt();
			b[i]=sc.nextInt();
			c[i]=sc.nextInt();
			--a[i];--b[i];
			if (c[i]==1) { // bi
				g[a[i]].add(b[i]);
				g[b[i]].add(a[i]);
				ds.setUnion(a[i], b[i]);
			}
		}
		int[] col=new int[N];
		for (int i=0;i<N;++i) {
			if (col[i]==0) dfs_bi(i,-1,g,col);
		}
		for (int i=0;i<M;++i) {
			if (c[i]==2) { // uni
				if (ds.equiv(a[i], b[i])) {
					System.out.println("Yes");
					return;
				}
				g2[ds.root(a[i])].add(ds.root(b[i]));
			}
		}
		Arrays.fill(col, 0);
		dfs_uni(ds.root(0),-1,g2,col);
		for (int i=0;i<N;++i) {
			if (i==ds.root(i) && col[i]==0) dfs_uni(ds.root(i), -1, g2, col);
		}
		
		pw.println("No");
		pw.close();
	}
	
	void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}
	
    public static void main(String[] args) {
    	new Main().run();
    }
}




class FastScanner {
    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;}
    private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
    public boolean hasNext() { skipUnprintable(); return hasNextByte();}
    public 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();
    }
    public 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();
        }
    }
    public int nextInt() {
    	return (int)nextLong();
    }
}