Submission #1086523

#	Time	Username	Problem	Language	Result	Execution time	Memory
1086523		steveonalex	Remittance (JOI19_remittance)	C++17	100 / 100	321 ms	28752 KiB

remittance

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }
 
 
int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();
 
    int n; cin >> n;
    vector<int> a(n), b(n);
    for(int i = 0; i<n; ++i) cin >> a[i] >> b[i];

    int shift = 0;
    int ma = 0;
    for(int i = 0; i<n; ++i) if (maximize(ma, a[i] - b[i])) shift = i; 
 
    for(int f = 0; f <= n * 31; ++f){
        int i = (f + shift) % n, _i = (i + 1) % n;
        if (a[i] >= b[i]){
            int target = b[i];
            if (a[i] % 2 != b[i] % 2){
                if (target == 0) target++;
                else target--;
            }
            int fund = a[i] - target;
            a[i] -= fund;
            a[_i] += fund / 2;
        }
    }
 
    if (a == b) cout << "Yes\n";
    else cout << "No\n";
 
    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

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