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>
#define INF 1000000021
#define MOD 1000000007
#define pb push_back
#define sqr(a) (a)*(a)
#define M(a, b) make_pair(a,b)
#define T(a, b, c) make_pair(a, make_pair(b, c))
#define F first
#define S second
#define all(x) (x.begin(), x.end())
#define deb(x) cerr << #x << " = " << x << '\n'
#define N 222222
using namespace std;
//using namespace __gnu_pbds;
typedef long double ld;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
const ld pi = 2 * acos(0.0);
template<class T> bool umin(T& a, T b){if(a>b){a=b;return 1;}return 0;}
template<class T> bool umax(T& a, T b){if(a<b){a=b;return 1;}return 0;}
template<class T, class TT> bool pal(T a, TT n){int k=0;for(int i=0;i<=n/2;i++){if(a[i]!=a[n-i-1]){k=1;break;}}return k?0:1;}
//int month[] = {0,31,28,31,30,31,30,31,31,30,31,30,31};
ll a[N], b[N];
int n, m;
map<pair<int, vi>, int> mp;
void f(int id, vector<int> v)
{
if(id == m)
{
for(int i = 1; i <= n; i ++)
{
if(v[i] != a[i])
return;
}
cout << "YES\n";
exit(0);
}
if(mp.count(M(id, v)))
return;
for(int i = 1; i <= n; i ++)
{
v[i] += b[id];
if(v[i]<=a[i])
f(id+1, v);
v[i] -= b[id];
}
f(id+1,v);
mp[M(id, v)] = 1;
}
int main()
{
ios::sync_with_stdio(false);
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];
vi v(n+1,0);
f(0, v);
cout << "NO";
getchar();
getchar();
return 0;
}
Compilation message (stderr)
bank.cpp: In function 'void f(int, std::vector<int>)':
bank.cpp:54:7: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
if(v[i]<=a[i])
^~
bank.cpp:56:3: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
v[i] -= b[id];
^
# | 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... |