結果
問題 | No.2321 Continuous Flip |
ユーザー | 👑 hos.lyric |
提出日時 | 2023-05-27 02:55:33 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 619 ms / 2,000 ms |
コード長 | 2,530 bytes |
コンパイル時間 | 2,622 ms |
コンパイル使用メモリ | 124,496 KB |
実行使用メモリ | 48,468 KB |
最終ジャッジ日時 | 2023-09-04 20:25:22 |
合計ジャッジ時間 | 24,149 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 607 ms
48,332 KB |
testcase_05 | AC | 619 ms
46,512 KB |
testcase_06 | AC | 587 ms
46,500 KB |
testcase_07 | AC | 594 ms
46,492 KB |
testcase_08 | AC | 604 ms
48,140 KB |
testcase_09 | AC | 591 ms
46,548 KB |
testcase_10 | AC | 606 ms
46,556 KB |
testcase_11 | AC | 598 ms
46,548 KB |
testcase_12 | AC | 600 ms
46,472 KB |
testcase_13 | AC | 589 ms
48,208 KB |
testcase_14 | AC | 591 ms
48,136 KB |
testcase_15 | AC | 600 ms
48,468 KB |
testcase_16 | AC | 592 ms
46,548 KB |
testcase_17 | AC | 586 ms
46,496 KB |
testcase_18 | AC | 586 ms
46,484 KB |
testcase_19 | AC | 591 ms
48,128 KB |
testcase_20 | AC | 591 ms
46,556 KB |
testcase_21 | AC | 585 ms
48,136 KB |
testcase_22 | AC | 587 ms
48,080 KB |
testcase_23 | AC | 590 ms
46,552 KB |
testcase_24 | AC | 378 ms
44,484 KB |
testcase_25 | AC | 1 ms
4,380 KB |
testcase_26 | AC | 293 ms
33,580 KB |
testcase_27 | AC | 347 ms
43,368 KB |
testcase_28 | AC | 510 ms
44,264 KB |
testcase_29 | AC | 508 ms
44,408 KB |
testcase_30 | AC | 513 ms
44,404 KB |
testcase_31 | AC | 506 ms
44,340 KB |
testcase_32 | AC | 506 ms
44,292 KB |
testcase_33 | AC | 511 ms
44,340 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; } 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)); } /* cost A[i] to flip [i, i+1) flip all ==> path from 0 to N */ enum INF = 10L^^18; void main() { try { for (; ; ) { const N = readInt; const M = readInt; const C = readLong; auto A = new long[N]; foreach (u; 0 .. N) { A[u] = readLong; } auto L = new int[M]; auto R = new int[M]; foreach (i; 0 .. M) { L[i] = readInt - 1; R[i] = readInt; } alias Edge = Tuple!(long, "c", int, "v"); auto G = new Edge[][N + 1]; foreach (u; 0 .. N) { G[u] ~= Edge(A[u], u + 1); G[u + 1] ~= Edge(A[u], u); } foreach (i; 0 .. M) { G[L[i]] ~= Edge(C, R[i]); G[R[i]] ~= Edge(C, L[i]); } alias Entry = Tuple!(long, "c", int, "u"); BinaryHeap!(Array!Entry, "a.c > b.c") que; auto dist = new long[N + 1]; dist[] = INF; que.insert(Entry(dist[0] = 0, 0)); for (; !que.empty; ) { const c = que.front.c; const u = que.front.u; que.removeFront; if (dist[u] == c) { foreach (e; G[u]) { const cc = c + e.c; const v = e.v; if (chmin(dist[v], cc)) { que.insert(Entry(cc, v)); } } } } long ans = A.sum; ans -= dist[N]; writeln(ans); } } catch (EOFException e) { } }