Submission #520001

#	Time	Username	Problem	Language	Result	Execution time	Memory
520001		aadit_ambadkar	Bank (IZhO14_bank)	C++11	100 / 100	108 ms	3328 KiB

bank

#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
 
/*
    This code belongs to Aadit Ambadkar
    Date: 2022-01-25 21:41:41
    Problem: bank
*/
#include <bits/stdc++.h>
using namespace::std;
 
typedef long long ll;
#define F0R(i, n) for (int i = 0; i < n; i++)
#define R0F(i, n) for (int i = n-1; i >= 0; i--)
#define FOR(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define fastio ios::sync_with_stdio(0); cin.tie(0)
#define MOD 1000000007
#define FF first
#define SS second
 
vector<int> a;
vector<int> b;
vector<int> work[21];
int n, m;
bool works = false;
vector<vector<bool>> vis(21, vector<bool>(1048576, false));
 
void recur(int ly, int cmsk) {
    vis[ly][cmsk]=true;
    int sm = 0;
    F0R(i, m) {
        if (!(cmsk & (1 << i))) sm+=b[i];
    }
    if (sm < a[ly]) {
        return;
    }
    for (auto msk : work[ly]) {
        if ((msk & cmsk)==0) {
            if (ly==n-1) {
                cout << "YES\n";
                exit(EXIT_SUCCESS);
            }
            if (!vis[ly+1][(msk | cmsk)]) recur(ly+1, (msk | cmsk));
        }
    }
    // for (int msk = cmsk+1; msk < (1<<m); msk++) {
    //     if ((cmsk & msk) == cmsk) {  // learned by thinking
    //         int tmsk = msk ^ cmsk;
    //         int sum = 0;
    //         F0R(i, m) {
    //             if (tmsk & (1<<i)) {
    //                 sum+=b[i];
    //             }
    //             if (sum > a[ly]) break;
    //         }
    //         if (sum==a[ly]) {
    //             if (ly == n-1) {
    //                 cout << "YES\n";
    //                 exit(EXIT_SUCCESS);
    //             } else {
    //                 if (!vis[ly+1][msk]) {
    //                     recur(ly+1, msk);
    //                 }
    //             }
    //         }
    //     }
    // }
}
 
int main() {
    fastio;
    cin >> n >> m;
    
    if (n==1) {
        int k; cin >> k;
        vector<int> arr(m, 0);
        F0R(i, m) cin >> arr[i];
        sort(arr.begin(), arr.end());
        set<int> psbl;
        psbl.insert(0);
        F0R(i, m)
            for (auto it = psbl.rbegin(); it != psbl.rend(); it++) {
                psbl.insert((*it)+arr[i]);
            }
        if (psbl.count(k)) {
            cout << "YES\n";
        } else {
            cout << "NO\n";
        }
    } else {
        int x;
        F0R(i, n) {
            cin >> x;
            a.pb(x);
        }
        F0R(i, m) {
            cin >> x;
            b.pb(x);
        }
        for (int msk = 1; msk < (1<<m); msk++) {
            int sm = 0;
            F0R(i, m) {
                if (msk & (1<<i)) sm+=b[i];
            }
            F0R(i, n) {
                if (sm==a[i]) work[i].pb(msk);
            }
        }
        recur(0, 0);
        cout << "NO\n"; 
    }
}

Compilation message (stderr)

bank.cpp:1: warning: ignoring '#pragma optimization_level ' [-Wunknown-pragmas]
    1 | #pragma optimization_level 3
      | 
bank.cpp:6: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    6 | #pragma GCC optimization ("unroll-loops")
      |

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