結果
問題 | No.1701 half price |
ユーザー | hamath |
提出日時 | 2021-10-08 22:12:48 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2,575 ms / 3,000 ms |
コード長 | 3,688 bytes |
コンパイル時間 | 2,679 ms |
コンパイル使用メモリ | 223,640 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-23 04:38:05 |
合計ジャッジ時間 | 12,955 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,944 KB |
testcase_02 | AC | 110 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 108 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,944 KB |
testcase_06 | AC | 2,567 ms
6,940 KB |
testcase_07 | AC | 2,575 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 2 ms
6,944 KB |
testcase_10 | AC | 2 ms
6,944 KB |
testcase_11 | AC | 2 ms
6,944 KB |
testcase_12 | AC | 2 ms
6,940 KB |
testcase_13 | AC | 2 ms
6,944 KB |
testcase_14 | AC | 2 ms
6,940 KB |
testcase_15 | AC | 2 ms
6,944 KB |
testcase_16 | AC | 2 ms
6,940 KB |
testcase_17 | AC | 1,552 ms
6,944 KB |
testcase_18 | AC | 2 ms
6,940 KB |
testcase_19 | AC | 3 ms
6,944 KB |
testcase_20 | AC | 2 ms
6,940 KB |
testcase_21 | AC | 2,568 ms
6,940 KB |
ソースコード
#ifdef LOCAL//#define _GLIBCXX_DEBUG#endif//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;typedef long long ll;typedef long double ld;typedef pair<ll, ll> P;typedef pair<int, int> Pi;typedef vector<ll> Vec;typedef vector<int> Vi;typedef vector<string> Vs;typedef vector<char> Vc;typedef vector<P> VP;typedef vector<vector<ll>> VV;typedef vector<vector<int>> VVi;typedef vector<vector<char>> VVc;typedef vector<vector<vector<ll>>> VVV;typedef vector<vector<vector<vector<ll>>>> VVVV;#define endl '\n'#define REP(i, a, b) for(ll i=(a); i<(b); i++)#define PER(i, a, b) for(ll i=(a); i>=(b); i--)#define rep(i, n) REP(i, 0, n)#define per(i, n) PER(i, n, 0)const ll INF=1e18+18;const ll MOD=1000000007;#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;#define YES(n) cout << ((n) ? "YES" : "NO") << endl;#define ALL(v) v.begin(), v.end()#define rALL(v) v.rbegin(), v.rend()#define pb(x) push_back(x)#define mp(a, b) make_pair(a,b)#define Each(a,b) for(auto &a :b)#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)#ifdef LOCAL#define dbg(x_) cerr << #x_ << ":" << x_ << endl;#define dbgmap(mp) cerr << #mp << ":"<<endl; for (auto i = mp.begin(); i != mp.end(); ++i) { cerr << i->first <<":"<<i->second << endl;}#define dbgset(st) cerr << #st << ":"<<endl; for (auto i = st.begin(); i != st.end(); ++i) { cerr << *i <<" ";}cerr<<endl;#define dbgarr(n,m,arr) rep(i,n){rep(j,m){cerr<<arr[i][j]<<" ";}cerr<<endl;}#define dbgdp(n,arr) rep(i,n){cerr<<arr[i]<<" ";}cerr<<endl;#else#define dbg(...)#define dbgmap(...)#define dbgset(...)#define dbgarr(...)#define dbgdp(...)#endif#define out(a) cout<<a<<endl#define out2(a,b) cout<<a<<" "<<b<<endl#define vout(v) rep(i,v.size()){cout<<v[i]<<" ";}cout<<endl#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())#define fi first#define se secondtemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }template<typename T1, typename T2>ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}// vectortemplate<typename T>ostream &operator<<(ostream &s, const vector<T> &v) {int len=v.size();for(int i=0; i<len; ++i) {s<<v[i];if(i<len-1) s<<" ";}return s;}// 2 dimentional vectortemplate<typename T>ostream &operator<<(ostream &s, const vector<vector<T> > &vv) {s<<endl;int len=vv.size();for(int i=0; i<len; ++i) {s<<vv[i]<<endl;}return s;}int solve(){ll n;cin>>n;ll w;cin>>w;Vec A(n);cin>>A;set<ll> st;auto f = [&](Vec &a)->void{ll bits = 1LL<<n;rep(bit, bits){if(bit==0)continue;ll sum = 0;rep(i,n){if((bit>>i) & 1){sum += a[i];}}if(sum == w){st.insert(bit);}}return;};ll bits = 1LL<<n;rep(bit,bits){Vec a = A;rep(i,n){if((bit>>i) & 1){a[i] /= 2;}}f(a);}out(st.size());return 0;}int main() {cin.tie(nullptr);ios::sync_with_stdio(false);cout<<std::setprecision(10);// ll T;// cin>>T;// while(T--)solve();}