oj.uz

Submission #933319

# Submission time Handle Problem Language Result Execution time Memory
933319 2024-02-25T13:19:44 Z browntoad Inspections (NOI23_inspections) C++14
100 / 100
 241 ms 30524 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, n+1)
#define pii pair<int, int>
#define ppi pair<pii, int>
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)((x).size())
#define f first
#define s second
#define pb push_back
#define IOS() ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define endl '\n'

const ll maxn = 1e6+5;
const ll inf = 1ll<<60;
const ll mod = 1e9+7;

int n, m, q;
vector<pii> tag; // lazy tag to modify suffix

multiset<ppi> st;

set<ppi> ::iterator rep(set<ppi> ::iterator it, int L, int R, int v){
    ppi cur = (*it);
    int l = cur.f.f;
    int r = cur.f.s;
    //cout<<l<<' '<<r<<' '<<L<<' '<<R<<' '<<cur.s<<' '<<v<<endl;
    if (r < L || l > R) return next(it);
    if (l < L && r > R){
        tag.pb({v-(cur.s+L-l)-1, R-L+1});
        st.insert({{l, L-1}, cur.s});
        st.insert({{R+1, r}, cur.s+R+1-l});
        return st.erase(it);
    }
    if (l < L){
        //cout<<"toad"<<endl;
        tag.pb({v-(cur.s+L-l)-1, r-L+1});
        st.insert({{l, L-1}, cur.s});
        return st.erase(it);
    }
    if (r > R){
        tag.pb({v-(cur.s-(l-L))-1, R-l+1});
        st.insert({{R+1, r}, cur.s+R+1-l});
        return st.erase(it);
    }

    tag.pb({v-(cur.s-(l-L))-1, r-l+1});
    return st.erase(it);
}
signed main(){
    IOS();
    cin>>n>>m>>q;
    int cval = 0;
    REP(i, m){
        int L, R; cin>>L>>R;
        if (SZ(st) > 0){
            auto tt = st.lower_bound({{L+1, 0}, 0});
            if (tt != st.begin()){
                tt = prev(tt);
            }
            while(tt != st.end() && (*tt).f.f <= R){
                tt = rep(tt, L, R, cval);
            }
        }
        st.insert({{L, R}, cval});

        cval += R-L+1;
    }
    sort(ALL(tag), greater<pii> ());

    vector<pii> quer(q);
    REP(i, q){
        cin>>quer[i].f;
        quer[i].s = i;
    }
    vector<int> ans(q);
    sort(ALL(quer), greater<pii> ());
    int ptr = 0, woo = 0;
    REP(i, q){
        while(ptr < SZ(tag) && tag[ptr].f >= quer[i].f){
            woo += tag[ptr].s;
            ptr++;
        }

        ans[quer[i].s] = woo;
    }
    REP(i, q) cout<<ans[i]<<' ';
    cout<<endl;

}
/*
5 3 7
1 3
3 5
2 3

bruh 4 minutes debug
*/

Subtask #1
11.0 / 11.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 0 ms 452 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 42 ms 7120 KB Output is correct
14 Correct 38 ms 6896 KB Output is correct
15 Correct 41 ms 7108 KB Output is correct
16 Correct 41 ms 7248 KB Output is correct
17 Correct 40 ms 7132 KB Output is correct
18 Correct 40 ms 6992 KB Output is correct
19 Correct 43 ms 7252 KB Output is correct

Subtask #3
22.0 / 22.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 41 ms 6992 KB Output is correct
4 Correct 43 ms 7508 KB Output is correct
5 Correct 125 ms 16588 KB Output is correct
6 Correct 127 ms 16012 KB Output is correct
7 Correct 95 ms 13316 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 0 ms 452 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 42 ms 7120 KB Output is correct
14 Correct 38 ms 6896 KB Output is correct
15 Correct 41 ms 7108 KB Output is correct
16 Correct 41 ms 7248 KB Output is correct
17 Correct 40 ms 7132 KB Output is correct
18 Correct 40 ms 6992 KB Output is correct
19 Correct 43 ms 7252 KB Output is correct
20 Correct 42 ms 8276 KB Output is correct
21 Correct 40 ms 7404 KB Output is correct
22 Correct 43 ms 8184 KB Output is correct
23 Correct 39 ms 7316 KB Output is correct
24 Correct 39 ms 6996 KB Output is correct
25 Correct 43 ms 7508 KB Output is correct
26 Correct 42 ms 8284 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 0 ms 452 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 42 ms 7120 KB Output is correct
14 Correct 38 ms 6896 KB Output is correct
15 Correct 41 ms 7108 KB Output is correct
16 Correct 41 ms 7248 KB Output is correct
17 Correct 40 ms 7132 KB Output is correct
18 Correct 40 ms 6992 KB Output is correct
19 Correct 43 ms 7252 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 41 ms 6992 KB Output is correct
23 Correct 43 ms 7508 KB Output is correct
24 Correct 125 ms 16588 KB Output is correct
25 Correct 127 ms 16012 KB Output is correct
26 Correct 95 ms 13316 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 42 ms 8276 KB Output is correct
30 Correct 40 ms 7404 KB Output is correct
31 Correct 43 ms 8184 KB Output is correct
32 Correct 39 ms 7316 KB Output is correct
33 Correct 39 ms 6996 KB Output is correct
34 Correct 43 ms 7508 KB Output is correct
35 Correct 42 ms 8284 KB Output is correct
36 Correct 187 ms 21064 KB Output is correct
37 Correct 212 ms 20832 KB Output is correct
38 Correct 177 ms 20244 KB Output is correct
39 Correct 127 ms 17300 KB Output is correct
40 Correct 184 ms 20532 KB Output is correct
41 Correct 215 ms 25196 KB Output is correct
42 Correct 225 ms 26740 KB Output is correct
43 Correct 236 ms 30384 KB Output is correct
44 Correct 241 ms 30524 KB Output is correct
45 Correct 198 ms 20660 KB Output is correct
46 Correct 234 ms 19264 KB Output is correct
47 Correct 230 ms 19116 KB Output is correct
48 Correct 192 ms 21208 KB Output is correct