結果

問題 No.1963 Subset Mex
ユーザー HIR180HIR180
提出日時 2022-05-28 06:12:17
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 16 ms / 4,000 ms
コード長 6,346 bytes
コンパイル時間 3,449 ms
コンパイル使用メモリ 187,192 KB
実行使用メモリ 18,524 KB
最終ジャッジ日時 2024-09-20 20:32:23
合計ジャッジ時間 4,660 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 5 ms
8,176 KB
testcase_01 AC 5 ms
8,476 KB
testcase_02 AC 4 ms
8,140 KB
testcase_03 AC 5 ms
8,244 KB
testcase_04 AC 4 ms
8,268 KB
testcase_05 AC 5 ms
8,248 KB
testcase_06 AC 5 ms
8,352 KB
testcase_07 AC 5 ms
8,248 KB
testcase_08 AC 4 ms
8,220 KB
testcase_09 AC 5 ms
8,240 KB
testcase_10 AC 5 ms
8,136 KB
testcase_11 AC 5 ms
8,368 KB
testcase_12 AC 5 ms
8,104 KB
testcase_13 AC 5 ms
8,264 KB
testcase_14 AC 5 ms
8,264 KB
testcase_15 AC 5 ms
8,220 KB
testcase_16 AC 5 ms
8,296 KB
testcase_17 AC 5 ms
10,492 KB
testcase_18 AC 6 ms
8,824 KB
testcase_19 AC 7 ms
10,300 KB
testcase_20 AC 9 ms
12,108 KB
testcase_21 AC 15 ms
18,004 KB
testcase_22 AC 16 ms
18,524 KB
testcase_23 AC 15 ms
16,716 KB
testcase_24 AC 12 ms
14,128 KB
testcase_25 AC 11 ms
13,032 KB
testcase_26 AC 5 ms
8,352 KB
testcase_27 AC 6 ms
8,980 KB
testcase_28 AC 7 ms
9,892 KB
testcase_29 AC 8 ms
10,476 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <cassert>
#include <iomanip>
#include <chrono>
#include <random>
#include <bitset>
#include <complex>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
#define int long long
//#define L __int128
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define a first
#define b second
#define fi first
#define sc second
//#define rng(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
#define si(x) int(x.size())
#define pcnt(x) __builtin_popcountll(x)

#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif
 
template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}
 
template<class t> using vc=vector<t>;
 
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.fi<<","<<p.sc<<"}";
}
 
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}
 
 //https://codeforces.com/blog/entry/62393
struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		// http://xorshift.di.unimi.it/splitmix64.c
		x += 0x9e3779b97f4a7c15;
		x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
		x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
		return x ^ (x >> 31);
	}
 
	size_t operator()(uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
		return splitmix64(x + FIXED_RANDOM);
	}
	//don't make x negative!
	size_t operator()(pair<int,int> x)const{
		return operator()(uint64_t(x.first)<<32|x.second);
	}
};
//unordered_set -> dtype, null_type
//unordered_map -> dtype(key), dtype(value)
using namespace __gnu_pbds;
template<class t,class u>
using hash_table=gp_hash_table<t,u,custom_hash>;

