oj.uz

Submission #41207

# Submission time Handle Problem Language Result Execution time Memory
41207 2018-02-14T01:55:03 Z wzy Bank (IZhO14_bank) C++14
100 / 100
 625 ms 31104 KB 
#include <bits/stdc++.h>
using namespace std;
int n  , m , v[21] , b[21];
bool dp[21][1<<21];
vector<int> submask[1010];
bool vis[21][1<<21];

bool solve(int i ,int j){
	if(i == n) return 1;
	if(vis[i][j]) return dp[i][j];
	vis[i][j] = true;
	int vv = v[i];
	for(int w = 0 ; w < submask[v[i]].size() ; w++){
		int v = submask[vv][w];
		if(v&j) continue;
		dp[i][j] |= solve(i + 1 , j | v);
	}
	return dp[i][j];
}

int main(){
	scanf("%d%d" , &n , &m);
	int maxv = 0;
	for(int i = 0 ; i < n;i++){
		scanf("%d" , & v[i]);
		maxv = max(maxv , v[i]);
	}
	for(int i = 0 ; i < m ; i++) {
		scanf("%d" , & b[i]);
	}
	for(int j = 0 ; j < (1<<m) ; j++){
		int sumj = 0;
		for(int w = 0 ; w < m ; w++){
			if(1<<w & j) sumj +=  b[w];
		}
		if(sumj == 0 || sumj > maxv) continue;
		submask[sumj].push_back(j);
	}
	int q = solve(0 , 0);
	q ? puts("YES") : puts("NO");
}

Compilation message

bank.cpp: In function 'bool solve(int, int)':
bank.cpp:13:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int w = 0 ; w < submask[v[i]].size() ; w++){
                  ~~^~~~~~~~~~~~~~~~~~~~~~
bank.cpp: In function 'int main()':
bank.cpp:22:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d" , &n , &m);
  ~~~~~^~~~~~~~~~~~~~~~~~
bank.cpp:25:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d" , & v[i]);
   ~~~~~^~~~~~~~~~~~~~~
bank.cpp:29:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d" , & b[i]);
   ~~~~~^~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 472 KB Output is correct
3 Correct 2 ms 472 KB Output is correct
4 Correct 4 ms 592 KB Output is correct
5 Correct 68 ms 592 KB Output is correct
6 Correct 2 ms 608 KB Output is correct
7 Correct 2 ms 608 KB Output is correct
8 Correct 68 ms 2988 KB Output is correct
9 Correct 74 ms 6444 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 472 KB Output is correct
3 Correct 2 ms 472 KB Output is correct
4 Correct 4 ms 592 KB Output is correct
5 Correct 68 ms 592 KB Output is correct
6 Correct 2 ms 608 KB Output is correct
7 Correct 2 ms 608 KB Output is correct
8 Correct 68 ms 2988 KB Output is correct
9 Correct 74 ms 6444 KB Output is correct
10 Correct 2 ms 6444 KB Output is correct
11 Correct 2 ms 6444 KB Output is correct
12 Correct 2 ms 6444 KB Output is correct
13 Correct 2 ms 6444 KB Output is correct
14 Correct 2 ms 6444 KB Output is correct
15 Correct 2 ms 6444 KB Output is correct
16 Correct 2 ms 6444 KB Output is correct
17 Correct 2 ms 6444 KB Output is correct
18 Correct 2 ms 6444 KB Output is correct
19 Correct 2 ms 6444 KB Output is correct
20 Correct 3 ms 6444 KB Output is correct
21 Correct 3 ms 6444 KB Output is correct
22 Correct 3 ms 6444 KB Output is correct
23 Correct 3 ms 6444 KB Output is correct
24 Correct 3 ms 6444 KB Output is correct
25 Correct 3 ms 6444 KB Output is correct
26 Correct 3 ms 6444 KB Output is correct
27 Correct 3 ms 6444 KB Output is correct
28 Correct 3 ms 6444 KB Output is correct
29 Correct 3 ms 6444 KB Output is correct
30 Correct 3 ms 6444 KB Output is correct
31 Correct 75 ms 6492 KB Output is correct
32 Correct 174 ms 6908 KB Output is correct
33 Correct 71 ms 6908 KB Output is correct
34 Correct 68 ms 6908 KB Output is correct
35 Correct 68 ms 6908 KB Output is correct
36 Correct 69 ms 6908 KB Output is correct
37 Correct 68 ms 6908 KB Output is correct
38 Correct 68 ms 6908 KB Output is correct
39 Correct 89 ms 8828 KB Output is correct
40 Correct 69 ms 8828 KB Output is correct
41 Correct 68 ms 8828 KB Output is correct
42 Correct 81 ms 8828 KB Output is correct
43 Correct 69 ms 8828 KB Output is correct
44 Correct 67 ms 8828 KB Output is correct
45 Correct 70 ms 8828 KB Output is correct
46 Correct 70 ms 8828 KB Output is correct
47 Correct 67 ms 8828 KB Output is correct
48 Correct 67 ms 8828 KB Output is correct
49 Correct 67 ms 8828 KB Output is correct
50 Correct 226 ms 31104 KB Output is correct
51 Correct 70 ms 31104 KB Output is correct
52 Correct 79 ms 31104 KB Output is correct
53 Correct 625 ms 31104 KB Output is correct
54 Correct 295 ms 31104 KB Output is correct
55 Correct 246 ms 31104 KB Output is correct
56 Correct 246 ms 31104 KB Output is correct
57 Correct 248 ms 31104 KB Output is correct
58 Correct 241 ms 31104 KB Output is correct