제출 #893385

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
893385		Warinchai	Pilot (NOI19_pilot)	C++14	28 / 100	33 ms	35888 KiB

pilot

#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,q;
int ar[1000005];
int asum[1000005];
int ssum[1000005];
int rsum[1000005];
vector<int>v;
struct node{
    int val;
    int sz;
    node *l;
    node *r;
    node(int x=0){
        val=x;
        l=NULL;
        r=NULL;
        sz=0;
    }
};
node *rt=NULL;
vector<int>qr;
stack<node*>s;
void dfs(node *u){
    u->sz=1;
    if(u->l){
        dfs(u->l);
        u->sz+=u->l->sz;
    }
    if(u->r){
        dfs(u->r);
        u->sz+=u->r->sz;
    }
    //cerr<<u->val<<" "<<u->sz<<"\n";
}
void dfs2(node *u,int pn=0){
    asum[u->val]+=(u->sz)*((u->sz)+1)/2;
    ssum[pn-1]+=(u->sz)*((u->sz)+1)/2;
    if(u->l)dfs2(u->l,u->val);
    if(u->r)dfs2(u->r,u->val);
}
int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>q;
    for(int i=1;i<=n;i++){
        cin>>ar[i];
    }
    for(int i=0;i<q;i++){
        int a;cin>>a;
        qr.push_back(a);
    }
    //sort(qr.begin(),qr.end(),greater<pair<int,int> >());
    for(int i=1;i<=n;i++){
        int x=ar[i];
        node *p=NULL;
        while(!s.empty()&&s.top()->val<x){
            p=s.top();
            s.pop();
        }
        if(s.empty()){
            rt=new node(x);
            rt->l=p;
            s.push(rt);
        }else{
            s.top()->r=new node(x);
            s.top()->r->l=p;
            s.push(s.top()->r);
        }
    }
    dfs(rt);
    dfs2(rt,1e6+2);
    long long sum=0;
    for(int i=1;i<=1e6;i++){
        sum+=asum[i];
        rsum[i]=sum;
        sum-=ssum[i];
    }
    for(auto x:qr)cout<<rsum[x]<<"\n";
}

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