제출 #337648

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
337648		blue	송금 (JOI19_remittance)	C++11	15 / 100	1 ms	492 KiB

remittance

#include <iostream>
using namespace std;

/*
Let T[i] be the total number of yen transferred from i to i+1
A[i] - B[i] == 2*T[i] - T[i-1]
A[i+1] - B[i+1] == 2*T[i+1] - T[i]
T[i] = 2*T[i+1] + B[i+1] - A[i+1]
*/

long long N;
long long A[1000001];
long long B[1000001];
long long sumT = 0;

void b_search(long long l, long long r)
{
    //cout << l << ' ' << r << '\n';
    if(l == r)
     {
        long long temp = r;
        long long S = r;
        //cout << r << ' ';
        for(long long i = N-1; i >= 1; i--)
        {
            temp = 2*temp + B[i+1] - A[i+1];
            if(temp < 0)
            {
                cout << "No\n";
                return;
            }
            S += temp;
        //    cout << temp << ' ';
        }
        //cout << '\n';
        if(r == 2*temp + B[1] - A[1] && S == sumT) cout << "Yes\n";
        else cout << "No\n";
        return;
    }

    long long m = (l+r)/2;
    long long S = m;
    long long temp = m;
    for(long long i = N-1; i >= 1; i--)
    {
        temp = 2*temp + B[i+1] - A[i+1];
        if(temp < 0)
        {
            b_search(m+1, r);
            return;
        }
        S += temp;
    }
    if(S >= sumT) b_search(l, m);
    else b_search(m+1, r);
}

int main()
{
    cin >> N;

    int sumB = 0;
    int sumA = 0;

    for(long long i = 1; i <= N; i++)
    {
        cin >> A[i] >> B[i];
        sumT += A[i] - B[i];
        sumB += B[i];
        sumA += A[i];
    }

    if(sumT < 0 || (sumB == 0 && sumA != 0))
    {
        cout << "No\n";
        return 0;
    }

    b_search(0, 1000000000000000L);
}

• Subtask 1: 15 / 15
• Subtask 2: 0 / 40
• Subtask 3: 0 / 45