제출 #661251

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
661251		hafo	은행 (IZhO14_bank)	C++17	100 / 100	519 ms	8528 KiB

bank

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pa pair<int, int>
#define pall pair<ll, int>
#define fi first
#define se second
#define TASK "test"
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T1, typename T2> bool mini (T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi (T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}

const int MOD = 1e9 + 7;
const int LOG = 20;
const int maxn = 20;
const ll oo = 1e15 + 69;

int n, m, a[maxn], b[maxn], dp[2][1 << maxn];

bool getbit(const int mask, int i) {
    return ((mask >> i) & 1);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);

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

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

    dp[0][(1 << m) - 1] = 0;
    for(int i = 0; i < n; i++)
        for(int mask = (1 << m) - 1; mask; mask--) {
            if(dp[i & 1][mask] != -1)
                for(int x = mask; x; x -= x&-x) {
                    int j = __builtin_ctz(x), s = dp[i & 1][mask] + b[j], add = (s == a[i]);
                    dp[i & 1 ^ add][mask ^ (1 << j)] = (add == 0 ? s:0);
                    if(i + add == n) {
                        cout<<"YES";
                        exit(0);
                    }
                }
            dp[i & 1][mask] = -1;
        }
    cout<<"NO";
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

bank.cpp: In function 'int main()':
bank.cpp:47:26: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   47 |                     dp[i & 1 ^ add][mask ^ (1 << j)] = (add == 0 ? s:0);
      |                        ~~^~~

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