Submission #1001468

#	Time	Username	Problem	Language	Result	Execution time	Memory
1001468		reginox	Bank (IZhO14_bank)	C++17	19 / 100	56 ms	2520 KiB

bank

#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define all(v) begin(v), end(v)
#define pi pair<int, int>
#define vi vector<int>
#define task "test"
using namespace std;
const int maxn = 20;
int n, m, a[maxn], b[maxn];
 
bool dp[maxn][1<<maxn];
 
vector<int> cnt[maxn];
int main(){
    if(fopen(task".inp","r")){
        freopen(task".inp","r",stdin);
        freopen(task".out","w",stdout);
    }
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = 0; i < m; i++) cin >> b[i];
    for(int i = 0; i < 1<<m; i++){
        int sum = 0;
        for(int j = 0; j < m; j++){
            if(i & (1<<j)) sum += b[j];
        }
        // if(sum > 1000) continue;
        for(int j = 1; j <= n; j++){
            if(sum == a[j]) cnt[j].push_back(i);
        }
    }
    for(auto x:cnt[1]){
        dp[1][x] = true;
    }
    for(int j = 2; j <= n; j++){
        for(auto x:cnt[j]){
            int t = x ^ ((1<<n)-1);
            for(int sub = t; sub > 0; sub = (sub-1)&t){
                dp[j][x^sub] |= dp[j-1][sub];
            }
        }
    }
    for(int i = 0; i < 1<<m; i++){
        if(dp[n][i]){
            cout << "YES";
            return 0;
        }
    }
    cout << "NO";
    return 0;
}

Compilation message (stderr)

bank.cpp: In function 'int main()':
bank.cpp:17:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |         freopen(task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
bank.cpp:18:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |         freopen(task".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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