Submission #584622

#	Time	Username	Problem	Language	Result	Execution time	Memory
584622		Theo830	Remittance (JOI19_remittance)	C++17	0 / 100	1 ms	324 KiB

remittance

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define ull unsigned ll
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
int main(void){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n;
    cin>>n;
    ll a[n],b[n];
    f(i,0,n){
        cin>>a[i]>>b[i];
    }
    bool ok = 1;
    while(ok){
        ok = 0;
        f(i,0,n){
            ll posa = max(0LL,a[i] - b[i]);
            posa /= 2;
            a[i] -= 2 * posa;
            a[(i+1) % n] += posa;
        }
        f(i,0,n){
            if(a[i] - b[i] > 1){
                ok = 1;
                break;
            }
        }
    }
    ok = 1;
    f(i,0,n){
        if(a[i] != b[i]){
            ok = 0;
            break;
        }
    }
    if(ok){
        cout<<"Yes\n";
    }
    else{
        cout<<"No\n";
    }
}

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