Submission #5548749


Source Code Expand

Copy
#include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=998244353;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};

ll Pow(ll n,ll p){
	ll r=1;
	for(;p>0;p>>=1){
		if(p&1) r=(r*n)%mod;
		n=(n*n)%mod;
	}
	return r;
}

const int M=1005;
ll F[M];

void Init(){
	F[0]=1;
	for(int i=1;i<M;i++) F[i]=F[i-1]*i%mod;
}

ll Div(ll n,ll m){
	return n*Pow(m,mod-2)%mod;
}

ll nCk(ll n,ll k){
	return Div(F[n],F[n-k]*F[k]%mod);
}

int n;
vi a;

int main(){
	Init();
	cin>>n;
	a=vi(n+1);
	for(int i=0;i<n;i++){
		int x;
		cin>>x;
		a[x]++;
	}
	vl dp(1);
	dp[0]++;
	int S=0;
	for(int i=n;i>0;i--){
		vl DP(S+a[i]+1);
		for(int j=0;j<=S;j++){
			ll t=1;
			for(int k=0;i*k<=j+a[i];k++){
				(DP[j+a[i]-i*k]+=dp[j]*Div(t,F[k]))%=mod;
				if(j+a[i]-i*k>=i) (t*=nCk(j+a[i]-i*k,i))%=mod;
			}
		}
		dp=DP;S+=a[i];
	}
	cout<<dp[0]<<endl;
}

Submission Info

Submission Time
Task F - チーム分け
User Pulmn
Language C++14 (GCC 5.4.1)
Score 600
Code Size 1461 Byte
Status
Exec Time 1192 ms
Memory 256 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 1 ms 256 KB
02.txt 1 ms 256 KB
03.txt 1 ms 256 KB
04.txt 1 ms 256 KB
05.txt 1 ms 256 KB
06.txt 7 ms 256 KB
07.txt 7 ms 256 KB
08.txt 7 ms 256 KB
09.txt 7 ms 256 KB
10.txt 7 ms 256 KB
11.txt 830 ms 256 KB
12.txt 876 ms 256 KB
13.txt 851 ms 256 KB
14.txt 842 ms 256 KB
15.txt 767 ms 256 KB
16.txt 1192 ms 256 KB
17.txt 1180 ms 256 KB
18.txt 1173 ms 256 KB
19.txt 1177 ms 256 KB
20.txt 1167 ms 256 KB
21.txt 1 ms 256 KB
22.txt 1 ms 256 KB
23.txt 1 ms 256 KB
24.txt 1 ms 256 KB
s1.txt 1 ms 256 KB
s2.txt 1 ms 256 KB
s3.txt 1 ms 256 KB