結果
問題 | No.1898 Battle and Exchange |
ユーザー | Shirotsume |
提出日時 | 2022-03-20 01:24:00 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 4,071 ms / 5,000 ms |
コード長 | 1,736 bytes |
コンパイル時間 | 212 ms |
コンパイル使用メモリ | 82,348 KB |
実行使用メモリ | 203,240 KB |
最終ジャッジ日時 | 2024-04-15 15:48:42 |
合計ジャッジ時間 | 45,909 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
53,248 KB |
testcase_01 | AC | 42 ms
52,992 KB |
testcase_02 | AC | 44 ms
52,480 KB |
testcase_03 | AC | 45 ms
53,248 KB |
testcase_04 | AC | 68 ms
66,944 KB |
testcase_05 | AC | 71 ms
68,608 KB |
testcase_06 | AC | 117 ms
76,556 KB |
testcase_07 | AC | 107 ms
76,608 KB |
testcase_08 | AC | 82 ms
72,704 KB |
testcase_09 | AC | 193 ms
78,976 KB |
testcase_10 | AC | 44 ms
53,620 KB |
testcase_11 | AC | 60 ms
64,384 KB |
testcase_12 | AC | 92 ms
76,928 KB |
testcase_13 | AC | 42 ms
52,480 KB |
testcase_14 | AC | 97 ms
76,544 KB |
testcase_15 | AC | 45 ms
54,548 KB |
testcase_16 | AC | 96 ms
76,092 KB |
testcase_17 | AC | 208 ms
79,232 KB |
testcase_18 | AC | 475 ms
88,176 KB |
testcase_19 | AC | 662 ms
92,800 KB |
testcase_20 | AC | 483 ms
94,492 KB |
testcase_21 | AC | 1,371 ms
115,080 KB |
testcase_22 | AC | 53 ms
61,512 KB |
testcase_23 | AC | 72 ms
69,328 KB |
testcase_24 | AC | 74 ms
71,668 KB |
testcase_25 | AC | 108 ms
76,600 KB |
testcase_26 | AC | 53 ms
58,240 KB |
testcase_27 | AC | 107 ms
76,928 KB |
testcase_28 | AC | 122 ms
77,800 KB |
testcase_29 | AC | 137 ms
78,096 KB |
testcase_30 | AC | 113 ms
76,544 KB |
testcase_31 | AC | 58 ms
62,848 KB |
testcase_32 | AC | 487 ms
93,528 KB |
testcase_33 | AC | 1,039 ms
107,004 KB |
testcase_34 | AC | 472 ms
90,648 KB |
testcase_35 | AC | 567 ms
94,944 KB |
testcase_36 | AC | 511 ms
92,800 KB |
testcase_37 | AC | 350 ms
84,572 KB |
testcase_38 | AC | 4,071 ms
203,240 KB |
testcase_39 | AC | 1,362 ms
152,880 KB |
testcase_40 | AC | 3,287 ms
180,524 KB |
testcase_41 | AC | 1,283 ms
149,412 KB |
testcase_42 | AC | 216 ms
79,076 KB |
testcase_43 | AC | 718 ms
112,964 KB |
testcase_44 | AC | 79 ms
70,656 KB |
testcase_45 | AC | 343 ms
81,396 KB |
testcase_46 | AC | 817 ms
93,736 KB |
testcase_47 | AC | 255 ms
79,544 KB |
testcase_48 | AC | 282 ms
83,640 KB |
testcase_49 | AC | 148 ms
77,696 KB |
testcase_50 | AC | 140 ms
77,440 KB |
testcase_51 | AC | 136 ms
77,568 KB |
testcase_52 | AC | 132 ms
77,444 KB |
testcase_53 | AC | 309 ms
82,932 KB |
testcase_54 | AC | 262 ms
81,840 KB |
testcase_55 | AC | 453 ms
85,416 KB |
testcase_56 | AC | 308 ms
84,856 KB |
testcase_57 | AC | 3,040 ms
122,396 KB |
testcase_58 | AC | 1,849 ms
122,052 KB |
testcase_59 | AC | 1,714 ms
127,948 KB |
testcase_60 | AC | 2,930 ms
131,300 KB |
ソースコード
import heapq def solve(n, m, graph, abc): global ok 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: return False 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 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) ok = 0 abc = [list(map(int,input().split())) for _ in range(n)] for i in range(n): abc[i].sort(reverse = True) ok = max(ok , sum(abc[i])) a, b, c = solve(n, m, graph, abc) print(a, b, c)