| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 899418 | nasir_bashirov | Bank (IZhO14_bank) | C++11 | 1082 ms | 600 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.
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
#define db long double
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define vll vector<pll>
#define endl '\n'
#define all(x) x.begin(), x.end()
#define fastio\
ios_base::sync_with_stdio(0);\
cin.tie(0);\
cout.tie(0)\
#define int long long
int a[25], b[25], n, m;
signed main(){
cin >> n >> m;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
if(n == 1){
for(int mask = 1; mask < (1 << m); mask++){
int s = 0;
for(int j = 0; j < m; j++){
if((1 << j) & mask){
s += b[j + 1];
}
}
if(s == a[1]){
cout << "YES";
return 0;
}
}
cout << "NO";
return 0;
}
vi v;
for(int i = 1; i <= m; i++){
cin >> b[i];
v.push_back(i);
}
do{
int p = 1, cur = 0, s = 0;
while(p <= n and cur < v.size()){
s += b[v[cur]];
cur++;
if(s == a[p]) p++, s = 0;
}
if(p == n + 1){
cout << "YES";
return 0;
}
}while(next_permutation(all(v)));
cout << "NO";
}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... | ||||
