oj.uz

Submission #765456

# Submission time Handle Problem Language Result Execution time Memory
765456 2023-06-24T13:49:51 Z vjudge1 Bank (IZhO14_bank) C++17
100 / 100
 118 ms 8496 KB 
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cctype>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <cstdlib>
#include <bitset>
#include <deque>
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3fll
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 20;
pair<int, int> f[1 << maxn];
int a[maxn], b[maxn];
int main() {
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (int i = 0; i < m; i++) {
		cin >> b[i];
	}
	sort(a, a + n, greater<int>());
	sort(b, b + m, greater<int>());
	f[0] = make_pair(0, 0);
	for (int s = 1; s < (1 << m); s++) {
		f[s] = make_pair(0, 0);
		for (int i = 0; i < m; i++) {
			if (~s & (1 << i)) continue;
			pair<int, int> pre = f[s ^ (1 << i)];
			if (pre.second + b[i] == a[pre.first]) {
				pre.first++;
				pre.second = 0;
			} else if (pre.second + b[i] < a[pre.first]) {
				pre.second += b[i];
			}
			// cout << (s ^ (1 << i)) << " " << pre.first << " " << pre.second << endl;
			f[s] = max(f[s], pre);
		}
	}
	for (int s = 0; s < (1 << m); s++) {
		if (f[s].first >= n) {
			cout << "YES" << endl;
			return 0;
		}
	}
	cout << "NO" << endl;
	return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 3 ms 564 KB Output is correct
5 Correct 88 ms 8472 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 92 ms 8364 KB Output is correct
9 Correct 84 ms 8480 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 3 ms 564 KB Output is correct
5 Correct 88 ms 8472 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 92 ms 8364 KB Output is correct
9 Correct 84 ms 8480 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 304 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 428 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 440 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 436 KB Output is correct
30 Correct 1 ms 440 KB Output is correct
31 Correct 94 ms 8372 KB Output is correct
32 Correct 93 ms 8472 KB Output is correct
33 Correct 118 ms 8480 KB Output is correct
34 Correct 89 ms 8480 KB Output is correct
35 Correct 93 ms 8376 KB Output is correct
36 Correct 91 ms 8468 KB Output is correct
37 Correct 88 ms 8484 KB Output is correct
38 Correct 86 ms 8480 KB Output is correct
39 Correct 82 ms 8424 KB Output is correct
40 Correct 89 ms 8460 KB Output is correct
41 Correct 85 ms 8412 KB Output is correct
42 Correct 117 ms 8420 KB Output is correct
43 Correct 101 ms 8408 KB Output is correct
44 Correct 86 ms 8424 KB Output is correct
45 Correct 113 ms 8448 KB Output is correct
46 Correct 107 ms 8496 KB Output is correct
47 Correct 91 ms 8424 KB Output is correct
48 Correct 88 ms 8400 KB Output is correct
49 Correct 92 ms 8388 KB Output is correct
50 Correct 83 ms 8436 KB Output is correct
51 Correct 101 ms 8396 KB Output is correct
52 Correct 99 ms 8420 KB Output is correct
53 Correct 95 ms 8420 KB Output is correct
54 Correct 96 ms 8496 KB Output is correct
55 Correct 83 ms 8412 KB Output is correct
56 Correct 85 ms 8464 KB Output is correct
57 Correct 82 ms 8396 KB Output is correct
58 Correct 82 ms 8496 KB Output is correct