# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1222056 | quangminh412 | 은행 (IZhO14_bank) | C++17 | 68 ms | 12552 KiB |
/*
Ben Watson
Handle codeforces : quangminh98
Mua Code nhu mua Florentino !!
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const string name = "test";
void solve();
signed main()
{
if (fopen((name + ".inp").c_str(), "r"))
{
freopen((name + ".inp").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
solve();
return 0;
}
// main program
const int bit = (1 << 20);
const int maxn = 21;
int n, m;
int a[maxn], b[maxn];
int dp[maxn][bit], s[bit];
void solve()
{
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= m; i++)
cin >> b[i];
for (int mask = 0; mask < (1 << m); mask++)
{
dp[0][mask] = 1;
for (int i = 0; i < m; i++)
if (mask >> i & 1)
s[mask] += b[i + 1];
}
int full = (1 << m) - 1;
for (int i = 1; i <= n; i++)
for (int mask = 0; mask < (1 << m); mask++)
if (s[mask] == a[i] && dp[i - 1][mask ^ full] == 1)
dp[i][mask] = 1;
int res = 0;
for (int mask = 0; mask < (1 << m); mask++)
res |= dp[n][mask];
cout << (res == 1 ? "YES\n" : "NO\n");
}
컴파일 시 표준 에러 (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... |