結果
問題 | No.2062 Sum of Subset mod 999630629 |
ユーザー |
👑 ![]() |
提出日時 | 2022-08-26 22:03:24 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 298 ms / 5,000 ms |
コード長 | 2,992 bytes |
コンパイル時間 | 1,867 ms |
コンパイル使用メモリ | 200,292 KB |
最終ジャッジ日時 | 2025-01-31 04:50:47 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 29 |
ソースコード
#include <bits/stdc++.h>#pragma GCC optimize("Ofast")using namespace std;using std::cout;using std::cin;using std::endl;using ll=long long;using ld=long double;ll ILL=2167167167167167167;const int INF=2100000000;const ll mod=998244353;#define rep(i,a) for (ll i=0;i<a;i++)#define all(p) p.begin(),p.end()template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}ll jyo(ll x,ll y,ll z){ll H=y; //ここからll a=1,b=(x%z+z)%z,c=1;while(H>0){a*=2;if(H%a!=0){H-=a/2;c*=b;c%=z;}b*=b;b%=z;} //ここまでreturn c;}namespace po167{struct combination{int upper;long long MOD;std::vector<long long> fact;std::vector<long long> rev;std::vector<long long> fact_rev;combination(int max,long long mod):upper(max),MOD(mod),fact(max+1),rev(max+1),fact_rev(max+1){for(long long i=0;i<=max;i++){if(i<2){fact[i]=1;fact_rev[i]=1;rev[i]=1;continue;}fact[i]=(fact[i-1]*i)%mod;rev[i]=mod-((mod/i)*rev[mod%i])%mod;fact_rev[i]=(fact_rev[i-1]*rev[i])%mod;}}long long Comb(int x,int y){assert(upper>=x);if (x<y||y<0||x<0) return 0;return (((fact_rev[y]*fact_rev[x-y])%MOD)*fact[x])%MOD;}long long P(int x,int y){assert(upper>=x);if (x<y||y<0||x<0) return 0;return (fact_rev[x-y]*fact[x])%MOD;}};}using po167::combination;void solve();// oddloopint main() {ios::sync_with_stdio(false);cin.tie(nullptr);int t=1;//cin>>t;rep(i,t) solve();}void solve(){int N;cin>>N;ll S=0,L=1e4+10;vector<ll> A(N),B(L);rep(i,N) cin>>A[i],S+=A[i],B[A[i]]++;ll P=999630629;ll M=S-P;S%=mod,P%=mod;ll base=(S*jyo(2,N-1,mod))%mod;if(M<=0){cout<<base<<"\n";return ;}assert(M<=1e6);vector<ll> dp(M+1);combination table(N,mod);dp[0]=1;for(int i=L-1;i>=0;i--){if(B[i]==0) continue;for(int j=M;j>=0;j--){if(dp[j]==0) continue;for(int k=1;k<=B[i]&&j+k*i<=M;k++){dp[j+k*i]=(dp[j+k*i]+dp[j]*table.Comb(B[i],k))%mod;}}}for(auto x:dp){base=(base-x*P)%mod;}cout<<(base+mod)%mod<<"\n";}