結果
問題 | No.1014 competitive fighting |
ユーザー | maspy |
提出日時 | 2020-03-21 01:59:07 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 906 ms / 2,000 ms |
コード長 | 1,984 bytes |
コンパイル時間 | 494 ms |
コンパイル使用メモリ | 11,212 KB |
実行使用メモリ | 123,172 KB |
最終ジャッジ日時 | 2023-09-21 19:23:42 |
合計ジャッジ時間 | 33,202 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 474 ms
43,084 KB |
testcase_01 | AC | 197 ms
43,152 KB |
testcase_02 | AC | 201 ms
43,476 KB |
testcase_03 | AC | 200 ms
43,276 KB |
testcase_04 | AC | 205 ms
43,220 KB |
testcase_05 | AC | 700 ms
84,868 KB |
testcase_06 | AC | 682 ms
84,600 KB |
testcase_07 | AC | 682 ms
84,616 KB |
testcase_08 | AC | 635 ms
81,484 KB |
testcase_09 | AC | 664 ms
84,580 KB |
testcase_10 | AC | 452 ms
74,128 KB |
testcase_11 | AC | 799 ms
112,220 KB |
testcase_12 | AC | 691 ms
84,732 KB |
testcase_13 | AC | 378 ms
61,452 KB |
testcase_14 | AC | 366 ms
60,228 KB |
testcase_15 | AC | 424 ms
63,024 KB |
testcase_16 | AC | 217 ms
44,104 KB |
testcase_17 | AC | 278 ms
49,752 KB |
testcase_18 | AC | 585 ms
77,596 KB |
testcase_19 | AC | 669 ms
83,776 KB |
testcase_20 | AC | 338 ms
56,608 KB |
testcase_21 | AC | 546 ms
73,824 KB |
testcase_22 | AC | 462 ms
66,412 KB |
testcase_23 | AC | 287 ms
51,972 KB |
testcase_24 | AC | 297 ms
52,216 KB |
testcase_25 | AC | 219 ms
45,228 KB |
testcase_26 | AC | 543 ms
73,952 KB |
testcase_27 | AC | 266 ms
49,712 KB |
testcase_28 | AC | 282 ms
50,324 KB |
testcase_29 | AC | 201 ms
43,604 KB |
testcase_30 | AC | 607 ms
80,104 KB |
testcase_31 | AC | 554 ms
75,280 KB |
testcase_32 | AC | 201 ms
43,556 KB |
testcase_33 | AC | 231 ms
46,888 KB |
testcase_34 | AC | 731 ms
97,652 KB |
testcase_35 | AC | 852 ms
107,768 KB |
testcase_36 | AC | 677 ms
91,776 KB |
testcase_37 | AC | 212 ms
44,980 KB |
testcase_38 | AC | 618 ms
85,916 KB |
testcase_39 | AC | 399 ms
63,096 KB |
testcase_40 | AC | 621 ms
85,636 KB |
testcase_41 | AC | 493 ms
73,588 KB |
testcase_42 | AC | 906 ms
111,940 KB |
testcase_43 | AC | 231 ms
46,172 KB |
testcase_44 | AC | 835 ms
106,196 KB |
testcase_45 | AC | 538 ms
76,612 KB |
testcase_46 | AC | 253 ms
49,080 KB |
testcase_47 | AC | 393 ms
62,548 KB |
testcase_48 | AC | 653 ms
89,324 KB |
testcase_49 | AC | 227 ms
45,372 KB |
testcase_50 | AC | 880 ms
109,440 KB |
testcase_51 | AC | 571 ms
80,888 KB |
testcase_52 | AC | 224 ms
45,592 KB |
testcase_53 | AC | 682 ms
123,172 KB |
ソースコード
#!/usr/bin/ python3.8 import sys read = sys.stdin.buffer.read readline = sys.stdin.buffer.readline readlines = sys.stdin.buffer.readlines import numpy as np from scipy.sparse import csr_matrix from scipy.sparse.csgraph import connected_components N = int(readline()) ABC = np.array(read().split(), np.int64) A = ABC[::3] B = ABC[1::3] C = ABC[2::3] sort_key = (A << 32) + (B - C) ind = np.concatenate([np.argsort(sort_key), [N]]) nums = np.concatenate([[-10**10], A]) nums.sort() fr = [] to = [] cost = [] fr.append(ind[0:-2]) to.append(ind[1:-1]) fr.append([N]) to.append([ind[0]]) cost.append(np.zeros(N, np.int64)) fr.append(ind[np.searchsorted(nums, B - C, side='right') - 2]) to.append(np.arange(N)) cost.append(B) fr = np.concatenate(fr) to = np.concatenate(to) cost = np.concatenate(cost) G = csr_matrix((np.ones_like(fr), (fr, to)), (N + 1, N + 1)) n_comp, comp = connected_components(G, directed=True, connection='strong') comp = comp.tolist() INF = 10 ** 18 fr = fr.tolist() to = to.tolist() cost = cost.tolist() dp = [0] * (n_comp) G = [[] for _ in range(n_comp)] self_loop = [0] * n_comp in_deg = [0] * n_comp for v, w, c in zip(fr, to, cost): cv = comp[v] cw = comp[w] if cv == cw: if c == 0: continue if self_loop[cv]: self_loop[cv] = INF else: self_loop[cv] = c else: G[cv].append((cw, c)) in_deg[cw] += 1 deg_0 = [i for i, x in enumerate(in_deg) if not x] dp = [0] * (n_comp) while deg_0: v = deg_0.pop() dp[v] += self_loop[v] for w, c in G[v]: x = dp[v] + c if dp[w] < x: dp[w] = x in_deg[w] -= 1 if not in_deg[w]: deg_0.append(w) answer = [None] * N for v, w, c in zip(fr, to, cost): cv = comp[v] cw = comp[w] if c == 0: continue if cv == cw: x = dp[cv] else: x = dp[cv] + c answer[w] = str(x) if x < INF else 'BAN' print('\n'.join(map(str, answer)))