oj.uz

Submission #671855

# Submission time Handle Problem Language Result Execution time Memory
671855 2022-12-14T05:23:02 Z Baytoro Bank (IZhO14_bank) C++17
71 / 100
 1000 ms 17016 KB 
#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
void fopn(string name){
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}
const int INF=1e9,mod=1e9+7;
int dp[(1ll<<20)+5],ok[(1ll<<20)+5];
void get(int x){
	for(int i=0;i<20;i++)
		cout<<((x&(1<<i))?1:0);
	cout<<endl;
}
vector<int> f(vector<int> a, vector<int> b){
	int n=a.size();
	int m=b.size();
	vector<int> ans;
	dp[0]=0;
	for(int i=0;i<n;i++){
		for(int mask=1;mask<(1<<(m-1));mask++){
			for(int j=0;j<m;j++){
				if(mask&(1<<j)){
					if(ok[mask^(1<<j)]!=i-1) continue;
					if((dp[mask^(1<<j)])+b[j]>a[i]) continue;
					dp[mask]=(dp[mask^(1<<j)])+b[j];
					ok[mask]=i-1;
					//cout<<(1<<m)<<' ';
					//cout<<mask<<endl;
					if(dp[mask]==a[i]){
						dp[mask]=0;
						ok[mask]=i;
						if(i==n-1){
							//get(mask);
							ans.pb(mask);
						}
					}
					break;
				}
			}
		}
	}
	return ans;
}
int n,m;
void solve(){
	memset(ok,-1,sizeof(ok));
	memset(dp,0x3f3f3f3f,sizeof(dp));
	cin>>n>>m;
	vector<int> a(n+1),b(m+1);
	for(int i=0;i<n;i++) cin>>a[i];
	for(int i=0;i<m;i++) cin>>b[i];
	vector<int> tmp;
	for(int i=0;i<n/2;i++) 
		tmp.pb(a[i]);
	vector<int> ans1=f(tmp,b);
	tmp.clear();
	for(int i=n/2;i<n;i++)
		tmp.pb(a[i]);
	memset(ok,-1,sizeof(ok));
	memset(dp,0x3f3f3f3f,sizeof(dp));
	vector<int> ans2=f(tmp,b);
	//cout<<ans2.size()<<endl;
	if(n==1){
		if(ans2.size()>0)
			cout<<"YES\n";
		else
			cout<<"NO\n";
		return;
	}
	for(auto i: ans1){
		if(ans2.size()==0) continue;
		for(auto j: ans2){
			if(!(i&j)){
				cout<<"YES\n";
				return;
			}
		}
	}
	cout<<"NO\n";
	
}
main(){
	ios;
	int T=1;
	//cin>>T;
	while(T--){
		solve();
	}
}

Compilation message

bank.cpp:90:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   90 | main(){
      | ^~~~
bank.cpp: In function 'void fopn(std::string)':
bank.cpp:12:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:13:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16724 KB Output is correct
2 Correct 8 ms 16724 KB Output is correct
3 Correct 8 ms 16724 KB Output is correct
4 Correct 10 ms 16724 KB Output is correct
5 Correct 82 ms 16724 KB Output is correct
6 Correct 8 ms 16724 KB Output is correct
7 Correct 8 ms 16704 KB Output is correct
8 Correct 62 ms 16832 KB Output is correct
9 Correct 12 ms 16724 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 16724 KB Output is correct
2 Correct 11 ms 16624 KB Output is correct
3 Correct 17 ms 16724 KB Output is correct
4 Correct 21 ms 16732 KB Output is correct
5 Correct 18 ms 16724 KB Output is correct
6 Correct 14 ms 16656 KB Output is correct
7 Correct 12 ms 16680 KB Output is correct
8 Correct 11 ms 16732 KB Output is correct
9 Correct 15 ms 16676 KB Output is correct
10 Correct 17 ms 16728 KB Output is correct
11 Correct 19 ms 16724 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16724 KB Output is correct
2 Correct 8 ms 16724 KB Output is correct
3 Correct 8 ms 16724 KB Output is correct
4 Correct 10 ms 16724 KB Output is correct
5 Correct 82 ms 16724 KB Output is correct
6 Correct 8 ms 16724 KB Output is correct
7 Correct 8 ms 16704 KB Output is correct
8 Correct 62 ms 16832 KB Output is correct
9 Correct 12 ms 16724 KB Output is correct
10 Correct 9 ms 16724 KB Output is correct
11 Correct 8 ms 16704 KB Output is correct
12 Correct 8 ms 16724 KB Output is correct
13 Correct 9 ms 16728 KB Output is correct
14 Correct 8 ms 16724 KB Output is correct
15 Correct 9 ms 16724 KB Output is correct
16 Correct 9 ms 16724 KB Output is correct
17 Correct 9 ms 16724 KB Output is correct
18 Correct 11 ms 16696 KB Output is correct
19 Correct 9 ms 16724 KB Output is correct
20 Correct 15 ms 16724 KB Output is correct
21 Correct 11 ms 16624 KB Output is correct
22 Correct 17 ms 16724 KB Output is correct
23 Correct 21 ms 16732 KB Output is correct
24 Correct 18 ms 16724 KB Output is correct
25 Correct 14 ms 16656 KB Output is correct
26 Correct 12 ms 16680 KB Output is correct
27 Correct 11 ms 16732 KB Output is correct
28 Correct 15 ms 16676 KB Output is correct
29 Correct 17 ms 16728 KB Output is correct
30 Correct 19 ms 16724 KB Output is correct
31 Correct 91 ms 16740 KB Output is correct
32 Correct 172 ms 17016 KB Output is correct
33 Correct 513 ms 16844 KB Output is correct
34 Correct 717 ms 16716 KB Output is correct
35 Correct 796 ms 16724 KB Output is correct
36 Execution timed out 1091 ms 16612 KB Time limit exceeded
37 Halted 0 ms 0 KB -