結果
問題 | No.2374 ASKT Subsequences |
ユーザー | 21kazu13 |
提出日時 | 2023-07-07 22:51:52 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,587 bytes |
コンパイル時間 | 365 ms |
コンパイル使用メモリ | 87,264 KB |
実行使用メモリ | 149,508 KB |
最終ジャッジ日時 | 2023-09-29 00:27:23 |
合計ジャッジ時間 | 11,019 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | AC | 151 ms
79,840 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | AC | 149 ms
79,808 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | OLE | - |
testcase_26 | WA | - |
testcase_27 | OLE | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
ソースコード
#!/usr/bin/env python3 import sys from bisect import bisect_left, bisect_right, insort_left, insort_right # type: ignore from collections import Counter, defaultdict, deque # type: ignore from math import gcd, sqrt, ceil # type: ignore from heapq import heapify, heappop, heappush, heappushpop, heapreplace, merge # type: ignore from itertools import accumulate, combinations, permutations, product # type: ignore from string import ascii_lowercase, ascii_uppercase # type: ignore def LI(): return list(map(int, sys.stdin.buffer.readline().split())) def I(): return int(sys.stdin.buffer.readline()) def LS(): return sys.stdin.buffer.readline().rstrip().decode("utf-8").split() def S(): return sys.stdin.buffer.readline().rstrip().decode("utf-8") def IR(n): return [I() for _ in range(n)] def LIR(n): return [LI() for _ in range(n)] def SR(n): return [S() for _ in range(n)] def LSR(n): return [LS() for _ in range(n)] def SRL(n): return [list(S()) for _ in range(n)] N = I() A = LI() num = [[] for _ in range(2020)] cnt = [[0]*(N+1) for _ in range(2020)] for i,a in enumerate(A): num[a].append(i) for j in num[a-1]: cnt[a-1][j+1]+=1 cnt[a-1][i]-=1 for i in range(2020): cnt[i] = list(accumulate(cnt[i])) for i in range(2019,0,-1): for j in range(N+1): cnt[i-1][j] += cnt[i][j] ans = 0 for i in range(N): a1 = A[i] for k in num[a1+10]: if k-i<2: continue a3 = A[k] if cnt[a3+1][k]>0: print(i,k,a3+1,cnt[a3+1][k]) print(cnt[a3+1]) ans += cnt[a3+1][k]-cnt[a3+1][i] print(ans)