Submission #907451

# Submission time Handle Problem Language Result Execution time Memory
907451 2024-01-15T15:42:34 Z zhasyn Bank (IZhO14_bank) C++14
100 / 100
98 ms 13144 KB
#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
using namespace std;
#define F first
#define S second
typedef long long ll;
#define pii pair <int, int>
#define pll pair <ll, ll>
typedef long double ld;
const ll N = 1e6 + 1e5 + 10;
const ll mod = 998244353;

ll um(ll a, ll b){
	return ((1LL * a * b) % mod + mod) % mod;
}
ll subr(ll a, ll b){
	return ((1LL * a - b) % mod + mod) % mod;
}
int a[N], b[N], n, m;
int dp[N], last[N];
int main() {
	ios::sync_with_stdio(false);
  	cin.tie(NULL);
  	//freopen("bank.in", "r", stdin);
  	//freopen("bank.out", "w", stdout);
  	cin >> n >> m;
  	for(int i = 0; i < n; i++){
  		cin >> a[i];
  	}
  	for(int i = 0; i < m; i++){
  		cin >> b[i];
  	}
  	bool can = false;
  	for(int mask = 0; mask < (1 << m); mask++){
  		dp[mask] = -1;
  	}
  	dp[0] = 0;
  	for(int mask = 0; mask < (1 << m); mask++){
  		for(int dig = 0; dig < m; dig++){
  			if((mask & (1 << dig)) > 0){
  				int nw = mask ^ (1 << dig);
  				int mx = dp[nw], rest = last[nw];
  				
  				if(dp[nw] == -1) continue;
  				if(last[nw] + b[dig] == a[dp[nw]]){
  					mx++;
  					rest = 0;
  				} else rest += b[dig];
  				
  				if(mx >= dp[mask]){
  					dp[mask] = mx;
  					last[mask] = rest;
  				}
  			}
  		}
  		if(dp[mask] == n){
			can = true;
			break;
		}
  	}
  	if(can) cout << "YES\n";
  	else cout << "NO\n";
  return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 2 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 79 ms 12880 KB Output is correct
6 Correct 2 ms 6488 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 82 ms 12928 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6608 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6488 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 3 ms 6492 KB Output is correct
3 Correct 3 ms 6492 KB Output is correct
4 Correct 2 ms 6608 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 3 ms 6492 KB Output is correct
7 Correct 3 ms 6492 KB Output is correct
8 Correct 5 ms 6624 KB Output is correct
9 Correct 3 ms 6492 KB Output is correct
10 Correct 3 ms 6492 KB Output is correct
11 Correct 3 ms 6492 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 2 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 79 ms 12880 KB Output is correct
6 Correct 2 ms 6488 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 82 ms 12928 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6608 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6488 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 3 ms 6492 KB Output is correct
22 Correct 3 ms 6492 KB Output is correct
23 Correct 2 ms 6608 KB Output is correct
24 Correct 2 ms 6492 KB Output is correct
25 Correct 3 ms 6492 KB Output is correct
26 Correct 3 ms 6492 KB Output is correct
27 Correct 5 ms 6624 KB Output is correct
28 Correct 3 ms 6492 KB Output is correct
29 Correct 3 ms 6492 KB Output is correct
30 Correct 3 ms 6492 KB Output is correct
31 Correct 94 ms 12880 KB Output is correct
32 Correct 84 ms 12928 KB Output is correct
33 Correct 87 ms 13084 KB Output is correct
34 Correct 81 ms 12888 KB Output is correct
35 Correct 80 ms 12880 KB Output is correct
36 Correct 76 ms 12884 KB Output is correct
37 Correct 88 ms 12884 KB Output is correct
38 Correct 78 ms 12884 KB Output is correct
39 Correct 2 ms 8540 KB Output is correct
40 Correct 81 ms 12688 KB Output is correct
41 Correct 78 ms 12688 KB Output is correct
42 Correct 98 ms 12928 KB Output is correct
43 Correct 81 ms 12684 KB Output is correct
44 Correct 78 ms 12884 KB Output is correct
45 Correct 3 ms 8552 KB Output is correct
46 Correct 88 ms 12884 KB Output is correct
47 Correct 83 ms 13144 KB Output is correct
48 Correct 2 ms 8540 KB Output is correct
49 Correct 78 ms 12888 KB Output is correct
50 Correct 71 ms 12884 KB Output is correct
51 Correct 80 ms 12888 KB Output is correct
52 Correct 74 ms 12884 KB Output is correct
53 Correct 86 ms 12884 KB Output is correct
54 Correct 78 ms 12684 KB Output is correct
55 Correct 70 ms 12932 KB Output is correct
56 Correct 73 ms 12884 KB Output is correct
57 Correct 78 ms 13068 KB Output is correct
58 Correct 70 ms 12932 KB Output is correct