oj.uz

Submission #88301

# Submission time Handle Problem Language Result Execution time Memory
88301 2018-12-05T08:38:56 Z dimash241 Bank (IZhO14_bank) C++17
100 / 100
 229 ms 14716 KB 
# include <stdio.h>
# include <bits/stdc++.h>


#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define For(i,x,y)  for (int i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (int i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

using namespace std;

inline bool isvowel (char c) {
	c = tolower(c);
    if (c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u') return 1;
    return 0;
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, m, k;
int a[2020], b[2020];
int sum;
bool was[22][(1 << 20) + 12];
vector < int > g[21];

void rec (int v, int used) {
	if (v > n) {
		cout << "YES";
		exit(0);
	}

	if (was[v][used]) return ;
	was[v][used] = 1;
	for (auto to : g[v]) if ((used & to) == 0) {
		rec(v + 1, (used ^ to));	
	}
}

int main () {
	cin >> n >> m;
	For (i, 1, n) {
		cin >> a[i];
	}

	For (i, 1, m) {
		cin >> b[i];
	}

	for (int mask = 1; mask < (1 << m); mask ++) {
		sum = 0;
		for (int j = 0; j < m; j ++) {
			if (mask & (1 << j))
				sum += b[j + 1];
		} 
		For (i, 1, n) {
			if (a[i] == sum) g[i].pb(mask);
		}
	}

	rec (1, 0);
	cout << "NO";


    return Accepted;
}

// Coded By OB

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 2 ms 612 KB Output is correct
4 Correct 4 ms 612 KB Output is correct
5 Correct 72 ms 612 KB Output is correct
6 Correct 2 ms 612 KB Output is correct
7 Correct 2 ms 612 KB Output is correct
8 Correct 71 ms 684 KB Output is correct
9 Correct 71 ms 684 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 2 ms 612 KB Output is correct
4 Correct 4 ms 612 KB Output is correct
5 Correct 72 ms 612 KB Output is correct
6 Correct 2 ms 612 KB Output is correct
7 Correct 2 ms 612 KB Output is correct
8 Correct 71 ms 684 KB Output is correct
9 Correct 71 ms 684 KB Output is correct
10 Correct 2 ms 684 KB Output is correct
11 Correct 2 ms 684 KB Output is correct
12 Correct 2 ms 684 KB Output is correct
13 Correct 2 ms 684 KB Output is correct
14 Correct 1 ms 684 KB Output is correct
15 Correct 2 ms 684 KB Output is correct
16 Correct 2 ms 684 KB Output is correct
17 Correct 2 ms 684 KB Output is correct
18 Correct 2 ms 684 KB Output is correct
19 Correct 2 ms 684 KB Output is correct
20 Correct 3 ms 684 KB Output is correct
21 Correct 2 ms 684 KB Output is correct
22 Correct 3 ms 684 KB Output is correct
23 Correct 3 ms 684 KB Output is correct
24 Correct 3 ms 684 KB Output is correct
25 Correct 3 ms 684 KB Output is correct
26 Correct 3 ms 684 KB Output is correct
27 Correct 3 ms 720 KB Output is correct
28 Correct 3 ms 720 KB Output is correct
29 Correct 3 ms 720 KB Output is correct
30 Correct 3 ms 720 KB Output is correct
31 Correct 72 ms 720 KB Output is correct
32 Correct 75 ms 892 KB Output is correct
33 Correct 78 ms 892 KB Output is correct
34 Correct 82 ms 892 KB Output is correct
35 Correct 83 ms 892 KB Output is correct
36 Correct 89 ms 892 KB Output is correct
37 Correct 73 ms 892 KB Output is correct
38 Correct 76 ms 892 KB Output is correct
39 Correct 80 ms 892 KB Output is correct
40 Correct 81 ms 892 KB Output is correct
41 Correct 88 ms 892 KB Output is correct
42 Correct 83 ms 3864 KB Output is correct
43 Correct 80 ms 3864 KB Output is correct
44 Correct 86 ms 3864 KB Output is correct
45 Correct 75 ms 3864 KB Output is correct
46 Correct 78 ms 3864 KB Output is correct
47 Correct 85 ms 3864 KB Output is correct
48 Correct 72 ms 3864 KB Output is correct
49 Correct 71 ms 3864 KB Output is correct
50 Correct 88 ms 3864 KB Output is correct
51 Correct 81 ms 3864 KB Output is correct
52 Correct 82 ms 3864 KB Output is correct
53 Correct 82 ms 3864 KB Output is correct
54 Correct 90 ms 3864 KB Output is correct
55 Correct 88 ms 3864 KB Output is correct
56 Correct 88 ms 3864 KB Output is correct
57 Correct 229 ms 14716 KB Output is correct
58 Correct 88 ms 14716 KB Output is correct