結果
問題 | No.2375 watasou and hibit's baseball |
ユーザー | poyon |
提出日時 | 2023-06-27 18:44:06 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 725 ms / 2,000 ms |
コード長 | 1,624 bytes |
コンパイル時間 | 450 ms |
コンパイル使用メモリ | 87,068 KB |
実行使用メモリ | 121,340 KB |
最終ジャッジ日時 | 2023-09-22 17:33:59 |
合計ジャッジ時間 | 11,118 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 72 ms
71,240 KB |
testcase_01 | AC | 72 ms
71,296 KB |
testcase_02 | AC | 77 ms
71,044 KB |
testcase_03 | AC | 243 ms
96,896 KB |
testcase_04 | AC | 84 ms
76,112 KB |
testcase_05 | AC | 80 ms
76,212 KB |
testcase_06 | AC | 725 ms
121,340 KB |
testcase_07 | AC | 73 ms
71,236 KB |
testcase_08 | AC | 130 ms
83,312 KB |
testcase_09 | AC | 72 ms
71,180 KB |
testcase_10 | AC | 71 ms
71,240 KB |
testcase_11 | AC | 99 ms
78,460 KB |
testcase_12 | AC | 289 ms
120,676 KB |
testcase_13 | AC | 202 ms
96,860 KB |
testcase_14 | AC | 72 ms
71,124 KB |
testcase_15 | AC | 152 ms
81,476 KB |
testcase_16 | AC | 128 ms
79,280 KB |
testcase_17 | AC | 265 ms
120,524 KB |
testcase_18 | AC | 74 ms
71,292 KB |
testcase_19 | AC | 73 ms
71,004 KB |
testcase_20 | AC | 102 ms
78,708 KB |
testcase_21 | AC | 273 ms
120,712 KB |
testcase_22 | AC | 73 ms
70,884 KB |
testcase_23 | AC | 257 ms
120,508 KB |
testcase_24 | AC | 256 ms
120,520 KB |
testcase_25 | AC | 71 ms
71,216 KB |
testcase_26 | AC | 346 ms
120,984 KB |
testcase_27 | AC | 373 ms
121,208 KB |
testcase_28 | AC | 398 ms
121,172 KB |
testcase_29 | AC | 441 ms
120,996 KB |
testcase_30 | AC | 456 ms
120,996 KB |
testcase_31 | AC | 422 ms
121,128 KB |
testcase_32 | AC | 458 ms
120,980 KB |
testcase_33 | AC | 385 ms
120,980 KB |
testcase_34 | AC | 357 ms
121,056 KB |
testcase_35 | AC | 456 ms
121,236 KB |
testcase_36 | AC | 434 ms
121,324 KB |
testcase_37 | AC | 371 ms
120,928 KB |
testcase_38 | AC | 263 ms
120,976 KB |
ソースコード
import sys input = sys.stdin.readline def main(): N, A, B = map(int, input().split()) X, Y, K = [0] * N, [0] * N, [0] * N for i in range(N): X[i], Y[i], K[i] = map(int, input().split()) ok = [[[False] * N for _ in range(N)] for _ in range(N)] # a -> b -> c for a in range(N): for b in range(N): for c in range(N): if a == b or a == c or b == c: continue d = abs(X[c] - X[a]) + abs(Y[c] - Y[a]) + abs(X[c] - X[b]) + abs(Y[c] - Y[b]) v = abs(K[c] - K[b]) if d >= A or v >= B: ok[a][b][c] = True dp = [[[False] * N for _ in range(N)] for _ in range(1 << N)] # a -> b for a in range(N): for b in range(N): if a == b: continue d = abs(X[b] - X[a]) + abs(Y[b] - Y[a]) v = abs(K[b] - K[a]) if d >= A or v >= B: dp[(1 << a) + (1 << b)][a][b] = True for S in range(1, 1 << N): for a in range(N): if ((S >> a) & 1) == 0: continue for b in range(N): if ((S >> b) & 1) == 0: continue if not dp[S][a][b]: continue for c in range(N): if ((S >> c) & 1) == 1: continue if not ok[a][b][c]: continue dp[S + (1 << c)][b][c] = True ans = 1 for S in range(1, 1 << N): for a in range(N): for b in range(N): if dp[S][a][b]: ans = max(ans, bin(S).count("1")) print(ans) if __name__ == "__main__": main()