Submission #68458

# Submission time Handle Problem Language Result Execution time Memory
68458 2018-08-17T07:30:16 Z ekrem Bank (IZhO14_bank) C++
71 / 100
1000 ms 24252 KB
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define N 1000005
using namespace std;

int n, m, ans, a[N], b[N], dp[2][N];
vector < int > g[N];

void dfs(int node, int top, int x, int yap){
	if(node > m){
		if(top == a[yap])
			g[yap].pb(x);
		return;
	}
	x *= 2;
	dfs(node + 1, top + b[node], x + 1, yap);
	dfs(node + 1, top, x, yap);
}

bool bul(int node, int bit){
	// cout << node << " -> " << bit << endl;
	if(node > n)
		return 1;
	for(int i = 0; i < g[node].size(); i++)
		if((bit&g[node][i]) == 0)
			if(bul(node + 1, (bit|g[node][i])))
				return 1;
	return 0;
}

int main(){
	// freopen("in.txt", "r", stdin);
	// freopen("out.txt", "w", stdout);
	scanf("%d %d",&n ,&m);
	for(int i = 1; i <= n; i++)
		scanf("%d",a + i);
	for(int i = 1; i <= m; i++)
		scanf("%d",b + i);
	for(int i = 1; i <= n; i++)
		dfs(1, 0, 0, i);
	// for(int i = 1; i <= n; i++,puts(""))
	// 	for(int j = 0; j < g[i].size(); j++)
	// 		printf("%d ",g[i][j]);
	if(bul(1, 0))
		printf("YES\n");
	else
		printf("NO\n");
	return 0;
}

Compilation message

bank.cpp: In function 'bool bul(int, int)':
bank.cpp:27:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < g[node].size(); i++)
                 ~~^~~~~~~~~~~~~~~~
bank.cpp: In function 'int main()':
bank.cpp:37: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:39:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",a + i);
   ~~~~~^~~~~~~~~~~~
bank.cpp:41:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",b + i);
   ~~~~~^~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 22 ms 23800 KB Output is correct
2 Correct 22 ms 23956 KB Output is correct
3 Correct 22 ms 23968 KB Output is correct
4 Correct 23 ms 23968 KB Output is correct
5 Correct 29 ms 24040 KB Output is correct
6 Correct 19 ms 24040 KB Output is correct
7 Correct 20 ms 24088 KB Output is correct
8 Correct 25 ms 24140 KB Output is correct
9 Correct 25 ms 24140 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 18 ms 24140 KB Output is correct
2 Correct 18 ms 24140 KB Output is correct
3 Correct 19 ms 24160 KB Output is correct
4 Correct 19 ms 24160 KB Output is correct
5 Correct 20 ms 24160 KB Output is correct
6 Correct 19 ms 24160 KB Output is correct
7 Correct 19 ms 24160 KB Output is correct
8 Correct 37 ms 24160 KB Output is correct
9 Correct 20 ms 24160 KB Output is correct
10 Correct 19 ms 24160 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 19 ms 24160 KB Output is correct
2 Correct 20 ms 24160 KB Output is correct
3 Correct 19 ms 24160 KB Output is correct
4 Correct 20 ms 24160 KB Output is correct
5 Correct 20 ms 24160 KB Output is correct
6 Correct 20 ms 24160 KB Output is correct
7 Correct 20 ms 24160 KB Output is correct
8 Correct 19 ms 24160 KB Output is correct
9 Correct 21 ms 24160 KB Output is correct
10 Correct 23 ms 24160 KB Output is correct
11 Correct 21 ms 24160 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 22 ms 23800 KB Output is correct
2 Correct 22 ms 23956 KB Output is correct
3 Correct 22 ms 23968 KB Output is correct
4 Correct 23 ms 23968 KB Output is correct
5 Correct 29 ms 24040 KB Output is correct
6 Correct 19 ms 24040 KB Output is correct
7 Correct 20 ms 24088 KB Output is correct
8 Correct 25 ms 24140 KB Output is correct
9 Correct 25 ms 24140 KB Output is correct
10 Correct 18 ms 24140 KB Output is correct
11 Correct 18 ms 24140 KB Output is correct
12 Correct 19 ms 24160 KB Output is correct
13 Correct 19 ms 24160 KB Output is correct
14 Correct 20 ms 24160 KB Output is correct
15 Correct 19 ms 24160 KB Output is correct
16 Correct 19 ms 24160 KB Output is correct
17 Correct 37 ms 24160 KB Output is correct
18 Correct 20 ms 24160 KB Output is correct
19 Correct 19 ms 24160 KB Output is correct
20 Correct 19 ms 24160 KB Output is correct
21 Correct 20 ms 24160 KB Output is correct
22 Correct 19 ms 24160 KB Output is correct
23 Correct 20 ms 24160 KB Output is correct
24 Correct 20 ms 24160 KB Output is correct
25 Correct 20 ms 24160 KB Output is correct
26 Correct 20 ms 24160 KB Output is correct
27 Correct 19 ms 24160 KB Output is correct
28 Correct 21 ms 24160 KB Output is correct
29 Correct 23 ms 24160 KB Output is correct
30 Correct 21 ms 24160 KB Output is correct
31 Correct 31 ms 24160 KB Output is correct
32 Correct 40 ms 24160 KB Output is correct
33 Correct 58 ms 24160 KB Output is correct
34 Correct 74 ms 24160 KB Output is correct
35 Correct 83 ms 24160 KB Output is correct
36 Correct 128 ms 24160 KB Output is correct
37 Correct 31 ms 24160 KB Output is correct
38 Correct 41 ms 24160 KB Output is correct
39 Correct 63 ms 24160 KB Output is correct
40 Correct 77 ms 24160 KB Output is correct
41 Correct 132 ms 24160 KB Output is correct
42 Correct 109 ms 24160 KB Output is correct
43 Correct 66 ms 24160 KB Output is correct
44 Correct 103 ms 24160 KB Output is correct
45 Correct 39 ms 24160 KB Output is correct
46 Correct 56 ms 24160 KB Output is correct
47 Correct 104 ms 24200 KB Output is correct
48 Correct 30 ms 24200 KB Output is correct
49 Correct 27 ms 24200 KB Output is correct
50 Correct 132 ms 24200 KB Output is correct
51 Correct 99 ms 24252 KB Output is correct
52 Correct 76 ms 24252 KB Output is correct
53 Correct 75 ms 24252 KB Output is correct
54 Correct 131 ms 24252 KB Output is correct
55 Correct 127 ms 24252 KB Output is correct
56 Correct 131 ms 24252 KB Output is correct
57 Execution timed out 1086 ms 24252 KB Time limit exceeded
58 Halted 0 ms 0 KB -