結果
問題 | No.1898 Battle and Exchange |
ユーザー | Shirotsume |
提出日時 | 2022-03-20 01:19:06 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 4,963 ms / 5,000 ms |
コード長 | 1,710 bytes |
コンパイル時間 | 233 ms |
コンパイル使用メモリ | 82,336 KB |
実行使用メモリ | 224,044 KB |
最終ジャッジ日時 | 2024-04-15 15:43:20 |
合計ジャッジ時間 | 50,033 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
53,248 KB |
testcase_01 | AC | 44 ms
52,824 KB |
testcase_02 | AC | 46 ms
53,248 KB |
testcase_03 | AC | 45 ms
53,376 KB |
testcase_04 | AC | 89 ms
71,552 KB |
testcase_05 | AC | 86 ms
70,016 KB |
testcase_06 | AC | 126 ms
76,544 KB |
testcase_07 | AC | 113 ms
76,584 KB |
testcase_08 | AC | 86 ms
74,240 KB |
testcase_09 | AC | 196 ms
78,580 KB |
testcase_10 | AC | 48 ms
53,376 KB |
testcase_11 | AC | 63 ms
64,384 KB |
testcase_12 | AC | 86 ms
74,240 KB |
testcase_13 | AC | 45 ms
53,120 KB |
testcase_14 | AC | 87 ms
74,752 KB |
testcase_15 | AC | 47 ms
53,120 KB |
testcase_16 | AC | 99 ms
76,168 KB |
testcase_17 | AC | 214 ms
78,776 KB |
testcase_18 | AC | 515 ms
89,156 KB |
testcase_19 | AC | 852 ms
94,592 KB |
testcase_20 | AC | 475 ms
95,380 KB |
testcase_21 | AC | 1,491 ms
113,968 KB |
testcase_22 | AC | 68 ms
64,640 KB |
testcase_23 | AC | 79 ms
67,712 KB |
testcase_24 | AC | 79 ms
70,528 KB |
testcase_25 | AC | 113 ms
76,516 KB |
testcase_26 | AC | 48 ms
53,632 KB |
testcase_27 | AC | 124 ms
77,196 KB |
testcase_28 | AC | 122 ms
77,568 KB |
testcase_29 | AC | 144 ms
78,024 KB |
testcase_30 | AC | 129 ms
76,652 KB |
testcase_31 | AC | 65 ms
62,464 KB |
testcase_32 | AC | 550 ms
91,920 KB |
testcase_33 | AC | 992 ms
105,344 KB |
testcase_34 | AC | 437 ms
88,240 KB |
testcase_35 | AC | 644 ms
96,076 KB |
testcase_36 | AC | 537 ms
95,232 KB |
testcase_37 | AC | 366 ms
85,108 KB |
testcase_38 | AC | 4,963 ms
224,044 KB |
testcase_39 | AC | 1,493 ms
160,084 KB |
testcase_40 | AC | 3,353 ms
188,280 KB |
testcase_41 | AC | 1,311 ms
153,004 KB |
testcase_42 | AC | 230 ms
79,292 KB |
testcase_43 | AC | 761 ms
115,316 KB |
testcase_44 | AC | 65 ms
66,304 KB |
testcase_45 | AC | 322 ms
81,144 KB |
testcase_46 | AC | 797 ms
93,992 KB |
testcase_47 | AC | 243 ms
79,640 KB |
testcase_48 | AC | 255 ms
81,668 KB |
testcase_49 | AC | 153 ms
77,764 KB |
testcase_50 | AC | 153 ms
77,204 KB |
testcase_51 | AC | 142 ms
77,396 KB |
testcase_52 | AC | 143 ms
77,400 KB |
testcase_53 | AC | 270 ms
81,688 KB |
testcase_54 | AC | 271 ms
81,608 KB |
testcase_55 | AC | 531 ms
85,624 KB |
testcase_56 | AC | 342 ms
84,520 KB |
testcase_57 | AC | 3,494 ms
127,284 KB |
testcase_58 | AC | 2,387 ms
125,864 KB |
testcase_59 | AC | 2,125 ms
127,988 KB |
testcase_60 | AC | 2,145 ms
127,684 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 return False ok = 3 * 10 ** 8 ng = 3 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)