結果
問題 | No.1190 Points |
ユーザー | 👑 hos.lyric |
提出日時 | 2020-08-22 14:22:32 |
言語 | D (dmd 2.107.1) |
結果 |
AC
|
実行時間 | 258 ms / 2,000 ms |
コード長 | 2,843 bytes |
コンパイル時間 | 894 ms |
コンパイル使用メモリ | 109,644 KB |
実行使用メモリ | 19,764 KB |
最終ジャッジ日時 | 2023-09-04 09:09:09 |
合計ジャッジ時間 | 8,385 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,384 KB |
testcase_03 | AC | 144 ms
15,256 KB |
testcase_04 | AC | 124 ms
14,228 KB |
testcase_05 | AC | 119 ms
14,284 KB |
testcase_06 | AC | 184 ms
18,500 KB |
testcase_07 | AC | 213 ms
18,344 KB |
testcase_08 | AC | 224 ms
19,176 KB |
testcase_09 | AC | 222 ms
18,084 KB |
testcase_10 | AC | 225 ms
19,544 KB |
testcase_11 | AC | 161 ms
16,100 KB |
testcase_12 | AC | 223 ms
19,536 KB |
testcase_13 | AC | 155 ms
14,952 KB |
testcase_14 | AC | 40 ms
8,520 KB |
testcase_15 | AC | 257 ms
18,860 KB |
testcase_16 | AC | 28 ms
5,616 KB |
testcase_17 | AC | 228 ms
18,364 KB |
testcase_18 | AC | 127 ms
11,824 KB |
testcase_19 | AC | 27 ms
9,788 KB |
testcase_20 | AC | 149 ms
13,404 KB |
testcase_21 | AC | 59 ms
9,280 KB |
testcase_22 | AC | 73 ms
13,680 KB |
testcase_23 | AC | 258 ms
19,764 KB |
testcase_24 | AC | 250 ms
19,632 KB |
testcase_25 | AC | 187 ms
18,960 KB |
testcase_26 | AC | 145 ms
14,216 KB |
testcase_27 | AC | 185 ms
19,564 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; } real readReal() { return readToken.to!real; } 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 P = readLong(); const S = readInt() - 1; const T = readInt() - 1; auto A = new int[M]; auto B = new int[M]; foreach (i; 0 .. M) { A[i] = readInt() - 1; B[i] = readInt() - 1; } auto graph = new int[][N << 1]; foreach (i; 0 .. M) { graph[A[i] << 1 | 0] ~= (B[i] << 1 | 1); graph[A[i] << 1 | 1] ~= (B[i] << 1 | 0); graph[B[i] << 1 | 0] ~= (A[i] << 1 | 1); graph[B[i] << 1 | 1] ~= (A[i] << 1 | 0); } long[] bfs(int src) { DList!int que; auto dist = new long[N << 1]; dist[] = INF; dist[src] = 0; que ~= src; for (; !que.empty; ) { const u = que.front; que.removeFront; foreach (v; graph[u]) { if (chmin(dist[v], dist[u] + 1)) { que ~= v; } } } return dist; } const dS = bfs(S << 1 | 0); const dT = bfs(T << 1 | 0); if (dS[T << 1 | cast(int)(P & 1)] <= P) { int[] ans; foreach (u; 0 .. N) { bool ok; foreach (x; 0 .. 2) foreach (y; 0 .. 2) { if ((x ^ y) == (P & 1) && dS[u << 1 | x] + dT[u << 1 | y] <= P) { ok = true; } } if (ok) { ans ~= u; } } writeln(ans.length); foreach (u; ans) { writeln(u + 1); } } else { writeln(-1); } } } catch (EOFException e) { } }