제출 #1182086

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1182086		asli_bg	Inspections (NOI23_inspections)	C++20	100 / 100	721 ms	34636 KiB

Main

#include<bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

#define int long long

typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<bool> vb;

#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)

#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pb push_back
#define sp <<" "<<

#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;

#define DEBUG(x) cout<<#x sp x<<endl;
#define carp(x,y) ((x%MOD)*(y%MOD))%MOD
#define topla(x,y) ((x%MOD)+(y%MOD))%MOD
#define mid (l+r)/2

const int MAXN=1e6+5;
const int MOD=1e9+7;
const int INF=1e18;

int l[MAXN], r[MAXN];

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    int n,m,q;
    cin>>n>>m>>q;

    set<pair<pii,int>> s;
    s.insert({{1,n},INF});

    map<int,int> ans;

    int len=0;
    FORE(i,1,m+1){
        cin>>l[i]>>r[i];

        pair<pii,int> ara={{l[i],0},0};
        auto it=s.lower_bound(ara);
        int ind=len+1-l[i];

        while(it!=s.end() and it->fi.fi <= r[i]){
            int bas=it->fi.fi;
            int son=it->fi.se;
            int deg=it->se;
            s.erase(*it);

            if(son > r[i]){ // (l bas r son)
                s.insert({{r[i]+1,son},deg});
                if(deg!=INF) ans[ind-deg-1]+=r[i]-bas+1;
            }
            else if(deg!=INF) ans[ind-deg-1]+=son-bas+1;// (l bas son r)
            
            if(s.empty()) break;

            it=s.lower_bound(ara);
        }

        if(!s.empty() and it!=s.begin()){ 
            it--;
            if(it->fi.se >= l[i]){ //no intersection
            //(bas l son r) or (bas l r son)
                int bas=it->fi.fi;
                int son=it->fi.se;
                int deg=it->se;
                s.erase(*it);

                s.insert({{bas,l[i]-1},deg});
                if(son > r[i]){
                    s.insert({{r[i]+1,son},deg});
                    if(deg!=INF) ans[ind-deg-1]+=r[i]-l[i]+1;
                }
                else if(deg!=INF) ans[ind-deg-1]+=son-l[i]+1;
            }
            it++;
        }

        len+=r[i]-l[i]+1;
        s.insert({{l[i],r[i]},ind});

        /*cout<<l[i] sp r[i] sp ind<<endl;

        for(auto el:s) cout<<"here" sp el.fi.fi sp el.fi.se sp el.se<<endl;
        cout<<"ANS"<<endl;
        for(auto el:ans) cout<<el.fi sp el.se<<endl;*/
    }

    vii qq(q+1);
    FORE(i,1,q+1) {cin>>qq[i].fi;qq[i].se=i;}
    sort(all(qq));
    reverse(all(qq));

    vi cev(q+1,0);

    bool f=true;
    if(!ans.empty()){
        auto it=ans.end();
        it--;

        int sum=0;
        
        for(auto el:qq){
            int deg=el.fi;
            int ind=el.se;
            while(!ans.empty() and ans.rbegin()->fi >= deg){
                sum+=ans.rbegin()->se;
                ans.erase(ans.rbegin()->fi);
            }
            cev[ind]=sum;
        }
    }

    FORE(i,1,q+1) cout<<cev[i]<<' ';
    cout<<endl;
}   

• Subtask 1: 11 / 11
• Subtask 2: 18 / 18
• Subtask 3: 22 / 22
• Subtask 4: 26 / 26
• Subtask 5: 23 / 23