Submission #40521

# Submission time Handle Problem Language Result Execution time Memory
40521 2018-02-03T17:50:09 Z Pajaraja Bank (IZhO14_bank) C++14
100 / 100
649 ms 25280 KB
#include <bits/stdc++.h>
using namespace std;
int a[20],b[20];
bool ma[22][1100000];
vector<int> v[22];
vector<int> s[20007];
int main()
{
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	for(int i=0;i<m;i++) scanf("%d",&b[i]);
	v[0].push_back(0);
	for(int i=0;i<(1<<m);i++)
	{
		int ma=i;
		int sum=0;
		for(int j=0;j<m;j++)
		{
			if(ma%2==1) sum+=b[j];
			ma/=2;
		}
	    s[sum].push_back(i);
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=0;j<s[a[i]].size();j++) for(int k=0;k<v[i-1].size();k++) if(((v[i-1][k]^s[a[i]][j]) == (v[i-1][k]|s[a[i]][j])) && !ma[i][v[i-1][k] xor s[a[i]][j]])
		{
			v[i].push_back(s[a[i]][j] xor v[i-1][k]);
			ma[i][s[a[i]][j] xor v[i-1][k]]=true;
		}
	}
	if(v[n].size()>0) printf("YES");
	else printf("NO");
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:27:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j=0;j<s[a[i]].size();j++) for(int k=0;k<v[i-1].size();k++) if(((v[i-1][k]^s[a[i]][j]) == (v[i-1][k]|s[a[i]][j])) && !ma[i][v[i-1][k] xor s[a[i]][j]])
               ~^~~~~~~~~~~~~~~
bank.cpp:27:50: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j=0;j<s[a[i]].size();j++) for(int k=0;k<v[i-1].size();k++) if(((v[i-1][k]^s[a[i]][j]) == (v[i-1][k]|s[a[i]][j])) && !ma[i][v[i-1][k] xor s[a[i]][j]])
                                                 ~^~~~~~~~~~~~~~
bank.cpp:10: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:11:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++) scanf("%d",&a[i]);
                        ~~~~~^~~~~~~~~~~~
bank.cpp:12:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0;i<m;i++) scanf("%d",&b[i]);
                       ~~~~~^~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 2 ms 884 KB Output is correct
3 Correct 2 ms 964 KB Output is correct
4 Correct 4 ms 1164 KB Output is correct
5 Correct 73 ms 7456 KB Output is correct
6 Correct 2 ms 7456 KB Output is correct
7 Correct 2 ms 7456 KB Output is correct
8 Correct 73 ms 7584 KB Output is correct
9 Correct 73 ms 7584 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 7584 KB Output is correct
2 Correct 2 ms 7584 KB Output is correct
3 Correct 2 ms 7584 KB Output is correct
4 Correct 2 ms 7584 KB Output is correct
5 Correct 2 ms 7584 KB Output is correct
6 Correct 2 ms 7584 KB Output is correct
7 Correct 2 ms 7584 KB Output is correct
8 Correct 2 ms 7584 KB Output is correct
9 Correct 2 ms 7584 KB Output is correct
10 Correct 2 ms 7584 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 7584 KB Output is correct
2 Correct 3 ms 7584 KB Output is correct
3 Correct 4 ms 7584 KB Output is correct
4 Correct 3 ms 7584 KB Output is correct
5 Correct 3 ms 7584 KB Output is correct
6 Correct 3 ms 7584 KB Output is correct
7 Correct 3 ms 7584 KB Output is correct
8 Correct 4 ms 7584 KB Output is correct
9 Correct 4 ms 7584 KB Output is correct
10 Correct 4 ms 7584 KB Output is correct
11 Correct 3 ms 7584 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 2 ms 884 KB Output is correct
3 Correct 2 ms 964 KB Output is correct
4 Correct 4 ms 1164 KB Output is correct
5 Correct 73 ms 7456 KB Output is correct
6 Correct 2 ms 7456 KB Output is correct
7 Correct 2 ms 7456 KB Output is correct
8 Correct 73 ms 7584 KB Output is correct
9 Correct 73 ms 7584 KB Output is correct
10 Correct 2 ms 7584 KB Output is correct
11 Correct 2 ms 7584 KB Output is correct
12 Correct 2 ms 7584 KB Output is correct
13 Correct 2 ms 7584 KB Output is correct
14 Correct 2 ms 7584 KB Output is correct
15 Correct 2 ms 7584 KB Output is correct
16 Correct 2 ms 7584 KB Output is correct
17 Correct 2 ms 7584 KB Output is correct
18 Correct 2 ms 7584 KB Output is correct
19 Correct 2 ms 7584 KB Output is correct
20 Correct 4 ms 7584 KB Output is correct
21 Correct 3 ms 7584 KB Output is correct
22 Correct 4 ms 7584 KB Output is correct
23 Correct 3 ms 7584 KB Output is correct
24 Correct 3 ms 7584 KB Output is correct
25 Correct 3 ms 7584 KB Output is correct
26 Correct 3 ms 7584 KB Output is correct
27 Correct 4 ms 7584 KB Output is correct
28 Correct 4 ms 7584 KB Output is correct
29 Correct 4 ms 7584 KB Output is correct
30 Correct 3 ms 7584 KB Output is correct
31 Correct 79 ms 8168 KB Output is correct
32 Correct 192 ms 9064 KB Output is correct
33 Correct 77 ms 9064 KB Output is correct
34 Correct 79 ms 9064 KB Output is correct
35 Correct 80 ms 9064 KB Output is correct
36 Correct 79 ms 9064 KB Output is correct
37 Correct 78 ms 9064 KB Output is correct
38 Correct 81 ms 9064 KB Output is correct
39 Correct 92 ms 12220 KB Output is correct
40 Correct 74 ms 12220 KB Output is correct
41 Correct 71 ms 12220 KB Output is correct
42 Correct 78 ms 12220 KB Output is correct
43 Correct 72 ms 12220 KB Output is correct
44 Correct 76 ms 12220 KB Output is correct
45 Correct 74 ms 12220 KB Output is correct
46 Correct 74 ms 12220 KB Output is correct
47 Correct 74 ms 12220 KB Output is correct
48 Correct 70 ms 12220 KB Output is correct
49 Correct 70 ms 12220 KB Output is correct
50 Correct 163 ms 24640 KB Output is correct
51 Correct 70 ms 24640 KB Output is correct
52 Correct 78 ms 24640 KB Output is correct
53 Correct 649 ms 24640 KB Output is correct
54 Correct 197 ms 24640 KB Output is correct
55 Correct 172 ms 24640 KB Output is correct
56 Correct 162 ms 25280 KB Output is correct
57 Correct 165 ms 25280 KB Output is correct
58 Correct 165 ms 25280 KB Output is correct