結果
問題 | No.2374 ASKT Subsequences |
ユーザー | McGregorsh |
提出日時 | 2023-07-07 22:30:10 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,043 bytes |
コンパイル時間 | 780 ms |
コンパイル使用メモリ | 87,016 KB |
実行使用メモリ | 102,224 KB |
最終ジャッジ日時 | 2023-09-28 23:57:29 |
合計ジャッジ時間 | 13,895 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 260 ms
91,204 KB |
testcase_01 | AC | 263 ms
91,128 KB |
testcase_02 | AC | 254 ms
90,860 KB |
testcase_03 | AC | 251 ms
90,912 KB |
testcase_04 | WA | - |
testcase_05 | AC | 263 ms
90,904 KB |
testcase_06 | AC | 266 ms
91,164 KB |
testcase_07 | AC | 265 ms
90,856 KB |
testcase_08 | AC | 266 ms
91,220 KB |
testcase_09 | AC | 263 ms
91,048 KB |
testcase_10 | AC | 261 ms
90,928 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 264 ms
90,924 KB |
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 | TLE | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
ソースコード
import sys from sys import stdin from fractions import Fraction import math from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce, lru_cache from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(stdin.readline()) def i_map(): return map(int, stdin.readline().split()) def i_list(): return list(i_map()) def s_input(): return stdin.readline()[:-1] def s_map(): return s_input().split() def s_list(): return list(s_map()) def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 alpa = 'abcdefghijklmnopqrstuvwxyz' ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' def main(): N = int(input()) A = i_list() numpoint = [[] for i in range(2001)] for i in range(N-1): p = A[i] + 10 for j in range(i+2, N): if p == A[j]: numpoint[A[i]].append(j) cost = [[0] * N for i in range(2001)] for i in range(N): cost[A[i]][i] += 1 for i in range(2001): for j in range(1, N): cost[i][j] += cost[i][j-1] ans = 0 for i in range(N-1): l = i for j in numpoint[A[i]]: r = j-1 for k in range(1, 2001): p = k + A[i] + 10 if p+1 > 2000: break else: score1 = cost[p][r] - cost[p][l] score2 = cost[p+1][-1] - cost[p+1][r+1] score = score1 * score2 ans += score print(ans) if __name__ == '__main__': main()