Submission #519131

#	Time	Username	Problem	Language	Result	Execution time	Memory
519131		cig32	Remittance (JOI19_remittance)	C++17	0 / 100	1 ms	316 KiB

remittance

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7;
#define int long long
void solve(int tc) {
  int n;
  cin >> n;
  vector<int> a(n), b(n);
  for(int i=0; i<n; i++) cin >> a[i] >> b[i];
  for(int i=0; i<3; i++) {
    for(int j=0; j<n; j++) {
      if(a[j] > b[j]) {
        int c = (a[j] - b[j]) / 2;
        a[j] -= c * 2;
        a[(j+1) % n] += c;
      }
    }
  }
  for(int i=0; i<n; i++) {
    if(a[i] != b[i]) {
      cout << "No\n"; return;
    }
  }
  cout << "Yes\n";
}
 
int32_t main(){
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
} 

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