結果
問題 | No.1301 Strange Graph Shortest Path |
ユーザー | daut-dlang |
提出日時 | 2020-11-27 23:15:14 |
言語 | D (dmd 2.106.1) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,196 bytes |
コンパイル時間 | 809 ms |
コンパイル使用メモリ | 118,768 KB |
実行使用メモリ | 41,004 KB |
最終ジャッジ日時 | 2024-06-22 10:07:37 |
合計ジャッジ時間 | 14,211 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,944 KB |
testcase_02 | WA | - |
testcase_03 | AC | 282 ms
33,008 KB |
testcase_04 | AC | 407 ms
39,004 KB |
testcase_05 | AC | 291 ms
32,000 KB |
testcase_06 | AC | 353 ms
36,104 KB |
testcase_07 | AC | 353 ms
36,808 KB |
testcase_08 | AC | 267 ms
33,016 KB |
testcase_09 | AC | 349 ms
34,888 KB |
testcase_10 | WA | - |
testcase_11 | AC | 381 ms
35,776 KB |
testcase_12 | AC | 370 ms
38,000 KB |
testcase_13 | AC | 339 ms
37,628 KB |
testcase_14 | AC | 344 ms
35,156 KB |
testcase_15 | AC | 344 ms
35,888 KB |
testcase_16 | AC | 397 ms
39,240 KB |
testcase_17 | AC | 367 ms
38,276 KB |
testcase_18 | AC | 323 ms
36,064 KB |
testcase_19 | AC | 363 ms
37,580 KB |
testcase_20 | AC | 376 ms
36,552 KB |
testcase_21 | AC | 357 ms
39,224 KB |
testcase_22 | AC | 349 ms
36,436 KB |
testcase_23 | AC | 371 ms
38,916 KB |
testcase_24 | AC | 355 ms
37,908 KB |
testcase_25 | AC | 388 ms
37,636 KB |
testcase_26 | AC | 352 ms
36,604 KB |
testcase_27 | AC | 363 ms
35,676 KB |
testcase_28 | AC | 299 ms
34,560 KB |
testcase_29 | WA | - |
testcase_30 | AC | 395 ms
37,000 KB |
testcase_31 | AC | 411 ms
39,296 KB |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 299 ms
29,584 KB |
ソースコード
import std.stdio, std.conv, std.functional, std.string; import std.algorithm, std.array, std.container, std.range, std.typecons; import std.bigint, std.numeric, std.math, std.random; import core.bitop; string FMT_F = "%.10f"; static File _f; void file_io(string fn) { _f = File(fn, "r"); } static string[] s_rd; T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; } T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; } T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; } T[] RDA(T = long)(T fix = 0) { if (_f.isOpen) return _RDA!T(_f, fix); else return _RDA!T(fix); } size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;} size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; } void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); } bool inside(T)(T x, T b, T e) { return x >= b && x < e; } T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); } //long mod = 10^^9 + 7; long mod = 998_244_353; //long mod = 1_000_003; void moda(ref long x, long y) { x = (x + y) % mod; } void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; } void modm(ref long x, long y) { x = (x * y) % mod; } void modpow(ref long x, long y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); } void modd(ref long x, long y) { y.modpow(mod - 2); x.modm(y); } void main() { auto N = RD; auto M = RD; auto edges = new long[][][](N); foreach (i; 0..M) { auto u = RD-1; auto v = RD-1; auto c = RD; auto d = RD; edges[u] ~= [v, c, d]; edges[v] ~= [u, c, d]; } long ans; { long[] q = [0]; auto dist = new long[][](N); foreach (i; 0..N) dist[i] = [long.max, i]; dist[0] = [0, 0]; while (!q.empty) { auto u = q.front; q.popFront; foreach (e; edges[u]) { auto v = e[0]; auto d = e[1]; auto nd = dist[u][0] + d; if (nd < dist[v][0]) { dist[v] = [nd, u]; q ~= v; } } } long pos = N-1; while (pos != 0) { auto prev = dist[pos][1]; foreach (ref e; edges[pos]) { if (e[0] == prev) { swap(e[1], e[2]); break; } } foreach (ref e; edges[prev]) { if (e[0] == pos) { swap(e[1], e[2]); break; } } pos = prev; } ans += dist[N-1][0]; } { long[] q = [N-1]; auto dist = new long[][](N); foreach (i; 0..N) dist[i] = [long.max, i]; dist[N-1] = [0, 0]; while (!q.empty) { auto u = q.front; q.popFront; foreach (e; edges[u]) { auto v = e[0]; auto d = e[1]; auto nd = dist[u][0] + d; if (nd < dist[v][0]) { dist[v] = [nd, u]; q ~= v; } } } ans += dist[0][0]; } writeln(ans); stdout.flush; debug readln; }