This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define int long long
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
const int mxN = (int)1e5+10;
const int LINF = (int)1e18;
int n, m, x, y;
vector<int> adj[mxN];
int a[mxN], b[mxN], c[mxN];
int32_t main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i] >> b[i], c[i]=a[i];
for(int i = 1; i <= n; i++){
int xd = n, ok = 1;
for(int i = 1; i <= n; i++) c[i]=a[i];
for(int j = i; xd-- and ok; j++){
if(j==n+1) j=1;
int extra = c[j]-b[j];
if(extra%2 or extra<0) ok=0;
int nx = j+1; if(nx>n)nx=1;
c[nx]+=extra/2, c[j]=b[j];
}
for(int j = 1; j <= n; j++)
if(c[j]!=b[j]) ok=0;
if(ok){cout << "Yes";return 0;}
}
cout << "No";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |