Submission #521864

#	Time	Username	Problem	Language	Result	Execution time	Memory
521864		Kalashnikov	Bank (IZhO14_bank)	C++17	71 / 100	315 ms	262148 KiB

bank

#include <bits/stdc++.h>
 
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
 
using namespace std;
using ll = long long;
 
const int N = 20+5 , inf = 2e9 + 7;
const ll INF = 1e18 ,   mod = 1e9+7 , P = 6547;

int a[N] , b[N];
vector<int> ms;
int n , m;

void f(int sum , int pos = 1 , int cur = 0) {
	if(sum == 0) {
		ms.push_back(cur);
		return;
	}
	if(pos == m+1) return;
	if(sum < b[pos]) return;
	f(sum-b[pos] , pos+1 , cur ^ (1 << pos-1));
	f(sum , pos+1 , cur);
}

void solve(int tc) {
	cin >> n >> m;
	for(int i = 1; i <= n; i ++) {
		cin >> a[i];
	}
	for(int i = 1; i <= m; i ++) {
		cin >> b[i];
	}
	sort(b+1, b+m+1);
	vector<pair<int,int>> v;
	v.push_back({0 , 0});
	for(int i = 1; i <= n; i ++) {
		int ok = 0;
		vector<pair<int,int>> cur;
		ms.clear();
		f(a[i]);
		for(auto x: ms) {
			for(auto y: v) {
				if((x&y.F) == 0) {
					cur.push_back({x|y.F , y.S+1});
					if(y.S+1 == n) {
						cout << "YES\n";
						return;
					}
				}
			}
		}
		swap(cur , v);
	}
	cout << "NO";
}
/*
*/
main() {
    ios;
    int tt = 1 , tc = 0;
    // cin >> tt;
    while(tt --) {
        solve(++tc);
    }
    return 0;
}

Compilation message (stderr)

bank.cpp: In function 'void f(int, int, int)':
bank.cpp:26:40: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   26 |  f(sum-b[pos] , pos+1 , cur ^ (1 << pos-1));
      |                                     ~~~^~
bank.cpp: In function 'void solve(int)':
bank.cpp:42:7: warning: unused variable 'ok' [-Wunused-variable]
   42 |   int ok = 0;
      |       ^~
bank.cpp: At global scope:
bank.cpp:63:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   63 | main() {
      | ^~~~

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