結果
問題 | No.1898 Battle and Exchange |
ユーザー | Shirotsume |
提出日時 | 2021-12-23 16:49:59 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,696 bytes |
コンパイル時間 | 250 ms |
コンパイル使用メモリ | 81,840 KB |
実行使用メモリ | 225,072 KB |
最終ジャッジ日時 | 2023-10-22 04:27:59 |
合計ジャッジ時間 | 61,076 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
53,364 KB |
testcase_01 | AC | 41 ms
53,364 KB |
testcase_02 | AC | 41 ms
53,364 KB |
testcase_03 | WA | - |
testcase_04 | AC | 102 ms
75,912 KB |
testcase_05 | AC | 106 ms
75,904 KB |
testcase_06 | AC | 121 ms
76,320 KB |
testcase_07 | WA | - |
testcase_08 | AC | 98 ms
76,184 KB |
testcase_09 | AC | 221 ms
78,324 KB |
testcase_10 | AC | 42 ms
53,364 KB |
testcase_11 | AC | 57 ms
64,064 KB |
testcase_12 | AC | 101 ms
76,280 KB |
testcase_13 | AC | 41 ms
53,364 KB |
testcase_14 | AC | 107 ms
76,232 KB |
testcase_15 | AC | 41 ms
53,364 KB |
testcase_16 | AC | 94 ms
75,784 KB |
testcase_17 | AC | 273 ms
78,820 KB |
testcase_18 | AC | 820 ms
88,628 KB |
testcase_19 | AC | 1,260 ms
93,972 KB |
testcase_20 | AC | 1,243 ms
94,264 KB |
testcase_21 | AC | 2,185 ms
114,472 KB |
testcase_22 | AC | 56 ms
64,076 KB |
testcase_23 | AC | 84 ms
74,140 KB |
testcase_24 | AC | 89 ms
75,672 KB |
testcase_25 | AC | 110 ms
76,356 KB |
testcase_26 | AC | 45 ms
58,808 KB |
testcase_27 | AC | 118 ms
76,960 KB |
testcase_28 | AC | 119 ms
76,976 KB |
testcase_29 | AC | 143 ms
77,748 KB |
testcase_30 | AC | 118 ms
76,428 KB |
testcase_31 | AC | 66 ms
68,252 KB |
testcase_32 | AC | 514 ms
91,532 KB |
testcase_33 | AC | 971 ms
104,608 KB |
testcase_34 | AC | 392 ms
87,928 KB |
testcase_35 | AC | 617 ms
95,880 KB |
testcase_36 | WA | - |
testcase_37 | AC | 389 ms
84,384 KB |
testcase_38 | AC | 4,707 ms
225,072 KB |
testcase_39 | AC | 2,912 ms
167,064 KB |
testcase_40 | AC | 3,345 ms
189,436 KB |
testcase_41 | AC | 2,547 ms
159,984 KB |
testcase_42 | AC | 242 ms
79,116 KB |
testcase_43 | AC | 2,086 ms
117,388 KB |
testcase_44 | AC | 63 ms
66,268 KB |
testcase_45 | AC | 329 ms
80,564 KB |
testcase_46 | AC | 845 ms
93,508 KB |
testcase_47 | AC | 243 ms
78,748 KB |
testcase_48 | AC | 370 ms
83,404 KB |
testcase_49 | AC | 149 ms
77,008 KB |
testcase_50 | AC | 133 ms
76,956 KB |
testcase_51 | AC | 143 ms
76,956 KB |
testcase_52 | AC | 137 ms
76,960 KB |
testcase_53 | AC | 303 ms
81,364 KB |
testcase_54 | AC | 258 ms
81,228 KB |
testcase_55 | AC | 502 ms
84,936 KB |
testcase_56 | AC | 409 ms
84,928 KB |
testcase_57 | AC | 3,782 ms
127,588 KB |
testcase_58 | AC | 3,476 ms
125,168 KB |
testcase_59 | AC | 4,072 ms
129,040 KB |
testcase_60 | AC | 3,121 ms
125,880 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 else: continue 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)) if good[n - 1]: return True else: return False ok = 3 * 10 ** 8 ng = 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)