結果
問題 | No.1898 Battle and Exchange |
ユーザー | Shirotsume |
提出日時 | 2021-12-25 20:53:28 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 4,596 ms / 5,000 ms |
コード長 | 1,720 bytes |
コンパイル時間 | 164 ms |
コンパイル使用メモリ | 82,324 KB |
実行使用メモリ | 225,320 KB |
最終ジャッジ日時 | 2024-04-15 14:06:06 |
合計ジャッジ時間 | 57,850 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
53,248 KB |
testcase_01 | AC | 46 ms
53,632 KB |
testcase_02 | AC | 42 ms
53,504 KB |
testcase_03 | AC | 42 ms
53,376 KB |
testcase_04 | AC | 101 ms
76,544 KB |
testcase_05 | AC | 105 ms
76,544 KB |
testcase_06 | AC | 120 ms
76,848 KB |
testcase_07 | AC | 115 ms
76,800 KB |
testcase_08 | AC | 97 ms
76,592 KB |
testcase_09 | AC | 225 ms
78,848 KB |
testcase_10 | AC | 42 ms
53,632 KB |
testcase_11 | AC | 63 ms
63,232 KB |
testcase_12 | AC | 101 ms
77,112 KB |
testcase_13 | AC | 42 ms
52,736 KB |
testcase_14 | AC | 104 ms
76,800 KB |
testcase_15 | AC | 44 ms
53,376 KB |
testcase_16 | AC | 92 ms
76,288 KB |
testcase_17 | AC | 270 ms
79,528 KB |
testcase_18 | AC | 840 ms
89,404 KB |
testcase_19 | AC | 1,272 ms
94,404 KB |
testcase_20 | AC | 1,243 ms
94,968 KB |
testcase_21 | AC | 2,162 ms
115,164 KB |
testcase_22 | AC | 58 ms
64,384 KB |
testcase_23 | AC | 85 ms
74,880 KB |
testcase_24 | AC | 89 ms
75,008 KB |
testcase_25 | AC | 108 ms
76,676 KB |
testcase_26 | AC | 47 ms
58,752 KB |
testcase_27 | AC | 116 ms
77,312 KB |
testcase_28 | AC | 120 ms
77,440 KB |
testcase_29 | AC | 141 ms
78,020 KB |
testcase_30 | AC | 113 ms
76,864 KB |
testcase_31 | AC | 66 ms
67,200 KB |
testcase_32 | AC | 495 ms
91,952 KB |
testcase_33 | AC | 949 ms
105,332 KB |
testcase_34 | AC | 391 ms
88,280 KB |
testcase_35 | AC | 601 ms
96,512 KB |
testcase_36 | AC | 581 ms
94,168 KB |
testcase_37 | AC | 389 ms
85,320 KB |
testcase_38 | AC | 4,596 ms
225,320 KB |
testcase_39 | AC | 2,922 ms
167,864 KB |
testcase_40 | AC | 3,213 ms
190,068 KB |
testcase_41 | AC | 2,483 ms
159,272 KB |
testcase_42 | AC | 237 ms
79,800 KB |
testcase_43 | AC | 1,993 ms
118,128 KB |
testcase_44 | AC | 62 ms
65,840 KB |
testcase_45 | AC | 334 ms
80,856 KB |
testcase_46 | AC | 843 ms
93,768 KB |
testcase_47 | AC | 243 ms
79,512 KB |
testcase_48 | AC | 388 ms
83,632 KB |
testcase_49 | AC | 147 ms
77,824 KB |
testcase_50 | AC | 131 ms
77,628 KB |
testcase_51 | AC | 138 ms
77,344 KB |
testcase_52 | AC | 136 ms
77,348 KB |
testcase_53 | AC | 304 ms
81,944 KB |
testcase_54 | AC | 259 ms
81,548 KB |
testcase_55 | AC | 479 ms
85,652 KB |
testcase_56 | AC | 418 ms
85,944 KB |
testcase_57 | AC | 3,638 ms
128,260 KB |
testcase_58 | AC | 3,185 ms
125,620 KB |
testcase_59 | AC | 3,747 ms
129,772 KB |
testcase_60 | AC | 2,955 ms
126,608 KB |
ソースコード
import heapq def solve(n, m, graph, abc): for i in range(n): abc[i].sort(reverse = True) def check(x): first = True #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 first: first = False myabc[2] = abc[0][1] else: continue if now != 0: myabc.sort(reverse=True) 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)