oj.uz

Submission #517311

# Submission time Handle Problem Language Result Execution time Memory
517311 2022-01-23T02:04:07 Z zhangjishen Bank (IZhO14_bank) C++
100 / 100
 269 ms 4436 KB 
#include<bits/stdc++.h>
using namespace std;

#define mp make_pair
#define pb push_back
#define fi first
#define se second
template<typename T> bool chkmin(T &a, T b){return b < a ? a = b, 1 : 0;}
template<typename T> bool chkmax(T &a, T b){return b > a ? a = b, 1 : 0;}
typedef long long ll;
const int MAXN = 21, MAXS = 11e5;

int n, m, a[MAXN], b[MAXN], s[MAXN], f[MAXS];

int sum(int i){
	int ans = 0;
	for(int j = 1; j <= m; j++)
		if(i & (1 << (j - 1)))
			ans += b[j];
	return ans;
}

int main(){
	// input
	scanf("%d %d", &n, &m);
	for(int i = 1; i <= n; i++){
		scanf("%d", &a[i]);
		s[i] = s[i - 1] + a[i];
	}
	for(int i = 1; i <= m; i++)
		scanf("%d", &b[i]);
	// dp
	f[0] = 1;
	for(int i = 1; i < (1 << m); i++){
		int tot = sum(i), k = lower_bound(s + 1, s + 1 + n, tot) - s - 1, d = tot - s[k];
		if(tot > s[n]) continue;
		for(int j = 1; j <= m; j++)
			if((i & (1 << (j - 1))) && b[j] <= d)
				f[i] |= f[i ^ (1 << (j - 1))];
	}
	int ans = 0;
	for(int i = 0; i < (1 << m); i++)
		if(sum(i) == s[n])
			ans |= f[i];
	if(ans)
		printf("YES\n");
	else printf("NO\n");
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:25:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |  scanf("%d %d", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~~
bank.cpp:27:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |   scanf("%d", &a[i]);
      |   ~~~~~^~~~~~~~~~~~~
bank.cpp:31:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |   scanf("%d", &b[i]);
      |   ~~~~~^~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 280 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 129 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 161 ms 4388 KB Output is correct
9 Correct 203 ms 4304 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 280 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 129 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 161 ms 4388 KB Output is correct
9 Correct 203 ms 4304 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 4 ms 308 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 3 ms 344 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 3 ms 332 KB Output is correct
25 Correct 3 ms 332 KB Output is correct
26 Correct 4 ms 332 KB Output is correct
27 Correct 5 ms 344 KB Output is correct
28 Correct 4 ms 332 KB Output is correct
29 Correct 5 ms 332 KB Output is correct
30 Correct 4 ms 296 KB Output is correct
31 Correct 244 ms 4384 KB Output is correct
32 Correct 216 ms 4380 KB Output is correct
33 Correct 261 ms 4432 KB Output is correct
34 Correct 269 ms 4304 KB Output is correct
35 Correct 240 ms 4380 KB Output is correct
36 Correct 243 ms 4436 KB Output is correct
37 Correct 161 ms 548 KB Output is correct
38 Correct 158 ms 416 KB Output is correct
39 Correct 145 ms 4336 KB Output is correct
40 Correct 208 ms 4208 KB Output is correct
41 Correct 222 ms 4332 KB Output is correct
42 Correct 237 ms 4388 KB Output is correct
43 Correct 233 ms 4388 KB Output is correct
44 Correct 225 ms 4292 KB Output is correct
45 Correct 236 ms 4392 KB Output is correct
46 Correct 228 ms 4292 KB Output is correct
47 Correct 245 ms 4268 KB Output is correct
48 Correct 139 ms 4228 KB Output is correct
49 Correct 150 ms 412 KB Output is correct
50 Correct 213 ms 4268 KB Output is correct
51 Correct 255 ms 4296 KB Output is correct
52 Correct 223 ms 4380 KB Output is correct
53 Correct 215 ms 4380 KB Output is correct
54 Correct 215 ms 4380 KB Output is correct
55 Correct 211 ms 4296 KB Output is correct
56 Correct 242 ms 4388 KB Output is correct
57 Correct 216 ms 4384 KB Output is correct
58 Correct 256 ms 4332 KB Output is correct