oj.uz

Submission #677224

# Submission time Handle Problem Language Result Execution time Memory
677224 2023-01-02T15:13:18 Z amirhoseinfar1385 Tug of War (BOI15_tug) C++17
0 / 100
 3000 ms 2012 KB 
#include<bits/stdc++.h>
using namespace std;
int n,k;
vector<pair<pair<int,int>,int>>all;
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){
			int v;
			if(fb[all[x].first.second][0]==x){
				v=fb[all[x].first.second][1];
			}
			else{
				v=fb[all[x].first.second][0];
			}
			if(vis[v]==0){
				vis[v]=1;
				fake.push_back(v);
			}
		}
		else{
			int v;
			if(fa[all[x].first.first][0]==x){
				v=fa[all[x].first.first][1];
			}
			else{
				v=fa[all[x].first.first][0];
			}
			if(vis[v]==0){
				vis[v]=1;
				fake.push_back(v);
			}
		}
	}
	bf.swap(fake);
	bfs((z^1));
}
const int mid=20*30000+10;
void solve(){
	bitset<mid>bt;
	bt[0]=1;
	for(int i=0;i<(int)allp.size();i++){
		int x=allp[i];
		bitset<mid>fake,fakea;
		for(int i=0;i<x;i++){
			fake[i]=0;
		}
		for(int i=x;i<mid;i++){
			fake[i]=bt[i-x];
		}
		for(int i=0;i<mid-x;i++){
			fakea[i]=bt[i+x];
		}
		for(int i=mid+x;i<mid;i++){
			fakea[i]=0;
		}
		for(int i=0;i<mid;i++){
			if(fake[i]==1||fakea[i]==1){
				bt[i]=1;
			}
			else{
				bt[i]=0;
			}
		}
	}
	for(int i=0;i<=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;
	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()>2||(int)fb[i].size()>2){
			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 49 ms 516 KB Output is correct
2 Correct 46 ms 468 KB Output is correct
3 Correct 47 ms 512 KB Output is correct
4 Correct 50 ms 512 KB Output is correct
5 Correct 48 ms 512 KB Output is correct
6 Correct 49 ms 512 KB Output is correct
7 Incorrect 44 ms 468 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 516 KB Output is correct
2 Correct 46 ms 468 KB Output is correct
3 Correct 47 ms 512 KB Output is correct
4 Correct 50 ms 512 KB Output is correct
5 Correct 48 ms 512 KB Output is correct
6 Correct 49 ms 512 KB Output is correct
7 Incorrect 44 ms 468 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

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

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 516 KB Output is correct
2 Correct 46 ms 468 KB Output is correct
3 Correct 47 ms 512 KB Output is correct
4 Correct 50 ms 512 KB Output is correct
5 Correct 48 ms 512 KB Output is correct
6 Correct 49 ms 512 KB Output is correct
7 Incorrect 44 ms 468 KB Output isn't correct
8 Halted 0 ms 0 KB -