Submission #231466

#	Time	Username	Problem	Language	Result	Execution time	Memory
231466		Blerargh	Remittance (JOI19_remittance)	C++17	100 / 100	296 ms	36472 KiB

remittance

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii;
typedef pair<ld,ld> id;
typedef tuple<ll,ll,ll> tl;
typedef tuple<ll,ll,ll,ll> ql;

#define FOR(i, a, b) for(ll i=(a); i<=(b); i++)
#define ROF(i, a, b) for(ll i=(a); i>=(b); i--)
#define MEM(x, v) memset(x, v, sizeof(x))
#define FILL(x, n, v) fill(x, x+n, v);
#define ALL(x) x.begin(), x.end()
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

#define f first
#define s second
#define ins insert
#define e emplace
#define eb emplace_back
#define ef emplace_front
#define p push
#define pf push_front
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ft front
#define bk back
#define pp pop
#define ppb pop_back
#define ppf pop_front

#define db cout<<"YEET\n";
#define ct(x) cout<<x<<'\n';

const ll MOD = 1e9+7; //998244353
const ll MAXN = 1e6+5;
const ll INF = 1e18;
const ld PI = acos((ld)-1);

int main(){
    FAST
    ll n, a[MAXN], b[MAXN];
    cin >> n;
    FOR(i,1,n){
        cin >> a[i] >> b[i];
    }
    ll cnt=0, index=1;
    while (cnt<=n){
        if (a[index] > b[index] && a[index] != 1){
            ll diff = a[index] - b[index];
            ll remit = diff/2 + diff%2;
            a[index] -= remit*2;

            if (a[index] < 0) a[index] += 2, remit--;
            
            if (index == n) index=1;
            else index++;

            a[index] += remit;
            cnt=0;
        } else {
            cnt++;

            if (index == n) index=1;
            else index++;
        }
    }
    bool no=0;
    FOR(i,1,n){
        if (a[i] != b[i]) no=1;
    }
    if (no) cout << "No";
    else cout << "Yes";
}

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