結果
問題 | No.317 辺の追加 |
ユーザー |
👑 |
提出日時 | 2019-01-18 17:30:35 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 147 ms / 2,000 ms |
コード長 | 2,565 bytes |
コンパイル時間 | 1,003 ms |
コンパイル使用メモリ | 121,712 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-13 02:59:10 |
合計ジャッジ時間 | 8,428 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 38 |
ソースコード
import std.conv, std.stdio, std.string;import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons;import core.bitop;class EOFException : Throwable { this() { super("EOF"); } }string[] tokens;string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }int readInt() { return readToken().to!int; }long readLong() { return readToken().to!long; }real readReal() { return readToken().to!real; }void chmin(T)(ref T t, in T f) { if (t > f) t = f; }void chmax(T)(ref T t, in T f) { if (t < f) t = f; }int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp)>> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }int root(int[] uf, int u) {return (uf[u] < 0) ? u : (uf[u] = uf.root(uf[u]));}bool connect(int[] uf, int u, int v) {u = uf.root(u);v = uf.root(v);if (u == v) return false;if (uf[u] > uf[v]) swap(u, v);uf[u] += uf[v];uf[v] = u;return true;}int N, M;int[] A, B;void main() {try {for (; ; ) {N = readInt();M = readInt();A = new int[M];B = new int[M];foreach (i; 0 .. M) {A[i] = readInt() - 1;B[i] = readInt() - 1;}auto uf = new int[N];uf[] = -1;foreach (i; 0 .. M) {uf.connect(A[i], B[i]);}int[] xs;foreach (u; 0 .. N) {if (uf[u] < 0) {xs ~= -uf[u];}}xs.sort;debug {writeln("xs = ", xs);}auto dp = new int[N + 1];dp[] = N + 1;dp[0] = 0;for (int i = 0, j = 0; i < xs.length; i = j) {for (; j < xs.length && xs[i] == xs[j]; ++j) {}int k = j - i;for (int l = 1; l < k; l <<= 1) {k -= l;const y = xs[i] * l;foreach_reverse (z; y .. N + 1) {chmin(dp[z], dp[z - y] + l);}}{const y = xs[i] * k;foreach_reverse (z; y .. N + 1) {chmin(dp[z], dp[z - y] + k);}}}foreach (z; 1 .. N + 1) {writeln((dp[z] > N) ? -1 : (dp[z] - 1));}}} catch (EOFException e) {}}