# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
677957 | arnold518 | 송금 (JOI19_remittance) | C++17 | 1 ms | 212 KiB |
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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e6;
int N;
ll A[MAXN+10], B[MAXN+10], S;
bool solve(ll X)
{
ll t=X;
for(int i=N; i>=1; i--)
{
X=X*2+B[i]-A[i];
if(X<S) return true;
if(X>-S) return false;
}
return X<=t;
}
int main()
{
scanf("%d", &N);
for(int i=1; i<=N; i++) scanf("%lld%lld", &A[i], &B[i]), S+=B[i]-A[i];
ll p=0, q=1;
for(int i=1; i<=N; i++)
{
p+=q*(B[i]-A[i]);
q*=2;
}
if(p%(q-1)!=0) return !printf("No\n");
ll x=p/(1-q);
for(int i=N; i>=1; i--)
{
x=x*2+B[i]-A[i];
if(x<0) return !printf("No\n");
}
return !printf("Yes\n");
if(S>0) return !printf("No\n");
ll lo=0, hi=-S+1;
while(lo+1<hi)
{
ll mid=lo+hi>>1;
if(solve(mid)) lo=mid;
else hi=mid;
}
ll t=lo, X=lo;
for(int i=N; i>=1; i--)
{
X=X*2+B[i]-A[i];
if(X<S) return !printf("No\n");
if(X>-S) return !printf("No\n");
}
if(X!=t) return !printf("No\n");
printf("Yes\n");
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |