oj.uz

답안 #1110129

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1110129 2024-11-08T19:38:05 Z alcoholic Cat Exercise (JOI23_ho_t4) C++17
54 / 100
 142 ms 63560 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
 
#define MAX_N 200010
 
ll n,p[MAX_N],a[MAX_N],b[MAX_N];
vll g[MAX_N];
 
struct LCA{
    #define D 20
    ll depth[MAX_N],par[MAX_N][D];
    void dfs(ll x,ll from,ll d){
        depth[x]=d;
        par[x][0]=from;
        for(auto y:g[x])if(y!=from){
            dfs(y,x,d+1);
        }
    }
    void init(){
        dfs(0,0,0);
        rep(d,D-1){
            rep(i,n){
                par[i][d+1]=par[par[i][d]][d];
            }
        }
    }
    ll lca(ll a,ll b){
        if(depth[a]>depth[b])swap(a,b);
        assert(depth[a]<=depth[b]);
        for(ll d=D-1;d>=0;d--){
            if(depth[a]<=depth[b]-(1<<d)){
                b=par[b][d];
            }
        }
        assert(depth[a]==depth[b]);
        if(a==b)return a;
        for(ll d=D-1;d>=0;d--){
            if(par[a][d]!=par[b][d]){
                a=par[a][d];
                b=par[b][d];
            }
        }
        assert(a!=b);
        return par[a][0];
    }
    ll dist(ll a,ll b){
        ll c=lca(a,b);
        return depth[a]+depth[b]-2*depth[c];
    }
};
LCA lca;
 
struct UnionFind{
    ll par[MAX_N];
    void init(){
        rep(i,n){
            par[i]=i;
        }
    }
    ll root(ll x){
        return par[x]=(x==par[x]?x:root(par[x]));
    }
    void unite(ll a,ll b){
        a=root(a);
        b=root(b);
        if(a!=b){
            if(p[a]>p[b])swap(a,b);
            assert(p[a]<p[b]);
            par[a]=b;
        }
    }
};
UnionFind uf;
 
ll rp[MAX_N],f[MAX_N];
int main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cin>>n;
    rep(i,n){
        cin>>p[i];
        rp[p[i]]=i;
    }
    rep(i,n-1){
        cin>>a[i]>>b[i];
        a[i]--,b[i]--;
        g[a[i]].pb(b[i]);
        g[b[i]].pb(a[i]);
    }
 
    lca.init();
    uf.init();
 
    for(int i=1;i<=n;i++){
        ll x=rp[i];
        ll ans=0;
        for(auto y:g[x])if(p[y]<p[x]){
            ll v=uf.root(y);
            chmax(ans,f[v]+lca.dist(v,x));
            uf.unite(x,y);
        }
        f[x]=ans;
    }
 
    ll root=rp[n];
    ll ans=f[root];
    cout<<(int)ans<<"\n";
}

Subtask #1
7.0 / 7.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
7.0 / 7.0

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

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14672 KB Output is correct
2 Correct 2 ms 14672 KB Output is correct
3 Correct 2 ms 14672 KB Output is correct
4 Correct 3 ms 14672 KB Output is correct
5 Correct 3 ms 14672 KB Output is correct
6 Correct 2 ms 14672 KB Output is correct
7 Correct 3 ms 14672 KB Output is correct
8 Correct 3 ms 14672 KB Output is correct
9 Correct 3 ms 14672 KB Output is correct
10 Correct 3 ms 14672 KB Output is correct
11 Correct 2 ms 14672 KB Output is correct
12 Correct 2 ms 14672 KB Output is correct
13 Correct 3 ms 14672 KB Output is correct
14 Correct 2 ms 14672 KB Output is correct
15 Correct 3 ms 14672 KB Output is correct
16 Correct 2 ms 14672 KB Output is correct
17 Correct 3 ms 14672 KB Output is correct
18 Correct 5 ms 17232 KB Output is correct
19 Correct 5 ms 17232 KB Output is correct
20 Correct 4 ms 17232 KB Output is correct
21 Correct 5 ms 17472 KB Output is correct
22 Correct 5 ms 17232 KB Output is correct
23 Correct 6 ms 17232 KB Output is correct
24 Correct 5 ms 17232 KB Output is correct
25 Correct 3 ms 14672 KB Output is correct
26 Correct 5 ms 17232 KB Output is correct
27 Correct 5 ms 17232 KB Output is correct
28 Correct 6 ms 17276 KB Output is correct
29 Correct 5 ms 17224 KB Output is correct
30 Correct 6 ms 16976 KB Output is correct
31 Correct 6 ms 16976 KB Output is correct
32 Correct 5 ms 16976 KB Output is correct
33 Correct 5 ms 17144 KB Output is correct

Subtask #5
0 / 20.0

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

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14672 KB Output is correct
2 Correct 2 ms 14672 KB Output is correct
3 Correct 140 ms 58744 KB Output is correct
4 Correct 142 ms 58736 KB Output is correct
5 Correct 139 ms 58824 KB Output is correct

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14672 KB Output is correct
2 Correct 2 ms 14672 KB Output is correct
3 Correct 2 ms 14672 KB Output is correct
4 Correct 3 ms 14672 KB Output is correct
5 Correct 3 ms 14672 KB Output is correct
6 Correct 2 ms 14672 KB Output is correct
7 Correct 3 ms 14672 KB Output is correct
8 Correct 3 ms 14672 KB Output is correct
9 Correct 3 ms 14672 KB Output is correct
10 Correct 3 ms 14672 KB Output is correct
11 Correct 2 ms 14672 KB Output is correct
12 Correct 2 ms 14672 KB Output is correct
13 Correct 3 ms 14672 KB Output is correct
14 Correct 2 ms 14672 KB Output is correct
15 Correct 3 ms 14672 KB Output is correct
16 Correct 2 ms 14672 KB Output is correct
17 Correct 3 ms 14672 KB Output is correct
18 Correct 5 ms 17232 KB Output is correct
19 Correct 5 ms 17232 KB Output is correct
20 Correct 4 ms 17232 KB Output is correct
21 Correct 5 ms 17472 KB Output is correct
22 Correct 5 ms 17232 KB Output is correct
23 Correct 6 ms 17232 KB Output is correct
24 Correct 5 ms 17232 KB Output is correct
25 Correct 3 ms 14672 KB Output is correct
26 Correct 5 ms 17232 KB Output is correct
27 Correct 5 ms 17232 KB Output is correct
28 Correct 6 ms 17276 KB Output is correct
29 Correct 5 ms 17224 KB Output is correct
30 Correct 6 ms 16976 KB Output is correct
31 Correct 6 ms 16976 KB Output is correct
32 Correct 5 ms 16976 KB Output is correct
33 Correct 5 ms 17144 KB Output is correct
34 Incorrect 94 ms 63560 KB Output isn't correct
35 Halted 0 ms 0 KB -