結果

問題 No.1640 簡単な色塗り
ユーザー nishi5451
提出日時 2021-08-07 14:30:57
言語 Java
(openjdk 23)
結果
AC  
実行時間 394 ms / 2,000 ms
コード長 4,350 bytes
コンパイル時間 2,407 ms
コンパイル使用メモリ 79,756 KB
実行使用メモリ 87,776 KB
最終ジャッジ日時 2024-06-29 16:51:48
合計ジャッジ時間 20,790 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 53
権限があれば一括ダウンロードができます

ソースコード

diff # 

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;
	}
}
0