제출 #1152689

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1152689		MPG	Bank (IZhO14_bank)	C++20	100 / 100	86 ms	16868 KiB

bank

//#pragma GCC optomize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC target("sse,sse2,sse4.1,sse4.2") 



#include <bits/stdc++.h>
using namespace std;
typedef long long                           ll;
#define                                     max_heap priority_queue<pair <ll, pair <ll, ll>>>
#define                                     min_heap priority_queue<pair <ll, pair <ll, ll>>, vector<pair <ll, pair <ll, ll>>>, greater<pair <ll, pair <ll, ll>>>>
//#define                                     min_heap priority_queue<ll, vector<ll>, greater<ll>>
#define                                     sariE cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false);
#define                                     filE freopen("in.txt", "r", stdin); freopen("out1.txt", "w", stdout); 
#define                                     endl '\n'
#define                                     md(a) (a % mod + mod) % mod
#define pb push_back
//cout << vectorprecision(5) << fixed << f;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll const maxn = 5e5 + 123;
ll const inf = 2e18;
ll const loG = 23;
ll const mod = 1e9 + 7;
//ll const mod = 998244353;
ll const sq = 350;
ll power(ll a, ll b, ll mod){if(b==0)return 1;if(b==1)return a;ll x = power(a, b / 2, mod);return (((x * x) % mod) * (b % 2 ? a : 1)) % mod;}


ll n, m, arr[50], pol[50], dp[maxn * 3], bag[maxn * 3];

void Solve(){

cin >> n >> m;
for (int i = 0; i < n; i++)
    cin >> arr[i];
for (int i = 0; i < m; i++)
    cin >> pol[i];

for (int i = 1; i < (1 << m); i++)
    dp[i] = -1;



bool done = 0;
for (int i = 1; i < (1 << m); i++){
    for (int j = 0; j < m; j++){
        if (!(i & (1 << j)))
            continue;
        ll x = i ^ (1 << j);
        if (dp[x] < 0)
            continue;
        ll now = bag[x] + pol[j];
        //cout << i << ' ' << x << ' ' << now  << ' ' << dp[x] << endl;
        if (now < arr[dp[x]]){
            dp[i] = dp[x];
            bag[i] = now;

        }
        else if (now == arr[dp[x]]){
            dp[i] = dp[x] + 1;
            bag[i] = 0;
        }
    }
    if (dp[i] == n){
        done = 1;
        break;
    }
    //cout << i << ' ' << dp[i] << ' ' << bag[i] << endl;
}
cout << (done ? "YES" : "NO") << endl;


}



int main(){
sariE;// filE;



int test = 1;
//cin >> test;
while (test--) Solve();
return 0;
}

• Subtask 1: 19 / 19
• Subtask 2: 25 / 25
• Subtask 3: 27 / 27
• Subtask 4: 29 / 29