結果
問題 | No.1898 Battle and Exchange |
ユーザー | Shirotsume |
提出日時 | 2022-03-09 11:31:17 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 4,922 ms / 5,000 ms |
コード長 | 1,762 bytes |
コンパイル時間 | 229 ms |
コンパイル使用メモリ | 82,600 KB |
実行使用メモリ | 224,680 KB |
最終ジャッジ日時 | 2024-04-15 14:09:51 |
合計ジャッジ時間 | 60,113 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
55,364 KB |
testcase_01 | AC | 44 ms
53,984 KB |
testcase_02 | AC | 44 ms
53,752 KB |
testcase_03 | AC | 43 ms
53,792 KB |
testcase_04 | AC | 103 ms
76,044 KB |
testcase_05 | AC | 104 ms
76,652 KB |
testcase_06 | AC | 121 ms
76,584 KB |
testcase_07 | AC | 114 ms
76,600 KB |
testcase_08 | AC | 99 ms
76,404 KB |
testcase_09 | AC | 222 ms
78,868 KB |
testcase_10 | AC | 44 ms
54,220 KB |
testcase_11 | AC | 58 ms
65,060 KB |
testcase_12 | AC | 100 ms
76,936 KB |
testcase_13 | AC | 43 ms
54,144 KB |
testcase_14 | AC | 105 ms
76,540 KB |
testcase_15 | AC | 44 ms
53,564 KB |
testcase_16 | AC | 93 ms
76,192 KB |
testcase_17 | AC | 272 ms
79,528 KB |
testcase_18 | AC | 875 ms
89,400 KB |
testcase_19 | AC | 1,338 ms
94,708 KB |
testcase_20 | AC | 1,304 ms
94,448 KB |
testcase_21 | AC | 2,355 ms
115,264 KB |
testcase_22 | AC | 59 ms
63,936 KB |
testcase_23 | AC | 85 ms
74,512 KB |
testcase_24 | AC | 85 ms
74,568 KB |
testcase_25 | AC | 110 ms
76,608 KB |
testcase_26 | AC | 49 ms
60,656 KB |
testcase_27 | AC | 117 ms
77,144 KB |
testcase_28 | AC | 119 ms
77,460 KB |
testcase_29 | AC | 142 ms
78,012 KB |
testcase_30 | AC | 115 ms
77,048 KB |
testcase_31 | AC | 67 ms
67,788 KB |
testcase_32 | AC | 518 ms
91,900 KB |
testcase_33 | AC | 1,008 ms
104,952 KB |
testcase_34 | AC | 404 ms
88,632 KB |
testcase_35 | AC | 628 ms
96,404 KB |
testcase_36 | AC | 592 ms
94,228 KB |
testcase_37 | AC | 389 ms
84,852 KB |
testcase_38 | AC | 4,922 ms
224,680 KB |
testcase_39 | AC | 3,053 ms
168,120 KB |
testcase_40 | AC | 3,449 ms
190,396 KB |
testcase_41 | AC | 2,574 ms
160,264 KB |
testcase_42 | AC | 226 ms
79,548 KB |
testcase_43 | AC | 2,089 ms
117,616 KB |
testcase_44 | AC | 61 ms
65,888 KB |
testcase_45 | AC | 317 ms
80,852 KB |
testcase_46 | AC | 839 ms
93,632 KB |
testcase_47 | AC | 232 ms
79,384 KB |
testcase_48 | AC | 357 ms
84,256 KB |
testcase_49 | AC | 143 ms
77,796 KB |
testcase_50 | AC | 132 ms
77,124 KB |
testcase_51 | AC | 136 ms
77,384 KB |
testcase_52 | AC | 137 ms
77,436 KB |
testcase_53 | AC | 295 ms
82,072 KB |
testcase_54 | AC | 252 ms
81,772 KB |
testcase_55 | AC | 444 ms
85,484 KB |
testcase_56 | AC | 419 ms
85,476 KB |
testcase_57 | AC | 3,831 ms
128,004 KB |
testcase_58 | AC | 3,396 ms
125,748 KB |
testcase_59 | AC | 3,995 ms
128,580 KB |
testcase_60 | AC | 3,148 ms
126,408 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 else: pass 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]) else: pass 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)