oj.uz

Submission #832602

# Submission time Handle Problem Language Result Execution time Memory
832602 2023-08-21T12:18:38 Z _martynas Inspections (NOI23_inspections) C++11
100 / 100
 664 ms 32204 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <array>
#include <cassert>

using namespace std;

using ll = long long;

const int mxn = 2e5+5;

int n, m, q;
int l[mxn], r[mxn];
ll s[mxn], ans[mxn];

struct Interval {
    int l, r;
    long long t;
    bool operator<(const Interval& other) const {
        return r < other.r;
    }
    array<Interval, 2> cut(int m, bool right_cut) {
        return {Interval{l, m-right_cut, t}, Interval{m+1-right_cut, r, t+m-l+1-right_cut}};
    }
    pair<ll, ll> eat(Interval top) {
        assert(top.l <= l && r <= top.r);
        pair<ll, ll> info; info.second = r-l+1;
        info.first = (l-top.l)+(top.t-t);
        return info;
    }
};

int main(int argc, char const *argv[]) {
    cin >> n >> m >> q;
    for(int i = 1; i <= m; i++) {
        cin >> l[i] >> r[i];
    }
    for(int i = 1; i <= q; i++) {
        cin >> s[i];
    }
    // using intervals find largest s such that all s* s.t. s*<=s increase
    map<ll, ll> inc;
    set<Interval> ints;
    long long t = 0;
    for(int i = 1; i <= m; i++) {
        Interval curr{l[i], r[i], t};
        // printf("%d: [%d; %d] at %d\n", i, l[i], r[i], t);
        auto it = ints.lower_bound(Interval{-1000, l[i]});
        while(it != ints.end() && it->l <= r[i]) {
            Interval last = *it;
            ints.erase(it);
            // printf("\t[%d; %d] (%d)\n", last.l, last.r, last.t);
            if(curr.l <= last.l && last.r <= curr.r) {
                auto leftovers = last.eat(curr);
                // printf("[%d; %d] (%d) ate [%d; %d] (%d)\n", curr.l, curr.r, curr.t, last.l, last.r, last.t);
                // printf("leftovers: %d %d\n", leftovers.first, leftovers.second);
                inc[leftovers.first-1] += leftovers.second;
            }
            else {
                auto parts = last.cut((last.r > curr.r ? curr.r : curr.l), !(last.r > curr.r));
                ints.insert(parts[0]);
                ints.insert(parts[1]);
                // printf("split into:\n");
                // printf("[%d; %d] (%d)\n", parts[0].l, parts[0].r, parts[0].t);
                // printf("[%d; %d] (%d)\n", parts[1].l, parts[1].r, parts[1].t);
            }
            // find it again
            it = ints.lower_bound(Interval{-1000, l[i]});
        }
        ints.insert(curr);
        t += r[i]-l[i]+1;
    }
    // accumulate answers
    vector<int> dec_s(q); iota(dec_s.begin(), dec_s.end(), 1);
    sort(dec_s.begin(), dec_s.end(), [&](int i, int j) { return s[i] > s[j];});
    ll sum = 0;
    auto it = inc.rbegin();
    for(int i = 0; i < q; i++) {
        int j = dec_s[i];
        while(it != inc.rend() && it->first >= s[j]) {
            sum += it->second;
            it++;
        }
        ans[j] = sum;
    }
    for(int i = 1; i <= q; i++) cout << ans[i] << " ";
    cout << "\n";
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 83 ms 4864 KB Output is correct
14 Correct 76 ms 4576 KB Output is correct
15 Correct 77 ms 4820 KB Output is correct
16 Correct 81 ms 5044 KB Output is correct
17 Correct 77 ms 4788 KB Output is correct
18 Correct 76 ms 4816 KB Output is correct
19 Correct 88 ms 5332 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 76 ms 4828 KB Output is correct
4 Correct 89 ms 5152 KB Output is correct
5 Correct 373 ms 24976 KB Output is correct
6 Correct 338 ms 23416 KB Output is correct
7 Correct 238 ms 19660 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 83 ms 4864 KB Output is correct
14 Correct 76 ms 4576 KB Output is correct
15 Correct 77 ms 4820 KB Output is correct
16 Correct 81 ms 5044 KB Output is correct
17 Correct 77 ms 4788 KB Output is correct
18 Correct 76 ms 4816 KB Output is correct
19 Correct 88 ms 5332 KB Output is correct
20 Correct 77 ms 6204 KB Output is correct
21 Correct 75 ms 5204 KB Output is correct
22 Correct 76 ms 6096 KB Output is correct
23 Correct 74 ms 5240 KB Output is correct
24 Correct 77 ms 4916 KB Output is correct
25 Correct 100 ms 5092 KB Output is correct
26 Correct 85 ms 6452 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 83 ms 4864 KB Output is correct
14 Correct 76 ms 4576 KB Output is correct
15 Correct 77 ms 4820 KB Output is correct
16 Correct 81 ms 5044 KB Output is correct
17 Correct 77 ms 4788 KB Output is correct
18 Correct 76 ms 4816 KB Output is correct
19 Correct 88 ms 5332 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 76 ms 4828 KB Output is correct
23 Correct 89 ms 5152 KB Output is correct
24 Correct 373 ms 24976 KB Output is correct
25 Correct 338 ms 23416 KB Output is correct
26 Correct 238 ms 19660 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 77 ms 6204 KB Output is correct
30 Correct 75 ms 5204 KB Output is correct
31 Correct 76 ms 6096 KB Output is correct
32 Correct 74 ms 5240 KB Output is correct
33 Correct 77 ms 4916 KB Output is correct
34 Correct 100 ms 5092 KB Output is correct
35 Correct 85 ms 6452 KB Output is correct
36 Correct 430 ms 20684 KB Output is correct
37 Correct 562 ms 31060 KB Output is correct
38 Correct 507 ms 29608 KB Output is correct
39 Correct 217 ms 7036 KB Output is correct
40 Correct 473 ms 26384 KB Output is correct
41 Correct 453 ms 28348 KB Output is correct
42 Correct 444 ms 29012 KB Output is correct
43 Correct 466 ms 32204 KB Output is correct
44 Correct 460 ms 31168 KB Output is correct
45 Correct 645 ms 30124 KB Output is correct
46 Correct 646 ms 28524 KB Output is correct
47 Correct 664 ms 27516 KB Output is correct
48 Correct 605 ms 30472 KB Output is correct