結果
問題 | No.1545 [Cherry 2nd Tune N] Anthem |
ユーザー | daut-dlang |
提出日時 | 2021-06-11 23:06:30 |
言語 | D (dmd 2.106.1) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,338 bytes |
コンパイル時間 | 935 ms |
コンパイル使用メモリ | 128,112 KB |
実行使用メモリ | 188,548 KB |
最終ジャッジ日時 | 2023-09-04 12:55:30 |
合計ジャッジ時間 | 22,078 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
8,764 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 139 ms
51,752 KB |
testcase_05 | AC | 353 ms
79,796 KB |
testcase_06 | AC | 188 ms
59,912 KB |
testcase_07 | AC | 424 ms
63,828 KB |
testcase_08 | AC | 387 ms
72,204 KB |
testcase_09 | AC | 234 ms
49,384 KB |
testcase_10 | AC | 164 ms
61,440 KB |
testcase_11 | AC | 204 ms
67,220 KB |
testcase_12 | AC | 279 ms
67,256 KB |
testcase_13 | AC | 114 ms
51,820 KB |
testcase_14 | AC | 135 ms
61,720 KB |
testcase_15 | AC | 62 ms
53,312 KB |
testcase_16 | AC | 147 ms
52,816 KB |
testcase_17 | AC | 198 ms
56,592 KB |
testcase_18 | AC | 353 ms
61,208 KB |
testcase_19 | AC | 196 ms
61,196 KB |
testcase_20 | AC | 122 ms
60,660 KB |
testcase_21 | AC | 213 ms
61,360 KB |
testcase_22 | AC | 232 ms
55,684 KB |
testcase_23 | AC | 300 ms
72,540 KB |
testcase_24 | AC | 14 ms
4,380 KB |
testcase_25 | AC | 11 ms
4,376 KB |
testcase_26 | AC | 2 ms
4,380 KB |
testcase_27 | AC | 9 ms
4,380 KB |
testcase_28 | AC | 16 ms
4,380 KB |
testcase_29 | AC | 16 ms
4,376 KB |
testcase_30 | AC | 11 ms
4,376 KB |
testcase_31 | AC | 14 ms
4,380 KB |
testcase_32 | AC | 6 ms
4,376 KB |
testcase_33 | AC | 17 ms
4,380 KB |
testcase_34 | AC | 13 ms
4,376 KB |
testcase_35 | AC | 36 ms
4,380 KB |
testcase_36 | AC | 29 ms
4,384 KB |
testcase_37 | AC | 5 ms
4,376 KB |
testcase_38 | AC | 16 ms
4,376 KB |
testcase_39 | AC | 5 ms
4,376 KB |
testcase_40 | AC | 9 ms
4,376 KB |
testcase_41 | AC | 3 ms
4,380 KB |
testcase_42 | AC | 11 ms
4,376 KB |
testcase_43 | AC | 15 ms
4,376 KB |
testcase_44 | AC | 7 ms
4,380 KB |
testcase_45 | AC | 2 ms
4,380 KB |
testcase_46 | AC | 21 ms
4,376 KB |
testcase_47 | AC | 31 ms
4,704 KB |
testcase_48 | AC | 43 ms
7,048 KB |
testcase_49 | AC | 64 ms
6,268 KB |
testcase_50 | AC | 111 ms
6,772 KB |
testcase_51 | AC | 5 ms
4,376 KB |
testcase_52 | AC | 121 ms
6,796 KB |
testcase_53 | AC | 47 ms
6,472 KB |
testcase_54 | AC | 6 ms
4,380 KB |
testcase_55 | AC | 103 ms
6,260 KB |
testcase_56 | AC | 8 ms
4,376 KB |
testcase_57 | AC | 73 ms
6,772 KB |
testcase_58 | AC | 51 ms
5,272 KB |
testcase_59 | AC | 14 ms
4,376 KB |
testcase_60 | AC | 11 ms
5,948 KB |
testcase_61 | AC | 29 ms
4,380 KB |
testcase_62 | AC | 60 ms
5,720 KB |
testcase_63 | AC | 32 ms
4,424 KB |
testcase_64 | TLE | - |
testcase_65 | -- | - |
testcase_66 | -- | - |
ソースコード
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)); } double[] rotate(double[] vec, double rad) { return [cos(rad)*vec[0] - sin(rad)*vec[1], sin(rad)*vec[0] + cos(rad)*vec[1]]; } //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 S = RD-1; auto T = RD-1; auto K = RD; auto X = RDA; auto M = RD; auto edges = new int[][][](N); foreach (i; 0..M) { auto A = RD!int-1; auto B = RD!int-1; auto Y = RD!int; edges[A] ~= [B, Y]; } auto KK = min(3*(10^^6)/N, N+K); auto dist = new long[][](N, KK); foreach (i; 0..N) dist[i][] = long.max; dist[S][0] = X[S]; BinaryHeap!(Array!(long[]), "a[2] > b[2]") q; q.insert([S, 0, X[S]]); auto par = new int[][](N, KK); long[] ans; while (!q.empty) { auto nd = q.front; q.removeFront; auto u1 = nd[0]; auto u2 = nd[1]; auto c = nd[2]; if (u1 == T && u2 >= K-1) { ans = [u2, c]; break; } if (u2+1 > KK-1) continue; foreach (e; edges[u1]) { auto v1 = e[0]; auto v2 = u2+1; auto d = c + X[v1] + e[1]; if (d < dist[v1][v2]) { dist[v1][v2] = d; par[v1][v2] = cast(int)u1; debug writeln("v1:", v1, " v2:", v2, " u1:", u1, " d:", d); q.insert([v1, v2, d]); } } } debug writeln(dist); debug writeln(par); if (ans.empty) writeln("Impossible"); else { writeln("Possible"); writeln(ans[1]); auto pos = [T, ans[0]]; auto arr = [T+1]; while (pos[1] != 0) { pos = [par[pos[0]][pos[1]], pos[1]-1]; arr ~= pos[0]+1; } arr.reverse; writeln(arr.length); arr.map!(to!string).join(" ").writeln; } stdout.flush; debug readln; }