답안 #933227

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
933227	2024-02-25T09:47:36 Z	browntoad	Inspections (NOI23_inspections)	C++14	100 / 100	238 ms	30432 KB

Main

#include <bits/stdc++.h>
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
*/

Subtask #1
11.0 / 11.0

#	결과	메모리	Grader output
1	Correct	344 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	452 KB	Output is correct
5	Correct	460 KB	Output is correct
6	Correct	344 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	452 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct
12	Correct	348 KB	Output is correct

Subtask #2
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	452 KB	Output is correct
5	Correct	0 ms	460 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	452 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	48 ms	7236 KB	Output is correct
14	Correct	39 ms	6992 KB	Output is correct
15	Correct	41 ms	7276 KB	Output is correct
16	Correct	41 ms	7268 KB	Output is correct
17	Correct	41 ms	6992 KB	Output is correct
18	Correct	42 ms	7416 KB	Output is correct
19	Correct	41 ms	7320 KB	Output is correct

Subtask #3
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	40 ms	5596 KB	Output is correct
4	Correct	42 ms	5972 KB	Output is correct
5	Correct	122 ms	13492 KB	Output is correct
6	Correct	123 ms	11700 KB	Output is correct
7	Correct	93 ms	11432 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct

Subtask #4
26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	452 KB	Output is correct
5	Correct	0 ms	460 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	452 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	48 ms	7236 KB	Output is correct
14	Correct	39 ms	6992 KB	Output is correct
15	Correct	41 ms	7276 KB	Output is correct
16	Correct	41 ms	7268 KB	Output is correct
17	Correct	41 ms	6992 KB	Output is correct
18	Correct	42 ms	7416 KB	Output is correct
19	Correct	41 ms	7320 KB	Output is correct
20	Correct	41 ms	8252 KB	Output is correct
21	Correct	42 ms	7532 KB	Output is correct
22	Correct	41 ms	8272 KB	Output is correct
23	Correct	42 ms	7284 KB	Output is correct
24	Correct	39 ms	6924 KB	Output is correct
25	Correct	50 ms	7660 KB	Output is correct
26	Correct	42 ms	8268 KB	Output is correct

Subtask #5
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	452 KB	Output is correct
5	Correct	0 ms	460 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	452 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	48 ms	7236 KB	Output is correct
14	Correct	39 ms	6992 KB	Output is correct
15	Correct	41 ms	7276 KB	Output is correct
16	Correct	41 ms	7268 KB	Output is correct
17	Correct	41 ms	6992 KB	Output is correct
18	Correct	42 ms	7416 KB	Output is correct
19	Correct	41 ms	7320 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	40 ms	5596 KB	Output is correct
23	Correct	42 ms	5972 KB	Output is correct
24	Correct	122 ms	13492 KB	Output is correct
25	Correct	123 ms	11700 KB	Output is correct
26	Correct	93 ms	11432 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	41 ms	8252 KB	Output is correct
30	Correct	42 ms	7532 KB	Output is correct
31	Correct	41 ms	8272 KB	Output is correct
32	Correct	42 ms	7284 KB	Output is correct
33	Correct	39 ms	6924 KB	Output is correct
34	Correct	50 ms	7660 KB	Output is correct
35	Correct	42 ms	8268 KB	Output is correct
36	Correct	181 ms	20716 KB	Output is correct
37	Correct	180 ms	21396 KB	Output is correct
38	Correct	178 ms	20396 KB	Output is correct
39	Correct	124 ms	17688 KB	Output is correct
40	Correct	187 ms	20388 KB	Output is correct
41	Correct	226 ms	25520 KB	Output is correct
42	Correct	213 ms	26136 KB	Output is correct
43	Correct	238 ms	30432 KB	Output is correct
44	Correct	238 ms	30128 KB	Output is correct
45	Correct	201 ms	19884 KB	Output is correct
46	Correct	226 ms	19364 KB	Output is correct
47	Correct	228 ms	19032 KB	Output is correct
48	Correct	178 ms	21180 KB	Output is correct

답안 #933227

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 18.0 / 18.0

Subtask #3 22.0 / 22.0

Subtask #4 26.0 / 26.0

Subtask #5 23.0 / 23.0

Subtask #1
11.0 / 11.0

Subtask #2
18.0 / 18.0

Subtask #3
22.0 / 22.0

Subtask #4
26.0 / 26.0

Subtask #5
23.0 / 23.0