Submission #944299

# Submission time Handle Problem Language Result Execution time Memory
944299 2024-03-12T14:20:24 Z 4QT0R Bank (IZhO14_bank) C++17
71 / 100
1000 ms 6420 KB
#include <bits/stdc++.h>
using namespace std;

int sal[22];
int val[22];
vector<int> maski[1002];
int n,m;

bool backtrack(int maska, int pos){
	if (pos==n)return true;
	for (auto u : maski[sal[pos]]){
		if (!(u&maska) && backtrack(u^maska,pos+1))return true;
	}
	return false;
}

bool sorting(int a, int b){
	return maski[a].size()<maski[b].size();
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int v;
	cin >> n >> m;
	multiset<int> wart,bank;
	for (int i = 0; i<n; i++){
		cin >> v;
		wart.insert(v);
	}
	for (int i = 0; i<m; i++){
		cin >> v;
		auto it=wart.find(v);
		if (it!=wart.end())wart.erase(it);
		else bank.insert(v);
	}
	n=wart.size();
	m=bank.size();
	if (n>10){
		cout << "NO\n";
		return 0;
	}
	int iter=0,sm;
	for (auto u : wart)sal[iter++]=u;
	iter=0;
	for (auto u : bank)val[iter++]=u;
	for (int i = 1; i<(1<<m); i++){
		sm=0;
		for (int j = 0; j<m; j++){
			if (i&(1<<j))sm+=val[j];
		}
		if (sm<=1000)maski[sm].push_back(i);
	}
	sort(sal,sal+n,sorting);
	if (backtrack(0,0))cout << "YES\n";
	else cout << "NO\n";
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 71 ms 6420 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 81 ms 5672 KB Output is correct
9 Correct 74 ms 5972 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 71 ms 6420 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 81 ms 5672 KB Output is correct
9 Correct 74 ms 5972 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 74 ms 5192 KB Output is correct
32 Correct 72 ms 5112 KB Output is correct
33 Correct 68 ms 1216 KB Output is correct
34 Correct 35 ms 344 KB Output is correct
35 Correct 16 ms 344 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 77 ms 620 KB Output is correct
38 Correct 69 ms 624 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 67 ms 1928 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 108 ms 5472 KB Output is correct
43 Correct 67 ms 2144 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 72 ms 6092 KB Output is correct
46 Correct 68 ms 3456 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 72 ms 5716 KB Output is correct
49 Correct 71 ms 5972 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 64 ms 3168 KB Output is correct
52 Execution timed out 1061 ms 4900 KB Time limit exceeded
53 Halted 0 ms 0 KB -