結果
| 問題 |
No.1526 Sum of Mex 2
|
| ユーザー |
gew1fw
|
| 提出日時 | 2025-06-12 20:15:38 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 1,919 bytes |
| コンパイル時間 | 293 ms |
| コンパイル使用メモリ | 82,244 KB |
| 実行使用メモリ | 174,276 KB |
| 最終ジャッジ日時 | 2025-06-12 20:18:26 |
| 合計ジャッジ時間 | 6,493 ms |
|
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 10 TLE * 1 -- * 21 |
ソースコード
import sys
from collections import defaultdict
def main():
input = sys.stdin.read().split()
N = int(input[0])
A = list(map(int, input[1:N+1]))
from bisect import bisect_left, bisect_right
pos = defaultdict(list)
for idx, num in enumerate(A):
pos[num].append(idx)
ans = 0
for x in range(1, N+2):
x_pos = pos.get(x, [])
regions = []
prev = -1
for p in x_pos:
if prev + 1 <= p - 1:
regions.append((prev + 1, p - 1))
prev = p
if prev + 1 <= N - 1:
regions.append((prev + 1, N - 1))
total = 0
required = set(range(1, x)) if x > 1 else set()
if x == 1:
for (s, e) in regions:
length = e - s + 1
total += length * (length + 1) // 2
else:
if not required:
continue
for (s, e) in regions:
if s > e:
continue
sub = A[s:e+1]
freq = defaultdict(int)
cnt = 0
left = 0
unique = 0
current = 0
for right in range(len(sub)):
num = sub[right]
if num in required:
freq[num] += 1
if freq[num] == 1:
unique += 1
while unique == len(required):
current += len(sub) - right
num_left = sub[left]
if num_left in required:
freq[num_left] -= 1
if freq[num_left] == 0:
unique -= 1
left += 1
total += current
ans += x * total
print(ans)
if __name__ == '__main__':
main()
gew1fw