oj.uz

Submission #958373

# Submission time Handle Problem Language Result Execution time Memory
958373 2024-04-05T14:47:49 Z FanOfWilliamLin Bank (IZhO14_bank) C++14
100 / 100
 108 ms 16976 KB 
#include <bits/stdc++.h>
using namespace std;
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template <class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define int long long 
#define ll long long
#define ld long double
#define ar array
#define vt vector
#define pb push_back
#define bit(i, x) ((x>>i)&1ULL)
#define pf push_front
#define all(v) v.begin(), v.end()
#define lla(v) v.rbegin(), v.rend()

const ll INF=1e18;
const ll MOD=1e9+7;
const ll M=(1ll<<61)-1;
//const ll MOD=998244353; 

mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
const ll base=uniform_int_distribution<ll>(0, M-1)(rng);

ll bpow(ll a, ll b, ll DOMDOM) {
	a%=DOMDOM;
	ll res=1;
	while(b>0) {
		if(b&1)
			res=res*a%DOMDOM;
		a=a*a%DOMDOM;
		b>>=1;
	}
	return res;
}

ll floor_div(ll x, ll y) {
	assert(y!=0);
	if (y<0) {
		y=-y;
		x=-x;
	}
	if (x>=0) return x/y;
	return (x+1)/y-1;
}

ll ceil_div(ll x, ll y) {
	assert(y!=0);
	if (y<0) {
		y=-y;
		x=-x;
	}
	if (x<=0) {
		return x/y;
	}
	return (x-1)/y+1;
}

const int d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};
const int d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};

void tmw() {
	//solve here
	int n, m;
	cin >> n >> m;
	vt<int> a(n), b(m);
	for(auto& ele: a) {
		cin >> ele;
	}
	for(auto& ele: b) {
		cin >> ele;
	}
	vt<int> cover((1<<m)+1, -1);
	vt<int> left((1<<m)+1, -1);
	cover[0]=0;
	left[0]=0;
	for(int msk=1; msk<(1<<m); ++msk) {
		for(int i=0; i<m; ++i) {
			if(!bit(i, msk)) {
				continue;
			}
			int pre_msk=msk-(1<<i);
			if(left[pre_msk]==-1||cover[pre_msk]==-1) {
				continue;
			}
			int new_amt=left[pre_msk]+b[i];
			int target=a[cover[pre_msk]];
			if(new_amt<target) {
				cover[msk]=cover[pre_msk];
				left[msk]=new_amt;
			}
			else if(new_amt==target) {
				cover[msk]=cover[pre_msk]+1;
				left[msk]=0;
			}
		}
		if(cover[msk]==n) {
			cout << "YES\n";
			return;
		}
	}
	cout << "NO\n";
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
 
	//freopen("bank.in", "r", stdin);
	//freopen("bank.out", "w", stdout);	

	int TC=1;
	//cin >> TC;
	while(TC--) {
		tmw();
	}
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 72 ms 16732 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 3 ms 16732 KB Output is correct
9 Correct 82 ms 16864 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 72 ms 16732 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 3 ms 16732 KB Output is correct
9 Correct 82 ms 16864 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 468 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 2 ms 600 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 720 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 94 ms 16868 KB Output is correct
32 Correct 97 ms 16868 KB Output is correct
33 Correct 75 ms 16732 KB Output is correct
34 Correct 68 ms 16884 KB Output is correct
35 Correct 69 ms 16732 KB Output is correct
36 Correct 69 ms 16728 KB Output is correct
37 Correct 71 ms 16732 KB Output is correct
38 Correct 78 ms 16732 KB Output is correct
39 Correct 4 ms 16728 KB Output is correct
40 Correct 72 ms 16732 KB Output is correct
41 Correct 70 ms 16732 KB Output is correct
42 Correct 108 ms 16976 KB Output is correct
43 Correct 72 ms 16732 KB Output is correct
44 Correct 81 ms 16732 KB Output is correct
45 Correct 4 ms 16728 KB Output is correct
46 Correct 88 ms 16872 KB Output is correct
47 Correct 71 ms 16872 KB Output is correct
48 Correct 3 ms 16732 KB Output is correct
49 Correct 74 ms 16732 KB Output is correct
50 Correct 80 ms 16728 KB Output is correct
51 Correct 76 ms 16728 KB Output is correct
52 Correct 80 ms 16872 KB Output is correct
53 Correct 96 ms 16872 KB Output is correct
54 Correct 92 ms 16880 KB Output is correct
55 Correct 79 ms 16732 KB Output is correct
56 Correct 80 ms 16728 KB Output is correct
57 Correct 81 ms 16876 KB Output is correct
58 Correct 79 ms 16732 KB Output is correct