#710813 (C++17) No.137 貯金箱の焦り

• 問題: No.137 貯金箱の焦り
• ユーザー: 沙耶花
• 提出日時: 2021-10-28 06:36:15
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 1,561 bytes
• コンパイル時間: 4,502 ms
• コンパイル使用メモリ: 258,184 KB
• 実行使用メモリ: 7,460 KB
• 最終ジャッジ日時: 2024-04-16 12:58:08
• 合計ジャッジ時間: 61,297 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	220 ms; 7,352 KB
testcase_01	AC	595 ms; 7,456 KB
testcase_02	AC	3,211 ms; 7,328 KB
testcase_03	AC	60 ms; 7,036 KB
testcase_04	AC	1,092 ms; 7,460 KB
testcase_05	AC	385 ms; 7,456 KB
testcase_06	AC	1,031 ms; 7,328 KB
testcase_07	AC	1,035 ms; 7,328 KB
testcase_08	AC	1,084 ms; 7,456 KB
testcase_09	AC	1,081 ms; 7,456 KB
testcase_10	AC	1,030 ms; 7,332 KB
testcase_11	AC	3,230 ms; 7,332 KB
testcase_12	WA	-
testcase_13	AC	437 ms; 7,328 KB
testcase_14	AC	3,204 ms; 7,324 KB
testcase_15	AC	3,187 ms; 7,460 KB
testcase_16	AC	3,217 ms; 7,328 KB
testcase_17	AC	3,132 ms; 7,460 KB
testcase_18	AC	3,150 ms; 7,356 KB
testcase_19	AC	3,233 ms; 7,460 KB
testcase_20	AC	2,981 ms; 7,456 KB
testcase_21	AC	3,184 ms; 7,328 KB
testcase_22	AC	3,203 ms; 7,328 KB
testcase_23	AC	3,087 ms; 7,456 KB
testcase_24	AC	3,054 ms; 7,324 KB
testcase_25	AC	3,207 ms; 7,332 KB

ソースコード

#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000000000000

template <class T>
vector<T> convolution_mint(vector<T> a,vector<T> b){
	vector<long long> a1(a.size()),a2(a.size()),b1(b.size()),b2(b.size());
	rep(i,a.size()){
		a1[i] = a[i].val()>>15;
		a2[i] = a[i].val()&((1<<15)-1);
	}
	rep(i,b.size()){
		b1[i] = b[i].val()>>15;
		b2[i] = b[i].val()&((1<<15)-1);
	}
	
	vector<long long> A = convolution_ll(a1,b1), C = convolution_ll(a2,b2);
	
	rep(i,a1.size())a1[i] += a2[i];
	rep(i,b1.size())b1[i] += b2[i];
	
	vector<long long> B = convolution_ll(a1,b1);
	
	rep(i,B.size()){
		B[i] -= A[i] + C[i];
	}
	
	
	vector<T> ret(A.size(),0);
	rep(i,A.size()){
		ret[i] += (long long)T(A[i]).val()<<30;
		ret[i] += (long long)T(B[i]).val()<<15;
		ret[i] += T(C[i]).val();
	}
	return ret;
}

int main(){
	
	mint::set_mod(1234567891);
	
	int n;
	cin>>n;
	
	long long m;
	cin>>m;
	
	vector<int> a(n);
	rep(i,n)cin>>a[i];
	
	vector<mint> dp(25005,0);
	dp[0] = 1;
	
	rep(i,n){
		vector<mint> ndp(25005,0);
		rep(j,dp.size()){
			if(dp[j]==0)continue;
			ndp[j] += dp[j];
			
			ndp[j+a[i]] += dp[j];
		}
		swap(dp,ndp);
	}
	
	vector<mint> ddp(25005,0);
	ddp[0] = 1;
	
	while(m!=0){
		vector<mint> ndp = convolution_mint(dp,ddp);
		rep(i,ndp.size()){
			if(i%2!=m%2)continue;
			ndp[i>>1] = ndp[i];
		}
		while(ndp.size()!=dp.size())ndp.pop_back();
		swap(ddp,ndp);
		m>>=1;
	}
	
	cout<<ddp[0].val()<<endl;
	
	return 0;
}