제출 #897334

#제출 시각아이디문제언어결과실행 시간메모리
897334NK_송금 (JOI19_remittance)C++17
0 / 100
357 ms592 KiB
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
 
using namespace std;
 
#define nl '\n'
 
using ll = long long;
template<class T> using V = vector<T>;
using vi = V<int>;
using vl = V<ll>;
 

const int MX = 8e7;
int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int N; cin >> N;
	vl A(N), B(N); for(int i = 0; i < N; i++) cin >> A[i] >> B[i];
 
	for(int t = 0; t < MX / N; t++) {
		// move all not used money (it halfs each time hence i only need to repeat ~60 times)
 
		for(int x = 0; x < N; x++) {
			ll amt = (max(0LL, A[x] - B[x]) / 2) * 2;
			// cout << x << " " << amt << nl; 
			A[x] -= amt;
			A[(x + 1) % N] += amt / 2;
		}
	}
 
	cout << (A == B ? "Yes" : "No") << nl;
 
	exit(0-0);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...