結果
問題 | No.2735 Demarcation |
ユーザー | AngrySadEight |
提出日時 | 2024-04-10 17:22:56 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 492 ms / 1,500 ms |
コード長 | 2,330 bytes |
コンパイル時間 | 240 ms |
コンパイル使用メモリ | 82,536 KB |
実行使用メモリ | 261,492 KB |
最終ジャッジ日時 | 2024-04-19 19:41:42 |
合計ジャッジ時間 | 9,311 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 32 ms
53,348 KB |
testcase_01 | AC | 32 ms
53,860 KB |
testcase_02 | AC | 33 ms
53,336 KB |
testcase_03 | AC | 33 ms
53,412 KB |
testcase_04 | AC | 238 ms
211,940 KB |
testcase_05 | AC | 170 ms
89,472 KB |
testcase_06 | AC | 277 ms
202,468 KB |
testcase_07 | AC | 466 ms
236,136 KB |
testcase_08 | AC | 423 ms
231,284 KB |
testcase_09 | AC | 243 ms
128,704 KB |
testcase_10 | AC | 272 ms
165,180 KB |
testcase_11 | AC | 119 ms
109,648 KB |
testcase_12 | AC | 141 ms
85,156 KB |
testcase_13 | AC | 225 ms
95,496 KB |
testcase_14 | AC | 459 ms
204,580 KB |
testcase_15 | AC | 282 ms
89,320 KB |
testcase_16 | AC | 300 ms
202,728 KB |
testcase_17 | AC | 373 ms
155,052 KB |
testcase_18 | AC | 216 ms
109,588 KB |
testcase_19 | AC | 425 ms
236,576 KB |
testcase_20 | AC | 492 ms
226,068 KB |
testcase_21 | AC | 278 ms
197,900 KB |
testcase_22 | AC | 241 ms
242,760 KB |
testcase_23 | AC | 138 ms
112,300 KB |
testcase_24 | AC | 182 ms
164,720 KB |
testcase_25 | AC | 230 ms
190,304 KB |
testcase_26 | AC | 210 ms
177,988 KB |
testcase_27 | AC | 236 ms
185,720 KB |
testcase_28 | AC | 324 ms
261,492 KB |
testcase_29 | AC | 308 ms
261,312 KB |
ソースコード
N = int(input()) X = list(map(int, input().split())) 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 + 1)] 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) 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) 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 for j in range(len_vec): kinds[vec[j]] = 0 if ok >= len_vec: print(-1) else: print(ok)