oj.uz

Submission #13508

# Submission time Handle Problem Language Result Execution time Memory
13508 2015-02-22T07:21:14 Z woqja125 Bank (IZhO14_bank) C++
100 / 100
 195 ms 4800 KB 
#include<stdio.h>
#include<set>
const int MAX = 20;
const int PMAX = 1<<MAX;
int a[MAX], b[MAX];
int s[MAX];
int cnt[PMAX];
int max(int a, int b){return a>b?a:b;}
int main()
{
	int n, m;
	int i, j;
	scanf("%d%d", &n, &m);
	for(i=0; i<n; i++)
	{
		scanf("%d", a+i);
		s[i] += a[i];
		s[i+1] += s[i];
	}
	for(i=0; i<m; i++)scanf("%d", b+i);
	for(i=0; i<(1<<m); i++)
	{
		int x = i;
		int sum = 0;
		for(j=0; j<m; j++) if((x>>j)&1) sum += b[j];
		int type = -1;
		for(j=0; j<n; j++) if(s[j] == sum) type = j;
		if(type == 0) cnt[i] = 1;
		else if(type == -1)
		{
			for(j=0; j<m; j++) if((x>>j)&1) cnt[i] = max(cnt[i], cnt[i-(1<<j)]);
		}
		else
		{
			for(j=0; j<m; j++) if(((x>>j)&1) && cnt[i-(1<<j)] == type) cnt[i] = type+1;
		}
		if(cnt[i] == n)
		{
			printf("YES");
			return 0;
		}
	}
	printf("NO");
	return 0;
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:13: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:16:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", a+i);
   ~~~~~^~~~~~~~~~~
bank.cpp:20:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=0; i<m; i++)scanf("%d", b+i);
                    ~~~~~^~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 372 KB Output is correct
3 Correct 2 ms 408 KB Output is correct
4 Correct 1 ms 424 KB Output is correct
5 Correct 135 ms 4428 KB Output is correct
6 Correct 2 ms 4428 KB Output is correct
7 Correct 1 ms 4428 KB Output is correct
8 Correct 2 ms 4428 KB Output is correct
9 Correct 195 ms 4648 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 372 KB Output is correct
3 Correct 2 ms 408 KB Output is correct
4 Correct 1 ms 424 KB Output is correct
5 Correct 135 ms 4428 KB Output is correct
6 Correct 2 ms 4428 KB Output is correct
7 Correct 1 ms 4428 KB Output is correct
8 Correct 2 ms 4428 KB Output is correct
9 Correct 195 ms 4648 KB Output is correct
10 Correct 1 ms 4648 KB Output is correct
11 Correct 2 ms 4648 KB Output is correct
12 Correct 2 ms 4648 KB Output is correct
13 Correct 2 ms 4648 KB Output is correct
14 Correct 2 ms 4648 KB Output is correct
15 Correct 1 ms 4648 KB Output is correct
16 Correct 2 ms 4648 KB Output is correct
17 Correct 2 ms 4648 KB Output is correct
18 Correct 2 ms 4648 KB Output is correct
19 Correct 2 ms 4648 KB Output is correct
20 Correct 3 ms 4648 KB Output is correct
21 Correct 3 ms 4648 KB Output is correct
22 Correct 3 ms 4648 KB Output is correct
23 Correct 3 ms 4648 KB Output is correct
24 Correct 4 ms 4648 KB Output is correct
25 Correct 3 ms 4648 KB Output is correct
26 Correct 3 ms 4648 KB Output is correct
27 Correct 2 ms 4648 KB Output is correct
28 Correct 4 ms 4648 KB Output is correct
29 Correct 3 ms 4648 KB Output is correct
30 Correct 4 ms 4648 KB Output is correct
31 Correct 138 ms 4704 KB Output is correct
32 Correct 139 ms 4704 KB Output is correct
33 Correct 143 ms 4788 KB Output is correct
34 Correct 146 ms 4788 KB Output is correct
35 Correct 146 ms 4788 KB Output is correct
36 Correct 149 ms 4788 KB Output is correct
37 Correct 139 ms 4788 KB Output is correct
38 Correct 141 ms 4788 KB Output is correct
39 Correct 2 ms 4788 KB Output is correct
40 Correct 145 ms 4800 KB Output is correct
41 Correct 148 ms 4800 KB Output is correct
42 Correct 142 ms 4800 KB Output is correct
43 Correct 142 ms 4800 KB Output is correct
44 Correct 145 ms 4800 KB Output is correct
45 Correct 2 ms 4800 KB Output is correct
46 Correct 143 ms 4800 KB Output is correct
47 Correct 148 ms 4800 KB Output is correct
48 Correct 2 ms 4800 KB Output is correct
49 Correct 138 ms 4800 KB Output is correct
50 Correct 144 ms 4800 KB Output is correct
51 Correct 145 ms 4800 KB Output is correct
52 Correct 144 ms 4800 KB Output is correct
53 Correct 140 ms 4800 KB Output is correct
54 Correct 146 ms 4800 KB Output is correct
55 Correct 142 ms 4800 KB Output is correct
56 Correct 145 ms 4800 KB Output is correct
57 Correct 146 ms 4800 KB Output is correct
58 Correct 145 ms 4800 KB Output is correct