oj.uz

Submission #436594

# Submission time Handle Problem Language Result Execution time Memory
436594 2021-06-24T16:35:52 Z Trinadh724 Bank (IZhO14_bank) C++17
100 / 100
 143 ms 16720 KB 
#include<iostream>
#include<vector>
#include<algorithm>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<string>
#include<math.h>

using namespace std;
#define ll long long
#define pb push_back
#define ld long double
#define ff first
#define ss second

#define mod 1000000007
ll cd(ll a,ll b)
{
	if(a==0)return b;
	else if (b==0)return a;
	else return cd(b,a%b);
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	// freopen("bank.in", "r", stdin);
	// freopen("bank.out", "w", stdout);

	ll n, m;
	cin>>n>>m;
	ll a[n+5], b[m+5];
	for(int i=0;i<n;i++){
		cin>>a[i];
	}	
	for(int j=0;j<m;j++){
		cin>>b[j];
	}

	pair<ll,ll> notes[1<<m];

	for(int i=0;i<(1<<n); i++){
		notes[i] = {0,0};
	}
	ll ans = -1, curr, mon;

	for(int i=0;i<(1<<m); i++){

		for(int s=0;s<m;s++){
			if(i & (1<<s)){
				curr = notes[i ^ (1<<s)].ff;
				mon = notes[i ^ (1<<s)].ss;
				if(mon + b[s] == a[curr]){
					curr++;
					mon = 0;
					notes[i] = max(notes[i], {curr, mon});
				}
				else{
					mon += b[s];
					notes[i] = max(notes[i], {curr, mon});

				}
			}	
		}
		// cout<<i<<" "<<notes[i].ff<<" "<<notes[i].ss<<endl;
		if(notes[i].ff >= n){
			cout<<"YES"<<endl;
			return 0;
		}
	}
	cout<<"NO"<<endl;
	return 0;


}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:49:5: warning: unused variable 'ans' [-Wunused-variable]
   49 |  ll ans = -1, curr, mon;
      |     ^~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 716 KB Output is correct
5 Correct 116 ms 16716 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 12 ms 16716 KB Output is correct
9 Correct 107 ms 16716 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 716 KB Output is correct
5 Correct 116 ms 16716 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 12 ms 16716 KB Output is correct
9 Correct 107 ms 16716 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 2 ms 460 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 2 ms 564 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 2 ms 568 KB Output is correct
28 Correct 2 ms 460 KB Output is correct
29 Correct 2 ms 568 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 118 ms 16716 KB Output is correct
32 Correct 128 ms 16716 KB Output is correct
33 Correct 125 ms 16716 KB Output is correct
34 Correct 116 ms 16716 KB Output is correct
35 Correct 117 ms 16716 KB Output is correct
36 Correct 112 ms 16716 KB Output is correct
37 Correct 114 ms 16716 KB Output is correct
38 Correct 106 ms 16716 KB Output is correct
39 Correct 11 ms 16716 KB Output is correct
40 Correct 111 ms 16716 KB Output is correct
41 Correct 109 ms 16716 KB Output is correct
42 Correct 143 ms 16720 KB Output is correct
43 Correct 118 ms 16716 KB Output is correct
44 Correct 108 ms 16716 KB Output is correct
45 Correct 13 ms 16716 KB Output is correct
46 Correct 133 ms 16716 KB Output is correct
47 Correct 117 ms 16716 KB Output is correct
48 Correct 12 ms 16716 KB Output is correct
49 Correct 105 ms 16716 KB Output is correct
50 Correct 109 ms 16716 KB Output is correct
51 Correct 113 ms 16716 KB Output is correct
52 Correct 110 ms 16716 KB Output is correct
53 Correct 127 ms 16704 KB Output is correct
54 Correct 127 ms 16716 KB Output is correct
55 Correct 128 ms 16716 KB Output is correct
56 Correct 110 ms 16712 KB Output is correct
57 Correct 119 ms 16716 KB Output is correct
58 Correct 111 ms 16716 KB Output is correct