oj.uz

Submission #684480

# Submission time Handle Problem Language Result Execution time Memory
684480 2023-01-21T10:42:44 Z pragmatist Bank (IZhO14_bank) C++17
100 / 100
 918 ms 58972 KB 
/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/

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

#include<bits/stdc++.h>
 
#define sz(v) (int)v.size()
#define ll long long
#define pb push_back
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define nl "\n"

using namespace std;
using pii = pair<int, int>;

const int N = (int)3e5 + 7; // make sure this is right
const int M = (int)1e6 + 7;
const int inf = (int)1e9 + 7;
const ll INF = (ll)3e18 + 7; 
const ll MOD = (ll)998244353; // make sure this is right

bool bit(int x, int i) {
	return x >> i & 1;
}

pii dir[] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

int n, m, a[21], b[20];
vector<int> pos[21];
int dp[21][1 << 20], r[1 << 20];

void solve() {
	cin >> n >> m;
	for(int i = 1; i <= n; ++i) {
		cin >> a[i];
	}
	for(int i = 0; i < m; ++i) {
		cin >> b[i];
	}                   
	for(int mask = 0; mask < (1 << m); ++mask) {
		int cur = 0;
		for(int i = 0; i < m; ++i) {
			if(bit(mask, i)) {
				cur += b[i];
			} else {
				r[mask] |= (1 << i);
			}
		}
		for(int i = 1; i <= n; ++i) {
			if(a[i] == cur) {
				pos[i].pb(mask);
			}
		}
	}                         
	dp[0][0] = 1;
	for(int i = 1; i <= n; ++i) {
		for(auto mask : pos[i]) {
			int e = r[mask];
			for(int sub = e; ; sub = (sub - 1) & e) {
				if(dp[i - 1][sub]) {
					dp[i][mask | sub] = 1;
				}
				if(sub == 0) break;	
			}
		}
	}
	for(int i = 0; i < (1 << m); ++i) {
		if(dp[n][i]) {
			cout << "YES\n";
			return;
		}
	}
	cout << "NO\n";
}

signed main() {	
	ios_base::sync_with_stdio(0);
	cin.tie(0); 
	int test = 1;
	//cin >> test;
	for(int i = 1; i <= test; ++i) {
	 	//cout << "Case #" << i << ": ";
		solve();
	}
	return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 53 ms 4300 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 64 ms 8468 KB Output is correct
9 Correct 47 ms 4320 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 53 ms 4300 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 64 ms 8468 KB Output is correct
9 Correct 47 ms 4320 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 452 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 456 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 2 ms 456 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 58 ms 6460 KB Output is correct
32 Correct 149 ms 12120 KB Output is correct
33 Correct 65 ms 6036 KB Output is correct
34 Correct 63 ms 4624 KB Output is correct
35 Correct 70 ms 4528 KB Output is correct
36 Correct 81 ms 4564 KB Output is correct
37 Correct 50 ms 4460 KB Output is correct
38 Correct 50 ms 4428 KB Output is correct
39 Correct 150 ms 20840 KB Output is correct
40 Correct 57 ms 4472 KB Output is correct
41 Correct 71 ms 4560 KB Output is correct
42 Correct 115 ms 14356 KB Output is correct
43 Correct 70 ms 5100 KB Output is correct
44 Correct 70 ms 4572 KB Output is correct
45 Correct 76 ms 12952 KB Output is correct
46 Correct 77 ms 8012 KB Output is correct
47 Correct 73 ms 4520 KB Output is correct
48 Correct 69 ms 7688 KB Output is correct
49 Correct 48 ms 4420 KB Output is correct
50 Correct 401 ms 58740 KB Output is correct
51 Correct 240 ms 4788 KB Output is correct
52 Correct 392 ms 10768 KB Output is correct
53 Correct 918 ms 32760 KB Output is correct
54 Correct 416 ms 56520 KB Output is correct
55 Correct 427 ms 58972 KB Output is correct
56 Correct 405 ms 58592 KB Output is correct
57 Correct 480 ms 54644 KB Output is correct
58 Correct 425 ms 54748 KB Output is correct