Submission #253783

#	Time	Username	Problem	Language	Result	Execution time	Memory
253783		kshitij_sodani	송금 (JOI19_remittance)	C++14	55 / 100	284 ms	33016 KiB

remittance

#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
llo n;
pair<llo,llo> it[1000001];
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n;
	int stt=0;
	int tt=1;
	for(llo i=0;i<n;i++){
		cin>>it[i].a>>it[i].b;
		if(it[i].b>0){
			stt=1;
		}
		if(it[i].a!=it[i].b){
			tt=0;
		}
	}
	llo su=0;
	llo cur=1;
	for(llo i=1;i<n;i++){
		su+=(it[i].a-it[i].b)*cur;
		cur*=2;
	}
	su+=cur*(it[0].a-it[0].b);
	cur*=2;
	cur-=1;

	if(su<0){
		cout<<"No"<<endl;
	}
	else{
		if(su%cur>0){
			cout<<"No"<<endl;
		}
		else{
			llo ac=su/cur;
			vector<int> val;
			val.pb(ac);
			for(llo i=1;i<n;i++){
				llo cc=it[i].a-it[i].b+ac;
				if(cc<0){
					cout<<"No"<<endl;
					return 0;
				}
				if(cc%2>0){
					cout<<"No"<<endl;
					return 0;
				}
				ac=cc/2;
				val.pb(ac);
			}
			if(tt==0 and stt==0){
				cout<<"No"<<endl;
				return 0;
			}
		/*	set<pair<int,int>> kk;
			for(int i=0;i<n;i++){
				kk.insert({-it[i].a,i});
			}
			int st=1;
			while(kk.size()){
				pair<int,int> no=*kk.begin();
				if(val[no.b]==0){
					kk.erase(no);
					continue;
				}
				no.a=-no.a;
				if(no.a<=1){
					st=0;
					cout<<"No"<<endl;
					return 0;
					break;
				}
				val[no.b]-=1;
				it[no.b].a-=2;
				kk.erase(no);
				kk.erase({-it[(no.b+1)%n].a,(no.b+1)%n});
				it[(no.b+1)%n].a+=1;
				kk.insert({-it[(no.b+1)%n].a,(no.b+1)%n});
				kk.insert({-it[no.b].a,no.b});
			}
			for(int i=0;i<n;i++){
				if(it[i].a!=it[i].b){
					cout<<"No"<<endl;
					return 0;
				}
			}
*/
			cout<<"Yes"<<endl;
		}
	}







	return 0;
}

• Subtask 1: 15 / 15
• Subtask 2: 40 / 40
• Subtask 3: 0 / 45