結果

問題 No.317 辺の追加
ユーザー uwiuwi
提出日時 2015-12-10 02:55:57
言語 Java21
(openjdk 21)
結果
AC  
実行時間 308 ms / 2,000 ms
コード長 4,311 bytes
コンパイル時間 3,727 ms
コンパイル使用メモリ 81,644 KB
実行使用メモリ 59,204 KB
最終ジャッジ日時 2023-10-13 10:17:00
合計ジャッジ時間 14,426 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
49,664 KB
testcase_01 AC 45 ms
49,368 KB
testcase_02 AC 183 ms
57,068 KB
testcase_03 AC 180 ms
57,972 KB
testcase_04 AC 257 ms
56,788 KB
testcase_05 AC 161 ms
56,304 KB
testcase_06 AC 182 ms
55,944 KB
testcase_07 AC 125 ms
53,860 KB
testcase_08 AC 308 ms
58,068 KB
testcase_09 AC 200 ms
56,884 KB
testcase_10 AC 208 ms
57,060 KB
testcase_11 AC 196 ms
54,936 KB
testcase_12 AC 207 ms
56,744 KB
testcase_13 AC 206 ms
55,488 KB
testcase_14 AC 214 ms
59,204 KB
testcase_15 AC 207 ms
57,096 KB
testcase_16 AC 256 ms
57,372 KB
testcase_17 AC 203 ms
56,712 KB
testcase_18 AC 208 ms
56,824 KB
testcase_19 AC 223 ms
58,740 KB
testcase_20 AC 278 ms
56,612 KB
testcase_21 AC 151 ms
55,264 KB
testcase_22 AC 115 ms
52,392 KB
testcase_23 AC 126 ms
52,656 KB
testcase_24 AC 189 ms
58,380 KB
testcase_25 AC 164 ms
57,768 KB
testcase_26 AC 166 ms
57,784 KB
testcase_27 AC 151 ms
55,072 KB
testcase_28 AC 118 ms
52,796 KB
testcase_29 AC 96 ms
51,988 KB
testcase_30 AC 255 ms
55,892 KB
testcase_31 AC 260 ms
55,832 KB
testcase_32 AC 272 ms
56,136 KB
testcase_33 AC 265 ms
55,948 KB
testcase_34 AC 253 ms
55,852 KB
testcase_35 AC 268 ms
56,036 KB
testcase_36 AC 264 ms
55,928 KB
testcase_37 AC 260 ms
56,588 KB
testcase_38 AC 267 ms
55,992 KB
testcase_39 AC 256 ms
55,836 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q8xx;
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 Q896_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		DJSet ds = new DJSet(n);
		for(int i = 0;i < m;i++){
			ds.union(ni()-1, ni()-1);
		}
		int[] f = new int[n+1];
		for(int i = 0;i < n;i++){
			if(ds.upper[i] < 0){
				f[-ds.upper[i]]++;
			}
		}
		int[] dp = new int[n+1];
		Arrays.fill(dp, 9999999);
		dp[0] = 0;
		int sum = 0;
		for(int i = 1;i <= n;i++){
			for(int d = 1;f[i] > 0;d *= 2){
				int x = Math.min(f[i], d);
				f[i] -= x;
				sum += x*i;
				for(int j = sum;j >= x*i;j--){
					dp[j] = Math.min(dp[j], dp[j-x*i] + x);
				}
			}
		}
		for(int i = 0;i <= n;i++){
			if(dp[i] > 1000000)dp[i] = 0;
		}
		for(int i = 1;i <= n;i++){
			out.println(dp[i]-1);
		}
	}
	
	public static class DJSet {
		public int[] upper;

		public DJSet(int n) {
			upper = new int[n];
			Arrays.fill(upper, -1);
		}

		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;
				}
				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 Q896_2().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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