oj.uz

Submission #340891

# Submission time Handle Problem Language Result Execution time Memory
340891 2020-12-28T13:11:18 Z amunduzbaev Bank (IZhO14_bank) C++14
100 / 100
 863 ms 129900 KB 
/** made by amunduzbaev **/
 
#include <bits/stdc++.h>
using namespace std;
 
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
 
const int N = 21;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
int s, n, m, k, ans;
int used[(1 << N)][N], tmp[1<<N][N];
vii make[N];
int a[N], b[N], ok = 1;
ll cnt = 0;

void bit(int x){
	for(int i=0;i<m;i++) cout<<((x & (1<<i)) ? 1:0);
	cout<<endl;
}

bool check(int k = 0, int mask = 0){
	if(used[mask][k]) return tmp[mask][k];
	used[mask][k] = 1;
	if(k == n) return 1;
	for(auto x:make[k]){
		int res = 0;
		if((x & mask) == 0) res = check(k+1, mask | x);
		if(res) tmp[mask][k] = 1;
	}
	return tmp[mask][k];
}

void solve(){
	cin>>n>>m;
	ll suma = 0, sumb = 0;
	for(int i=0;i<n;i++) { cin>>a[i]; suma += a[i]; }
	for(int j=0;j<m;j++) { cin>>b[j]; sumb += b[j]; }
	
	if(suma > sumb){
		cout<<"NO\n";
		return;
	}
	
	for(int i=0;i<(1<<m);i++){
		int sum = 0;
		for(int j=0;j<m;j++) if(i & (1<<j)) sum+= b[j];
		for(int j=0;j<n;j++) if(sum == a[j]) make[j].pb(i);
	}
	
	if(check()) cout<<"YES\n";
	else cout<<"NO\n";
	return;
}

/*

2 2
10 10
10 10

20 20
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

1 3
10 
5 5 5

3 6
9 8 11
5 4 8 6 3 11

*/

int main(){
	fastios
	int t = 0;
	if(!t) solve();
	else {
		cin>>t;
		while (t--) solve();
	}
	return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 1004 KB Output is correct
5 Correct 63 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 81 ms 28012 KB Output is correct
9 Correct 63 ms 364 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 1004 KB Output is correct
5 Correct 63 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 81 ms 28012 KB Output is correct
9 Correct 63 ms 364 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 2 ms 364 KB Output is correct
21 Correct 2 ms 492 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 2 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 2 ms 364 KB Output is correct
27 Correct 2 ms 364 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 2 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 68 ms 4972 KB Output is correct
32 Correct 148 ms 35948 KB Output is correct
33 Correct 84 ms 2412 KB Output is correct
34 Correct 76 ms 620 KB Output is correct
35 Correct 75 ms 492 KB Output is correct
36 Correct 82 ms 492 KB Output is correct
37 Correct 64 ms 492 KB Output is correct
38 Correct 67 ms 364 KB Output is correct
39 Correct 210 ms 93164 KB Output is correct
40 Correct 74 ms 364 KB Output is correct
41 Correct 0 ms 364 KB Output is correct
42 Correct 92 ms 23020 KB Output is correct
43 Correct 73 ms 1552 KB Output is correct
44 Correct 80 ms 400 KB Output is correct
45 Correct 84 ms 23916 KB Output is correct
46 Correct 74 ms 5228 KB Output is correct
47 Correct 80 ms 492 KB Output is correct
48 Correct 85 ms 11884 KB Output is correct
49 Correct 64 ms 364 KB Output is correct
50 Correct 467 ms 129900 KB Output is correct
51 Correct 76 ms 1644 KB Output is correct
52 Correct 101 ms 26348 KB Output is correct
53 Correct 863 ms 96616 KB Output is correct
54 Correct 550 ms 129900 KB Output is correct
55 Correct 497 ms 129772 KB Output is correct
56 Correct 515 ms 129772 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 516 ms 129772 KB Output is correct