結果
問題 | No.2374 ASKT Subsequences |
ユーザー | McGregorsh |
提出日時 | 2023-07-07 22:23:15 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,913 bytes |
コンパイル時間 | 340 ms |
コンパイル使用メモリ | 86,896 KB |
実行使用メモリ | 104,248 KB |
最終ジャッジ日時 | 2023-09-28 23:48:51 |
合計ジャッジ時間 | 12,268 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 246 ms
90,740 KB |
testcase_01 | AC | 250 ms
91,016 KB |
testcase_02 | AC | 251 ms
91,120 KB |
testcase_03 | AC | 255 ms
90,952 KB |
testcase_04 | AC | 254 ms
90,880 KB |
testcase_05 | AC | 255 ms
90,948 KB |
testcase_06 | AC | 251 ms
91,000 KB |
testcase_07 | AC | 249 ms
90,720 KB |
testcase_08 | AC | 251 ms
90,744 KB |
testcase_09 | AC | 251 ms
90,800 KB |
testcase_10 | AC | 253 ms
90,812 KB |
testcase_11 | AC | 263 ms
90,764 KB |
testcase_12 | AC | 259 ms
90,996 KB |
testcase_13 | AC | 254 ms
90,816 KB |
testcase_14 | AC | 273 ms
91,084 KB |
testcase_15 | AC | 295 ms
99,336 KB |
testcase_16 | AC | 267 ms
91,052 KB |
testcase_17 | AC | 290 ms
101,452 KB |
testcase_18 | AC | 325 ms
104,012 KB |
testcase_19 | AC | 320 ms
103,908 KB |
testcase_20 | AC | 326 ms
103,840 KB |
testcase_21 | AC | 333 ms
103,996 KB |
testcase_22 | AC | 321 ms
104,040 KB |
testcase_23 | AC | 336 ms
103,980 KB |
testcase_24 | AC | 331 ms
104,248 KB |
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() 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 range(i+2, N): if A[i] + 10 != A[j]: continue 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()