oj.uz

Submission #684438

# Submission time Handle Problem Language Result Execution time Memory
684438 2023-01-21T08:08:03 Z pragmatist Bank (IZhO14_bank) C++17
71 / 100
 1000 ms 6172 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], sum[1 << 20];
int dp[21][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];
			}
		}
		sum[mask] = cur;
		if(n == 1 && cur == a[1]) {
			cout << "YES\n";
			return;
		} 
	}
	if(n == 1) {
		cout << "NO\n";
		return;
	}
	dp[0][0] = 1;
	for(int i = 1; i <= n; ++i) {
		for(int mask = 0; mask < (1 << m); ++mask) {
			for(int sub = mask; sub && !dp[i][mask]; sub = (sub - 1) & mask) {
				if(sum[sub] == a[i]) {
					dp[i][mask] |= dp[i - 1][mask ^ sub];
				}	
			}
		}
	}

	for(int mask = 0; mask < (1 << m); ++mask) {
		if(dp[n][mask]) {
			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 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 0 ms 224 KB Output is correct
5 Correct 56 ms 4372 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 56 ms 4376 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 344 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 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 828 KB Output is correct
2 Correct 17 ms 596 KB Output is correct
3 Correct 72 ms 900 KB Output is correct
4 Correct 84 ms 1124 KB Output is correct
5 Correct 62 ms 956 KB Output is correct
6 Correct 27 ms 340 KB Output is correct
7 Correct 23 ms 604 KB Output is correct
8 Correct 23 ms 596 KB Output is correct
9 Correct 43 ms 796 KB Output is correct
10 Correct 58 ms 844 KB Output is correct
11 Correct 70 ms 412 KB Output is correct

Subtask #4
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 0 ms 224 KB Output is correct
5 Correct 56 ms 4372 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 56 ms 4376 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 344 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 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 340 KB Output is correct
20 Correct 39 ms 828 KB Output is correct
21 Correct 17 ms 596 KB Output is correct
22 Correct 72 ms 900 KB Output is correct
23 Correct 84 ms 1124 KB Output is correct
24 Correct 62 ms 956 KB Output is correct
25 Correct 27 ms 340 KB Output is correct
26 Correct 23 ms 604 KB Output is correct
27 Correct 23 ms 596 KB Output is correct
28 Correct 43 ms 796 KB Output is correct
29 Correct 58 ms 844 KB Output is correct
30 Correct 70 ms 412 KB Output is correct
31 Execution timed out 1070 ms 6172 KB Time limit exceeded
32 Halted 0 ms 0 KB -