結果
問題 | No.1898 Battle and Exchange |
ユーザー | tamato |
提出日時 | 2022-04-08 23:37:06 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 3,062 ms / 5,000 ms |
コード長 | 2,249 bytes |
コンパイル時間 | 341 ms |
コンパイル使用メモリ | 87,220 KB |
実行使用メモリ | 192,908 KB |
最終ジャッジ日時 | 2023-08-19 02:10:22 |
合計ジャッジ時間 | 36,033 ms |
ジャッジサーバーID (参考情報) |
judge9 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 68 ms
71,248 KB |
testcase_01 | AC | 67 ms
71,364 KB |
testcase_02 | AC | 67 ms
71,600 KB |
testcase_03 | AC | 67 ms
71,216 KB |
testcase_04 | AC | 77 ms
76,196 KB |
testcase_05 | AC | 76 ms
76,372 KB |
testcase_06 | AC | 114 ms
78,228 KB |
testcase_07 | AC | 109 ms
77,824 KB |
testcase_08 | AC | 100 ms
77,860 KB |
testcase_09 | AC | 146 ms
79,784 KB |
testcase_10 | AC | 66 ms
71,220 KB |
testcase_11 | AC | 80 ms
76,840 KB |
testcase_12 | AC | 79 ms
76,508 KB |
testcase_13 | AC | 66 ms
71,440 KB |
testcase_14 | AC | 80 ms
76,672 KB |
testcase_15 | AC | 64 ms
71,460 KB |
testcase_16 | AC | 91 ms
77,524 KB |
testcase_17 | AC | 164 ms
80,104 KB |
testcase_18 | AC | 282 ms
86,392 KB |
testcase_19 | AC | 473 ms
90,704 KB |
testcase_20 | AC | 293 ms
91,484 KB |
testcase_21 | AC | 859 ms
105,652 KB |
testcase_22 | AC | 76 ms
76,420 KB |
testcase_23 | AC | 78 ms
76,092 KB |
testcase_24 | AC | 84 ms
77,136 KB |
testcase_25 | AC | 106 ms
78,024 KB |
testcase_26 | AC | 67 ms
71,288 KB |
testcase_27 | AC | 109 ms
78,028 KB |
testcase_28 | AC | 115 ms
78,424 KB |
testcase_29 | AC | 123 ms
79,072 KB |
testcase_30 | AC | 107 ms
77,924 KB |
testcase_31 | AC | 73 ms
76,016 KB |
testcase_32 | AC | 319 ms
88,848 KB |
testcase_33 | AC | 565 ms
98,264 KB |
testcase_34 | AC | 243 ms
87,032 KB |
testcase_35 | AC | 355 ms
91,968 KB |
testcase_36 | AC | 341 ms
91,076 KB |
testcase_37 | AC | 232 ms
85,332 KB |
testcase_38 | AC | 3,062 ms
192,908 KB |
testcase_39 | AC | 580 ms
144,524 KB |
testcase_40 | AC | 2,137 ms
159,592 KB |
testcase_41 | AC | 473 ms
136,508 KB |
testcase_42 | AC | 167 ms
79,236 KB |
testcase_43 | AC | 446 ms
105,428 KB |
testcase_44 | AC | 74 ms
75,884 KB |
testcase_45 | AC | 228 ms
81,544 KB |
testcase_46 | AC | 546 ms
90,132 KB |
testcase_47 | AC | 178 ms
80,428 KB |
testcase_48 | AC | 162 ms
82,120 KB |
testcase_49 | AC | 126 ms
79,120 KB |
testcase_50 | AC | 122 ms
79,068 KB |
testcase_51 | AC | 129 ms
78,936 KB |
testcase_52 | AC | 109 ms
78,552 KB |
testcase_53 | AC | 171 ms
81,636 KB |
testcase_54 | AC | 220 ms
82,012 KB |
testcase_55 | AC | 285 ms
84,664 KB |
testcase_56 | AC | 194 ms
83,848 KB |
testcase_57 | AC | 2,337 ms
113,952 KB |
testcase_58 | AC | 1,498 ms
112,336 KB |
testcase_59 | AC | 1,397 ms
114,748 KB |
testcase_60 | AC | 1,427 ms
111,840 KB |
ソースコード
mod = 998244353 def main(): import sys from heapq import heappop, heappush input = sys.stdin.readline def trade(X, Y): Z = sorted(X + Y, reverse=True) return Z[:3] N, M = map(int, input().split()) adj = [[] for _ in range(N + 1)] for _ in range(M): a, b = map(int, input().split()) adj[a].append(b) adj[b].append(a) ABC = [[0, 0, 0]] * (N + 1) for v in range(1, N+1): ABC[v] = list(map(int, input().split())) ABC_sum = [sum(abc) for abc in ABC] ans = 3 * 10 ** 8 ans_k = -1 for k in range(1): ok = 3 * 10 ** 8 ng = 1 mid = (ok + ng) // 2 while ok - ng > 1: X = [1] * 3 X[k] = mid X_ori = X[:] # 頂点1で勝てるかどうか if sum(X) <= sum(ABC[1]): ng = mid mid = (ok + ng) // 2 continue else: ma_1 = max(ABC[1]) X[1] = max(X[1], ma_1) S = sum(X) flg = 0 for u in adj[1]: if S > ABC_sum[u]: flg = 1 break if not flg: ng = mid mid = (ok + ng) // 2 continue X = trade(X_ori, ABC[1]) seen = [0] * (N + 1) pq = [(0, 1)] seen[1] = 1 flg = 1 while pq: s, v = heappop(pq) if s >= sum(X): flg = 0 break else: if v == N: break if v != 1: X = trade(X, ABC[v]) for u in adj[v]: if not seen[u]: heappush(pq, (ABC_sum[u], u)) seen[u] = 1 if flg: ok = mid else: ng = mid mid = (ok + ng) // 2 if ok + 2 < ans: ans = ok ans_k = k ANS = [1] * 3 ANS[ans_k] = ans print(*ANS) if __name__ == '__main__': main()