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 <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <climits>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define f first
#define s second
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define int ll
#define sz(x) (ll)x.size()
#define all(x) (x.begin(),x.end())
using namespace std;
const ll INF = 1e12;
const ll N =(1e6+5); // TODO : change value as per problem
const ll MOD = 1e9+7;
int a[N],b[N];
int n;
int nxt(int x){
if(x == n) return 1;
return x+1;
}
void solve(){
cin >> n;
for(int i = 1;i <= n;i++){
cin >> a[i] >> b[i];
}
bool sirfzero = true;
for(int i =1;i<=n;i++){
sirfzero &= (b[i] == 0);
}
if(sirfzero){
for(int i =1;i<=n;i++){
if(a[i]){
cout<<"No\n";
return;
}
}
}
int ta[n+1],tb[n+1];
for(int j = 1;j<=n;j++) ta[j]= a[j],tb[j] = b[j];
int operations = 1;
while(operations <= 200){
for(int cur = 1;cur<=n;cur++){
int k = nxt(cur);
if(ta[cur] > tb[cur]){
int x = (ta[cur]-tb[cur]+1)/2;
ta[cur] -= 2*x;
ta[k] += (x);
}}
operations++;
}
bool ok = true;
for(int j = 1;j<=n;j++)
ok &= (ta[j] == tb[j]);
if(ok){
cout<<"Yes\n";
return;
}
cout<<"No\n";
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
// freopen(".in","r",stdin);freopen(".out","w",stdout);
ll tt=1;
// cin >> tt;
while(tt--){
solve();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |