結果
問題 | No.1898 Battle and Exchange |
ユーザー | polylogK |
提出日時 | 2021-12-25 20:06:45 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,806 bytes |
コンパイル時間 | 149 ms |
コンパイル使用メモリ | 81,644 KB |
実行使用メモリ | 105,488 KB |
最終ジャッジ日時 | 2023-10-22 04:39:00 |
合計ジャッジ時間 | 20,695 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 39 ms
53,428 KB |
testcase_01 | AC | 39 ms
53,428 KB |
testcase_02 | AC | 39 ms
53,428 KB |
testcase_03 | AC | 36 ms
53,428 KB |
testcase_04 | AC | 43 ms
57,524 KB |
testcase_05 | AC | 49 ms
57,524 KB |
testcase_06 | AC | 61 ms
65,432 KB |
testcase_07 | AC | 54 ms
65,080 KB |
testcase_08 | WA | - |
testcase_09 | AC | 134 ms
78,132 KB |
testcase_10 | WA | - |
testcase_11 | AC | 39 ms
55,476 KB |
testcase_12 | AC | 61 ms
70,684 KB |
testcase_13 | AC | 37 ms
53,428 KB |
testcase_14 | AC | 60 ms
70,684 KB |
testcase_15 | AC | 37 ms
53,428 KB |
testcase_16 | AC | 52 ms
63,452 KB |
testcase_17 | AC | 145 ms
78,472 KB |
testcase_18 | AC | 197 ms
82,436 KB |
testcase_19 | AC | 231 ms
84,640 KB |
testcase_20 | AC | 218 ms
85,192 KB |
testcase_21 | AC | 421 ms
97,660 KB |
testcase_22 | AC | 40 ms
53,428 KB |
testcase_23 | AC | 51 ms
63,032 KB |
testcase_24 | AC | 47 ms
63,032 KB |
testcase_25 | AC | 68 ms
74,148 KB |
testcase_26 | AC | 35 ms
53,428 KB |
testcase_27 | AC | 73 ms
75,976 KB |
testcase_28 | AC | 76 ms
75,988 KB |
testcase_29 | AC | 86 ms
75,992 KB |
testcase_30 | AC | 66 ms
70,700 KB |
testcase_31 | AC | 44 ms
55,476 KB |
testcase_32 | AC | 184 ms
83,876 KB |
testcase_33 | AC | 253 ms
89,860 KB |
testcase_34 | AC | 171 ms
82,788 KB |
testcase_35 | AC | 213 ms
86,284 KB |
testcase_36 | AC | 198 ms
85,080 KB |
testcase_37 | AC | 173 ms
80,428 KB |
testcase_38 | AC | 577 ms
105,488 KB |
testcase_39 | AC | 368 ms
99,568 KB |
testcase_40 | AC | 518 ms
101,444 KB |
testcase_41 | AC | 341 ms
96,876 KB |
testcase_42 | AC | 151 ms
78,828 KB |
testcase_43 | AC | 290 ms
93,092 KB |
testcase_44 | AC | 39 ms
55,476 KB |
testcase_45 | AC | 168 ms
79,112 KB |
testcase_46 | AC | 250 ms
84,636 KB |
testcase_47 | AC | 153 ms
78,520 KB |
testcase_48 | AC | 157 ms
79,640 KB |
testcase_49 | AC | 84 ms
76,248 KB |
testcase_50 | AC | 87 ms
75,980 KB |
testcase_51 | AC | 90 ms
75,988 KB |
testcase_52 | AC | 78 ms
75,992 KB |
testcase_53 | AC | 178 ms
80,192 KB |
testcase_54 | AC | 178 ms
81,224 KB |
testcase_55 | AC | 204 ms
81,224 KB |
testcase_56 | AC | 201 ms
82,188 KB |
testcase_57 | AC | 517 ms
99,676 KB |
testcase_58 | AC | 459 ms
99,508 KB |
testcase_59 | AC | 433 ms
99,620 KB |
testcase_60 | AC | 461 ms
99,308 KB |
ソースコード
import heapq def solve(n, m, graph, abc): for i in range(n): abc[i].sort(reverse=True) ans = sum(abc[0]) - 1 myabc = [ans, 1, 1] myabc[1] = abc[0][0] v = graph[0][0] for to in graph[0]: if sum(abc[to]) < sum(abc[v]): v = to if sum(abc[v]) >= sum(myabc): ans += sum(abc[to]) - sum(myabc) + 1 myabc = [ans, 1, 1] q, visit = [], [False] * n heapq.heappush(q, (sum(abc[0]), 0)) visit[0] = True def update(myabc, x): myabc.append(x) myabc.sort(reverse=True) return myabc[:3] while q: nowsum, now = heapq.heappop(q) if nowsum >= sum(myabc): diff = nowsum - sum(myabc) + 1 if myabc[0] == ans: ans += diff myabc[0] += diff elif myabc[1] == ans: ans += diff myabc[1] += diff elif myabc[2] == ans: ans += diff myabc[2] += diff else: ans = myabc[2] + diff myabc[2] += diff if now == n - 1: return ans, 1, 1 myabc = update(myabc, abc[now][0]) myabc = update(myabc, abc[now][1]) myabc = update(myabc, abc[now][2]) for to in graph[now]: if visit[to]: continue heapq.heappush(q, (sum(abc[to]), to)) visit[to] = True if __name__ == '__main__': 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)