oj.uz

답안 #933318

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
933318 2024-02-25T13:04:25 Z parlimoos Construction of Highway (JOI18_construction) C++14
0 / 100
 3 ms 10888 KB 
//Be Name KHODA
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
#define pb push_back
#define pp pop_back
#define lb lower_bound
#define ub upper_bound
#define cl clear
#define bg begin
#define arr(x) array<int , x>
#define endl '\n'


int n;
vector<int> a , cmp;
int tms[100000] , cs[100000] , hs[100000];
int pth[100000] , bl[100000][20];
int seg[400001][2] , seginf[400001][2] , is[100000];
int fen[100001];
int segcnt = 0;
vector<int> tr[100000];
vector<arr(2)> ops;
vector<arr(2)> ns;

int timer = -1;
void dfs1(int v = 0 , int p = -1){
    cs[v] = 1 , bl[v][0] = p;
    if(p != -1) hs[v] = hs[p] + 1;
    for(int i = 1 ; i < 20 ; i++){
        if(bl[v][i - 1] == -1) bl[v][i] = -1;
        else bl[v][i] = bl[bl[v][i - 1]][i - 1];
    }
    for(int u : tr[v]) if(u != p) dfs1(u , v) , cs[v] += cs[u];
}
void hld(int v = 0){
    tms[v] = ++timer;
    int mxi = -1;
    for(int u : tr[v]) if(u != bl[v][0] and (mxi == -1 or cs[mxi] < cs[u])) mxi = u;
    if(mxi == -1) return;
    pth[mxi] = pth[v] , hld(mxi);
    for(int u : tr[v]) if(u != bl[v][0] and u != mxi) pth[u] = u , hld(u);
}
void buildSeg(int l = 0 , int r = n - 1 , int i = 1){
    seginf[i][0] = l , seginf[i][1] = r , seg[i][1] = -1;
    if(l == r) is[l] = i;
    else{
        int c = (r + l - 1) >> 1;
        buildSeg(l , c , i << 1) , buildSeg(c + 1 , r , (i << 1) | 1);
    }
}
void updSeg(int l , int r , int i , int val){
    if(seginf[i][0] >= l and seginf[i][1] <= r) seg[i][0] = val , seg[i][1] = segcnt;
    else if(seginf[i][1] >= l and seginf[i][0] <= r) updSeg(l , r , i << 1 , val) , updSeg(l , r , (i << 1) | 1 , val);
}
int getSeg(int v){
    int i = is[tms[v]] , res = seg[i][0] , time = seg[i][1];
    while(i > 1){
        i >>= 1;
        if(time < seg[i][1]) time = seg[i][1] , res = seg[i][0];
    }
    return res;
}
void cmpInt(){
    cmp = a;
    sort(cmp.bg() , cmp.end());
    cmp.resize(int(unique(cmp.bg() , cmp.end()) - cmp.bg()));
    for(int &el : a) el = int(lb(cmp.bg() , cmp.end() , el) - cmp.bg());
}
void addFen(int i , int val){
    i++;
    while(i < n + 1) fen[i] += val , i += (i & (-i));
}
int getFen(int l , int r){
    int res = 0;
    r++;
    while(r > 0) res += fen[r] , r -= (r & (-r));
    while(l > 0) res -= fen[l] , l -= (l & (-l));
    return res;
}
void updPth(int v , int val){
    while(v != -1){
        updSeg(tms[pth[v]] , tms[v] , 1 , val);
        v = bl[pth[v]][0] , segcnt++;
    }
}
ll getPth(int v){
    ns.cl();
    ll res = 0;
    while(v != -1){
        int d = getSeg(v) , u = v;
        for(int i = 19 ; i >= 0 ; i--){
            if(bl[u][i] == -1) continue;
            if(getSeg(bl[u][i]) == d) u = bl[u][i];
        }
        ns.pb({d , hs[v] - hs[u] + 1});
        v = bl[u][0];
    }
    for(int i = 0 ; i < (int)ns.size() ; i++){
        if(ns[i][0] > 0) res += (1ll * ns[i][1]) * (1ll * getFen(0 , ns[i][0] - 1));
        addFen(ns[i][0] , ns[i][1]);
    }
    for(int i = 0 ; i < (int)ns.size() ; i++){
        addFen(ns[i][0] , -(ns[i][1]));
    }
    return res;
}

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

    cin >> n;
    for(int i = 0 ; i < n ; i++){
        int d;
        cin >> d;
        a.pb(d);
    }
    for(int i = 1 ; i < n ; i++){
        int v , u;
        cin >> v >> u;
        v-- , u--;
        tr[v].pb(u) , tr[u].pb(v);
        ops.pb({v , u});
    }
    dfs1() , hld() , cmpInt() , buildSeg();
    for(auto op : ops){
        ll o = getPth(op[0]);
        while(o < 0);
        cout << getPth(op[0]) << endl;
        updPth(op[1] , a[op[1]]);
    }
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10844 KB Output is correct
2 Correct 2 ms 10844 KB Output is correct
3 Correct 2 ms 10844 KB Output is correct
4 Correct 2 ms 10844 KB Output is correct
5 Correct 2 ms 10844 KB Output is correct
6 Correct 2 ms 10844 KB Output is correct
7 Correct 2 ms 10888 KB Output is correct
8 Correct 2 ms 10844 KB Output is correct
9 Correct 2 ms 10844 KB Output is correct
10 Correct 2 ms 10844 KB Output is correct
11 Correct 2 ms 10844 KB Output is correct
12 Correct 2 ms 10844 KB Output is correct
13 Correct 2 ms 10868 KB Output is correct
14 Correct 2 ms 10844 KB Output is correct
15 Correct 2 ms 10844 KB Output is correct
16 Correct 3 ms 10844 KB Output is correct
17 Correct 3 ms 10844 KB Output is correct
18 Correct 3 ms 10840 KB Output is correct
19 Correct 2 ms 10844 KB Output is correct
20 Correct 2 ms 10844 KB Output is correct
21 Correct 2 ms 10840 KB Output is correct
22 Incorrect 2 ms 10844 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10844 KB Output is correct
2 Correct 2 ms 10844 KB Output is correct
3 Correct 2 ms 10844 KB Output is correct
4 Correct 2 ms 10844 KB Output is correct
5 Correct 2 ms 10844 KB Output is correct
6 Correct 2 ms 10844 KB Output is correct
7 Correct 2 ms 10888 KB Output is correct
8 Correct 2 ms 10844 KB Output is correct
9 Correct 2 ms 10844 KB Output is correct
10 Correct 2 ms 10844 KB Output is correct
11 Correct 2 ms 10844 KB Output is correct
12 Correct 2 ms 10844 KB Output is correct
13 Correct 2 ms 10868 KB Output is correct
14 Correct 2 ms 10844 KB Output is correct
15 Correct 2 ms 10844 KB Output is correct
16 Correct 3 ms 10844 KB Output is correct
17 Correct 3 ms 10844 KB Output is correct
18 Correct 3 ms 10840 KB Output is correct
19 Correct 2 ms 10844 KB Output is correct
20 Correct 2 ms 10844 KB Output is correct
21 Correct 2 ms 10840 KB Output is correct
22 Incorrect 2 ms 10844 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 84.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10844 KB Output is correct
2 Correct 2 ms 10844 KB Output is correct
3 Correct 2 ms 10844 KB Output is correct
4 Correct 2 ms 10844 KB Output is correct
5 Correct 2 ms 10844 KB Output is correct
6 Correct 2 ms 10844 KB Output is correct
7 Correct 2 ms 10888 KB Output is correct
8 Correct 2 ms 10844 KB Output is correct
9 Correct 2 ms 10844 KB Output is correct
10 Correct 2 ms 10844 KB Output is correct
11 Correct 2 ms 10844 KB Output is correct
12 Correct 2 ms 10844 KB Output is correct
13 Correct 2 ms 10868 KB Output is correct
14 Correct 2 ms 10844 KB Output is correct
15 Correct 2 ms 10844 KB Output is correct
16 Correct 3 ms 10844 KB Output is correct
17 Correct 3 ms 10844 KB Output is correct
18 Correct 3 ms 10840 KB Output is correct
19 Correct 2 ms 10844 KB Output is correct
20 Correct 2 ms 10844 KB Output is correct
21 Correct 2 ms 10840 KB Output is correct
22 Incorrect 2 ms 10844 KB Output isn't correct
23 Halted 0 ms 0 KB -