oj.uz

Submission #677236

# Submission time Handle Problem Language Result Execution time Memory
677236 2023-01-02T15:48:00 Z amirhoseinfar1385 Tug of War (BOI15_tug) C++17
0 / 100
 3000 ms 2336 KB 
#include<bits/stdc++.h>
using namespace std;
int n,k;
vector<pair<pair<int,int>,int>>all;
vector<int>visa,visb;
vector<vector<int>>fa,fb;
int res=0,now=0;
vector<int>vis;
vector<int>allp;
vector<int>bf;
void bfs(int z){
	if(bf.size()==0){
		return ;
	}
//	cout<<bf[0]<<" "<<z<<" "<<allp.size()<<endl;
	vis[bf[0]]=1;
	for(auto x:bf){
		if(z==1){
			res-=all[x].second;
		}
		else{
			res+=all[x].second;
		}
	}
	vector<int>fake;
	for(auto x:bf){
		if(z==1){
			if(visb[all[x].first.second]==1){
				continue;
			}	
			for(auto x:fb[all[x].first.second]){
				if(vis[x]==0){
					vis[x]=1;
					fake.push_back(x);
				}
			}
			visb[all[x].first.second]=1;
		}
		else{
			if(visa[all[x].first.first]==1){
				continue;
			}	
			for(auto x:fa[all[x].first.first]){
				if(vis[x]==0){
					vis[x]=1;
					fake.push_back(x);
				}
			}
			visa[all[x].first.first]=1;
		}
	}
	bf.swap(fake);
	bfs((z^1));
}
const int mid=20*30000+10;
void solve(){
	bitset<mid*2>bt;
	bt[mid]=1;
	for(int i=0;i<(int)allp.size();i++){
		int x=allp[i];
		bitset<mid*2>fake,fakea;
		for(int i=0;i<x;i++){
			fake[i]=0;
		}
		for(int i=x;i<mid*2;i++){
			fake[i]=bt[i-x];
		}
		for(int i=0;i<mid*2-x;i++){
			fakea[i]=bt[i+x];
		}
		for(int i=mid*2-x;i<mid*2;i++){
			fakea[i]=0;
		}
		for(int i=0;i<mid*2;i++){
			if(fake[i]==1||fakea[i]==1){
				bt[i]=1;
			}
			else{
				bt[i]=0;
			}
		}
	}
	for(int i=mid-k;i<=mid+k;i++){
		if(bt[i]==1){
			cout<<"YES\n";
			exit(0);
		}
	}
	cout<<"NO\n";
	exit(0);
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>k;
	visa.resize(n+1);
	visb.resize(n+1);
	vis.resize(n*2+1);
	fa.resize(n+1),fb.resize(n+1);
	all.resize(n*2);
	for(int i=0;i<n*2;i++){
		cin>>all[i].first.first>>all[i].first.second>>all[i].second;
	}
	for(int i=0;i<2*n;i++){
		fa[all[i].first.first].push_back(i);
		fb[all[i].first.second].push_back(i);
	}
	for(int i=1;i<=n;i++){
		if((int)fa[i].size()==0||(int)fb[i].size()==0){
			cout<<"NO"<<endl;
			return 0;
		}
	}
	for(int i=0;i<n*2;i++){
		if(vis[i]==0){
			bf.push_back(i);
			res=0;
			bfs(1);
			allp.push_back(abs(res));
		}
	}
	solve();
}

Subtask #1
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 732 KB Output is correct
2 Correct 103 ms 728 KB Output is correct
3 Correct 96 ms 732 KB Output is correct
4 Correct 95 ms 732 KB Output is correct
5 Correct 97 ms 736 KB Output is correct
6 Correct 95 ms 732 KB Output is correct
7 Correct 94 ms 732 KB Output is correct
8 Correct 95 ms 728 KB Output is correct
9 Correct 97 ms 732 KB Output is correct
10 Correct 108 ms 732 KB Output is correct
11 Correct 98 ms 736 KB Output is correct
12 Correct 95 ms 740 KB Output is correct
13 Correct 96 ms 736 KB Output is correct
14 Correct 97 ms 724 KB Output is correct
15 Correct 102 ms 728 KB Output is correct
16 Correct 125 ms 724 KB Output is correct
17 Correct 94 ms 724 KB Output is correct
18 Correct 104 ms 724 KB Output is correct
19 Correct 106 ms 724 KB Output is correct
20 Correct 101 ms 736 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Incorrect 57 ms 732 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 732 KB Output is correct
2 Correct 103 ms 728 KB Output is correct
3 Correct 96 ms 732 KB Output is correct
4 Correct 95 ms 732 KB Output is correct
5 Correct 97 ms 736 KB Output is correct
6 Correct 95 ms 732 KB Output is correct
7 Correct 94 ms 732 KB Output is correct
8 Correct 95 ms 728 KB Output is correct
9 Correct 97 ms 732 KB Output is correct
10 Correct 108 ms 732 KB Output is correct
11 Correct 98 ms 736 KB Output is correct
12 Correct 95 ms 740 KB Output is correct
13 Correct 96 ms 736 KB Output is correct
14 Correct 97 ms 724 KB Output is correct
15 Correct 102 ms 728 KB Output is correct
16 Correct 125 ms 724 KB Output is correct
17 Correct 94 ms 724 KB Output is correct
18 Correct 104 ms 724 KB Output is correct
19 Correct 106 ms 724 KB Output is correct
20 Correct 101 ms 736 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Incorrect 57 ms 732 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3066 ms 2336 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 732 KB Output is correct
2 Correct 103 ms 728 KB Output is correct
3 Correct 96 ms 732 KB Output is correct
4 Correct 95 ms 732 KB Output is correct
5 Correct 97 ms 736 KB Output is correct
6 Correct 95 ms 732 KB Output is correct
7 Correct 94 ms 732 KB Output is correct
8 Correct 95 ms 728 KB Output is correct
9 Correct 97 ms 732 KB Output is correct
10 Correct 108 ms 732 KB Output is correct
11 Correct 98 ms 736 KB Output is correct
12 Correct 95 ms 740 KB Output is correct
13 Correct 96 ms 736 KB Output is correct
14 Correct 97 ms 724 KB Output is correct
15 Correct 102 ms 728 KB Output is correct
16 Correct 125 ms 724 KB Output is correct
17 Correct 94 ms 724 KB Output is correct
18 Correct 104 ms 724 KB Output is correct
19 Correct 106 ms 724 KB Output is correct
20 Correct 101 ms 736 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Incorrect 57 ms 732 KB Output isn't correct
23 Halted 0 ms 0 KB -