제출 #1187220

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1187220		aladdin1	Pilot (NOI19_pilot)	C++20	89 / 100	1018 ms	83376 KiB

pilot

#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define int long long
const int N=1e6+5;
int a[N];
ll ans[N];
bool in[N];
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll n,q;
    cin>>n>>q;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    vector<pair<int,int>>qr(q);
    for(int i=0;i<q;i++){
        cin>>qr[i].ff;
        qr[i].ss=i;
    }
    sort(qr.begin(),qr.end());
    reverse(qr.begin(),qr.end());
    vector<pair<int,int>>vc;
    for(int i=1;i<=n;i++){
        vc.pb({a[i],i});
    }
    sort(vc.begin(),vc.end());
    ll H= (n*(n-1))/2+n;
    set<int>st={0,n+1};
    in[0]=1;
    in[n+1]=1;
    for(auto p:qr){
        int x=p.ff,id=p.ss;
        while(vc.size() and vc.back().ff>x){
            int idx=vc.back().ss;
            int R=*st.upper_bound(idx);
            int L= *prev(st.lower_bound(idx));
            ll p=R-L-1;
            
            H-=(p*(p-1)/2+p);
            p=idx-L-1;
            H+=(p*(p-1)/2+p);
            p=R-idx-1;
            H+=(p*(p-1)/2+p);
            if(in[idx-1]==0 or in[idx+1]==0){
                st.insert(idx);
            }
            in[idx]=1;
            vc.pop_back();
        }
        ans[id]=H;
    }
    for(int i=0;i<q;i++){
        cout<<ans[i]<<'\n';
    }
}

• Subtask 1: 3 / 3
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 5 / 5
• Subtask 6: 9 / 9
• Subtask 7: 14 / 14
• Subtask 8: 10 / 10
• Subtask 9: 11 / 11
• Subtask 10: 0 / 11