Submission #535613

#TimeUsernameProblemLanguageResultExecution timeMemory
535613michaoRemittance (JOI19_remittance)C++14
100 / 100
428 ms36512 KiB
#include <bits/stdc++.h> #define int long long #define mp make_pair #define pb push_back #define ld long double #define pii pair<int,int> #define sz(x) (int)x.size() #define piii pair<pii,pii> #define precise cout<<fixed<<setprecision(10) #define st first #define nd second #define ins insert #define vi vector<int> #define BOOST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0) using namespace std; const int inf=(int)1e18+9; const int MAX=1e6+5; int a[MAX]; int b[MAX]; int32_t main(){ BOOST; int n; cin>>n; for (int i=0;i<n;i++)cin>>a[i]>>b[i]; for (int ile=1;ile<=40;ile++){ for (int i=0;i<n;i++){ int x=max(0LL,a[i]-b[i])/2; a[i]-=x*2; a[(i+1)%n]+=x; } } bool f1=true,f2=true; int maxi=-inf; for (int i=0;i<n;i++){ if (a[i]!=b[i])f1=false; if (a[i]-b[i]!=1)f2=false; maxi=max(maxi,a[i]); } if ((maxi-2>=0 && f2) || f1)cout<<"Yes"; else cout<<"No"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...