Submission #757065

#TimeUsernameProblemLanguageResultExecution timeMemory
757065amine_arouaBank (IZhO14_bank)C++17
100 / 100
489 ms90128 KiB
#include <bits/stdc++.h> #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") using namespace std; #define vi vector<int> #define vl vector<long long> #define vii vector<pair<int,int>> #define vll vector<pair<long long,long long>> #define pb push_back #define ll long long #define ld long double #define nl '\n' #define boost ios::sync_with_stdio(false) #define mp make_pair #define se second #define fi first #define fore(i, y) for(ll i = 0; i < y; i++) #define forr(i,x,y) for(int i = x;i<=y;i++) #define forn(i,y,x) for(ll i = y; i >= x; i--) #define all(v) v.begin(),v.end() #define sz(v) v.size() #define clr(v,k) memset(v,k,sizeof(v)) #define rall(v) v.rbegin() , v.rend() #define pii pair<int,int> #define pll pair<ll , ll> const ll MOD = 1e9 + 7; const ll INF = 1e18 + 1; ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD) ll lcm(ll a , ll b) {return a * (b / gcd(a , b));} // least common multiple (PPCM) // HERE IS THE SOLUTION int n; vi salary; vector<vi> values(20001); vector<vi> dp; bool solve(int i , int mask) { if(i == n)return 1; int ans = dp[i][mask]; if(ans != -1)return ans; ans = 0; for(auto msk : values[salary[i]]) { if((msk & mask) != (msk))continue; ans|=solve(i + 1 , (msk^mask)); } return dp[i][mask] = ans; } int main() { cin.tie(0); cout.tie(0); boost; int m; cin>>n>>m; vi bank(m) ; dp.assign(n , vi(1<<m , -1)); salary.assign(n , 0); fore(i , n) { cin>>salary[i]; } fore(i , m) { cin>>bank[i]; } fore(mask , (1<<m) - 1) { int sum = 0; fore(i , m) { if((1<<i)&mask) { sum+=bank[i]; } } values[sum].pb(mask); } bool ans = solve(0 , (1<<m) - 1); if(ans)cout<<"YES"<<nl; else cout<<"NO"<<nl; }

Compilation message (stderr)

bank.cpp: In function 'bool solve(int, int)':
bank.cpp:49:24: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   49 |     return dp[i][mask] = ans;
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...