結果
問題 | No.1621 Sequence Inversions |
ユーザー | kyaneko999 |
提出日時 | 2021-07-23 07:48:52 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 3,628 bytes |
コンパイル時間 | 508 ms |
コンパイル使用メモリ | 87,228 KB |
実行使用メモリ | 281,004 KB |
最終ジャッジ日時 | 2023-09-25 05:21:08 |
合計ジャッジ時間 | 15,557 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 135 ms
77,952 KB |
testcase_01 | RE | - |
testcase_02 | AC | 152 ms
79,568 KB |
testcase_03 | AC | 149 ms
79,408 KB |
testcase_04 | AC | 313 ms
234,404 KB |
testcase_05 | RE | - |
testcase_06 | AC | 143 ms
79,236 KB |
testcase_07 | AC | 163 ms
79,700 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 566 ms
280,600 KB |
testcase_11 | WA | - |
testcase_12 | AC | 816 ms
280,576 KB |
testcase_13 | AC | 855 ms
280,816 KB |
testcase_14 | WA | - |
testcase_15 | AC | 907 ms
280,664 KB |
testcase_16 | AC | 690 ms
223,668 KB |
testcase_17 | AC | 870 ms
272,264 KB |
testcase_18 | AC | 669 ms
211,656 KB |
testcase_19 | AC | 155 ms
79,108 KB |
testcase_20 | AC | 315 ms
119,556 KB |
testcase_21 | AC | 910 ms
280,660 KB |
testcase_22 | AC | 907 ms
280,632 KB |
testcase_23 | AC | 905 ms
280,824 KB |
testcase_24 | AC | 138 ms
77,700 KB |
testcase_25 | AC | 141 ms
78,860 KB |
testcase_26 | RE | - |
testcase_27 | RE | - |
testcase_28 | RE | - |
ソースコード
from sys import exit, stdin, setrecursionlimit from collections import deque, defaultdict, Counter from copy import deepcopy from bisect import bisect_left, bisect_right, insort_left, insort_right from heapq import heapify, heappop, heappush from itertools import product, permutations, combinations, combinations_with_replacement from functools import reduce from math import gcd, sin, cos, tan, asin, acos, atan, atan2, degrees, radians, ceil, floor, sqrt, factorial from math import pi as PI from random import randint # from decimal import Decimal setrecursionlimit(500000) INF = (1<<61)-1 EPS = 1e-10 MOD = 10**9+7 MOD = 998244353 def input(): return stdin.readline().strip('\n') def intput(): return int(input()) def minput(): return input().split() def linput(): return input().split() def mint(): return map(int,input().split()) def lint(): return list(map(int,input().split())) def ilint(): return intput(),lint() def lcm(x,y): return x*y//gcd(x,y) def lgcd(l): return reduce(gcd,l) def llcm(l): return reduce(lcm,l) def powmod(n,i,mod=MOD): return pow(n,mod-1+i,mod) if i<0 else pow(n,i,mod) def div2(x): return x.bit_length() def div10(x): return len(str(x))-(x==0) def popcount(x): return bin(x).count('1') def digit(x,i,max_len=None): s = str(x) if max_len: i -= max_len-len(s) return int(s[i-1]) if i>0 else 0 def digitsum(x): ans = 0 for i in range(div10(x)): ans += digit(x,i+1) return ans def pf(x,mode='counter'): C = Counter() p = 2 while x>1: k = 0 while x%p==0: x //= p k += 1 if k>0: C[p] += k p = p+2-(p==2) if p*p<x else x if mode=='counter': return C S = set([1]) for k in C: T = set() for x in S: for i in range(C[k]+1): T.add(x*(k**i)) S = T if mode=='set': return S if mode=='list': return sorted(S) def isprime(x): if x<2: return False return len(pf(x,'set'))==2 def matmul(A, B): # import numpy A1, A2 = A >> 15, A & (1 << 15) - 1 B1, B2 = B >> 15, B & (1 << 15) - 1 X = np.dot(A1, B1) % MOD Y = np.dot(A2, B2) Z = np.dot(A1 + A2, B1 + B2) - X - Y return ((X << 30) + (Z << 15) + Y) % MOD def matpow(A, N): P = np.eye(A.shape[0], dtype=np.int64) while N: if N & 1: P = matmul(P, A) A = matmul(A, A) N >>= 1 return P def zash(S): lis = sorted(S) dic = {} for i,x in enumerate(lis): dic[x] = i return lis, dic def pr(*x): print(*x, sep='', end='') if len(x) else print() def lprint(l): for x in l: print(x) def ston(c, c0='a'): return ord(c)-ord(c0) def ntos(x, c0='a'): return chr(x+ord(c0)) def judge(x, l=['Yes', 'No']): print(l[0] if x else l[1]) def debug(*x, flag=1): if flag: print(*x) ###################################################### N,K=mint() M=N*(N-1)//2 A=lint() C=Counter(A) dp=[0]*(M+1) dp[0]=1 cnt=0 M0=N*N//4 dpp=[[[0]*(M0+1) for _ in range(N+1)] for _ in range(N+1)] for c in range(N+1): dpp[0][c][0]=1 for j in range(1,N+1): for c in range(N+1): for x in range(N+1): dpp[j][c][x]=dpp[j-1][c][x] if x-j>=0: dpp[j][c][x]+=dpp[j][c-1][x-j] dpp[j][c][x]%=MOD for key in sorted(C.keys()): v=C[key] Mp=cnt*v nxt=[0]*(M+1) for x in range(Mp+1): for k in range(M-x+1): nxt[k+x]+=dp[k]*dpp[v][cnt][x] nxt[k+x]%=MOD dp=nxt cnt+=v print(dp[K])