oj.uz

Submission #92771

# Submission time Handle Problem Language Result Execution time Memory
92771 2019-01-04T13:21:38 Z SamAnd Bank (IZhO14_bank) C++17
100 / 100
 718 ms 15656 KB 
#pragma comment(linker,"/STACK:20000000")
#define _CRT_SECURE_NO_WARNINGS
#define mp make_pair
//#define OLYMP
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <stack>
#include <string>
#include <cstring>
void fp();
void sp();
using namespace std;
const int N=21;

int n,m;
int a[N],b[N];
vector<int> t[N];
bool c[N][(1<<N)];
bool stg(int x,int y)
{
	for(int i=0;i<m;++i)
	{
		if((x|(1<<i))==x && (y|(1<<i))==y)
			return false;
	}
	return true;
}
int main()
{
	//fp();
	ios_base::sync_with_stdio(false);
	cin>>n>>m;
	for(int i=0;i<n;++i)
		cin>>a[i];
	for(int i=0;i<m;++i)
		cin>>b[i];
	//////
	for(int i=0;i<(1<<m);++i)
	{
		int x=0;
		for(int j=0;j<m;++j)
		{
			if((i|(1<<j))==i)
				x+=b[j];
		}
		for(int j=0;j<n;++j)
		{
			if(x==a[j])
				t[j].push_back(i);
		}
	}
	sort(t,t+n);
	for(int i=0;i<t[0].size();++i)
	{
		c[0][t[0][i]]=true;
	}
	for(int i=1;i<n;++i)
	{
		for(int j=0;j<t[i].size();++j)
		{
			int x=0;
			for(int k=0;k<m;++k)
			{
				if((t[i][j]|(1<<k))!=t[i][j])
					x|=(1<<k);
			}
			for(int k=(x);k;k=((k-1)&(x)))
			{
				if(c[i-1][k])
				{
					c[i][t[i][j]|k]=true;
				}
			}
		}
	}
	bool ans=false;
	for(int i=0;i<(1<<m);++i)
	{
		if(c[n-1][i])
		{
			ans=true;
			break;
		}
	}
	if(ans)
		cout<<"YES"<<endl;
	else
		cout<<"NO"<<endl;
	sp();
	return 0;
}

void fp()
{
#ifndef OLYMP
	freopen("bank.in","r",stdin);
	freopen("bank.out","w",stdout);
#endif
}
void sp()
{
#ifdef OLYMP
	system("pause");
#endif
}

Compilation message

bank.cpp:1:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker,"/STACK:20000000")
 
bank.cpp: In function 'int main()':
bank.cpp:59:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<t[0].size();++i)
              ~^~~~~~~~~~~~
bank.cpp:65:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j=0;j<t[i].size();++j)
               ~^~~~~~~~~~~~
bank.cpp: In function 'void fp()':
bank.cpp:102:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  freopen("bank.in","r",stdin);
  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
bank.cpp:103:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  freopen("bank.out","w",stdout);
  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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 2 ms 376 KB Output is correct
4 Correct 4 ms 308 KB Output is correct
5 Correct 76 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 76 ms 1400 KB Output is correct
9 Correct 77 ms 376 KB Output is correct

Subtask #2
25.0 / 25.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 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 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 2 ms 376 KB Output is correct
4 Correct 4 ms 308 KB Output is correct
5 Correct 76 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 76 ms 1400 KB Output is correct
9 Correct 77 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 380 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 4 ms 376 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 81 ms 1272 KB Output is correct
32 Correct 174 ms 2500 KB Output is correct
33 Correct 94 ms 1580 KB Output is correct
34 Correct 91 ms 632 KB Output is correct
35 Correct 93 ms 644 KB Output is correct
36 Correct 108 ms 504 KB Output is correct
37 Correct 79 ms 376 KB Output is correct
38 Correct 84 ms 376 KB Output is correct
39 Correct 164 ms 5516 KB Output is correct
40 Correct 91 ms 400 KB Output is correct
41 Correct 101 ms 460 KB Output is correct
42 Correct 136 ms 3708 KB Output is correct
43 Correct 99 ms 2296 KB Output is correct
44 Correct 101 ms 420 KB Output is correct
45 Correct 100 ms 2532 KB Output is correct
46 Correct 101 ms 1964 KB Output is correct
47 Correct 100 ms 508 KB Output is correct
48 Correct 77 ms 1400 KB Output is correct
49 Correct 76 ms 424 KB Output is correct
50 Correct 382 ms 15532 KB Output is correct
51 Correct 217 ms 632 KB Output is correct
52 Correct 396 ms 3580 KB Output is correct
53 Correct 718 ms 7176 KB Output is correct
54 Correct 376 ms 15608 KB Output is correct
55 Correct 377 ms 15608 KB Output is correct
56 Correct 353 ms 15656 KB Output is correct
57 Correct 395 ms 14520 KB Output is correct
58 Correct 375 ms 14556 KB Output is correct