結果

問題 No.137 貯金箱の焦り
ユーザー fumiphysfumiphys
提出日時 2019-08-01 22:46:11
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 308 ms / 5,000 ms
コード長 3,684 bytes
コンパイル時間 1,515 ms
コンパイル使用メモリ 167,256 KB
実行使用メモリ 27,788 KB
最終ジャッジ日時 2023-09-18 18:04:42
合計ジャッジ時間 6,701 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
27,520 KB
testcase_01 AC 31 ms
27,580 KB
testcase_02 AC 43 ms
27,524 KB
testcase_03 AC 25 ms
27,608 KB
testcase_04 AC 107 ms
27,604 KB
testcase_05 AC 107 ms
27,612 KB
testcase_06 AC 107 ms
27,528 KB
testcase_07 AC 78 ms
27,536 KB
testcase_08 AC 78 ms
27,764 KB
testcase_09 AC 107 ms
27,576 KB
testcase_10 AC 72 ms
27,528 KB
testcase_11 AC 25 ms
27,620 KB
testcase_12 AC 308 ms
27,604 KB
testcase_13 AC 308 ms
27,552 KB
testcase_14 AC 308 ms
27,524 KB
testcase_15 AC 267 ms
27,788 KB
testcase_16 AC 273 ms
27,656 KB
testcase_17 AC 170 ms
27,552 KB
testcase_18 AC 262 ms
27,528 KB
testcase_19 AC 303 ms
27,592 KB
testcase_20 AC 32 ms
27,588 KB
testcase_21 AC 204 ms
27,536 KB
testcase_22 AC 78 ms
27,548 KB
testcase_23 AC 72 ms
27,760 KB
testcase_24 AC 152 ms
27,784 KB
testcase_25 AC 238 ms
27,664 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>

// macros
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

//  types
using ll = long long int;
using P = pair<int, int>;
using Pli = pair<ll, int>;
using Pil = pair<int, ll>;
using Pll = pair<ll, ll>;
using Pdd = pair<double, double>;
using cd = complex<double>;

// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const ll mod = 1234567891;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve
int M = 50 * 500 * 2;
ll dp[62][51*500*2];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  INT(n); LL(m); vector<int> a(n); cin >> a;
  m *= 2;
  rep(i, 61){
    if(i > 0){
      rep(j, M + 1){
        if((j % 2) != (m % 2))continue;
        dp[i][j/2] = dp[i-1][j];
      }
    }else{
      dp[0][0] = 1;
    }
    rep(k, n){
      rrep(j, M + 1){
        dp[i][j] = (dp[i][j] + (j - a[k] >= 0 ? dp[i][j - a[k]]: 0)) % mod;
      }
    }
    m >>= 1;
  }
  cout << dp[60][0] << endl;
  return 0;
}
0