oj.uz

답안 #758643

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
758643 2023-06-15T03:30:51 Z KN200711 은행 (IZhO14_bank) C++14
100 / 100
 191 ms 12572 KB 
# include <bits/stdc++.h>
using namespace std;

map<int, vector<int> > ck;
int nd[1000001];

set<int> dp[21];

int main() {
	int N, M;
	scanf("%d %d", &N, &M);
	
	vector<int> A(N), B(M);
	int sum1 = 0, sum2 = 0;
	for(int i=0;i<N;i++) {
		scanf("%d", &A[i]);
		nd[A[i]] = 1;
		sum1 += A[i];
	}
	for(int i=0;i<M;i++) {
		scanf("%d", &B[i]);
		sum2 += B[i];
	}
	
	if(sum1 > sum2) {
		printf("NO\n");
		return 0;
	}
	for(int i=0;i<(1 << M);i++) {
		int sum = 0;
		for(int k=0;k<M;k++) {
			if(i&(1 << k)) sum += B[k];
		}
		if(sum <= 1e6 && nd[sum]) ck[sum].push_back(i);
	}
	
	dp[0].insert(0);
	sort(A.begin(), A.end());
	for(int i=0;i<N;i++) {
		for(auto p : dp[i]) {
			for(auto k : ck[A[i]]) {
				if(p&k) continue;
				dp[i + 1].insert(p|k);
			}
		}
	}
	if(dp[N].size()) printf("YES\n");
	else printf("NO\n");
	
	return 0;
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:11:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |  scanf("%d %d", &N, &M);
      |  ~~~~~^~~~~~~~~~~~~~~~~
bank.cpp:16:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |   scanf("%d", &A[i]);
      |   ~~~~~^~~~~~~~~~~~~
bank.cpp:21:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |   scanf("%d", &B[i]);
      |   ~~~~~^~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 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 2 ms 212 KB Output is correct
5 Correct 72 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 71 ms 564 KB Output is correct
9 Correct 81 ms 288 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 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 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 2 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 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 2 ms 212 KB Output is correct
5 Correct 72 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 71 ms 564 KB Output is correct
9 Correct 81 ms 288 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 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 2 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 2 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 80 ms 312 KB Output is correct
32 Correct 153 ms 1000 KB Output is correct
33 Correct 73 ms 212 KB Output is correct
34 Correct 71 ms 212 KB Output is correct
35 Correct 71 ms 212 KB Output is correct
36 Correct 76 ms 292 KB Output is correct
37 Correct 78 ms 288 KB Output is correct
38 Correct 84 ms 212 KB Output is correct
39 Correct 191 ms 12572 KB Output is correct
40 Correct 72 ms 284 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 77 ms 460 KB Output is correct
43 Correct 71 ms 292 KB Output is correct
44 Correct 71 ms 288 KB Output is correct
45 Correct 73 ms 420 KB Output is correct
46 Correct 72 ms 308 KB Output is correct
47 Correct 71 ms 292 KB Output is correct
48 Correct 73 ms 432 KB Output is correct
49 Correct 72 ms 280 KB Output is correct
50 Correct 84 ms 1832 KB Output is correct
51 Correct 78 ms 348 KB Output is correct
52 Correct 79 ms 680 KB Output is correct
53 Correct 188 ms 2584 KB Output is correct
54 Correct 84 ms 1824 KB Output is correct
55 Correct 89 ms 1824 KB Output is correct
56 Correct 135 ms 6408 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 133 ms 6432 KB Output is correct