Submission #19575443

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

const int MOD = 1000000007;
const int INF = 1e9;
const long long INFLL = 1e18;
using ll = long long;

int main(){
  int n;
  cin >> n;
  vector<ll> a(n), b(n);
  ll suma = 0, sumb = 0;
  for(int i = 0; i < n; i++) {
    cin >> a[i];
    suma += a[i];
  }
  for(int i = 0; i < n; i++) {
    cin >> b[i];
    sumb += b[i];
  }

  ll cnta = sumb - suma;
  ll cntb = sumb - suma;
  string ans = "Yes";
  for(int i = 0; i < n - 1; i++){
    if(a[i] > b[i]){
      cntb -= a[i] - b[i];
    }else{
      if((b[i] - a[i]) % 2 == 0){
        cnta -= (b[i] - a[i]) / 2;
      }else{
        cnta -= (b[i] - a[i] + 1) / 2;
        cntb -= 1;
      }
    }
  }
  if(cnta < 0 || cntb < 0) ans = "No";
  else if(a[n-1] + 2 * cnta != b[n-1] + cntb) ans = "No";

  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result