Submission #536044

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
536044	2022-03-12T08:04:10 Z	ctd6969	Bank (IZhO14_bank)	C++17	100 / 100	123 ms	8540 KB

bank

#pragma GCC optimize ("Ofast")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double db;

const ll mod = 1e9 + 7; // 500057 , 1000037 ,10000931 , 90903649 , 998244353, 109000057 , 1090000039
const ll inf = 1e18;

using pl = pair<ll,ll>;
using pi = pair<int,int>;
using vi = vector<int>; 
using vl = vector<ll>; 
using vpi = vector<pair<int,int>>;
using vpl = vector<pair<ll,ll>>;


#define mp make_pair
#define f first
#define s second

#define foru(i,a,b) for(int i = a ; i <= b;i++)
#define ford(i,a,b) for(int i = a ; i >= b;i--)

#define psh push
#define em emplace
#define eb emplace_back
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define debug(x) cout << x <<" ";



// #define LOCAL 1

void process(){
	int n , m;
	cin >> n >> m;
	ll a[n] , b[m];

	foru(i,0,n-1) cin >> a[i];
	foru(i,0,m-1) cin >> b[i];
	
	vi cover( (1<<m) , -1 );
	vi left( (1<<m) , -1 );

	bool ans = 0;
	cover[0] = 0;
	left[0] = 0;
	foru(i,0, (1<<m) - 1){
		foru(j,0,m-1){
			if( !((i>>j)&1) ) continue;

			int newmask = i^(1<<j);

			if(cover[newmask] == -1) continue;
			
			if( left[newmask] + b[j] < a[cover[newmask]] ){
				cover[i] = cover[newmask] ;
				left[i] = left[newmask] + b[j];
			} 
			else if( left[newmask] + b[j] == a[cover[newmask]] ) {
				cover[i] = cover[newmask] + 1;
				left[i] = 0;
			}
		}
		if( cover[i] == n ) {
			ans = 1;
			break;
		}
	}

	if(ans) cout << "YES" << '\n';
	else cout << "NO" << '\n';
}	


int main(void){

	#ifdef LOCAL
		freopen("input.txt","r",stdin);
		freopen("output.txt","w",stdout);
		auto start_time = chrono::high_resolution_clock::now();
	#endif 

	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	
	process();

	#ifdef LOCAL
		auto end_time = chrono::high_resolution_clock::now();
		double duration = chrono::duration_cast<chrono::milliseconds>(end_time - start_time).count();
		cout << "\n[ " << duration << " ms ]\n";
	#endif

}

Subtask #1
19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	468 KB	Output is correct
5	Correct	74 ms	8480 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	5 ms	8532 KB	Output is correct
9	Correct	81 ms	8532 KB	Output is correct

Subtask #2
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	324 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 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	340 KB	Output is correct
2	Correct	2 ms	448 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	2 ms	448 KB	Output is correct
6	Correct	2 ms	340 KB	Output is correct
7	Correct	3 ms	440 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	2 ms	340 KB	Output is correct
10	Correct	2 ms	448 KB	Output is correct
11	Correct	2 ms	448 KB	Output is correct

Subtask #4
29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	468 KB	Output is correct
5	Correct	74 ms	8480 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	5 ms	8532 KB	Output is correct
9	Correct	81 ms	8532 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	324 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	2 ms	340 KB	Output is correct
21	Correct	2 ms	448 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	2 ms	448 KB	Output is correct
25	Correct	2 ms	340 KB	Output is correct
26	Correct	3 ms	440 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	2 ms	340 KB	Output is correct
29	Correct	2 ms	448 KB	Output is correct
30	Correct	2 ms	448 KB	Output is correct
31	Correct	102 ms	8532 KB	Output is correct
32	Correct	107 ms	8540 KB	Output is correct
33	Correct	89 ms	8532 KB	Output is correct
34	Correct	82 ms	8532 KB	Output is correct
35	Correct	77 ms	8532 KB	Output is correct
36	Correct	73 ms	8532 KB	Output is correct
37	Correct	82 ms	8532 KB	Output is correct
38	Correct	79 ms	8532 KB	Output is correct
39	Correct	4 ms	8532 KB	Output is correct
40	Correct	76 ms	8532 KB	Output is correct
41	Correct	75 ms	8532 KB	Output is correct
42	Correct	123 ms	8532 KB	Output is correct
43	Correct	78 ms	8532 KB	Output is correct
44	Correct	72 ms	8508 KB	Output is correct
45	Correct	6 ms	8532 KB	Output is correct
46	Correct	99 ms	8532 KB	Output is correct
47	Correct	72 ms	8532 KB	Output is correct
48	Correct	4 ms	8532 KB	Output is correct
49	Correct	72 ms	8532 KB	Output is correct
50	Correct	98 ms	8532 KB	Output is correct
51	Correct	70 ms	8532 KB	Output is correct
52	Correct	84 ms	8532 KB	Output is correct
53	Correct	113 ms	8532 KB	Output is correct
54	Correct	106 ms	8532 KB	Output is correct
55	Correct	104 ms	8532 KB	Output is correct
56	Correct	99 ms	8532 KB	Output is correct
57	Correct	109 ms	8528 KB	Output is correct
58	Correct	106 ms	8528 KB	Output is correct

Submission #536044

Compilation message

Subtask #1 19.0 / 19.0

Subtask #2 25.0 / 25.0

Subtask #3 27.0 / 27.0

Subtask #4 29.0 / 29.0

Subtask #1
19.0 / 19.0

Subtask #2
25.0 / 25.0

Subtask #3
27.0 / 27.0

Subtask #4
29.0 / 29.0