Contest Duration: ~ (local time)

Submission #2997540

Source Code Expand

Copy
```using System;
using System.Text;
using System.Collections.Generic;
using System.Linq;
class Solve{
public Solve(){}
StringBuilder sb;
public static int Main(){
new Solve().Run();
return 0;
}
void Run(){
sb = new StringBuilder();
Calc();
Console.Write(sb.ToString());
}
void Calc(){
int N = re.i();
int[] A = new int[N+1];
for(int i=0;i<N;i++){
A[re.i()]++;
}
for(int i=N-1;i>=0;i--){
A[i] += A[i+1];
}
Fact fact = new Fact(N);
long[,] DP = new long[N+1,N+1];
DP[0,0] = 1;
for(int i=0;i<N;i++){
int c = N-i;
for(int j=0;j<=N;j++){
long co = DP[i,j];
int ma = A[c]-j;
for(int k=0;;k++){
long cok = co * fact.rf[k] % Define.mod;
DP[i+1,k*c+j] = (DP[i+1,k*c+j] + cok) % Define.mod;
if(ma < c){
break;
}
co *= fact.GetConv(ma,c);
co %= Define.mod;
ma -= c;
}
}
}
sb.Append(DP[N,N]+"\n");
}
}
class Fact{
public long[] f;
public long[] rf;
public Fact(int N){
f = new long[N+1];
rf = new long[N+1];
for(int i=0;i<N+1;i++){
if(i == 0){
f[i] = 1;
}
else{
f[i] = (f[i-1]*i)%Define.mod;
}
}
for(int i=N;i>=0;i--){
if(i == N){
rf[i] = pow(f[N],Define.mod-2);
}
else{
rf[i] = rf[i+1]*(i+1)%Define.mod;
}
}
}
public long pow(long N,long K){
if(K == 0){
return 1;
}
else if(K % 2 == 0){
long t = pow(N,K/2);
return t*t%Define.mod;
}
else{
return N*pow(N,K-1)%Define.mod;
}
}
public long GetFact(int N){
return f[N];
}
public long GetPerm(int N,int R){
return f[N] * rf[N-R] % Define.mod;
}
public long GetConv(int N,int R){
return ((f[N]*rf[R])%Define.mod*rf[N-R])%Define.mod;
}
public long GetRev(int N){
if(N == 0){
return 1;
}
else{
return rf[N] * f[N-1] % Define.mod;
}
}
}
string[] str;
int counter;
counter = 0;
}
public string s(){
if(counter == 0){
counter = str.Length;
}
counter--;
return str[str.Length-counter-1];
}
public int i(){
return int.Parse(s());
}
public long l(){
return long.Parse(s());
}
public double d(){
return double.Parse(s());
}
public int[] ia(int N){
int[] ans = new int[N];
for(int j=0;j<N;j++){
ans[j] = i();
}
return ans;
}
public int[] ia(){
counter = 0;
int[] ans = new int[str.Length];
for(int j=0;j<str.Length;j++){
ans[j] = int.Parse(str[j]);
}
return ans;
}
public long[] la(int N){
long[] ans = new long[N];
for(int j=0;j<N;j++){
ans[j] = l();
}
return ans;
}
public long[] la(){
counter = 0;
long[] ans = new long[str.Length];
for(int j=0;j<str.Length;j++){
ans[j] = long.Parse(str[j]);
}
return ans;
}
public double[] da(int N){
double[] ans = new double[N];
for(int j=0;j<N;j++){
ans[j] = d();
}
return ans;
}
public double[] da(){
counter = 0;
double[] ans = new double[str.Length];
for(int j=0;j<str.Length;j++){
ans[j] = double.Parse(str[j]);
}
return ans;
}
public List<int>[] g(int N,int[] f,int[] t){
List<int>[] ans = new List<int>[N];
for(int j=0;j<N;j++){
ans[j] = new List<int>();
}
for(int j=0;j<f.Length;j++){
}
return ans;
}
public List<int>[] g(int N,int M){
List<int>[] ans = new List<int>[N];
for(int j=0;j<N;j++){
ans[j] = new List<int>();
}
for(int j=0;j<M;j++){
int f = i()-1;
int t = i()-1;
}
return ans;
}
public List<int>[] g(){
int N = i();
int M = i();
List<int>[] ans = new List<int>[N];
for(int j=0;j<N;j++){
ans[j] = new List<int>();
}
for(int j=0;j<M;j++){
int f = i()-1;
int t = i()-1;
}
return ans;
}
}
public static class Define{
public const long mod = 998244353;
}
public static class Debug{
public static void Print(double[,,] k){
for(int i=0;i<k.GetLength(0);i++){
for(int j=0;j<k.GetLength(1);j++){
for(int l=0;l<k.GetLength(2);l++){
Console.Write(k[i,j,l]+" ");
}
Console.WriteLine();
}
Console.WriteLine();
}
}
public static void Print(double[,] k){
for(int i=0;i<k.GetLength(0);i++){
for(int j=0;j<k.GetLength(1);j++){
Console.Write(k[i,j]+" ");
}
Console.WriteLine();
}
}
public static void Print(double[] k){
for(int i=0;i<k.Length;i++){
Console.WriteLine(k[i]);
}
}
public static void Print(long[,,] k){
for(int i=0;i<k.GetLength(0);i++){
for(int j=0;j<k.GetLength(1);j++){
for(int l=0;l<k.GetLength(2);l++){
Console.Write(k[i,j,l]+" ");
}
Console.WriteLine();
}
Console.WriteLine();
}
}
public static void Print(long[,] k){
for(int i=0;i<k.GetLength(0);i++){
for(int j=0;j<k.GetLength(1);j++){
Console.Write(k[i,j]+" ");
}
Console.WriteLine();
}
}
public static void Print(long[] k){
for(int i=0;i<k.Length;i++){
Console.WriteLine(k[i]);
}
}
public static void Print(int[,,] k){
for(int i=0;i<k.GetLength(0);i++){
for(int j=0;j<k.GetLength(1);j++){
for(int l=0;l<k.GetLength(2);l++){
Console.Write(k[i,j,l]+" ");
}
Console.WriteLine();
}
Console.WriteLine();
}
}
public static void Print(int[,] k){
for(int i=0;i<k.GetLength(0);i++){
for(int j=0;j<k.GetLength(1);j++){
Console.Write(k[i,j]+" ");
}
Console.WriteLine();
}
}
public static void Print(int[] k){
for(int i=0;i<k.Length;i++){
Console.WriteLine(k[i]);
}
}
}
```

