結果

問題 No.137 貯金箱の焦り
ユーザー fumiphysfumiphys
提出日時 2019-09-15 15:57:00
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 241 ms / 5,000 ms
コード長 3,461 bytes
コンパイル時間 1,487 ms
コンパイル使用メモリ 171,652 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-06 22:45:45
合計ジャッジ時間 4,335 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
6,812 KB
testcase_01 AC 4 ms
6,944 KB
testcase_02 AC 25 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 25 ms
6,940 KB
testcase_05 AC 10 ms
6,944 KB
testcase_06 AC 24 ms
6,940 KB
testcase_07 AC 17 ms
6,944 KB
testcase_08 AC 18 ms
6,944 KB
testcase_09 AC 26 ms
6,940 KB
testcase_10 AC 16 ms
6,940 KB
testcase_11 AC 11 ms
6,940 KB
testcase_12 AC 224 ms
6,944 KB
testcase_13 AC 32 ms
6,940 KB
testcase_14 AC 222 ms
6,940 KB
testcase_15 AC 193 ms
6,940 KB
testcase_16 AC 203 ms
6,940 KB
testcase_17 AC 118 ms
6,940 KB
testcase_18 AC 194 ms
6,944 KB
testcase_19 AC 241 ms
6,940 KB
testcase_20 AC 14 ms
6,944 KB
testcase_21 AC 147 ms
6,944 KB
testcase_22 AC 51 ms
6,940 KB
testcase_23 AC 43 ms
6,940 KB
testcase_24 AC 102 ms
6,940 KB
testcase_25 AC 173 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#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 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 bit(n) (1LL<<(n))
// functions
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>;
// 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};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

ll dp[2][50010];

int main(int argc, char const* argv[])
{
  int n;
  ll m;
  cin >> n >> m;
  vector<ll> a(n);
  cin >> a;
  dp[0][0] = 1;
  while(m){
    rep(i, n){
      rep(j, 50001){
        dp[(i+1)&1][j] = (dp[i&1][j]);
        if(j - a[i] >= 0)(dp[(i+1)&1][j] += dp[i&1][j-a[i]]) %= mod;
      }
    }
    if((n & 1) == 0){
      rep(j, 50001){
        dp[1][j] = dp[0][j];
      }
    }
    rep(j, 50001)dp[0][j] = 0;
    rep(j, 50001){
      if((j & 1) == (m & 1)){
        (dp[0][j/2] += dp[1][j]) %= mod;
      }
    }
    m /= 2;
  }
  cout << dp[0][0] << endl;
  return 0;
}
0