제출 #1084673

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1084673		chaoslong	은행 (IZhO14_bank)	C++14	19 / 100	69 ms	5460 KiB

bank

// Calm down.
// Think three times, code twice.
#include "bits/stdc++.h"
#define forr(_a,_b,_c) for(int _a = (_b); _a <= (_c); ++_a)
#define ford(_a,_b,_c) for(int _a = (_b) + 1; _a --> (_c);)
#define forf(_a,_b,_c) for(int _a = (_b); _a < (_c); ++_a)
#define st first
#define nd second
#define ll long long
#define ull unsigned long long
#define pii pair <int,int>
#define pll pair <ll,ll>
#define piii pair <int,pii>
#define vi vector <int>
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define mask(i) (1LL << (i))
#define bit(x, i) (((x) >> (i)) & 1)
#define bp __builtin_popcountll
#define file "test"

using namespace std;
const int N = 2e6 + 5;
const int mod = 1e9 + 7; // 998244353
const ll oo = 1e18;

int n, m, a[N], b[N], s[N];
bool dp[25][N];

void to_nho_cau() {
    cin >> n >> m;
    forr(i, 1, n) cin >> a[i];
    forr(i, 1, m) cin >> b[i];
    forr(j, 0, mask(m) - 1) {
        int sum = 0;
        forr(i, 0, m - 1) {
            if(bit(j, i)) {
                sum += b[i + 1];
            }
        }
        s[j] = sum;
    }
    forr(i, 1, n) {
        forr(j, 0, mask(m) - 1) {
//            cout << i << " " << j << " " << s[j] << "\n";
            if(s[j] == a[i]) {
                dp[i][j] = 1;
            }
        }
    }
    forr(j, 0, mask(m) - 1) {
        if(dp[n][j] == 1) {
            cout << "YES\n";
            return;
        }
    }
    cout << "NO\n";
}

signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    #ifdef LOCAL
        freopen(file".inp","r",stdin);
        freopen(file".out","w",stdout);
    #endif
    int t = 1;
    //cin >> t;
    while(t--) to_nho_cau();
}
/*
1.self check:
2.long long
3.size of array
4.code for testing
5.initializing
6.modulo number
*/
/**
  ∧__∧
（｀•ω• )づ__∧
（つ　 /( •ω•。)
  しーＪ (nnノ) pat pat
**/
/**  /\_/\
*   (= ._.)
*   / >☕ \>💻
**/

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

bank.cpp:85:9: warning: "/*" within comment [-Wcomment]
   85 | /**  /\_/\
      |

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