oj.uz

Submission #922257

# Submission time Handle Problem Language Result Execution time Memory
922257 2024-02-05T09:58:22 Z Baizho Bank (IZhO14_bank) C++17
100 / 100
 317 ms 15652 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
 
 #pragma GCC optimize("Ofast,unroll-loops,fast-math")
 #pragma GCC target("popcnt")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
//const int mod = ll(1e9) + 7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const int mod = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(2e5) + 11;
const long long inf = 1e9;
const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
int n, m, a[23], b[23];
bool dp[23][(1 << 20) + 10];
vector<int> ways[30];
 
void Baizho() {
	cin>>n>>m;
	for(int i = 1; i <= n; i ++) cin>>a[i];
	for(int i = 1; i <= m; i ++) cin>>b[i];
	for(int mask = 1; mask < (1 << m); mask ++) {
		int sum = 0;
		for(int i = 1; i <= m; i ++) if(mask & (1 << i - 1)) sum += b[i];
		for(int i = 1; i <= n; i ++) if(a[i] == sum) ways[i].pb(mask);
	}
	
	dp[0][0] = 1;
	for(int i = 0; i < n; i ++) {
		for(int mask = 0; mask < (1 << m); mask ++) {
			if(!dp[i][mask]) continue;
			for(auto way : ways[i + 1]) {
				if((mask & way) == 0) dp[i + 1][mask | way] |= dp[i][mask];
			}
		}
	}
	bool ok = 0;
	for(int i = 0; i < (1 << m); i ++) ok |= dp[n][i];
	if(ok) cout<<"YES\n";
	else cout<<"NO\n";
}
 
signed main() {		
// 	Freopen("hps");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message

bank.cpp: In function 'void Baizho()':
bank.cpp:44:50: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   44 |   for(int i = 1; i <= m; i ++) if(mask & (1 << i - 1)) sum += b[i];
      |                                                ~~^~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 64 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 65 ms 1504 KB Output is correct
9 Correct 63 ms 436 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 64 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 65 ms 1504 KB Output is correct
9 Correct 63 ms 436 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 600 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 360 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 612 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 69 ms 1228 KB Output is correct
32 Correct 121 ms 2592 KB Output is correct
33 Correct 74 ms 1732 KB Output is correct
34 Correct 76 ms 500 KB Output is correct
35 Correct 76 ms 448 KB Output is correct
36 Correct 85 ms 452 KB Output is correct
37 Correct 68 ms 344 KB Output is correct
38 Correct 73 ms 436 KB Output is correct
39 Correct 82 ms 5464 KB Output is correct
40 Correct 74 ms 460 KB Output is correct
41 Correct 92 ms 436 KB Output is correct
42 Correct 78 ms 3800 KB Output is correct
43 Correct 75 ms 948 KB Output is correct
44 Correct 87 ms 344 KB Output is correct
45 Correct 79 ms 2748 KB Output is correct
46 Correct 73 ms 2248 KB Output is correct
47 Correct 84 ms 348 KB Output is correct
48 Correct 73 ms 1628 KB Output is correct
49 Correct 69 ms 348 KB Output is correct
50 Correct 152 ms 15448 KB Output is correct
51 Correct 77 ms 592 KB Output is correct
52 Correct 81 ms 3496 KB Output is correct
53 Correct 317 ms 8160 KB Output is correct
54 Correct 165 ms 14936 KB Output is correct
55 Correct 154 ms 15652 KB Output is correct
56 Correct 154 ms 15572 KB Output is correct
57 Correct 152 ms 14528 KB Output is correct
58 Correct 152 ms 14532 KB Output is correct