結果
問題 | No.1194 Replace |
ユーザー | 👑 hos.lyric |
提出日時 | 2020-08-22 13:49:42 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 395 ms / 2,000 ms |
コード長 | 2,558 bytes |
コンパイル時間 | 1,196 ms |
コンパイル使用メモリ | 127,596 KB |
実行使用メモリ | 30,348 KB |
最終ジャッジ日時 | 2024-06-22 08:13:15 |
合計ジャッジ時間 | 10,463 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 301 ms
24,168 KB |
testcase_01 | AC | 328 ms
24,884 KB |
testcase_02 | AC | 252 ms
20,576 KB |
testcase_03 | AC | 207 ms
18,676 KB |
testcase_04 | AC | 329 ms
24,968 KB |
testcase_05 | AC | 300 ms
24,308 KB |
testcase_06 | AC | 276 ms
23,864 KB |
testcase_07 | AC | 387 ms
27,756 KB |
testcase_08 | AC | 392 ms
30,348 KB |
testcase_09 | AC | 385 ms
30,084 KB |
testcase_10 | AC | 388 ms
29,060 KB |
testcase_11 | AC | 390 ms
29,804 KB |
testcase_12 | AC | 395 ms
28,672 KB |
testcase_13 | AC | 319 ms
16,464 KB |
testcase_14 | AC | 281 ms
13,208 KB |
testcase_15 | AC | 214 ms
14,104 KB |
testcase_16 | AC | 305 ms
14,332 KB |
testcase_17 | AC | 201 ms
11,696 KB |
testcase_18 | AC | 208 ms
12,768 KB |
testcase_19 | AC | 296 ms
14,380 KB |
testcase_20 | AC | 1 ms
6,940 KB |
testcase_21 | AC | 1 ms
6,944 KB |
testcase_22 | AC | 1 ms
6,940 KB |
testcase_23 | AC | 84 ms
6,940 KB |
testcase_24 | AC | 27 ms
6,944 KB |
testcase_25 | AC | 17 ms
6,940 KB |
testcase_26 | AC | 124 ms
7,184 KB |
testcase_27 | AC | 27 ms
6,940 KB |
testcase_28 | AC | 59 ms
6,940 KB |
testcase_29 | AC | 5 ms
6,944 KB |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, 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; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { const N = readLong(); const M = readInt(); auto B = new long[M]; auto C = new long[M]; foreach (i; 0 .. M) { B[i] = readLong(); C[i] = readLong(); } auto xs = B ~ C; xs = xs.sort.uniq.array; const xsLen = cast(int)(xs.length); debug { writeln("B = ", B); writeln("C = ", C); writeln("xs = ", xs); } auto graph = new int[][xsLen]; foreach (i; 0 .. M) { const u = xs.lowerBound(B[i]); const v = xs.lowerBound(C[i]); graph[v] ~= u; } auto que = new int[xsLen]; int qb, qe; auto mxs = new int[xsLen]; mxs[] = -1; foreach_reverse (s; 0 .. xsLen) { if (mxs[s] == -1) { mxs[s] = s; qb = qe = 0; que[qe++] = s; for (; qb != qe; ) { const u = que[qb++]; foreach (v; graph[u]) { if (mxs[v] == -1) { mxs[v] = s; que[qe++] = v; } } } } } debug { writeln("mxs = ", mxs); } long ans = N * (N + 1) / 2; foreach (u; 0 .. xsLen) { ans -= xs[u]; ans += xs[mxs[u]]; } writeln(ans); } } catch (EOFException e) { } }