#463866 (Java21) No.1023 Cyclic Tour

• 問題: No.1023 Cyclic Tour
• ユーザー: 37zigen
• 提出日時: 2020-04-14 01:26:57
• 言語: Java21 (openjdk 21)
• 結果: WA
• 実行時間: -
• コード長: 4,332 bytes
• コンパイル時間: 2,431 ms
• コンパイル使用メモリ: 79,764 KB
• 実行使用メモリ: 107,264 KB
• 最終ジャッジ日時: 2024-04-08 14:50:49
• 合計ジャッジ時間: 23,445 ms
• ジャッジサーバーID （参考情報）: judge15 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	80 ms; 55,264 KB
testcase_01	AC	57 ms; 53,884 KB
testcase_02	AC	58 ms; 53,996 KB
testcase_03	AC	57 ms; 53,976 KB
testcase_04	AC	326 ms; 75,164 KB
testcase_05	AC	306 ms; 74,972 KB
testcase_06	AC	327 ms; 76,168 KB
testcase_07	AC	321 ms; 74,832 KB
testcase_08	AC	243 ms; 69,504 KB
testcase_09	AC	290 ms; 73,296 KB
testcase_10	AC	305 ms; 74,196 KB
testcase_11	AC	306 ms; 72,964 KB
testcase_12	AC	289 ms; 73,128 KB
testcase_13	AC	295 ms; 72,384 KB
testcase_14	AC	271 ms; 72,876 KB
testcase_15	AC	276 ms; 71,224 KB
testcase_16	AC	337 ms; 73,932 KB
testcase_17	AC	330 ms; 74,612 KB
testcase_18	AC	354 ms; 74,468 KB
testcase_19	AC	331 ms; 73,632 KB
testcase_20	AC	356 ms; 85,280 KB
testcase_21	AC	398 ms; 85,476 KB
testcase_22	AC	434 ms; 85,436 KB
testcase_23	AC	410 ms; 85,120 KB
testcase_24	AC	419 ms; 85,228 KB
testcase_25	AC	392 ms; 86,472 KB
testcase_26	AC	392 ms; 86,508 KB
testcase_27	AC	391 ms; 84,300 KB
testcase_28	AC	453 ms; 85,328 KB
testcase_29	AC	346 ms; 74,048 KB
testcase_30	AC	395 ms; 86,160 KB
testcase_31	AC	351 ms; 79,000 KB
testcase_32	AC	373 ms; 84,852 KB
testcase_33	AC	418 ms; 89,736 KB
testcase_34	WA	-
testcase_35	WA	-
testcase_36	AC	393 ms; 85,560 KB
testcase_37	AC	414 ms; 90,052 KB
testcase_38	AC	368 ms; 79,452 KB
testcase_39	AC	394 ms; 85,380 KB
testcase_40	AC	349 ms; 78,016 KB
testcase_41	AC	384 ms; 78,020 KB
testcase_42	AC	308 ms; 76,952 KB
testcase_43	AC	255 ms; 72,556 KB
testcase_44	AC	316 ms; 74,688 KB
testcase_45	AC	330 ms; 97,220 KB
testcase_46	AC	329 ms; 96,060 KB
testcase_47	AC	374 ms; 107,264 KB
testcase_48	AC	412 ms; 85,700 KB
testcase_49	AC	382 ms; 85,956 KB
testcase_50	AC	400 ms; 85,688 KB
testcase_51	AC	384 ms; 85,732 KB
testcase_52	AC	368 ms; 84,684 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];
		dfs_bi(0,-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();
    }
}