oj.uz

Submission #17967

# Submission time Handle Problem Language Result Execution time Memory
17967 2016-01-13T15:28:55 Z Adilkhan Bank (IZhO14_bank) C++
71 / 100
 1000 ms 12592 KB 
#include <bits/stdc++.h>

#define pb push_back
#define endl "\n"
#define mp make_pair 
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define fname ""
#define sz(x) (int)(x.size())

typedef long long ll;

using namespace std;

const ll N = (ll)(5e5) + 322;
const ll INF = (ll)(1e9);
const ll mod = (ll)(1e9) + 7;
const double eps = 1e-9;

int n, m, sum;

vector <int> v[N], a, b;

void calc(int x, int pmsk) {
	if (x == n) {
		cout << "YES"; exit(0); 
	}	
	for (auto it : v[x]) {
		if (it & pmsk) continue;
		calc(x + 1, pmsk ^ it);
	}
}

int main () {
	ios_base :: sync_with_stdio (false); cin.tie(0);
//	freopen(fname".in", "r", stdin);
	//freopen(fname".out", "w", stdout);
	cin >> n >> m;
	for (int i = 1; i <= n; ++i) {int x; cin >> x; a.pb(x);}
	for (int i = 1; i <= m; ++i) {int x; cin >> x; b.pb(x);}
	for (int mask = 0; mask < (1 << m); ++mask) {
		sum = 0;
		for (int i = 0; i < m; ++i) {
			if ((1 << i) & mask) {
				sum += b[i];			
			}
		}		
		for (int i = 0; i < n; ++i) {
			if (sum == a[i]) {
				v[i].pb(mask);			
			}
		}
	}
	calc(0, 0);
	cout << "NO";
	return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 12152 KB Output is correct
2 Correct 10 ms 12272 KB Output is correct
3 Correct 11 ms 12336 KB Output is correct
4 Correct 12 ms 12336 KB Output is correct
5 Correct 77 ms 12336 KB Output is correct
6 Correct 10 ms 12336 KB Output is correct
7 Correct 10 ms 12336 KB Output is correct
8 Correct 81 ms 12592 KB Output is correct
9 Correct 79 ms 12592 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12592 KB Output is correct
2 Correct 12 ms 12592 KB Output is correct
3 Correct 12 ms 12592 KB Output is correct
4 Correct 11 ms 12592 KB Output is correct
5 Correct 12 ms 12592 KB Output is correct
6 Correct 12 ms 12592 KB Output is correct
7 Correct 12 ms 12592 KB Output is correct
8 Correct 12 ms 12592 KB Output is correct
9 Correct 11 ms 12592 KB Output is correct
10 Correct 12 ms 12592 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12592 KB Output is correct
2 Correct 13 ms 12592 KB Output is correct
3 Correct 14 ms 12592 KB Output is correct
4 Correct 13 ms 12592 KB Output is correct
5 Correct 13 ms 12592 KB Output is correct
6 Correct 13 ms 12592 KB Output is correct
7 Correct 13 ms 12592 KB Output is correct
8 Correct 13 ms 12592 KB Output is correct
9 Correct 13 ms 12592 KB Output is correct
10 Correct 13 ms 12592 KB Output is correct
11 Correct 13 ms 12592 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 12152 KB Output is correct
2 Correct 10 ms 12272 KB Output is correct
3 Correct 11 ms 12336 KB Output is correct
4 Correct 12 ms 12336 KB Output is correct
5 Correct 77 ms 12336 KB Output is correct
6 Correct 10 ms 12336 KB Output is correct
7 Correct 10 ms 12336 KB Output is correct
8 Correct 81 ms 12592 KB Output is correct
9 Correct 79 ms 12592 KB Output is correct
10 Correct 12 ms 12592 KB Output is correct
11 Correct 12 ms 12592 KB Output is correct
12 Correct 12 ms 12592 KB Output is correct
13 Correct 11 ms 12592 KB Output is correct
14 Correct 12 ms 12592 KB Output is correct
15 Correct 12 ms 12592 KB Output is correct
16 Correct 12 ms 12592 KB Output is correct
17 Correct 12 ms 12592 KB Output is correct
18 Correct 11 ms 12592 KB Output is correct
19 Correct 12 ms 12592 KB Output is correct
20 Correct 13 ms 12592 KB Output is correct
21 Correct 13 ms 12592 KB Output is correct
22 Correct 14 ms 12592 KB Output is correct
23 Correct 13 ms 12592 KB Output is correct
24 Correct 13 ms 12592 KB Output is correct
25 Correct 13 ms 12592 KB Output is correct
26 Correct 13 ms 12592 KB Output is correct
27 Correct 13 ms 12592 KB Output is correct
28 Correct 13 ms 12592 KB Output is correct
29 Correct 13 ms 12592 KB Output is correct
30 Correct 13 ms 12592 KB Output is correct
31 Correct 82 ms 12592 KB Output is correct
32 Correct 82 ms 12592 KB Output is correct
33 Correct 87 ms 12592 KB Output is correct
34 Correct 89 ms 12592 KB Output is correct
35 Correct 90 ms 12592 KB Output is correct
36 Correct 100 ms 12592 KB Output is correct
37 Correct 83 ms 12592 KB Output is correct
38 Correct 85 ms 12592 KB Output is correct
39 Correct 85 ms 12592 KB Output is correct
40 Correct 88 ms 12592 KB Output is correct
41 Correct 100 ms 12592 KB Output is correct
42 Correct 130 ms 12592 KB Output is correct
43 Correct 89 ms 12592 KB Output is correct
44 Correct 95 ms 12592 KB Output is correct
45 Correct 83 ms 12592 KB Output is correct
46 Correct 87 ms 12592 KB Output is correct
47 Correct 95 ms 12592 KB Output is correct
48 Correct 79 ms 12592 KB Output is correct
49 Correct 80 ms 12592 KB Output is correct
50 Correct 98 ms 12592 KB Output is correct
51 Correct 93 ms 12592 KB Output is correct
52 Correct 90 ms 12592 KB Output is correct
53 Correct 88 ms 12592 KB Output is correct
54 Correct 98 ms 12592 KB Output is correct
55 Correct 99 ms 12592 KB Output is correct
56 Correct 98 ms 12592 KB Output is correct
57 Execution timed out 1062 ms 12592 KB Time limit exceeded
58 Halted 0 ms 0 KB -