oj.uz

Submission #683692

# Submission time Handle Problem Language Result Execution time Memory
683692 2023-01-19T05:38:29 Z oblantis Bank (IZhO14_bank) C++17
100 / 100
 115 ms 8524 KB 
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define pb push_back
#define ss second
#define ff first
#define vt vector
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e9;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 12;
void solve() {
	int n, m;
	cin >> n >> m;
	int a[n + 1], b[m], rs[1 << m], ind[1 << m];
	a[n] = inf;
	rs[0] = ind[0] = 0;
	for(int i = 1; i < (1 << m); i++) ind[i] = rs[i] = -1;
	for(int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for(int i = 0; i < m; i++) {
		cin >> b[i];
	}
	bool ok = 0;
	for(int i = 0; i < (1 << m); i++) {
		if(ind[i] == n)ok = 1;
		for(int j = 0; j < m; j++) {
			if(i & (1 << j)) {
				continue;
			}
			if(ind[i] == -1)continue;
			int now = a[ind[i]] - rs[i] - b[j];
			if(now == 0){
				rs[i | (1 << j)] = 0, ind[i | (1 << j)] = ind[i] + 1;
			}
			else if(now > 0)rs[i | (1 << j)] = rs[i] + b[j], ind[i | (1 << j)] = ind[i];
		}
	}
	if(ok)cout << "YES";
	else cout << "NO";
}
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int tcs = 1;
	//cin >> tcs;
	for(int i = 1; i <= tcs; i++) {
		solve();
	}
	return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 64 ms 8500 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 98 ms 8404 KB Output is correct
9 Correct 74 ms 8500 KB Output is correct

Subtask #2
25.0 / 25.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 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 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 324 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 316 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 1 ms 340 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 64 ms 8500 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 98 ms 8404 KB Output is correct
9 Correct 74 ms 8500 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 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 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 324 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 316 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 448 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 324 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 88 ms 8508 KB Output is correct
32 Correct 94 ms 8504 KB Output is correct
33 Correct 70 ms 8508 KB Output is correct
34 Correct 64 ms 8504 KB Output is correct
35 Correct 68 ms 8404 KB Output is correct
36 Correct 67 ms 8404 KB Output is correct
37 Correct 65 ms 8404 KB Output is correct
38 Correct 65 ms 8524 KB Output is correct
39 Correct 79 ms 8504 KB Output is correct
40 Correct 64 ms 8404 KB Output is correct
41 Correct 65 ms 8512 KB Output is correct
42 Correct 98 ms 8508 KB Output is correct
43 Correct 68 ms 8504 KB Output is correct
44 Correct 67 ms 8516 KB Output is correct
45 Correct 93 ms 8520 KB Output is correct
46 Correct 78 ms 8404 KB Output is correct
47 Correct 65 ms 8504 KB Output is correct
48 Correct 91 ms 8404 KB Output is correct
49 Correct 67 ms 8504 KB Output is correct
50 Correct 81 ms 8516 KB Output is correct
51 Correct 64 ms 8504 KB Output is correct
52 Correct 68 ms 8404 KB Output is correct
53 Correct 115 ms 8500 KB Output is correct
54 Correct 90 ms 8504 KB Output is correct
55 Correct 79 ms 8508 KB Output is correct
56 Correct 76 ms 8404 KB Output is correct
57 Correct 78 ms 8516 KB Output is correct
58 Correct 77 ms 8500 KB Output is correct