Submission #1107309

#	Time	Username	Problem	Language	Result	Execution time	Memory
1107309		vjudge1	Bank (IZhO14_bank)	C++17	25 / 100	1068 ms	2892 KiB

bank

#include <bits/stdc++.h>
#pragma optimize("g", on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
// void Freopen () {
//     #ifndef ONLINE_JUDGE
//     freopen("input.txt", "r", stdin);
//     freopen("output.txt", "w", stdout);
//     #endif
// }
using namespace std;
#define fi first
#define se second
#define int long long
const int N = 2e5 + 7, M = 1e5;
int a[N], b[N], n, m, dp[22][1007];

void solve() {
	cin>>n>>m;
	for(int i = 1; i <= n; i++)cin>>a[i];
	for(int i = 1; i <= m; i++)cin>>b[i];
	bool ok = 0;
	for(int i = 1; i <= n; i++) {
		for(int mask = 0; mask < (1 << m); mask ++) {
			vector<int> pos;
			for(int j = 0; j < m; j++) {
				if((1 << j) & mask)pos.push_back(j + 1);
			}
			int k = pos.size();
			for(int maskk = 0; maskk < (1 << k); maskk ++) {
				int sum = 0, res = mask;
				for(int j = 0; j < k; j++) {
					if((1 << j) & maskk) {
						sum += b[pos[j]];
						res -= (1 << (pos[j] - 1));
					}
				}
				// cout << sum << ' ' << res << "\n{";
				// for(int j = 0; j < m; j++) {
				// 	if((1 << j) & res)cout << (j + 1) << ' ';
				// }
				// cout << "}\n";
				if(sum == a[i] && dp[i - 1][res] == i - 1)dp[i][mask] = dp[i - 1][res] + 1;
				if(i == n && dp[i][mask] == n)ok = 1;
			}
		}
	}
	cout << (ok ? "YES\n" : "NO\n");	
}
signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	// Freopen();
	int T = 1;
	// cin>>T;
	while(T --)solve();
}

Compilation message (stderr)

bank.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize("g", on)
      |

• Subtask 1: 0 / 19
• Subtask 2: 25 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29