oj.uz

Submission #683691

# Submission time Handle Problem Language Result Execution time Memory
683691 2023-01-19T05:36:58 Z oblantis Bank (IZhO14_bank) C++17
19 / 100
 112 ms 8500 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++) {
		for(int j = 0; j < m; j++) {
			if(i & (1 << j)) {
				continue;
			}
			if(ind[i] == n)ok = 1;
			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 216 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 57 ms 8404 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 112 ms 8500 KB Output is correct
9 Correct 84 ms 8404 KB Output is correct

Subtask #2
0 / 25.0

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

Subtask #3
0 / 27.0

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

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 216 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 57 ms 8404 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 112 ms 8500 KB Output is correct
9 Correct 84 ms 8404 KB Output is correct
10 Incorrect 1 ms 212 KB Output isn't correct
11 Halted 0 ms 0 KB -