제출 #1205386

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1205386		biank	Inspections (NOI23_inspections)	C++20	29 / 100	2126 ms	1114112 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define forn(i,n) for(int i=0;i<int(n);i++)
#define forsn(i,s,n) for(int i=int(s);i<int(n);i++)
#define dforn(i,n) for(int i=int(n)-1;i>=0;i--)
#define dforsn(i,s,n) for(int i=int(n)-1;i>=int(s);i--)
#define fst first
#define snd second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()

typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef pair<int,int> ii;

const ll INF=1e18;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    int n,m,q;
    cin>>n>>m>>q;
    vll last(n,-1);
    vll diff;
    int time=0;
    forn(_,m){
        int l,r;
        cin>>l>>r;
        --l;
        forsn(i,l,r){
            if(last[i]!=-1) diff.pb(time-last[i]-1);
            last[i]=time++;
        }
    }
    sort(all(diff));
    forn(_,q){
        ll s;
        cin>>s;
        int pos=int(lower_bound(all(diff),s)-begin(diff));
        cout<<sz(diff)-pos<<' ';
    }
    cout<<'\n';
    
    return 0;
}

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