제출 #766344

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
766344		1075508020060209tc	Construction of Highway (JOI18_construction)	C++14	16 / 100	2076 ms	11424 KiB

construction

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define X first
#define Y second
int lowbit(int x){return x&-x;}
int bit[500005];
void upd(int pl,int x){
while(pl<=200000){
    bit[pl]+=x;
    pl+=lowbit(pl);
}
}
int qsum(int pl){
int ret=0;
while(pl){
    ret+=bit[pl];
    pl-=lowbit(pl);
}
return ret;
}

int n;int ar[500005];
int fa[200005];
int va[200005];int vb[200005];
vector<int>e[200005];


void lisanhua(){
vector<int>vc;
for(int i=1;i<=n;i++){
    vc.push_back(ar[i]);
}
sort(vc.begin(),vc.end());
for(int i=1;i<=n;i++){
    ar[i]=1+lower_bound(vc.begin(),vc.end(),ar[i])-vc.begin();
}
}

signed main(){
cin>>n;
for(int i=1;i<=n;i++){
    cin>>ar[i];
}
lisanhua();
for(int i=1;i<=n-1;i++){
    cin>>va[i]>>vb[i];
    fa[vb[i]]=va[i];
    int nw=va[i];
    int ans=0;
    while(nw!=0){
        upd(ar[nw],1);
        ans+=qsum(ar[nw]-1);
        nw=fa[nw];
    }
    nw=va[i];
    while(nw!=0){
        upd(ar[nw],-1);
        ar[nw]=ar[vb[i]];
        nw=fa[nw];
    }
    cout<<ans<<"\n";
}



}

• Subtask 1: 7 / 7
• Subtask 2: 9 / 9
• Subtask 3: 0 / 84