結果

問題 No.556 仁義なきサルたち
ユーザー uwiuwi
提出日時 2017-08-11 22:41:32
言語 Java21
(openjdk 21)
結果
AC  
実行時間 111 ms / 2,000 ms
コード長 4,075 bytes
コンパイル時間 3,637 ms
コンパイル使用メモリ 84,740 KB
実行使用メモリ 51,952 KB
最終ジャッジ日時 2024-04-20 22:54:49
合計ジャッジ時間 6,024 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
50,204 KB
testcase_01 AC 54 ms
50,056 KB
testcase_02 AC 51 ms
49,848 KB
testcase_03 AC 52 ms
50,200 KB
testcase_04 AC 51 ms
49,900 KB
testcase_05 AC 55 ms
49,736 KB
testcase_06 AC 55 ms
50,136 KB
testcase_07 AC 54 ms
50,144 KB
testcase_08 AC 56 ms
50,276 KB
testcase_09 AC 56 ms
49,936 KB
testcase_10 AC 72 ms
50,444 KB
testcase_11 AC 58 ms
50,372 KB
testcase_12 AC 56 ms
49,888 KB
testcase_13 AC 95 ms
51,112 KB
testcase_14 AC 99 ms
51,380 KB
testcase_15 AC 96 ms
51,296 KB
testcase_16 AC 103 ms
51,356 KB
testcase_17 AC 107 ms
51,792 KB
testcase_18 AC 110 ms
51,804 KB
testcase_19 AC 98 ms
51,916 KB
testcase_20 AC 108 ms
51,540 KB
testcase_21 AC 111 ms
51,952 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest170811;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class E {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), Q = ni();
		DJSet ds = new DJSet(n);
		for(int i = 0;i < Q;i++){
			int x = ni()-1, y = ni()-1;
			ds.union(x, y);
		}
		for(int i = 0;i < n;i++){
			out.println(ds.boss[ds.root(i)] + 1);
		}
	}
	
	public static class DJSet {
		public int[] upper;
		public int[] boss;

		public DJSet(int n) {
			upper = new int[n];
			Arrays.fill(upper, -1);
			boss = new int[n];
			for(int i = 0;i < n;i++)boss[i] = i;
		}

		public int root(int x) {
			return upper[x] < 0 ? x : (upper[x] = root(upper[x]));
		}

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

		public boolean union(int x, int y) {
			x = root(x);
			y = root(y);
			if (x != y) {
				if (upper[y] < upper[x]) {
					int d = x;
					x = y;
					y = d;
				}
				if(-upper[x] < -upper[y] ||
						upper[x] == upper[y] && boss[x] > boss[y]){
					// y win
					boss[x] = boss[y];
				}
				upper[x] += upper[y];
				upper[y] = x;
			}
			return x == y;
		}

		public int count() {
			int ct = 0;
			for (int u : upper)
				if (u < 0)
					ct++;
			return ct;
		}
	}

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new E().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0