제출 #489525

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

remittance

using namespace std;
#pragma GCC optimize ("Ofast")
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <queue>
#include <stack>
#include <set>
#include <map>

typedef long long LL;
typedef pair<int,int> pii;
#define iter(x) x.begin(),x.end()
#define pb push_back
#define mkp make_pair
#define F first
#define S second
#define REP(n) for (int __=n;__--;)
#define REP0(i,n) for (int i=0;i<n;++i)
#define REP1(i,n) for (int i=1;i<=n;++i)

const int maxn = 1e6+10,mod = 0;
const LL inf = 0;

int a[maxn],n;

bool done(){
    REP1(i,n) if (a[i]) return false;
    return true;
}

bool pos(){
    REP1(i,n) if (a[i] > 0) return true;
    return false;
}

void solve(){
    cin >> n;
    REP1(i,n){
        int k;

        cin >> a[i] >> k;
        a[i] -= k;
    }

    while (!done()){
        //REP1(i,n) cerr << a[i] <<' '; cerr << '\n';
        if (!pos()){
            cout << "No\n";
            return;
        }
        for (int i=1;i<n;++i){
            if (a[i] > 0){
                a[i+1] += (a[i] + 1) >> 1;
                a[i] -= ((a[i] + 1) >> 1) << 1;
            }
        }
        if (a[n] > 0){
            a[1] += (a[n] + 1) >> 1;
            a[n] -= ((a[n] + 1) >> 1) << 1;
        }
        //REP1(i,n) cerr << a[i] <<' '; cerr << '\n';
    }
    cout << "Yes\n";
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
    solve();

    return 0;
}

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