template<class T>
void g(T &a){
	cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
	cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 998244353;
//const ll mod = 1000000007;
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
template<class T>
void add(T&a,T b){
	a+=b;
	if(a >= mod) a-=mod;
}
ll modpow(ll x,ll n){
	ll res=1;
	while(n>0){
		if(n&1) res=res*x%mod;
		x=x*x%mod;
		n>>=1;
	}
	return res;
}
#define _sz 1
ll F[_sz],R[_sz];
void make(){
	F[0] = 1;
	for(int i=1;i<_sz;i++) F[i] = F[i-1]*i%mod;
	R[_sz-1] = modpow(F[_sz-1], mod-2);
	for(int i=_sz-2;i>=0;i--) R[i] = R[i+1] * (i+1) % mod;
}
ll C(int a,int b){
	if(b < 0 || a < b) return 0;
	return F[a]*R[b]%mod*R[a-b]%mod;
}
//o(ans?"Yes":"No");
int dp[105][105][105], n, cnt[105];
int dp2[2][105][105][105];
void solve(){
	cin >> n;
	repn(i, n){
		int v; cin >> v;
		cnt[v] ++;
	}
	
	int ans = 0;
	if(cnt[0] == 0 and cnt[1] == 0) ans = 1;
	
	{
		dp[102][0][0] = 1;
		{
			for(int i=102;i>=3;i--){
				for(int g=0;g<=100;g++){
					for(int need=0;need*i<=n;need++){
						if(dp[i][g][need] == 0) continue;
						int zan = cnt[i-1];
						for(int m=0;;m++){
							if(m <= zan){
								int rem = zan-m;
								if(rem >= need){
									int ng = g + rem-need;
									int nxt = need;
									add(dp[i-1][ng][nxt], dp[i][g][need]);
								}
								else{
									int ng = g;
									int nxt = need + (need-rem);
									if(nxt*(i-1) > n) break;
									else add(dp[i-1][ng][nxt], dp[i][g][need]);
								}
							}
							else{
								int ng = g;
								int nxt = need + need + m - zan;
								if(nxt*(i-1) > n) break;
								else add(dp[i-1][ng][nxt], dp[i][g][need]);
							}
						}
					}
				}
			}
		}
		rep(g, 105) rep(c, 105){
			//dp[0][2][g][c]
			if(dp[2][g][c] == 0) continue;
			int zan = g + cnt[0] + cnt[1];
			zan -= c*2;
			if(zan < 0) continue;
			int p = (zan+1)*(zan+2)/2-1;
			add(ans, dp[2][g][c]*p%mod);
		}
	}
	{
		dp2[0][102][0][0] = 1;
		rep(s, 2){
			for(int i=102;i>=3;i--){
				for(int g=0;g<=100;g++){
					for(int need=0;need*i<=n;need++){
						if(dp2[s][i][g][need] == 0) continue;
						int zan = cnt[i-1];
						
						for(int m=0;;m++){
							if(s and m) break;
							if(m <= zan){
								int rem = zan-m;
								if(rem >= need){
									int ng = g + rem-need;
									int nxt = need;
									add(dp2[s][i-1][ng][nxt], dp2[s][i][g][need]);
								}
								else{
									int ng = g;
									int nxt = need + (need-rem);
									if(nxt*(i-1) > n) break;
									else add(dp2[s][i-1][ng][nxt], dp2[s][i][g][need]);
								}
							}
							else{
								int ng = g;
								int nxt = need + need + m - zan;
								if(nxt*(i-1) > n) break;
								else add(dp2[s][i-1][ng][nxt], dp2[s][i][g][need]);
							}
							
							if(s == 0 and need == 0 and m and m <= cnt[i-1]){
								int ng = g + cnt[i-1] - m + 1;
								int nxt = 1;
								add(dp2[1][i-1][ng][nxt], dp2[s][i][g][need]);
							}
						}
					}
				}
			}
		}
		rep(g, 105) rep(c, 105){
			//dp[0][2][g][c]
			if(dp2[0][2][g][c] == 0 or c == 0) continue;
			int zan = g + cnt[0] + cnt[1];
			zan -= c*2;
			if(zan < 0) continue;
			add(ans, dp2[0][2][g][c]);
		}
		rep(g, 105) rep(c, 105){
			//dp[1][2][g][c]
			if(dp2[1][2][g][c] == 0) continue;
			int zan = g + cnt[0] + cnt[1];
			zan -= c*2;
			if(zan < 0) continue;
			add(ans, dp2[1][2][g][c]);
		}
	}
		
	o(ans);
}
signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	int t; t = 1; //cin >> t;
	while(t--) solve();
}
0