結果
問題 | No.1065 電柱 / Pole (Easy) |
ユーザー | daut-dlang |
提出日時 | 2020-05-29 21:56:46 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 686 ms / 2,000 ms |
コード長 | 2,691 bytes |
コンパイル時間 | 2,475 ms |
コンパイル使用メモリ | 172,524 KB |
実行使用メモリ | 59,588 KB |
最終ジャッジ日時 | 2023-09-04 07:58:46 |
合計ジャッジ時間 | 16,110 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,384 KB |
testcase_02 | AC | 324 ms
26,276 KB |
testcase_03 | AC | 462 ms
49,324 KB |
testcase_04 | AC | 455 ms
51,032 KB |
testcase_05 | AC | 361 ms
47,312 KB |
testcase_06 | AC | 364 ms
48,084 KB |
testcase_07 | AC | 109 ms
18,356 KB |
testcase_08 | AC | 423 ms
53,404 KB |
testcase_09 | AC | 36 ms
9,800 KB |
testcase_10 | AC | 185 ms
25,244 KB |
testcase_11 | AC | 123 ms
21,900 KB |
testcase_12 | AC | 116 ms
20,616 KB |
testcase_13 | AC | 386 ms
46,020 KB |
testcase_14 | AC | 414 ms
44,712 KB |
testcase_15 | AC | 482 ms
53,640 KB |
testcase_16 | AC | 272 ms
32,300 KB |
testcase_17 | AC | 574 ms
59,588 KB |
testcase_18 | AC | 198 ms
24,724 KB |
testcase_19 | AC | 503 ms
43,220 KB |
testcase_20 | AC | 128 ms
16,256 KB |
testcase_21 | AC | 243 ms
36,828 KB |
testcase_22 | AC | 456 ms
49,044 KB |
testcase_23 | AC | 6 ms
4,376 KB |
testcase_24 | AC | 9 ms
4,380 KB |
testcase_25 | AC | 107 ms
15,928 KB |
testcase_26 | AC | 272 ms
29,276 KB |
testcase_27 | AC | 288 ms
31,844 KB |
testcase_28 | AC | 520 ms
58,188 KB |
testcase_29 | AC | 67 ms
14,304 KB |
testcase_30 | AC | 473 ms
51,536 KB |
testcase_31 | AC | 322 ms
34,028 KB |
testcase_32 | AC | 204 ms
27,668 KB |
testcase_33 | AC | 475 ms
47,856 KB |
testcase_34 | AC | 197 ms
25,280 KB |
testcase_35 | AC | 495 ms
53,092 KB |
testcase_36 | AC | 4 ms
4,376 KB |
testcase_37 | AC | 6 ms
4,380 KB |
testcase_38 | AC | 5 ms
4,380 KB |
testcase_39 | AC | 7 ms
4,384 KB |
testcase_40 | AC | 3 ms
4,376 KB |
testcase_41 | AC | 686 ms
53,916 KB |
testcase_42 | AC | 176 ms
21,296 KB |
testcase_43 | AC | 333 ms
28,688 KB |
testcase_44 | AC | 107 ms
12,868 KB |
testcase_45 | AC | 323 ms
27,904 KB |
testcase_46 | AC | 1 ms
4,380 KB |
testcase_47 | AC | 1 ms
4,380 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(T)(ref T x, T y) { x = (x + y) % mod; } void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; } void modm(T)(ref T x, T y) { x = (x * y) % mod; } void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); } void modd(T)(ref T x, T y) { x.modm(y.modpow(mod - 2)); } void main() { auto N = RD; auto M = RD; auto X = RD-1; auto Y = RD-1; auto p = new long[](N); auto q = new long[](N); foreach (i; 0..N) { p[i] = RD; q[i] = RD; } auto edges = new double[][][](N); foreach (i; 0..M) { auto P = RD-1; auto Q = RD-1; auto d = sqrt(cast(double)((p[P]-p[Q])^^2 + (q[P]-q[Q])^^2)); edges[P] ~= [Q, d]; edges[Q] ~= [P, d]; } auto heap = BinaryHeap!(Array!(double[]), "a[1] > b[1]")(); heap.insert([X, 0.0]); auto dist = new double[](N); dist[] = double.max; dist[X] = 0.0; while (!heap.empty) { auto nd = heap.front; heap.removeFront; auto from = cast(long)nd[0]; auto d = nd[1]; foreach (e; edges[from]) { auto to = cast(long)e[0]; if (d+e[1] < dist[to]) { dist[to] = d+e[1]; heap.insert([to, dist[to]]); } } } writefln(FMT_F, dist[Y]); stdout.flush; debug readln; }