# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
927407 | May27_th | Bank (IZhO14_bank) | C++17 | 1 ms | 452 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define taskname "A"
using namespace std;
void World_Final();
void Solve();
int main(){
ios_base::sync_with_stdio(false); cin.tie(nullptr);
if (fopen(taskname".inp", "r")) {
freopen(taskname".inp", "r", stdin);
freopen(taskname".out", "w", stdout);
}
World_Final();
}
void World_Final(){
int Tests = 1;
//cin >> Tests;
while (Tests --) {
Solve();
}
}
void Solve(){
int N, M; cin >> N >> M;
vector<int> a(N), b(M), pref(M + 5, 0), cover((1 << M) + 5, 0);
for (int &x : a) cin >> x;
for (int &x : b) cin >> x;
for (int i = 1; i <= M; i ++) {
pref[i] = pref[i - 1] + b[i - 1];
}
for (int mask = 1; mask < (1 << M); mask ++) {
int tot = 0;
for (int i = 0; i < M; i ++) {
if (mask >> i & 1) tot = tot + b[i];
}
int pos = cover[mask];
if (pos == N - 1) {
cout << "YES" << "\n";
return;
}
if (tot - pref[pos] == b[pos]) {
cover[mask] ++;
}
}
cout << "NO" << "\n";
}
/**
**/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |