oj.uz

Submission #721256

# Submission time Handle Problem Language Result Execution time Memory
721256 2023-04-10T14:48:41 Z nishkarsh Bank (IZhO14_bank) C++14
100 / 100
 133 ms 4464 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pcc pair<char,char>
#define vi vector <int>
#define vl vector <ll>
#define sd(x) scanf("%d",&x)
#define slld(x) scanf("%lld",&x)
#define pd(x) printf("%d",x)
#define plld(x) printf("%lld",x)
#define pds(x) printf("%d ",x)
#define pllds(x) printf("%lld ",x)
#define pdn(x) printf("%d\n",x)
#define plldn(x) printf("%lld\n",x)
using namespace std;
ll powmod(ll base,ll exponent,ll mod){
	ll ans=1;
	if(base<0) base+=mod;
	while(exponent){
		if(exponent&1)ans=(ans*base)%mod;
		base=(base*base)%mod;
		exponent/=2;
	}
	return ans;
}
ll gcd(ll a, ll b){
	if(b==0) return a;
	else return gcd(b,a%b);
}
const int INF = 2e9;
const ll INFLL = 4e18;
const int upperlimit = 2e3+1;
const int mod = 1e9+7;
const int N = 20;
int dp[1<<N];
int pre[N+2];
int b[N];
int main() {
	int n,m;
	cin >> n >> m;
	for(int i = 1; i <= n; i++){
		cin >> pre[i];
		pre[i] += pre[i-1];
	}
	for(int i = 0; i < m; i++) cin >> b[i];
	for(int i = 1; i < (1<<m); i++){
		int sm = 0;
		for(int j = 0; j < m; j++) if(i&(1<<j)) sm += b[j];
		for(int j = 0; j < m; j++){
			if(i&(1<<j)){
				if(pre[dp[i^(1<<j)] + 1] == sm) dp[i] = max(dp[i],dp[i^(1<<j)] + 1);
				else dp[i] = max(dp[i],dp[i^(1<<j)]);
			}
		}
	}
	if(dp[(1<<m) - 1] < n) cout << "NO";
	else cout << "YES";
	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 308 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 116 ms 4400 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 108 ms 4312 KB Output is correct
9 Correct 112 ms 4360 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 212 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 308 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 304 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 308 KB Output is correct
7 Correct 2 ms 304 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 3 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 308 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 116 ms 4400 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 108 ms 4312 KB Output is correct
9 Correct 112 ms 4360 KB Output is correct
10 Correct 1 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 212 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 2 ms 304 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 308 KB Output is correct
26 Correct 2 ms 304 KB Output is correct
27 Correct 3 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 3 ms 340 KB Output is correct
31 Correct 121 ms 4300 KB Output is correct
32 Correct 112 ms 4304 KB Output is correct
33 Correct 106 ms 4300 KB Output is correct
34 Correct 111 ms 4384 KB Output is correct
35 Correct 108 ms 4336 KB Output is correct
36 Correct 106 ms 4464 KB Output is correct
37 Correct 109 ms 4340 KB Output is correct
38 Correct 107 ms 4388 KB Output is correct
39 Correct 112 ms 4348 KB Output is correct
40 Correct 115 ms 4300 KB Output is correct
41 Correct 116 ms 4308 KB Output is correct
42 Correct 107 ms 4320 KB Output is correct
43 Correct 112 ms 4300 KB Output is correct
44 Correct 113 ms 4444 KB Output is correct
45 Correct 107 ms 4300 KB Output is correct
46 Correct 107 ms 4260 KB Output is correct
47 Correct 114 ms 4380 KB Output is correct
48 Correct 109 ms 4284 KB Output is correct
49 Correct 112 ms 4308 KB Output is correct
50 Correct 114 ms 4296 KB Output is correct
51 Correct 113 ms 4328 KB Output is correct
52 Correct 114 ms 4412 KB Output is correct
53 Correct 120 ms 4296 KB Output is correct
54 Correct 120 ms 4332 KB Output is correct
55 Correct 118 ms 4336 KB Output is correct
56 Correct 120 ms 4272 KB Output is correct
57 Correct 133 ms 4320 KB Output is correct
58 Correct 114 ms 4268 KB Output is correct