oj.uz

Submission #33593

# Submission time Handle Problem Language Result Execution time Memory
33593 2017-10-30T10:29:02 Z RockyB Bank (IZhO14_bank) C++14
44 / 100
 900 ms 764 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) {
			if (clock() / (double)CLOCKS_PER_SEC > 0.9) cout << "NO", ioi
			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
	}
}

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];
	}
	if (n == 1 || max(n, m) <= 10 || 1) 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 476 KB Output is correct
3 Correct 2 ms 476 KB Output is correct
4 Correct 2 ms 524 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 564 KB Output is correct
9 Correct 511 ms 688 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 688 KB Output is correct
2 Correct 53 ms 688 KB Output is correct
3 Correct 11 ms 688 KB Output is correct
4 Correct 2 ms 688 KB Output is correct
5 Correct 24 ms 688 KB Output is correct
6 Correct 21 ms 688 KB Output is correct
7 Correct 64 ms 688 KB Output is correct
8 Correct 416 ms 688 KB Output is correct
9 Correct 118 ms 688 KB Output is correct
10 Correct 581 ms 764 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 900 ms 764 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 476 KB Output is correct
3 Correct 2 ms 476 KB Output is correct
4 Correct 2 ms 524 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 564 KB Output is correct
9 Correct 511 ms 688 KB Output is correct
10 Correct 195 ms 688 KB Output is correct
11 Correct 53 ms 688 KB Output is correct
12 Correct 11 ms 688 KB Output is correct
13 Correct 2 ms 688 KB Output is correct
14 Correct 24 ms 688 KB Output is correct
15 Correct 21 ms 688 KB Output is correct
16 Correct 64 ms 688 KB Output is correct
17 Correct 416 ms 688 KB Output is correct
18 Correct 118 ms 688 KB Output is correct
19 Correct 581 ms 764 KB Output is correct
20 Incorrect 900 ms 764 KB Output isn't correct
21 Halted 0 ms 0 KB -