oj.uz

Submission #397626

# Submission time Handle Problem Language Result Execution time Memory
397626 2021-05-02T15:11:27 Z huukhang Bank (IZhO14_bank) C++11
100 / 100
 154 ms 8612 KB 
/*
						   Khangnh's code

“You can either experience the pain of discipline or the pain of regret. 
						The choice is yours.”
*/

// - Only when necessary :d
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define fileopen(a, b) freopen(((string)a + ".inp").c_str(), "r", stdin); freopen(((string)b + ".out").c_str(), "w", stdout); 

#define ll long long
// #define int long long
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
typedef pair<int, int> pii;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const ll mod = 1e9 + 7;
const ll inf = 1e9 + 7;
const double eps = 1e-9;

int n, m;
int a[20], b[20];
pii dp[1 << 20];

void solve() {
	cin >> n >> m;
	for (int i = 0; i < n; ++i) cin >> a[i];
	for (int i = 0; i < m; ++i) cin >> b[i];

	dp[0] = {0, 0};
	for (int i = 1; i < (1 << m); ++i) {
		dp[i] = {0, 0};
		for (int j = 0; j < m; ++j) {
			if ((i >> j) & 1) {
				pii tmp = dp[i ^ (1 << j)];

				if (tmp.se + b[j] < a[tmp.fi]) tmp.se += b[j];
				else if (tmp.se + b[j] == a[tmp.fi]) ++tmp.fi, tmp.se = 0;

				dp[i] = max(dp[i], tmp);
			}
		}

		if (dp[i].first == n) {
			cout << "YES";
			return;
		}
	}

	cout << "NO";
}

signed main() {
	#ifdef khangorz
		fileopen("input", "output");
	#endif
	#ifndef khangorz
//		fileopen("LAH", "LAH");
	#endif
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	solve();
	return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 97 ms 8472 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 96 ms 8404 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 97 ms 8472 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 96 ms 8404 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 2 ms 404 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 118 ms 8580 KB Output is correct
32 Correct 119 ms 8480 KB Output is correct
33 Correct 121 ms 8516 KB Output is correct
34 Correct 105 ms 8604 KB Output is correct
35 Correct 107 ms 8384 KB Output is correct
36 Correct 101 ms 8496 KB Output is correct
37 Correct 105 ms 8460 KB Output is correct
38 Correct 99 ms 8516 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 107 ms 8380 KB Output is correct
41 Correct 97 ms 8432 KB Output is correct
42 Correct 154 ms 8388 KB Output is correct
43 Correct 117 ms 8420 KB Output is correct
44 Correct 114 ms 8604 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 136 ms 8540 KB Output is correct
47 Correct 100 ms 8408 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 98 ms 8420 KB Output is correct
50 Correct 109 ms 8460 KB Output is correct
51 Correct 113 ms 8388 KB Output is correct
52 Correct 104 ms 8388 KB Output is correct
53 Correct 130 ms 8412 KB Output is correct
54 Correct 124 ms 8440 KB Output is correct
55 Correct 107 ms 8388 KB Output is correct
56 Correct 105 ms 8448 KB Output is correct
57 Correct 107 ms 8408 KB Output is correct
58 Correct 109 ms 8612 KB Output is correct