結果
問題 | No.1701 half price |
ユーザー |
![]() |
提出日時 | 2021-10-08 23:06:45 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 162 ms / 3,000 ms |
コード長 | 2,801 bytes |
コンパイル時間 | 28,878 ms |
コンパイル使用メモリ | 360,260 KB |
最終ジャッジ日時 | 2025-01-24 23:15:04 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 20 |
ソースコード
#pragma region Macros#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>#include <atcoder/all>#include <ext/pb_ds/assoc_container.hpp>#include <ext/pb_ds/tree_policy.hpp>using namespace std;using namespace __gnu_pbds;template <typename T>using ordered_set =tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;#define REP(i,n) for(ll i=0;i<ll(n);i++)#define REPD(i,n) for(ll i=n-1;i>=0;i--)#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)#define overload4(_1,_2,_3,_4,name,...) name#define overload3(_1,_2,_3,name,...) name#define rep1(n) for(ll i=0;i<n;++i)#define rep2(i,n) for(ll i=0;i<n;++i)#define rep3(i,a,b) for(ll i=a;i<b;++i)#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)#define rrep1(n) for(ll i=n;i--;)#define rrep2(i,n) for(ll i=n;i--;)#define rrep3(i,a,b) for(ll i=b;i-->(a);)#define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c)#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)#define ALL(v) v.begin(), v.end()#define endl "\n"#define fi first#define se second#define popcount(bit) __builtin_popcount(bit)#define popcountll(bit) __builtin_popcountll(bit)#define pb push_back#define eb emplace_back#define sz(x) ((ll)(x).size())using namespace atcoder;using P = pair<int, int>;using PL = pair<long long, long long>;using Graph = vector<vector<int>>;typedef long long ll;template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }inline void Yes(bool b = true) { cout << (b ? "Yes" : "No") << '\n'; }inline void YES(bool b = true) { cout << (b ? "YES" : "NO") << '\n'; }inline void OKNG(bool b = true) { cout << (b ? "OK" : "NG") << '\n'; }const int dx[4] = {1, 0, -1, 0};const int dy[4] = {0, 1, 0, -1};const int fx[8] = {0, 1, 1, 1, 0, -1, -1, -1};const int fy[8] = {1, 1, 0, -1, -1, -1, 0, 1};template <typename T>const auto INF = numeric_limits<T>::max()/2;int main() {int n;ll w;cin >> n >> w;vector<ll> A(n);rep(i, n) cin >> A[i];set<ll> res;map<ll, set<ll>> mp;mp[0].insert(0);rep(i, n){map<ll, set<ll>> mp2;for (auto [a, b] : mp){for(auto c : b){ll d = c | (1 << i);mp2[a + A[i]].insert(d);mp2[a + (A[i] / 2)].insert(d);mp2[a].insert(c);}}swap(mp2, mp);}for(auto e : mp[w]){res.insert(e);}res.erase(0);cout << res.size() << endl;}