oj.uz

Submission #33601

# Submission time Handle Problem Language Result Execution time Memory
33601 2017-10-30T10:43:51 Z RockyB Bank (IZhO14_bank) C++14
71 / 100
 1000 ms 6832 KB 
/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)5e5 + 7, inf = (int)1e9 + 7, mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n, m;
int a[N], b[N];

int sum[N];

namespace s12 {
	void rec(int v = 1) {
		if (v > m) {
			for (int i = 1; i <= n; i++) {
				if (sum[i] != a[i]) {
					return;
				}
			}
			cout << "YES";
			ioi
		}
		rec(v + 1);
		for (int i = 1; i <= n; i++) {
			if (sum[i] + b[v] <= a[i]) {
				sum[i] += b[v];
				rec(v + 1);
				sum[i] -= b[v];
			}
		}
	}
	void solve() {
		rec();
		cout << "NO";
		ioi
	}
}
namespace s3 {
	vector <int> good[1111];
	void rec(int v = 1, int sum = 0, int mask = 0) {
		if (sum > 1000) return;
		if (v > m) {
			good[sum].pb(mask);
			return;
		}
		rec(v + 1, sum, mask);
		rec(v + 1, sum + b[v], mask | (1 << (v - 1)));
	}
	int calc(int v = 1, int mask = (1 << m) - 1) {
		if (v > n) return 1;
		for (auto it : good[a[v]]) {
			if ((mask | it) == mask) {
				if (calc(v + 1, mask ^ it)) return 1;
			}
		}
		return 0;
	}
	void solve() {
		rec();	
		if (calc()) cout << "YES";
		else cout << "NO";
		ioi
	}
}


int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n >> m;
	if (n > m) cout << "NO", ioi
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	for (int i = 1; i <= m; i++) {
		cin >> b[i];
	}
	s3 :: solve();
	if (n == 1 || max(n, m) <= 10) s12 :: solve();

	ioi
}

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 376 KB Output is correct
3 Correct 2 ms 540 KB Output is correct
4 Correct 3 ms 740 KB Output is correct
5 Correct 20 ms 6832 KB Output is correct
6 Correct 2 ms 6832 KB Output is correct
7 Correct 2 ms 6832 KB Output is correct
8 Correct 17 ms 6832 KB Output is correct
9 Correct 19 ms 6832 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
0 / 29.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 540 KB Output is correct
4 Correct 3 ms 740 KB Output is correct
5 Correct 20 ms 6832 KB Output is correct
6 Correct 2 ms 6832 KB Output is correct
7 Correct 2 ms 6832 KB Output is correct
8 Correct 17 ms 6832 KB Output is correct
9 Correct 19 ms 6832 KB Output is correct
10 Correct 2 ms 6832 KB Output is correct
11 Correct 2 ms 6832 KB Output is correct
12 Correct 2 ms 6832 KB Output is correct
13 Correct 2 ms 6832 KB Output is correct
14 Correct 2 ms 6832 KB Output is correct
15 Correct 2 ms 6832 KB Output is correct
16 Correct 2 ms 6832 KB Output is correct
17 Correct 2 ms 6832 KB Output is correct
18 Correct 2 ms 6832 KB Output is correct
19 Correct 2 ms 6832 KB Output is correct
20 Correct 2 ms 6832 KB Output is correct
21 Correct 2 ms 6832 KB Output is correct
22 Correct 2 ms 6832 KB Output is correct
23 Correct 2 ms 6832 KB Output is correct
24 Correct 2 ms 6832 KB Output is correct
25 Correct 2 ms 6832 KB Output is correct
26 Correct 2 ms 6832 KB Output is correct
27 Correct 2 ms 6832 KB Output is correct
28 Correct 2 ms 6832 KB Output is correct
29 Correct 2 ms 6832 KB Output is correct
30 Correct 2 ms 6832 KB Output is correct
31 Correct 18 ms 6832 KB Output is correct
32 Correct 16 ms 6832 KB Output is correct
33 Correct 4 ms 6832 KB Output is correct
34 Correct 2 ms 6832 KB Output is correct
35 Correct 2 ms 6832 KB Output is correct
36 Correct 2 ms 6832 KB Output is correct
37 Correct 2 ms 6832 KB Output is correct
38 Correct 2 ms 6832 KB Output is correct
39 Correct 14 ms 6832 KB Output is correct
40 Correct 7 ms 6832 KB Output is correct
41 Correct 3 ms 6832 KB Output is correct
42 Correct 79 ms 6832 KB Output is correct
43 Correct 7 ms 6832 KB Output is correct
44 Correct 2 ms 6832 KB Output is correct
45 Correct 18 ms 6832 KB Output is correct
46 Correct 10 ms 6832 KB Output is correct
47 Correct 2 ms 6832 KB Output is correct
48 Correct 16 ms 6832 KB Output is correct
49 Correct 16 ms 6832 KB Output is correct
50 Execution timed out 1076 ms 6832 KB Time limit exceeded
51 Halted 0 ms 0 KB -