#687202 (Java21) No.1640 簡単な色塗り

提出ソース

結果

問題	No.1640 簡単な色塗り
ユーザー	nishi5451
提出日時	2021-08-07 14:30:57
言語	Java21 (openjdk 21)
結果	AC
実行時間	588 ms / 2,000 ms
コード長	4,350 bytes
コンパイル時間	3,522 ms
コンパイル使用メモリ	75,408 KB
実行使用メモリ	88,256 KB
最終ジャッジ日時	2023-09-12 03:50:59
合計ジャッジ時間	22,631 ms
ジャッジサーバーID （参考情報）	judge15 / judge12

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	39 ms 49,528 KB
testcase_01	AC	40 ms 49,536 KB
testcase_02	AC	40 ms 49,476 KB
testcase_03	AC	39 ms 49,532 KB
testcase_04	AC	291 ms 67,728 KB
testcase_05	AC	345 ms 88,256 KB
testcase_06	AC	40 ms 49,388 KB
testcase_07	AC	40 ms 47,620 KB
testcase_08	AC	41 ms 49,500 KB
testcase_09	AC	40 ms 49,280 KB
testcase_10	AC	263 ms 68,096 KB
testcase_11	AC	222 ms 62,104 KB
testcase_12	AC	219 ms 60,732 KB
testcase_13	AC	371 ms 78,144 KB
testcase_14	AC	372 ms 77,284 KB
testcase_15	AC	194 ms 60,300 KB
testcase_16	AC	207 ms 61,408 KB
testcase_17	AC	333 ms 73,568 KB
testcase_18	AC	106 ms 54,728 KB
testcase_19	AC	209 ms 61,204 KB
testcase_20	AC	237 ms 66,604 KB
testcase_21	AC	203 ms 62,160 KB
testcase_22	AC	98 ms 52,320 KB
testcase_23	AC	287 ms 68,388 KB
testcase_24	AC	152 ms 57,648 KB
testcase_25	AC	217 ms 61,980 KB
testcase_26	AC	304 ms 70,364 KB
testcase_27	AC	179 ms 57,624 KB
testcase_28	AC	384 ms 77,896 KB
testcase_29	AC	297 ms 69,680 KB
testcase_30	AC	95 ms 54,148 KB
testcase_31	AC	249 ms 69,736 KB
testcase_32	AC	214 ms 66,748 KB
testcase_33	AC	155 ms 63,216 KB
testcase_34	AC	214 ms 67,204 KB
testcase_35	AC	144 ms 62,312 KB
testcase_36	AC	91 ms 53,888 KB
testcase_37	AC	109 ms 57,604 KB
testcase_38	AC	212 ms 68,444 KB
testcase_39	AC	128 ms 57,572 KB
testcase_40	AC	132 ms 55,540 KB
testcase_41	AC	207 ms 67,028 KB
testcase_42	AC	124 ms 61,460 KB
testcase_43	AC	141 ms 61,688 KB
testcase_44	AC	140 ms 60,352 KB
testcase_45	AC	128 ms 57,388 KB
testcase_46	AC	102 ms 55,284 KB
testcase_47	AC	85 ms 54,264 KB
testcase_48	AC	231 ms 68,380 KB
testcase_49	AC	72 ms 51,332 KB
testcase_50	AC	40 ms 49,880 KB
testcase_51	AC	41 ms 49,316 KB
testcase_52	AC	588 ms 84,396 KB
testcase_53	AC	429 ms 83,208 KB
07_evil_01.txt	AC	598 ms 93,848 KB
07_evil_02.txt	AC	841 ms 118,724 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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

class UFT {
	int[] par;
	int[] rank;
	int[] size;
	int n;
	int groups;
	public UFT(int n){
		this.n = n;
		groups = n;
		par = new int[n];
		rank = new int[n];
		size = new int[n];
		for(int i = 0; i < n; i++){
			par[i] = i;
			rank[i] = 0;
			size[i] = 1;
		}
	}

	public int root(int x){
		if(par[x] == x) return x;
		else return par[x] = root(par[x]);
	}

	public boolean merge(int x, int y){
		x = root(x);
		y = root(y);
		if(x == y) return false;
		if(rank[x] < rank[y]){
			par[x] = y;
			size[y] += size[x];
			size[x] = 0;
		} else {
			par[y] = x;
			size[x] += size[y];
			size[y] = 0;
			if(rank[x] == rank[y]) rank[x]++;
		}
		groups--;
		return true;
	}

