結果
問題 | No.1621 Sequence Inversions |
ユーザー | mkawa2 |
提出日時 | 2021-07-23 00:01:35 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,256 ms / 3,000 ms |
コード長 | 1,622 bytes |
コンパイル時間 | 673 ms |
コンパイル使用メモリ | 86,916 KB |
実行使用メモリ | 302,796 KB |
最終ジャッジ日時 | 2023-09-24 20:49:16 |
合計ジャッジ時間 | 30,708 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 899 ms
301,364 KB |
testcase_01 | AC | 896 ms
301,368 KB |
testcase_02 | AC | 905 ms
302,688 KB |
testcase_03 | AC | 901 ms
301,580 KB |
testcase_04 | AC | 895 ms
302,508 KB |
testcase_05 | AC | 885 ms
301,596 KB |
testcase_06 | AC | 891 ms
301,444 KB |
testcase_07 | AC | 899 ms
302,260 KB |
testcase_08 | AC | 1,087 ms
302,460 KB |
testcase_09 | AC | 902 ms
302,632 KB |
testcase_10 | AC | 906 ms
302,576 KB |
testcase_11 | AC | 1,160 ms
302,724 KB |
testcase_12 | AC | 1,256 ms
302,452 KB |
testcase_13 | AC | 1,201 ms
302,584 KB |
testcase_14 | AC | 955 ms
302,564 KB |
testcase_15 | AC | 939 ms
302,520 KB |
testcase_16 | AC | 995 ms
302,428 KB |
testcase_17 | AC | 1,077 ms
302,604 KB |
testcase_18 | AC | 988 ms
302,408 KB |
testcase_19 | AC | 911 ms
302,176 KB |
testcase_20 | AC | 949 ms
302,396 KB |
testcase_21 | AC | 1,089 ms
302,796 KB |
testcase_22 | AC | 963 ms
302,432 KB |
testcase_23 | AC | 1,112 ms
302,648 KB |
testcase_24 | AC | 896 ms
301,448 KB |
testcase_25 | AC | 895 ms
301,608 KB |
testcase_26 | AC | 888 ms
301,144 KB |
testcase_27 | AC | 888 ms
301,368 KB |
testcase_28 | AC | 897 ms
301,512 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = 10**16 md = 998244353 # md = 10**9+7 mx = 100 mx2 = 2505 dd = [[[0]*(mx+1) for _ in range(mx+1)] for _ in range(mx2)] for s in range(mx2): for j in range(1, mx+1): for lim in range(mx+1): if j == 1: if s <= lim: dd[s][j][lim] = 1 else: dd[s][j][lim] = 0 elif s == 0: dd[s][j][lim] = 1 elif s > lim*j: dd[s][j][lim] = 0 else: dd[s][j][lim] = (dd[s-j][j][lim-1]+dd[s][j-1][lim])%md from collections import Counter n, k = LI() aa = LI() aa.sort() ac = Counter(aa) dp = [0]*(k+1) dp[0] = 1 pa = -1 for i, a in enumerate(aa): if a == pa: continue dp1 = dp dp = [0]*(k+1) c = ac[a] for j in range(k+1): pre = dp1[j] if pre == 0: continue for nj in range(j, k+1): diff = nj-j if diff>i*c:break dp[nj] += pre*dd[diff][c][i]%md dp[nj] %= md pa = a # p2D(dp) print(dp[k])