Submission #1189806

#	Time	Username	Problem	Language	Result	Execution time	Memory
1189806		thelegendary08	Remittance (JOI19_remittance)	C++17	0 / 100	0 ms	328 KiB

remittance

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
 
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in(n);
	vi a(n);
	vi b(n);
	f0r(i,n){
		in2(x,y);
		a[i] = x;
		b[i] = y;
	}
	int thingy = 1;
	int s1 = 0;
	int s2 = 0;
	f0r(i,n){
		s1 += a[i] * thingy;
		s2 += b[i] * thingy;
		thingy *= 2;
	}
	if(s1 < s2)out("No");
	else if((s1 - s2) % (thingy - 1) != 0)out("No");
	else{
		int moves = (s1 - s2) / (thingy - 1);
		// dout(moves);
		a[n-1] -= moves * 2;
		a[0] += moves;
		int i = 0;
		vi v;
		vi w;
		for(int j = i; j < i + n; j++){
			v.pb(a[(j) % n]);
			w.pb(b[(j) % n]);
		}
		// vout(v);
		// vout(w);
		//operation: v[i] -= 2x, v[i+1] += x
		//want to make v = w
		bool ok = 1;
		f0r(j, n-1){
			if(v[j] < w[j]){
				ok = 0;
			}
			else{
				if((v[j] - w[j]) % 2 == 1)ok = 0;
				else{
					int pls = (v[j] - w[j]) / 2;
					v[j+1] += pls; 
				}
			}
			if(!ok)break;
		}
		if(ok){
			if(v[n-1] != w[n-1])ok = 0;
		}
		
		
		if(ok)out("Yes");
		else out("No");
	}
	
}

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