oj.uz

Submission #170410

# Submission time Handle Problem Language Result Execution time Memory
170410 2019-12-25T06:03:52 Z Lightning Bank (IZhO14_bank) C++14
100 / 100
 255 ms 14584 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <stack>
#include <queue>
#include <deque>

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;

#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define show(a) cerr << #a <<" -> "<< a <<"\n"
#define fo(a, b, c, d) for(int (a) = (b); (a) <= (c); (a) += (d))
#define foo(a, b, c ,d) for(int (a) = (b); (a) >= (c); (a) -= (d))
//#define int ll

const int N = 20;
const int INF = 1e9;

int n, m, a[N], b[N];
vector <int> mask[N];
bool visited[N][(1 << N)];

void rec(int i, int state) {
	if(i == n) {
		cout << "YES";
		exit(0);
	}
	
	if(visited[i][state]) return;
	visited[i][state] = true;
	
	for(int s : mask[i]) {
		if(state & s) continue;
		rec(i + 1, (state | s));
	}
}

int main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n >> m;
	for(int i = 0; i < n; ++i) {
		cin >> a[i];
	}
	for(int i = 0; i < m; ++i) {
		cin >> b[i];
	}
	for(int state = 0; state < (1 << m); ++state) {
		int sum = 0;
		for(int i = 0; i < m; ++i) if (state & (1 << i)) sum += b[i];
		for(int i = 0; i < n; ++i) if (a[i] == sum) mask[i].pb(state);
	}
	rec(0, 0);
	cout << "NO";
	return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 4 ms 452 KB Output is correct
5 Correct 84 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 85 ms 632 KB Output is correct
9 Correct 85 ms 504 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 4 ms 452 KB Output is correct
5 Correct 84 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 85 ms 632 KB Output is correct
9 Correct 85 ms 504 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 3 ms 380 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 87 ms 504 KB Output is correct
32 Correct 93 ms 632 KB Output is correct
33 Correct 89 ms 376 KB Output is correct
34 Correct 95 ms 376 KB Output is correct
35 Correct 97 ms 388 KB Output is correct
36 Correct 107 ms 476 KB Output is correct
37 Correct 86 ms 396 KB Output is correct
38 Correct 90 ms 476 KB Output is correct
39 Correct 90 ms 428 KB Output is correct
40 Correct 94 ms 376 KB Output is correct
41 Correct 107 ms 376 KB Output is correct
42 Correct 99 ms 3736 KB Output is correct
43 Correct 91 ms 1016 KB Output is correct
44 Correct 100 ms 388 KB Output is correct
45 Correct 88 ms 380 KB Output is correct
46 Correct 90 ms 376 KB Output is correct
47 Correct 100 ms 392 KB Output is correct
48 Correct 85 ms 376 KB Output is correct
49 Correct 84 ms 376 KB Output is correct
50 Correct 107 ms 504 KB Output is correct
51 Correct 95 ms 504 KB Output is correct
52 Correct 94 ms 504 KB Output is correct
53 Correct 94 ms 504 KB Output is correct
54 Correct 107 ms 504 KB Output is correct
55 Correct 107 ms 504 KB Output is correct
56 Correct 107 ms 504 KB Output is correct
57 Correct 255 ms 14584 KB Output is correct
58 Correct 105 ms 504 KB Output is correct