結果
問題 | No.2735 Demarcation |
ユーザー | kusirakusira |
提出日時 | 2024-04-09 23:15:48 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,453 bytes |
コンパイル時間 | 169 ms |
コンパイル使用メモリ | 82,288 KB |
実行使用メモリ | 262,336 KB |
最終ジャッジ日時 | 2024-04-19 19:38:59 |
合計ジャッジ時間 | 9,647 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 35 ms
53,480 KB |
testcase_01 | AC | 34 ms
54,192 KB |
testcase_02 | AC | 34 ms
53,412 KB |
testcase_03 | AC | 34 ms
53,076 KB |
testcase_04 | AC | 260 ms
212,228 KB |
testcase_05 | AC | 177 ms
89,636 KB |
testcase_06 | AC | 291 ms
201,960 KB |
testcase_07 | AC | 495 ms
236,964 KB |
testcase_08 | WA | - |
testcase_09 | AC | 240 ms
128,572 KB |
testcase_10 | AC | 272 ms
165,856 KB |
testcase_11 | AC | 130 ms
109,636 KB |
testcase_12 | AC | 154 ms
84,860 KB |
testcase_13 | AC | 245 ms
95,572 KB |
testcase_14 | AC | 476 ms
204,704 KB |
testcase_15 | AC | 303 ms
89,500 KB |
testcase_16 | AC | 306 ms
202,584 KB |
testcase_17 | AC | 378 ms
154,628 KB |
testcase_18 | AC | 223 ms
109,624 KB |
testcase_19 | AC | 432 ms
236,276 KB |
testcase_20 | AC | 504 ms
227,148 KB |
testcase_21 | AC | 284 ms
197,792 KB |
testcase_22 | AC | 259 ms
242,768 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 232 ms
190,548 KB |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
ソースコード
N = int(input()) X = list(map(int, input().split())) for i in range(N): X[i] -= 1 diff_sum = [0 for _ in range(N)] for i in range(N - 1): if X[i] != X[i + 1]: diff_sum[i + 1] = diff_sum[i] else: diff_sum[i + 1] = diff_sum[i] + 1 kinds = [0 for _ in range(N)] Q = int(input()) for _ in range(Q): l, r, S = map(int, input().split()) l -= 1 r -= 1 if r - l >= 90: diffs = diff_sum[r] - diff_sum[l] if diffs >= 60: print(0) else: if S >= (1 << diffs): print(1 << diffs) else: print(0) else: vec = [0 for _ in range(r - l + 1)] for j in range(l, r + 1): vec[j - l] = X[j] len_vec = len(vec) ans = [0 for _ in range(len_vec + 2)] ok = 0 ng = len_vec + 2 while ng - ok > 1: mid = (ok + ng) // 2 prev_idx = [-1 for _ in range(len_vec + 1)] now_kind = 0 left = 0 right = 0 while True: if now_kind <= mid: if right == len_vec: prev_idx[right] = left break else: prev_idx[right] = left if kinds[vec[right]] == 0: now_kind += 1 kinds[vec[right]] += 1 right += 1 else: kinds[vec[left]] -= 1 if kinds[vec[left]] == 0: now_kind -= 1 left += 1 dp = [0 for _ in range(len_vec + 1)] dp_sum = [0 for _ in range(len_vec + 1)] dp[0] = 1 dp_sum[0] = 1 infin = False for j in range(1, len_vec + 1): sum_val = dp_sum[j - 1] if prev_idx[j] > 0: sum_val -= dp_sum[prev_idx[j] - 1] if sum_val > S: infin = True break dp[j] = sum_val dp_sum[j] = dp[j] + dp_sum[j - 1] if infin: ng = mid else: ok = mid ans[mid] = dp[len_vec] for j in range(len_vec): kinds[vec[j]] = 0 if ok >= len_vec: print(-1) else: print(ok)