oj.uz

Submission #684457

# Submission time Handle Problem Language Result Execution time Memory
684457 2023-01-21T09:46:43 Z pragmatist Bank (IZhO14_bank) C++17
19 / 100
 133 ms 12616 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;
	}
	fill(dp[0], dp[0] + (1 << m), 1);
	for(int i = 1; i <= n; ++i) {
		for(int mask = 0; mask < (1 << m); ++mask) {
			if(sum[mask] != a[i]) continue;
			int need = 0;
			for(int j = 0; j < m; ++j) {
				if(!bit(mask, j)) need |= (1 << j);
			}
			if(dp[i - 1][need]) {
				dp[i][need | mask] = 1;		
			}          
		}
		for(int mask = 0; mask < (1 << m); ++mask) {
			for(int j = 0; j < m; ++j) {
				if(bit(mask, j)) {
					dp[i][mask ^ (1 << j)] |= dp[i][mask];
				}
			}
		}
	}

	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 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 4 ms 724 KB Output is correct
5 Correct 117 ms 12560 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 119 ms 12544 KB Output is correct
9 Correct 133 ms 12616 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 912 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.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 4 ms 724 KB Output is correct
5 Correct 117 ms 12560 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 119 ms 12544 KB Output is correct
9 Correct 133 ms 12616 KB Output is correct
10 Incorrect 1 ms 340 KB Output isn't correct
11 Halted 0 ms 0 KB -