Submission #1244979

#	Time	Username	Problem	Language	Result	Execution time	Memory
1244979		Zbyszek99	Remittance (JOI19_remittance)	C++20	100 / 100	233 ms	28032 KiB

remittance

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define vi vector<int>
#define vl vector<long long>
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random();
    int n;
    cin >> n;
    vl arr(n);
    vl a(n);
    vl b(n);
    rep(i,n)
    {
        cin >> a[i] >> b[i];
        arr[i] = a[i]-b[i];
    }
    queue<int> pos;
    rep(i,n) if(arr[i] > 0) pos.push(i);
    while(!pos.empty())
    {
        int t = pos.front();
        pos.pop();
        if(arr[t] > 1 || b[t] != 0)
        {
            ll cnt = arr[t]/2;
            if(arr[t] % 2 == 1 && b[t] != 0) cnt++;
            arr[t] -= 2*cnt;
            arr[(t+1)%n] += cnt;
            if(arr[(t+1)%n] >= 1) pos.push((t+1)%n);
        }
    }
    rep(i,n) if(arr[i] != 0)
    {
        cout << "No\n";
        return 0;
    }
    cout << "Yes\n";
}

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