結果
問題 | No.1898 Battle and Exchange |
ユーザー | polylogK |
提出日時 | 2021-12-23 17:45:22 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,665 bytes |
コンパイル時間 | 209 ms |
コンパイル使用メモリ | 81,856 KB |
実行使用メモリ | 222,596 KB |
最終ジャッジ日時 | 2023-10-22 04:28:44 |
合計ジャッジ時間 | 39,132 ms |
ジャッジサーバーID (参考情報) |
judge9 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 39 ms
53,676 KB |
testcase_01 | AC | 37 ms
53,676 KB |
testcase_02 | AC | 37 ms
53,676 KB |
testcase_03 | WA | - |
testcase_04 | AC | 59 ms
65,740 KB |
testcase_05 | AC | 59 ms
68,388 KB |
testcase_06 | AC | 106 ms
76,192 KB |
testcase_07 | WA | - |
testcase_08 | AC | 74 ms
73,668 KB |
testcase_09 | AC | 171 ms
78,276 KB |
testcase_10 | AC | 36 ms
53,676 KB |
testcase_11 | AC | 50 ms
64,352 KB |
testcase_12 | AC | 70 ms
73,596 KB |
testcase_13 | AC | 37 ms
53,676 KB |
testcase_14 | AC | 70 ms
74,476 KB |
testcase_15 | AC | 36 ms
53,676 KB |
testcase_16 | AC | 73 ms
74,256 KB |
testcase_17 | AC | 181 ms
78,596 KB |
testcase_18 | AC | 377 ms
88,752 KB |
testcase_19 | AC | 631 ms
94,088 KB |
testcase_20 | AC | 396 ms
93,564 KB |
testcase_21 | AC | 1,077 ms
114,508 KB |
testcase_22 | AC | 49 ms
64,356 KB |
testcase_23 | AC | 57 ms
67,784 KB |
testcase_24 | AC | 69 ms
73,312 KB |
testcase_25 | AC | 94 ms
76,580 KB |
testcase_26 | AC | 38 ms
53,676 KB |
testcase_27 | AC | 101 ms
77,216 KB |
testcase_28 | AC | 105 ms
77,220 KB |
testcase_29 | AC | 123 ms
77,912 KB |
testcase_30 | AC | 95 ms
76,604 KB |
testcase_31 | AC | 49 ms
63,324 KB |
testcase_32 | AC | 391 ms
91,764 KB |
testcase_33 | AC | 849 ms
104,828 KB |
testcase_34 | AC | 332 ms
88,152 KB |
testcase_35 | AC | 508 ms
96,096 KB |
testcase_36 | WA | - |
testcase_37 | AC | 281 ms
84,972 KB |
testcase_38 | AC | 3,661 ms
222,596 KB |
testcase_39 | AC | 1,205 ms
161,828 KB |
testcase_40 | AC | 2,572 ms
186,788 KB |
testcase_41 | AC | 1,164 ms
152,512 KB |
testcase_42 | AC | 181 ms
79,144 KB |
testcase_43 | AC | 601 ms
114,944 KB |
testcase_44 | AC | 61 ms
68,752 KB |
testcase_45 | AC | 250 ms
80,896 KB |
testcase_46 | AC | 639 ms
93,408 KB |
testcase_47 | AC | 195 ms
79,212 KB |
testcase_48 | AC | 207 ms
82,544 KB |
testcase_49 | AC | 131 ms
77,220 KB |
testcase_50 | AC | 129 ms
77,168 KB |
testcase_51 | AC | 117 ms
77,168 KB |
testcase_52 | AC | 118 ms
77,164 KB |
testcase_53 | AC | 216 ms
81,476 KB |
testcase_54 | AC | 217 ms
81,520 KB |
testcase_55 | AC | 357 ms
85,204 KB |
testcase_56 | AC | 264 ms
84,164 KB |
testcase_57 | AC | 2,862 ms
127,764 KB |
testcase_58 | AC | 1,862 ms
125,420 KB |
testcase_59 | AC | 1,801 ms
128,424 KB |
testcase_60 | AC | 1,748 ms
126,080 KB |
ソースコード
import heapq def solve(n, m, graph, abc): for i in range(n): abc[i].sort(reverse=True) def check(x): # A = x, B = 1, C = 1で突破できる? myabc = [x, 1, 1] q = [] good = [False] * n visit = [False] * n if sum(abc[0]) >= sum(myabc): return False myabc[1] = abc[0][0] good[0] = True visit[0] = True for to in graph[0]: visit[to] = True heapq.heappush(q, (sum(abc[to]), to)) while q: nowsum, now = heapq.heappop(q) if nowsum < sum(myabc): good[now] = True if now == n - 1: return True else: return False myabc.sort(reverse=True) myabc[1] = max(myabc[1], abc[0][1]) myabc[2] = max(myabc[2], abc[0][0]) myabc[1] = max(myabc[1], abc[now][1]) myabc[2] = max(myabc[2], abc[now][0]) for to in graph[now]: if not visit[to]: visit[to] = True heapq.heappush(q, (sum(abc[to]), to)) return good[n - 1] ok, ng = 3 * 10 ** 8, 1 while abs(ok - ng) > 1: mid = (ok + ng) // 2 if check(mid): ok = mid else: ng = mid return ok, 1, 1 n, m = map(int, input().split()) graph = [[] for _ in range(n)] for _ in range(m): u, v = map(int, input().split()) u -= 1 v -= 1 graph[u].append(v) graph[v].append(u) abc = [list(map(int, input().split())) for _ in range(n)] a, b, c = solve(n, m, graph, abc) print(a, b, c)