oj.uz

Submission #783621

# Submission time Handle Problem Language Result Execution time Memory
783621 2023-07-15T06:33:15 Z abhinavshukla408 Bank (IZhO14_bank) C++14
100 / 100
 129 ms 16724 KB 
#include <iostream>
#include <vector>
#include <set>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <cassert>
#include <math.h>
 
using namespace std;
 
#define endl "\n"
#define int int64_t 
#define pb push_back
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define FOR0(i,a) FOR(i,0,a)
#define FOR1(i,a) for (int i = (1); i <= (a); ++i)
#define TRAV(a,x) for (auto& a: x)

using pii = pair<int,int>;
using vi = vector<int>;

int32_t main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int salary_count,note_count;
	cin>>salary_count>>note_count;
	vi salary(salary_count),notes(note_count);
	FOR0(i,salary_count){cin>>salary[i];}
	FOR0(i,note_count){cin>>notes[i];}

	int dp1[1<<note_count];
	int dp2[1<<note_count];

	FOR0(i,1<<note_count){
		dp1[i]=0;
		dp2[i]=0;
	}

	FOR0(i,1<<note_count){
		FOR0(j,note_count){
			if(dp1[i]==(salary_count)){
				cout<<"YES"<<endl;
				return 0;
			}
			if(i & (1<<j)){
				int old=i & ~(1<<j);
				if(dp1[old]>dp1[i]){
					dp1[i]=dp1[old];
					dp2[i]=dp2[old];
				}
				int curLeft=dp2[old]+notes[j];
				if(salary[dp1[old]]==curLeft && (dp1[old]+1)>dp1[i]){
					dp2[i]=0;
					dp1[i]=dp1[old]+1;
				}else if(salary[dp1[old]]>curLeft && dp1[old]>=dp1[i]){
					dp1[i]=dp1[old];
					dp2[i]=curLeft;
				}
			}
		}
		if(dp1[i]==(salary_count)){
			cout<<"YES"<<endl;
			return 0;
		}
	}
	// FOR0(i,1<<note_count){
	// 	cout<<i<<" "<<dp1[i]<<" "<<dp2[i]<<endl;
	// }
	cout<<"NO"<<endl;
	
	



	return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 92 ms 16724 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 8 ms 16724 KB Output is correct
9 Correct 91 ms 16724 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 0 ms 324 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 92 ms 16724 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 8 ms 16724 KB Output is correct
9 Correct 91 ms 16724 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 0 ms 324 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 576 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 ms 572 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 1 ms 448 KB Output is correct
31 Correct 109 ms 16724 KB Output is correct
32 Correct 110 ms 16724 KB Output is correct
33 Correct 121 ms 16724 KB Output is correct
34 Correct 98 ms 16716 KB Output is correct
35 Correct 107 ms 16724 KB Output is correct
36 Correct 89 ms 16724 KB Output is correct
37 Correct 114 ms 16724 KB Output is correct
38 Correct 92 ms 16724 KB Output is correct
39 Correct 7 ms 16724 KB Output is correct
40 Correct 97 ms 16724 KB Output is correct
41 Correct 91 ms 16724 KB Output is correct
42 Correct 128 ms 16724 KB Output is correct
43 Correct 114 ms 16724 KB Output is correct
44 Correct 98 ms 16716 KB Output is correct
45 Correct 8 ms 16724 KB Output is correct
46 Correct 129 ms 16724 KB Output is correct
47 Correct 98 ms 16724 KB Output is correct
48 Correct 9 ms 16724 KB Output is correct
49 Correct 90 ms 16724 KB Output is correct
50 Correct 85 ms 16608 KB Output is correct
51 Correct 99 ms 16724 KB Output is correct
52 Correct 93 ms 16724 KB Output is correct
53 Correct 102 ms 16708 KB Output is correct
54 Correct 91 ms 16724 KB Output is correct
55 Correct 84 ms 16724 KB Output is correct
56 Correct 88 ms 16624 KB Output is correct
57 Correct 85 ms 16724 KB Output is correct
58 Correct 86 ms 16724 KB Output is correct