oj.uz

Submission #1078667

# Submission time Handle Problem Language Result Execution time Memory
1078667 2024-08-28T03:53:50 Z steveonalex Snowball (JOI21_ho_t2) C++17
100 / 100
 78 ms 18652 KB 
#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.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 504 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 604 KB Output is correct

Subtask #2
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 504 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 20 ms 8812 KB Output is correct
21 Correct 19 ms 8540 KB Output is correct
22 Correct 18 ms 8300 KB Output is correct
23 Correct 18 ms 8312 KB Output is correct
24 Correct 22 ms 8792 KB Output is correct
25 Correct 73 ms 16752 KB Output is correct
26 Correct 70 ms 16468 KB Output is correct
27 Correct 70 ms 16208 KB Output is correct
28 Correct 74 ms 16360 KB Output is correct
29 Correct 72 ms 15808 KB Output is correct
30 Correct 58 ms 15200 KB Output is correct
31 Correct 41 ms 14676 KB Output is correct
32 Correct 42 ms 14964 KB Output is correct
33 Correct 7 ms 2140 KB Output is correct
34 Correct 71 ms 16980 KB Output is correct
35 Correct 72 ms 16464 KB Output is correct
36 Correct 69 ms 16724 KB Output is correct
37 Correct 78 ms 16468 KB Output is correct
38 Correct 70 ms 16208 KB Output is correct
39 Correct 65 ms 16464 KB Output is correct
40 Correct 48 ms 16468 KB Output is correct
41 Correct 22 ms 9300 KB Output is correct
42 Correct 39 ms 14940 KB Output is correct
43 Correct 53 ms 18256 KB Output is correct
44 Correct 20 ms 9304 KB Output is correct
45 Correct 46 ms 16484 KB Output is correct
46 Correct 50 ms 18272 KB Output is correct
47 Correct 50 ms 18512 KB Output is correct
48 Correct 52 ms 18652 KB Output is correct