結果
問題 | No.2374 ASKT Subsequences |
ユーザー | McGregorsh |
提出日時 | 2023-07-07 22:30:10 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,043 bytes |
コンパイル時間 | 255 ms |
コンパイル使用メモリ | 82,392 KB |
実行使用メモリ | 115,124 KB |
最終ジャッジ日時 | 2024-07-21 18:39:11 |
合計ジャッジ時間 | 8,711 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 143 ms
96,340 KB |
testcase_01 | AC | 140 ms
89,688 KB |
testcase_02 | AC | 139 ms
89,564 KB |
testcase_03 | AC | 146 ms
89,316 KB |
testcase_04 | WA | - |
testcase_05 | AC | 147 ms
89,504 KB |
testcase_06 | AC | 139 ms
89,424 KB |
testcase_07 | AC | 143 ms
89,396 KB |
testcase_08 | AC | 145 ms
89,396 KB |
testcase_09 | AC | 144 ms
89,076 KB |
testcase_10 | AC | 143 ms
89,372 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 148 ms
89,536 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 sysfrom sys import stdinfrom fractions import Fractionimport mathfrom math import ceil, floor, sqrt, pi, factorial, gcdfrom copy import deepcopyfrom collections import Counter, deque, defaultdictfrom heapq import heapify, heappop, heappushfrom itertools import accumulate, product, combinations, combinations_with_replacement, permutationsfrom bisect import bisect, bisect_left, bisect_rightfrom functools import reduce, lru_cachefrom decimal import Decimal, getcontext, ROUND_HALF_UPdef 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 ddef rotate(table):n_fild = []for x in zip(*table[::-1]):n_fild.append(x)return n_fildsys.setrecursionlimit(10 ** 7)INF = float('inf')MOD = 10 ** 9 + 7MOD2 = 998244353alpa = '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] + 10for 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] += 1for i in range(2001):for j in range(1, N):cost[i][j] += cost[i][j-1]ans = 0for i in range(N-1):l = ifor j in numpoint[A[i]]:r = j-1for k in range(1, 2001):p = k + A[i] + 10if p+1 > 2000:breakelse:score1 = cost[p][r] - cost[p][l]score2 = cost[p+1][-1] - cost[p+1][r+1]score = score1 * score2ans += scoreprint(ans)if __name__ == '__main__':main()