#### Submission Info

Submission Time 2018-08-12 16:11:33+0900 F - チーム分け leign C# (Mono 4.6.2.0) 600 7771 Byte AC 299 ms 18784 KB

#### Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0
All 600 / 600 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt 21 ms 9044 KB
02.txt 21 ms 9044 KB
03.txt 21 ms 9044 KB
04.txt 21 ms 11092 KB
05.txt 21 ms 11092 KB
06.txt 23 ms 11136 KB
07.txt 23 ms 11136 KB
08.txt 23 ms 11140 KB
09.txt 23 ms 11140 KB
10.txt 23 ms 9092 KB
11.txt 229 ms 15584 KB
12.txt 243 ms 18144 KB
13.txt 236 ms 17888 KB
14.txt 233 ms 15840 KB
15.txt 216 ms 15328 KB
16.txt 299 ms 18784 KB
17.txt 297 ms 18656 KB
18.txt 296 ms 18656 KB
19.txt 296 ms 18656 KB
20.txt 293 ms 16608 KB
21.txt 21 ms 9044 KB
22.txt 21 ms 9044 KB
23.txt 21 ms 9172 KB
24.txt 21 ms 11092 KB
s1.txt 21 ms 9172 KB
s2.txt 22 ms 13140 KB
s3.txt 21 ms 11220 KB