제출 #925031

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
925031		boris_mihov	송금 (JOI19_remittance)	C++17	0 / 100	1 ms	2396 KiB

remittance

#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <set>

typedef long long llong;
const int MAXN = 1e6 + 10;
const int MAXLOG = 20;
const int INF  = 2e9;

int n;
int a[MAXN];
int b[MAXN];
std::queue <int> q;

void solve()
{
    for (int i = 1 ; i <= n ; ++i)
    {
        if (a[i] > b[i])
        {
            q.push(i);
        }
    }
    
    while (q.size())
    {
        int idx = q.front();
        q.pop();

        if (a[idx] <= b[idx])
        {
            continue;
        }

        int cnt = (a[idx] - b[idx] + 1) / 2;
        a[idx % n + 1] += cnt;
        a[idx] -= 2 * cnt;

        if (a[idx % n + 1] - b[idx % n + 1] > 1)
        {
            q.push(idx % n + 1);
        }
    }

    for (int i = 1 ; i <= n ; ++i)
    {
        if (a[i] < b[i])
        {
            std::cout << "No\n";
            return;
        }
    }

    std::cout << "Yes\n";
}

void input()
{
    std::cin >> n;
    for (int i = 1 ; i <= n ; ++i)
    {
        std::cin >> a[i] >> b[i];
    }
}

void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}   

int main()
{
    fastIOI();
    input();
    solve();

    return 0;
}

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