| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 671449 | Alihan_8 | 은행 (IZhO14_bank) | C++17 | 77 ms | 37464 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>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m; cin >> n >> m;
vector <int> a(n), b(m);
for ( auto &i: a ) cin >> i;
for ( auto &i: b ) cin >> i;
const int N = 2e4+1;
vector <int> g[N];
for ( int mask = 1; mask < (1 << m); mask++ ){
int cnt = 0;
for ( int i = 0; i < m; i++ ){
if ( mask >> i & 1 ) cnt += b[i];
}
g[cnt].pb(mask);
}
const int S = 1 << m;
vector <vector<int>> dp(n+1, vector <int> (S));
for ( int mask = 0; mask < S; mask++ ) dp[0][mask] = 1;
for ( int i = 1; i <= n; i++ ){
for ( auto j: g[a[i-1]] ){
dp[i][S-1] |= dp[i-1][(S-1)^j];
}
}
if ( dp[n].back() ) cout << "YES";
else cout << "NO";
cout << '\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... | ||||
