結果

問題 No.137 貯金箱の焦り
ユーザー lbm364dllbm364dl
提出日時 2023-05-03 00:51:03
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,219 ms / 5,000 ms
コード長 2,861 bytes
コンパイル時間 660 ms
コンパイル使用メモリ 82,644 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-05-01 08:36:30
合計ジャッジ時間 12,622 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 14 ms
6,812 KB
testcase_01 AC 14 ms
6,940 KB
testcase_02 AC 116 ms
6,940 KB
testcase_03 AC 4 ms
6,940 KB
testcase_04 AC 122 ms
6,940 KB
testcase_05 AC 46 ms
6,944 KB
testcase_06 AC 116 ms
6,940 KB
testcase_07 AC 83 ms
6,944 KB
testcase_08 AC 86 ms
6,940 KB
testcase_09 AC 130 ms
6,940 KB
testcase_10 AC 74 ms
6,940 KB
testcase_11 AC 38 ms
6,940 KB
testcase_12 AC 1,207 ms
6,940 KB
testcase_13 AC 164 ms
6,940 KB
testcase_14 AC 1,219 ms
6,944 KB
testcase_15 AC 1,084 ms
6,944 KB
testcase_16 AC 1,088 ms
6,944 KB
testcase_17 AC 622 ms
6,940 KB
testcase_18 AC 1,019 ms
6,940 KB
testcase_19 AC 1,215 ms
6,940 KB
testcase_20 AC 58 ms
6,944 KB
testcase_21 AC 764 ms
6,940 KB
testcase_22 AC 247 ms
6,940 KB
testcase_23 AC 225 ms
6,940 KB
testcase_24 AC 531 ms
6,940 KB
testcase_25 AC 913 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

//#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <queue>
//#include <atcoder/all>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
//using namespace atcoder;

#ifdef LOCAL
#define show(x) cerr << #x" = " << (x) << "\n"
#else
#define show(x) 0
#endif

#define pb push_back
#define pp pop_back
#define mp make_pair
#define fst first
#define snd second
#define FOR(var, from, to) for(int var = from; var < int(to); ++var)
#define all(x) x.begin(), x.end()
#define rev(x) x.rbegin(), x.rend()
#define sz(x) int(x.size())
#define vec(x) vector<x>
#define INF 2000000000

//using mint = modint998244353;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
// use unique second element of pair to work as multiset
//typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
const ll mod = 1234567891, mod2 = 998244353;

template<typename T, typename U> ostream &operator<<(ostream &os, pair<T,U> p){os << "(" << p.fst << "," << p.snd << ")"; return os;}
template<typename T, typename U> istream &operator>>(istream &is, pair<T,U> &p){is >> p.fst >> p.snd; return is;}
template<typename T> istream &operator>>(istream &is, vector<T> &v){FOR(i, 0, v.size()) is >> v[i]; return is;}
template<typename T> ostream &operator<<(ostream &os, vector<T> v){for(T x : v) os << x << " "; return os;}
template<typename T> ostream &operator<<(ostream &os, set<T> s){for(T x : s) os << x << " "; return os;} 
template<typename T> ostream &operator<<(ostream &os, multiset<T> s){for(T x : s) os << x << " "; return os;} 
template<typename T, typename U> ostream &operator<<(ostream &os, map<T,U> m){for(auto x : m) os << x << " "; return os;} 
//ostream &operator<<(ostream &os, ordered_set s){for(int x : s) os << x << " "; return os;} 
//ostream &operator<<(ostream &os, ordered_multiset s){for(pii x : s) os << x.fst << " "; return os;} 
ll mod_pow(ll a, ll b, ll m){ ll sol = 1; while(b){ if(b&1){ sol = (sol*a)%m; b--; }else{ a = (a*a)%m; b/=2; } } return sol;}
ll rem(ll a, ll b){ ll res = a%b; return res < 0 ? res+b : res; }

void test_case(){
	ll n, m; cin >> n >> m;
	vec(int) v(n); cin >> v;
	int lim = 500 * 500 + 5;
	vec(ll) dp(lim);
	dp[0] = 1;
	while(m){
		for(int x : v){
			for(int i = lim-1; i > 0; --i){
				if(i-x < 0) continue;
				dp[i] += dp[i-x];
				dp[i] %= mod;
			}
		}
		for(int i = 0; i < lim; ++i){
			int who = 2*i + m%2;
			dp[i] = who < lim ? dp[who] : 0LL;
		}
		m /= 2;
	}
	cout << dp[0] << "\n";
}

int main(){
	#ifndef LOCAL
	ios_base::sync_with_stdio(false);
  	cin.tie(NULL);
	#endif

	int t = 1;
	FOR(i, 0, t) test_case();
	return 0;
}
0