oj.uz

Submission #68556

# Submission time Handle Problem Language Result Execution time Memory
68556 2018-08-17T09:56:24 Z hamzqq9 Bank (IZhO14_bank) C++14
100 / 100
 194 ms 18940 KB 
#include<bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define umax(x,y) x=max(x,y)
#define umin(x,y) x=min(x,y)
#define ll long long
#define ii pair<int,int>
#define iii pair<int,ii>
#define sz(x) ((int) x.size())
#define orta ((bas+son)>>1)
#define all(x) x.begin(),x.end()
#define dbgs(x) cerr<<(#x)<<" --> "<<(x)<<" "
#define dbg(x) cerr<<(#x)<<" --> "<<(x)<<endl;getchar()
#define pw(x) (1<<(x))
#define inf 100000000
#define MOD 1000000007
#define N 400005
#define MAX 10000006
#define LOG 30
#define KOK 200
using namespace std;

int n,m;
int a[21],b[21],sum[pw(21)];
bool vis[21][pw(20)];
vector<int> okey[21];

void dfs(int now,int mask) {

	if(now==n) {

		printf("YES");

		exit(0);

	}

	if(vis[now][mask]) return ;

	vis[now][mask]=1;

	for(int i:okey[now]) {

		if(mask&i) continue ;

		dfs(now+1,mask|i);

	}

}

int main() {

//	freopen("input.txt","r",stdin);

	scanf("%d %d",&n,&m);

	for(int i=0;i<n;i++) {

		scanf("%d",&a[i]);

	}

	for(int i=0;i<m;i++) {

		scanf("%d",&b[i]);

	}

	for(int i=1;i<pw(m);i++) {

		for(int j=0;j<m;j++) {

			if(i&pw(j)) {

				sum[i]=sum[i-pw(j)]+b[j];

				break ;

			}

		}

	}

	for(int i=0;i<n;i++) {

		for(int j=0;j<pw(m);j++) {

			if(sum[j]==a[i]) {

				okey[i].pb(j);

			}

		}
	
	}

	dfs(0,0);

	printf("NO");

}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:58: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:62:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a[i]);
   ~~~~~^~~~~~~~~~~~
bank.cpp:68: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 376 KB Output is correct
3 Correct 1 ms 448 KB Output is correct
4 Correct 2 ms 656 KB Output is correct
5 Correct 10 ms 4752 KB Output is correct
6 Correct 2 ms 4752 KB Output is correct
7 Correct 2 ms 4752 KB Output is correct
8 Correct 11 ms 4752 KB Output is correct
9 Correct 10 ms 4752 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4752 KB Output is correct
2 Correct 2 ms 4752 KB Output is correct
3 Correct 2 ms 4752 KB Output is correct
4 Correct 2 ms 4752 KB Output is correct
5 Correct 2 ms 4752 KB Output is correct
6 Correct 2 ms 4752 KB Output is correct
7 Correct 2 ms 4752 KB Output is correct
8 Correct 2 ms 4752 KB Output is correct
9 Correct 2 ms 4752 KB Output is correct
10 Correct 2 ms 4752 KB Output is correct
11 Correct 2 ms 4752 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 376 KB Output is correct
3 Correct 1 ms 448 KB Output is correct
4 Correct 2 ms 656 KB Output is correct
5 Correct 10 ms 4752 KB Output is correct
6 Correct 2 ms 4752 KB Output is correct
7 Correct 2 ms 4752 KB Output is correct
8 Correct 11 ms 4752 KB Output is correct
9 Correct 10 ms 4752 KB Output is correct
10 Correct 2 ms 4752 KB Output is correct
11 Correct 2 ms 4752 KB Output is correct
12 Correct 2 ms 4752 KB Output is correct
13 Correct 2 ms 4752 KB Output is correct
14 Correct 2 ms 4752 KB Output is correct
15 Correct 2 ms 4752 KB Output is correct
16 Correct 2 ms 4752 KB Output is correct
17 Correct 2 ms 4752 KB Output is correct
18 Correct 2 ms 4752 KB Output is correct
19 Correct 2 ms 4752 KB Output is correct
20 Correct 2 ms 4752 KB Output is correct
21 Correct 2 ms 4752 KB Output is correct
22 Correct 2 ms 4752 KB Output is correct
23 Correct 2 ms 4752 KB Output is correct
24 Correct 2 ms 4752 KB Output is correct
25 Correct 2 ms 4752 KB Output is correct
26 Correct 2 ms 4752 KB Output is correct
27 Correct 2 ms 4752 KB Output is correct
28 Correct 2 ms 4752 KB Output is correct
29 Correct 2 ms 4752 KB Output is correct
30 Correct 2 ms 4752 KB Output is correct
31 Correct 13 ms 4752 KB Output is correct
32 Correct 15 ms 4864 KB Output is correct
33 Correct 24 ms 4864 KB Output is correct
34 Correct 32 ms 4864 KB Output is correct
35 Correct 33 ms 4864 KB Output is correct
36 Correct 56 ms 4864 KB Output is correct
37 Correct 13 ms 4864 KB Output is correct
38 Correct 17 ms 4864 KB Output is correct
39 Correct 27 ms 4864 KB Output is correct
40 Correct 30 ms 4864 KB Output is correct
41 Correct 55 ms 4864 KB Output is correct
42 Correct 27 ms 8060 KB Output is correct
43 Correct 27 ms 8060 KB Output is correct
44 Correct 43 ms 8060 KB Output is correct
45 Correct 16 ms 8060 KB Output is correct
46 Correct 22 ms 8060 KB Output is correct
47 Correct 44 ms 8060 KB Output is correct
48 Correct 10 ms 8060 KB Output is correct
49 Correct 10 ms 8060 KB Output is correct
50 Correct 57 ms 8060 KB Output is correct
51 Correct 33 ms 8060 KB Output is correct
52 Correct 32 ms 8060 KB Output is correct
53 Correct 32 ms 8060 KB Output is correct
54 Correct 55 ms 8060 KB Output is correct
55 Correct 56 ms 8060 KB Output is correct
56 Correct 55 ms 8060 KB Output is correct
57 Correct 194 ms 18940 KB Output is correct
58 Correct 52 ms 18940 KB Output is correct