oj.uz

Submission #979894

# Submission time Handle Problem Language Result Execution time Memory
979894 2024-05-11T15:12:41 Z hugo_pm Fish 3 (JOI24_fish3) C++17
100 / 100
 252 ms 61084 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define sz(v) ((int)((v).size()))

template<typename T>
void chmax(T &x, const T &v) { if (x < v) x = v; }
template<typename T>
void chmin(T &x, const T &v) { if (x > v) x = v; }

using pii = pair<int, int>;
using vi = vector<int>;
using ll = long long;

string to_string(string s) { return s; }
template <typename T> string to_string(T v) {
    bool first = true;
    string res = "[";
    for (const auto &x : v) {
        if (!first)
            res += ", ";
        first = false;
        res += to_string(x);
    }
    res += "]";
    return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

void dbg_out() { cout << endl; }
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) {
    cout << ' ' << to_string(H);
    dbg_out(T...);
}

#ifdef DEBUG
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

struct Req { int lft, iReq; };
struct Itv {
    int l, r, qt;
};
bool operator<(Itv a, Itv b) { return a.l < b.l; };
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int nbFish, delta;
    cin >> nbFish >> delta;
    vector<int> ideal(nbFish);
    vector<int> sumQt {0}, sumDecal {0};
    rep(i, 0, nbFish) {
        cin >> ideal[i];
        sumQt.push_back(sumQt.back() + ideal[i]/delta);
        int decal = i && (ideal[i-1] % delta > ideal[i] % delta);
        sumDecal.push_back(sumDecal.back() + decal);
    }
    vector<int> quadDecal {0};
    for (int sigma : sumDecal) {
        quadDecal.push_back(quadDecal.back() + sigma);
    }
    auto sumItv = [&] (Itv itv, int query_lft = -1e18) {
        int l = max(itv.l, query_lft);
        int nbElem = itv.r - l + 1;
        int totDecal = nbElem * sumDecal[itv.r+1] -quadDecal[itv.r+2] + quadDecal[l+1];
        return nbElem * itv.qt - totDecal; 
    };
    auto qtAt = [&] (Itv itv, int i) {
        return itv.qt - (sumDecal[itv.r+1] - sumDecal[i+1]);
    };


    int nbReq; cin >> nbReq;
    vector<vector<Req>> reqs(nbFish);
    rep(iReq, 0, nbReq) {
        int lft, rgt;
        cin >> lft >> rgt;
        --lft, --rgt;
        reqs[rgt].push_back({lft, iReq});
    }
    vector<int> answers(nbReq);
    vector<Itv> stk;
    vector<int> sumStk {0} ;
    rep(rgt, 0, nbFish) {
        int qtRgt = ideal[rgt] / delta;
        Itv toPush {rgt, rgt, qtRgt};
        while (!stk.empty() && stk.back().qt >= qtAt(toPush, toPush.l)) {
            toPush.l = stk.back().l;
            stk.pop_back();
            sumStk.pop_back();
        }
        stk.push_back(toPush);
        sumStk.push_back(sumStk.back() + sumItv(stk.back()));
        for (auto [lft, iReq] : reqs[rgt]) {
            #ifdef DEBUG
            dbg(lft, rgt);
            for (auto itv : stk) {
                dbg(itv.l, itv.r, itv.qt, sumItv(itv, lft));
            }
            #endif
            int idItvContainingLft = lower_bound(all(stk), Itv {lft+1, -1, -1}) - stk.begin() - 1;
            int sumBelowIncluded = sumStk.back() - sumStk[idItvContainingLft+1];
            int belowBorder = sumItv(stk[idItvContainingLft], lft);

            int totalBelow = sumBelowIncluded + belowBorder;
            
            int sumAbove = sumQt[rgt+1] - sumQt[lft];
            answers[iReq] = sumAbove - totalBelow;
            dbg(sumAbove, sumBelowIncluded, belowBorder, sumDecal[rgt+1]);
            if (qtAt(stk[idItvContainingLft], lft) < 0) {
                answers[iReq] = -1;
            }
        }
    }
    for (int x : answers) {
        cout << x << '\n';
    }
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 704 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 856 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 1 ms 604 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 30160 KB Output is correct
2 Correct 123 ms 34060 KB Output is correct
3 Correct 57 ms 14244 KB Output is correct
4 Correct 132 ms 32976 KB Output is correct
5 Correct 132 ms 34468 KB Output is correct
6 Correct 143 ms 33896 KB Output is correct
7 Correct 126 ms 34332 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 15440 KB Output is correct
2 Correct 168 ms 43516 KB Output is correct
3 Correct 160 ms 41244 KB Output is correct
4 Correct 172 ms 44004 KB Output is correct
5 Correct 158 ms 43156 KB Output is correct
6 Correct 138 ms 35088 KB Output is correct
7 Correct 140 ms 35580 KB Output is correct
8 Correct 145 ms 39000 KB Output is correct
9 Correct 156 ms 38132 KB Output is correct
10 Correct 237 ms 61084 KB Output is correct
11 Correct 222 ms 56608 KB Output is correct
12 Correct 252 ms 48420 KB Output is correct
13 Correct 216 ms 48672 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 26000 KB Output is correct
2 Correct 151 ms 32928 KB Output is correct
3 Correct 89 ms 15676 KB Output is correct
4 Correct 149 ms 31256 KB Output is correct
5 Correct 155 ms 31524 KB Output is correct
6 Correct 160 ms 34592 KB Output is correct
7 Correct 142 ms 28464 KB Output is correct
8 Correct 161 ms 34476 KB Output is correct
9 Correct 129 ms 29476 KB Output is correct
10 Correct 127 ms 30244 KB Output is correct
11 Correct 154 ms 29968 KB Output is correct
12 Correct 145 ms 30740 KB Output is correct
13 Correct 157 ms 35688 KB Output is correct
14 Correct 147 ms 29212 KB Output is correct
15 Correct 187 ms 34184 KB Output is correct
16 Correct 143 ms 29440 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 704 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 856 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 125 ms 30160 KB Output is correct
15 Correct 123 ms 34060 KB Output is correct
16 Correct 57 ms 14244 KB Output is correct
17 Correct 132 ms 32976 KB Output is correct
18 Correct 132 ms 34468 KB Output is correct
19 Correct 143 ms 33896 KB Output is correct
20 Correct 126 ms 34332 KB Output is correct
21 Correct 62 ms 15440 KB Output is correct
22 Correct 168 ms 43516 KB Output is correct
23 Correct 160 ms 41244 KB Output is correct
24 Correct 172 ms 44004 KB Output is correct
25 Correct 158 ms 43156 KB Output is correct
26 Correct 138 ms 35088 KB Output is correct
27 Correct 140 ms 35580 KB Output is correct
28 Correct 145 ms 39000 KB Output is correct
29 Correct 156 ms 38132 KB Output is correct
30 Correct 237 ms 61084 KB Output is correct
31 Correct 222 ms 56608 KB Output is correct
32 Correct 252 ms 48420 KB Output is correct
33 Correct 216 ms 48672 KB Output is correct
34 Correct 141 ms 26000 KB Output is correct
35 Correct 151 ms 32928 KB Output is correct
36 Correct 89 ms 15676 KB Output is correct
37 Correct 149 ms 31256 KB Output is correct
38 Correct 155 ms 31524 KB Output is correct
39 Correct 160 ms 34592 KB Output is correct
40 Correct 142 ms 28464 KB Output is correct
41 Correct 161 ms 34476 KB Output is correct
42 Correct 129 ms 29476 KB Output is correct
43 Correct 127 ms 30244 KB Output is correct
44 Correct 154 ms 29968 KB Output is correct
45 Correct 145 ms 30740 KB Output is correct
46 Correct 157 ms 35688 KB Output is correct
47 Correct 147 ms 29212 KB Output is correct
48 Correct 187 ms 34184 KB Output is correct
49 Correct 143 ms 29440 KB Output is correct
50 Correct 168 ms 40740 KB Output is correct
51 Correct 132 ms 34848 KB Output is correct
52 Correct 186 ms 38676 KB Output is correct
53 Correct 231 ms 56292 KB Output is correct
54 Correct 216 ms 47096 KB Output is correct
55 Correct 168 ms 43552 KB Output is correct
56 Correct 147 ms 36388 KB Output is correct
57 Correct 144 ms 35724 KB Output is correct
58 Correct 157 ms 34592 KB Output is correct
59 Correct 165 ms 38540 KB Output is correct
60 Correct 168 ms 35936 KB Output is correct
61 Correct 236 ms 54464 KB Output is correct
62 Correct 160 ms 38764 KB Output is correct
63 Correct 221 ms 47652 KB Output is correct
64 Correct 149 ms 36380 KB Output is correct