Submission #1159911

#	Time	Username	Problem	Language	Result	Execution time	Memory
1159911		Andrey	Construction of Highway (JOI18_construction)	C++20	16 / 100	2096 ms	27672 KiB

construction

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

vector<int> haha[100001];
vector<int> st(100001);
vector<int> pos(100001);
int bruh[100001][18];
vector<int> banana(100001);
vector<int> dep(100001);
vector<pair<int,int>> seg(500001);
int z = 1;

void dfs(int a, int t) {
    st[a] = 1;
    pos[a] = z;
    z++;
    if(t != -1) {
        dep[a] = dep[t]+1;
    }
    bruh[a][0] = t;
    for(int v: haha[a]) {
        if(v != t) {
            dfs(v,a);
            st[a]+=st[v];
        }
    }
}

void upd(int l, int r, int x, int p, pair<int,int> c) {
    if(l == r) {
        seg[x] = c;
        return;
    }
    int mid = (l+r)/2;
    if(p <= mid) {
        upd(l,mid,x*2,p,c);
    }
    else {
        upd(mid+1,r,x*2+1,p,c);
    }
    seg[x] = max(seg[x*2],seg[x*2+1]);
}

pair<int,int> calc(int l, int r, int x, int ql, int qr) {
    //cout << l << " " << r << " " << ql << " " << qr << endl;
    if(l == ql && r == qr) {
        return seg[x];
    }
    int mid = (l+r)/2;
    if(qr <= mid) {
        return calc(l,mid,x*2,ql,qr);
    }
    else if(ql > mid) {
        return calc(mid+1,r,x*2+1,ql,qr);
    }
    else {
        pair<int,int> a = calc(l,mid,x*2,ql,mid);
        pair<int,int> b = calc(mid+1,r,x*2+1,mid+1,qr);
        return max(a,b);
    }
}

int lift(int a, int br) {
    for(int i = 17; i >= 0; i--) {
        if(br&(1 << i)) {
            a = bruh[a][i];
        }
    }
    return a;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n,a,b;
    cin >> n;
    for(int i = 1; i <= n; i++) {
        cin >> banana[i];
    }
    vector<pair<int,int>> edge(0);
    vector<int> lol(n+1);
    for(int i = 0; i < n-1; i++) {
        cin >> a >> b;
        edge.push_back({a,b});
        haha[a].push_back(b);
    }
    dfs(1,-1);
    for(int i = 1; i < 18; i++) {
        for(int j = 1; j <= n; j++) {
            if(bruh[j][i-1] == -1) {
                bruh[j][i] = -1;
            }
            else {
                bruh[j][i] = bruh[bruh[j][i-1]][i-1];
            }
        }
    }
    upd(1,n,1,1,{1,1});
    for(int i = 0; i < n-1; i++) {
        a = edge[i].first;
        b = edge[i].second;
        lol[b] = 0;
        int c = a;
        vector<pair<int,int>> wut(0);
        while(c != -1) {
            int col = calc(1,n,1,pos[c],pos[c]+st[c]-1).second;
            int e = dep[c]-lol[col]+1;
            lol[col] = dep[c]+1;
            wut.push_back({banana[col],e});
            c = lift(c,e);
        }
        upd(1,n,1,pos[b],{i+2,b});
        int ans = 0;
        for(int j = 0; j < wut.size(); j++) {
            for(int k = j+1; k < wut.size(); k++) {
                if(wut[j].first < wut[k].first) {
                    ans+=wut[j].second*wut[k].second;
                }
            }
        }
        cout << ans << "\n";
    }
    return 0;
}

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