結果
問題 | No.2387 Yokan Factory |
ユーザー |
👑 |
提出日時 | 2023-07-21 21:57:46 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 888 ms / 5,000 ms |
コード長 | 2,646 bytes |
コンパイル時間 | 2,082 ms |
コンパイル使用メモリ | 136,448 KB |
実行使用メモリ | 20,796 KB |
最終ジャッジ日時 | 2024-09-21 23:28:46 |
合計ジャッジ時間 | 8,571 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 35 |
ソースコード
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)); }enum INF = 10L^^18;void main() {try {for (; ; ) {const N = readInt;const M = readInt;const X = readLong;auto A = new int[M];auto B = new int[M];auto C = new long[M];auto D = new long[M];foreach (i; 0 .. M) {A[i] = readInt - 1;B[i] = readInt - 1;C[i] = readLong;D[i] = readLong;}auto G = new int[][N];foreach (i; 0 .. M) {G[A[i]] ~= i;G[B[i]] ~= i;}const S = 0, T = N - 1;bool check(long thr) {alias Entry = Tuple!(long, "c", int, "u");BinaryHeap!(Array!Entry, "a.c > b.c") que;auto dist = new long[N];dist[] = INF;que.insert(Entry(dist[S] = 0, S));for (; !que.empty; ) {const c = que.front.c;const u = que.front.u;que.removeFront;if (dist[u] == c) {foreach (i; G[u]) if (D[i] >= thr) {const cc = c + C[i];const v = A[i] ^ B[i] ^ u;if (chmin(dist[v], cc)) {que.insert(Entry(cc, v));}}}}return (dist[T] <= X);}if (check(0)) {long lo = 0, hi = D.maxElement + 1;for (; lo + 1 < hi; ) {const mid = (lo + hi) / 2;(check(mid) ? lo : hi) = mid;}writeln(lo);} else {writeln(-1);}}} catch (EOFException e) {}}