	public boolean isSame(int x, int y){
		return root(x) == root(y);
	}

	public boolean isConnected(){
		int s = root(0);
		if(s == n) return true;
		else return false;
	}

	public int connectedComponents(){
		return groups;
	}

	public int groupSize(int i){
		return size[root(i)];
	}
}

class Edge {
	int to, id;
	Edge(int to, int id){
		this.to = to;
		this.id = id;
	}
}

public class Main {
	static final int INF = 1<<30;
	static final long INFL = 1L<<60;
	static final int MOD = 1000000007;
	static final int MOD2 = 998244353;
	static List<List<Edge>> g;
	static int[] ans;
	static void dfs(int v, int pv){
		for(Edge e : g.get(v)) if(e.to != pv){
			ans[e.id] = e.to+1;
			dfs(e.to,v);
		}
	}
	
	public static void main(String[] args) {
		FastScanner fs = new FastScanner();
		PrintWriter pw = new PrintWriter(System.out);
		int n = fs.nextInt();
		UFT uft = new UFT(n);
		int[] a = new int[n];
		int[] b = new int[n];
		List<Integer> s = new ArrayList<>();
		g = new ArrayList<>();
		for(int i = 0; i < n; i++) g.add(new ArrayList<>());
		ans = new int[n];
		for(int i = 0; i < n; i++){
			a[i] = fs.nextInt() - 1;
			b[i] = fs.nextInt() - 1;
			if(uft.merge(a[i],b[i])){
				g.get(a[i]).add(new Edge(b[i],i));
				g.get(b[i]).add(new Edge(a[i],i));
			} else {
				s.add(a[i]);
				ans[i] = a[i]+1;
			}
		}
		int[] es = new int[n];
		for(int i = 0; i < n; i++){
			es[uft.root(a[i])]++;
		}
		boolean ok = true;
		for(int i = 0; i < n; i++){
			if(es[i] != uft.size[i]) ok = false;
		}
		if(ok){
			for(int v : s){
				dfs(v,-1);
			}
			pw.println("Yes");
			for(int e : ans){
				pw.println(e);
			}
		} else {
			pw.println("No");
		}
	
		pw.close();
	}
}

class FastScanner {
	private InputStream in = System.in;
	private byte[] buffer = new byte[1024];
	private int length = 0, p = 0;
	private boolean hasNextByte() {
		if (p < length) return true;
		else{
			p = 0;
			try{
				length = in.read(buffer);
			}catch(Exception e){
				e.printStackTrace();
			}
			if(length == 0) return false;
		}
		return true;
	}
	private int readByte() {
		if (hasNextByte() == true) return buffer[p++];
		return -1;
	}
	private static boolean isPrintable(int n) {
		return 33 <= n && n <= 126;
	}
	private void skip() {
		while (hasNextByte() && !isPrintable(buffer[p])) p++;
	}
	public boolean hasNext() {
		skip();
		return hasNextByte();
	}
	public String next() {
		if(!hasNext()) throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int temp = readByte();
		while (isPrintable(temp)) {
			sb.appendCodePoint(temp);
			temp = readByte();
		}
		return sb.toString();
	}
	public int nextInt() {
		return Math.toIntExact(nextLong());
	}
	public int[] nextInts(int n) {
		int[] ar = new int[n];
		for (int i = 0; i < n; i++) ar[i] = nextInt();
		return ar;
	}
	public long[] nextLongs(int n) {
		long[] ar = new long[n];
		for (int i = 0; i < n; i++) ar[i] = nextLong();
		return ar;
	}
	public long nextLong() {
		if(!hasNext()) throw new NoSuchElementException();
		boolean minus = false;
		int temp = readByte();
		if (temp == '-') {
			minus = true;
			temp = readByte();
		}
		if (temp < '0' || '9' < temp) throw new NumberFormatException();
		long n = 0;
		while (isPrintable(temp)) {
			if ('0' <= temp && temp <= '9') {
				n *= 10;
				n += temp - '0';
			}
			temp = readByte();
		}
		return minus ? -n : n;
	}
	public char[] nextChars() {
		String s = next();
		return s.toCharArray();
	}
	public char[][] nextCharMat(int h, int w) {
		char[][] ar = new char[h][w];
		for(int i = 0; i < h; i++){
			String s = next();
			for(int j = 0; j < w; j++){
				ar[i][j] = s.charAt(j);
			}
		}
		return ar;
	}
}

yukicoder

結果

テストケース

ソースコード