제출 #915183

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
915183		Whisper	은행 (IZhO14_bank)	C++14	100 / 100	375 ms	61872 KiB

bank

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using T = tuple<ll, ll, ll>;

//#define int long long
#define Base 41
#define sz(a) (int)a.size()
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define all(x) x.begin() , x.end()
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e4 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int N, M;
int a[MAX], b[MAX];

#define LIM 1000
int mask[MAX];
int dp[21][MASK(20)];
vector<int> nxt[MAX];
void Whisper(){
    cin >> N >> M;
    REP(i, N) cin >> a[i];
    REP(i, M) cin >> b[i];
    REP(msk, MASK(M)){
        int sum = 0;
        REP(i, M) if(BIT(msk, i)) sum += b[i];
        if (sum > LIM) continue;
        nxt[sum].push_back(msk);
    }
    dp[0][0] = 1;
    REP(i, N) REP(msk, MASK(M)){
        if (!dp[i][msk]) continue;
        for (auto&nxt_msk : nxt[a[i]]){
            if ((nxt_msk & msk) == 0) dp[i + 1][msk ^ nxt_msk] |= dp[i][msk];
        }
    }
    int ans = 0;
    REP(msk, MASK(M)){
        ans |= dp[N][msk];
    }
    cout << (ans ? "YES" : "NO");
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

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