oj.uz

답안 #924572

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
924572 2024-02-09T08:22:56 Z adhityamv Cat Exercise (JOI23_ho_t4) C++17
100 / 100
 408 ms 68544 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pii pair<int,int>
#define fi first
#define se second
int INF=1000000000;
const int N=200000;
const int K=400000;
int a[N];
vector<int> edges[N];
int parent[N];
int ind[N];
int m;
vector<int> et;
int focc[N];
int locc[N];
int depth[N];
void euler_tour(int u,int p){
    et.push_back(u);
    parent[u]=p;
    for(int  v:edges[u]){
        if(v==p) continue;
        depth[v]=depth[u]+1;
        euler_tour(v,u);
        et.push_back(u);
    }
}
const int ln=20;
int sparsetable[N][ln];
ll dist(int u,int v){
    if(u==v) return 0;
    if(depth[u]<depth[v]) swap(u,v);
    ll ans=0;
    for(int j=ln-1;j>=0;j--){
        if(depth[u]>=(1<<j)+depth[v]){
            u=sparsetable[u][j];
            ans+=(1<<j);
        }
    }
    if(u==v) return ans;
    for(int j=ln-1;j>=0;j--){
        if(sparsetable[u][j]!=sparsetable[v][j]){
            u=sparsetable[u][j];
            v=sparsetable[v][j];
            ans+=2*(1<<j);
        }
    }
    ans+=2;
    return ans;
}
int seg[4*K]={};
int lazy[4*K]={};
void Build(int l,int r,int pos){
    if(l==r){
        seg[pos]=a[et[l]];
        lazy[pos]=INF;
        return;
    }
    int m=(l+r)/2;
    Build(l,m,2*pos);
    Build(m+1,r,2*pos+1);
    seg[pos]=max(seg[2*pos],seg[2*pos+1]);
    lazy[pos]=INF;
}
void UpdateLazy(int l,int r,int pos){
    if(lazy[pos]==INF) return;
    seg[pos]=lazy[pos];
    if(l!=r){
        lazy[2*pos]=lazy[pos];
        lazy[2*pos+1]=lazy[pos];
    }
    lazy[pos]=INF;
}
void Update(int l,int r,int pos,int ql,int qr,int qval){
    if(ql>qr) return;
    UpdateLazy(l,r,pos);
    if(ql>r || qr<l) return;
    if(ql<=l && qr>=r){
        lazy[pos]=qval;
        UpdateLazy(l,r,pos);
        return;
    }
    int m=(l+r)/2;
    Update(l,m,2*pos,ql,qr,qval);
    Update(m+1,r,2*pos+1,ql,qr,qval);
    seg[pos]=max(seg[2*pos],seg[2*pos+1]);
}
int Query(int l,int r,int pos, int ql,int qr){
    if(ql>qr) return -INF;
    UpdateLazy(l,r,pos);
    if(ql>r || qr<l) return -INF;
    if(ql<=l && qr>=r){
        return seg[pos]; 
    }
    int m=(l+r)/2;
    return max(Query(l,m,2*pos,ql,qr),Query(m+1,r,2*pos+1,ql,qr));
}
bool blocked[N]={};
ll dfs(int u,int p){
    int cu=ind[Query(0,m-1,1,focc[u],locc[u])];
    blocked[cu]=true;
    ll ans=0;
    for(int v:edges[cu]){
        if(blocked[v]) continue;
        if(v==parent[cu]) continue;
        ll cans=dfs(v,cu);
        ans=max(ans,cans);
    }
    Update(0,m-1,1,focc[cu],locc[cu],-1);
    int val=Query(0,m-1,1,focc[u],locc[u]);
    if(val!=-1){
        ans=max(ans,dfs(u,cu));
    }
    if(p!=-1) ans+=dist(cu,p);
    return ans;
}
void solve(){
    int n;
    cin >> n;
    for(int i=0;i<n;i++){
        cin >> a[i];
        a[i]--;
        ind[a[i]]=i;
    }
    for(int i=0;i<n-1;i++){
        int u,v;
        cin >> u >> v;
        u--,v--;
        edges[u].push_back(v);
        edges[v].push_back(u);
    }
    depth[0]=0;
    euler_tour(0,-1);
    m=et.size();
    assert(m==2*n-1);
    for(int i=0;i<m;i++){
        locc[et[i]]=i;
    }
    for(int i=m-1;i>=0;i--){
        focc[et[i]]=i;
    }
    for(int i=0;i<n;i++) sparsetable[i][0]=parent[i];
    for(int j=0;j<ln-1;j++){
        for(int i=0;i<n;i++){
            if(sparsetable[i][j]==-1) sparsetable[i][j+1]=-1;
            else sparsetable[i][j+1]=sparsetable[sparsetable[i][j]][j];
        }
    }
    Build(0,m-1,1);
    cout << dfs(0,-1);
}
signed main(){
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    t=1;
    //cin >> t;
    while(t--) solve();
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16728 KB Output is correct
2 Correct 2 ms 16732 KB Output is correct
3 Correct 2 ms 16732 KB Output is correct
4 Correct 3 ms 16732 KB Output is correct
5 Correct 3 ms 16732 KB Output is correct
6 Correct 3 ms 16732 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 3 ms 16732 KB Output is correct
9 Correct 3 ms 16732 KB Output is correct
10 Correct 3 ms 16732 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16728 KB Output is correct
2 Correct 2 ms 16732 KB Output is correct
3 Correct 2 ms 16732 KB Output is correct
4 Correct 3 ms 16732 KB Output is correct
5 Correct 3 ms 16732 KB Output is correct
6 Correct 3 ms 16732 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 3 ms 16732 KB Output is correct
9 Correct 3 ms 16732 KB Output is correct
10 Correct 3 ms 16732 KB Output is correct
11 Correct 3 ms 16984 KB Output is correct
12 Correct 3 ms 16728 KB Output is correct
13 Correct 3 ms 16728 KB Output is correct
14 Correct 3 ms 16732 KB Output is correct
15 Correct 4 ms 16732 KB Output is correct
16 Correct 3 ms 16732 KB Output is correct
17 Correct 3 ms 16732 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16728 KB Output is correct
2 Correct 2 ms 16732 KB Output is correct
3 Correct 2 ms 16732 KB Output is correct
4 Correct 3 ms 16732 KB Output is correct
5 Correct 3 ms 16732 KB Output is correct
6 Correct 3 ms 16732 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 3 ms 16732 KB Output is correct
9 Correct 3 ms 16732 KB Output is correct
10 Correct 3 ms 16732 KB Output is correct
11 Correct 3 ms 16984 KB Output is correct
12 Correct 3 ms 16728 KB Output is correct
13 Correct 3 ms 16728 KB Output is correct
14 Correct 3 ms 16732 KB Output is correct
15 Correct 4 ms 16732 KB Output is correct
16 Correct 3 ms 16732 KB Output is correct
17 Correct 3 ms 16732 KB Output is correct
18 Correct 10 ms 17500 KB Output is correct
19 Correct 9 ms 17640 KB Output is correct
20 Correct 9 ms 17500 KB Output is correct
21 Correct 9 ms 17500 KB Output is correct
22 Correct 11 ms 17496 KB Output is correct
23 Correct 10 ms 17500 KB Output is correct
24 Correct 10 ms 17328 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16728 KB Output is correct
2 Correct 2 ms 16732 KB Output is correct
3 Correct 2 ms 16732 KB Output is correct
4 Correct 3 ms 16732 KB Output is correct
5 Correct 3 ms 16732 KB Output is correct
6 Correct 3 ms 16732 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 3 ms 16732 KB Output is correct
9 Correct 3 ms 16732 KB Output is correct
10 Correct 3 ms 16732 KB Output is correct
11 Correct 3 ms 16984 KB Output is correct
12 Correct 3 ms 16728 KB Output is correct
13 Correct 3 ms 16728 KB Output is correct
14 Correct 3 ms 16732 KB Output is correct
15 Correct 4 ms 16732 KB Output is correct
16 Correct 3 ms 16732 KB Output is correct
17 Correct 3 ms 16732 KB Output is correct
18 Correct 10 ms 17500 KB Output is correct
19 Correct 9 ms 17640 KB Output is correct
20 Correct 9 ms 17500 KB Output is correct
21 Correct 9 ms 17500 KB Output is correct
22 Correct 11 ms 17496 KB Output is correct
23 Correct 10 ms 17500 KB Output is correct
24 Correct 10 ms 17328 KB Output is correct
25 Correct 3 ms 16732 KB Output is correct
26 Correct 7 ms 17436 KB Output is correct
27 Correct 8 ms 17500 KB Output is correct
28 Correct 8 ms 17500 KB Output is correct
29 Correct 9 ms 17500 KB Output is correct
30 Correct 8 ms 16988 KB Output is correct
31 Correct 8 ms 17244 KB Output is correct
32 Correct 8 ms 17244 KB Output is correct
33 Correct 9 ms 17068 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16728 KB Output is correct
2 Correct 2 ms 16732 KB Output is correct
3 Correct 2 ms 16732 KB Output is correct
4 Correct 3 ms 16732 KB Output is correct
5 Correct 3 ms 16732 KB Output is correct
6 Correct 3 ms 16732 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 3 ms 16732 KB Output is correct
9 Correct 3 ms 16732 KB Output is correct
10 Correct 3 ms 16732 KB Output is correct
11 Correct 3 ms 16984 KB Output is correct
12 Correct 3 ms 16728 KB Output is correct
13 Correct 3 ms 16728 KB Output is correct
14 Correct 3 ms 16732 KB Output is correct
15 Correct 4 ms 16732 KB Output is correct
16 Correct 3 ms 16732 KB Output is correct
17 Correct 3 ms 16732 KB Output is correct
18 Correct 10 ms 17500 KB Output is correct
19 Correct 9 ms 17640 KB Output is correct
20 Correct 9 ms 17500 KB Output is correct
21 Correct 9 ms 17500 KB Output is correct
22 Correct 11 ms 17496 KB Output is correct
23 Correct 10 ms 17500 KB Output is correct
24 Correct 10 ms 17328 KB Output is correct
25 Correct 388 ms 68544 KB Output is correct
26 Correct 376 ms 66888 KB Output is correct
27 Correct 408 ms 66680 KB Output is correct
28 Correct 342 ms 62316 KB Output is correct
29 Correct 357 ms 62416 KB Output is correct
30 Correct 375 ms 62144 KB Output is correct
31 Correct 360 ms 62440 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 16732 KB Output is correct
2 Correct 3 ms 16732 KB Output is correct
3 Correct 266 ms 50672 KB Output is correct
4 Correct 289 ms 50948 KB Output is correct
5 Correct 268 ms 50536 KB Output is correct

Subtask #7
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16728 KB Output is correct
2 Correct 2 ms 16732 KB Output is correct
3 Correct 2 ms 16732 KB Output is correct
4 Correct 3 ms 16732 KB Output is correct
5 Correct 3 ms 16732 KB Output is correct
6 Correct 3 ms 16732 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 3 ms 16732 KB Output is correct
9 Correct 3 ms 16732 KB Output is correct
10 Correct 3 ms 16732 KB Output is correct
11 Correct 3 ms 16984 KB Output is correct
12 Correct 3 ms 16728 KB Output is correct
13 Correct 3 ms 16728 KB Output is correct
14 Correct 3 ms 16732 KB Output is correct
15 Correct 4 ms 16732 KB Output is correct
16 Correct 3 ms 16732 KB Output is correct
17 Correct 3 ms 16732 KB Output is correct
18 Correct 10 ms 17500 KB Output is correct
19 Correct 9 ms 17640 KB Output is correct
20 Correct 9 ms 17500 KB Output is correct
21 Correct 9 ms 17500 KB Output is correct
22 Correct 11 ms 17496 KB Output is correct
23 Correct 10 ms 17500 KB Output is correct
24 Correct 10 ms 17328 KB Output is correct
25 Correct 3 ms 16732 KB Output is correct
26 Correct 7 ms 17436 KB Output is correct
27 Correct 8 ms 17500 KB Output is correct
28 Correct 8 ms 17500 KB Output is correct
29 Correct 9 ms 17500 KB Output is correct
30 Correct 8 ms 16988 KB Output is correct
31 Correct 8 ms 17244 KB Output is correct
32 Correct 8 ms 17244 KB Output is correct
33 Correct 9 ms 17068 KB Output is correct
34 Correct 388 ms 68544 KB Output is correct
35 Correct 376 ms 66888 KB Output is correct
36 Correct 408 ms 66680 KB Output is correct
37 Correct 342 ms 62316 KB Output is correct
38 Correct 357 ms 62416 KB Output is correct
39 Correct 375 ms 62144 KB Output is correct
40 Correct 360 ms 62440 KB Output is correct
41 Correct 3 ms 16732 KB Output is correct
42 Correct 3 ms 16732 KB Output is correct
43 Correct 266 ms 50672 KB Output is correct
44 Correct 289 ms 50948 KB Output is correct
45 Correct 268 ms 50536 KB Output is correct
46 Correct 395 ms 62688 KB Output is correct
47 Correct 320 ms 62400 KB Output is correct
48 Correct 371 ms 62532 KB Output is correct
49 Correct 292 ms 62396 KB Output is correct
50 Correct 352 ms 49608 KB Output is correct
51 Correct 356 ms 49644 KB Output is correct
52 Correct 345 ms 49596 KB Output is correct
53 Correct 341 ms 49856 KB Output is correct