| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 428048 | Amylopectin | 송금 (JOI19_remittance) | C++14 | 1 ms | 204 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 <iostream>
#include <stdio.h>
using namespace std;
const int mxn = 1e6 + 10;
int be[mxn] = {},af[mxn] = {},tw[mxn] = {};
int fima(int l,int r)
{
    if(l > r)
        return l;
    return r;
}
int main()
{
    int i,j,n,m,cma = 0,fr = 0,cva = 0;
    scanf("%d",&n);
    for(i=0; i<n; i++)
    {
        scanf("%d %d",&be[i],&af[i]);
        cma = fima(cma,be[i] - af[i]);
    }
    tw[0] = 1;
    for(i=1; i<40; i++)
    {
        tw[i] = tw[i-1] * 2;
        if(tw[i] > cma)
        {
            break;
        }
    }
    for(i=n-1; i>=0; i--)
    {
        cva += be[i] - af[i];
        while(cva > 0 && fr < i)
        {
            cva += (be[fr] - af[fr]) * tw[n-i + fr];
            fr ++;
        }
        if(fr == i)
        {
            break;
        }
        cva *= 2;
    }
    if(cva == 0)
    {
        printf("Yes\n");
    }
    else
    {
        printf("No\n");
    }
    return 0;
}
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... | ||||
