Submission #1078667

#	Time	Username	Problem	Language	Result	Execution time	Memory
1078667		steveonalex	Snowball (JOI21_ho_t2)	C++17	100 / 100	78 ms	18652 KiB

Main

#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, q; cin >> n >> q;
    vector<ll> x(n);
    for(int i= 0; i<n; ++i) cin >> x[i];

    vector<ll> queries(q+1);
    for(int i = 1; i<=q; ++i){
        cin >> queries[i];
        queries[i] += queries[i-1];
    }

    vector<pair<ll, ll>> range(q+1, {0, 0});
    vector<ll> sum(q+1);
    for(int i = 1; i<=q; ++i){
        range[i] = range[i-1];
        maximize(range[i].first, queries[i]);
        minimize(range[i].second, queries[i]);
        sum[i] = range[i].first - range[i].second;
    }

    vector<ll> ans(n);
    ans[0] -= range.back().second;
    ans.back() += range.back().first;

    for(int i = 1; i<n; ++i){
        ll dis = x[i] - x[i-1];
        if (dis >= sum.back()){
            ans[i-1] += range.back().first;
            ans[i] -= range.back().second;
        }
        else{
            int idx = lower_bound(ALL(sum), dis) - sum.begin();
            pair<ll, ll> cur = range[idx-1];
            if (queries[idx] >= 0) cur.first = dis + cur.second;
            else cur.second = cur.first - dis;
            ans[i-1] += cur.first;
            ans[i] -= cur.second;
        }
    }

    printArr(ans);

    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

• Subtask 1: 33 / 33
• Subtask 2: 67 / 67