Submission #1007972

#	Time	Username	Problem	Language	Result	Execution time	Memory
1007972		Luvidi	Pilot (NOI19_pilot)	C++17	100 / 100	985 ms	90644 KiB

pilot

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

#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fs first
#define sc second
#define pb push_back

void solve() {
    ll n,q;
    cin>>n>>q;
    pii h[n], y[q];
    for (int i=0;i<n;i++){
        cin>>h[i].fs;
        h[i].sc=i;
    }
    for (int i=0;i<q;i++){
        cin>>y[i].fs;
        y[i].sc=i;
    }
    sort(h,h+n);
    reverse(h,h+n);
    sort(y,y+q);
    reverse(y,y+q);
    ll ans[q];
    set<int> r;
    r.insert(n-1);
    r.insert(-1);
    ll idx=0,last=1e6+1,cnt=n*(n+1)/2;
    for (int i=0;i<q;i++){
        while(last>y[i].fs+1){
            last--;
            while(h[idx].fs==last){
                auto it=r.lower_bound(h[idx].sc);
                ll a,b,c;
                a=*it;
                it--;
                b=*it;
                c=h[idx].sc;
                cnt-=(a-b)*(a-b+1)/2;
                cnt+=(a-c)*(a-c+1)/2;
                cnt+=(c-b-1)*(c-b)/2;
                r.insert(c);
                r.insert(c-1);
                idx++;
            }
        }
        ans[y[i].sc]=cnt;
    }
    for (int i=0;i<q;i++)cout<<ans[i]<<'\n';
}

int main() {   
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    solve();
}

• 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: 11 / 11