oj.uz

답안 #781782

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
781782 2023-07-13T10:49:13 Z Andrey Cat Exercise (JOI23_ho_t4) C++14
41 / 100
 189 ms 65140 KB 
#include <bits/stdc++.h>
using namespace std;

vector<long long> h(200001);
vector<long long> haha[200001];
vector<long long> dsu(200001);
vector<long long> dep(200001);
long long bruh[200001][19];

void dfs(long long a, long long t, long long d) {
    bruh[a][0] = t;
    dep[a] = d;
    for(long long v: haha[a]) {
        if(v != t) {
            dfs(v,a,d+1);
        }
    }
}

long long check(long long a) {
    long long c = a,d,e;
    while(dsu[c] != c) {
        c = dsu[c];
    }
    d = a;
    while(d != dsu[d]) {
        e = dsu[d];
        dsu[d] = c;
        d = e;
    }
    return c;
}

long long dist(long long a, long long b) {
    if(dep[a] < dep[b]) {
        swap(a,b);
    }
    long long c = dep[a]-dep[b],e = a;
    for(long long i = 0; i < 19; i++) {
        if((1 << i)&c) {
            e = bruh[e][i];
        }
    }
    if(b != e) {
        for(long long i = 18; i >= 0; i--) {
            if(bruh[e][i] != -1 && bruh[e][i] != bruh[b][i]) {
                e = bruh[e][i];
                b = bruh[b][i];
            }
        }
        e = bruh[e][0];
    }
    return dep[a]-dep[e]+dep[b]-dep[e];
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    for(long long i = 1; i <= 200000; i++) {
        dsu[i] = i;
    }
    long long n,a,b,y = 0;
    cin >> n;
    for(long long i = 1; i <= n; i++) {
        cin >> h[i];
    }
    vector<pair<long long,pair<long long,long long>>> edge(0);
    for(long long i = 0; i < n-1; i++) {
        cin >> a >> b;
        haha[a].push_back(b);
        haha[b].push_back(a);
        edge.push_back({max(h[a],h[b]),{a,b}});
    }
    sort(edge.begin(),edge.end());
    dfs(1,-1,0);
    for(long long i = 1; i < 19; i++) {
        for(long long j = 1; j <= n; j++) {
            if(bruh[j][i-1] != -1) {
                bruh[j][i] = bruh[bruh[j][i-1]][i-1];
            }
            else {
                bruh[j][i] = -1;
            }
        }
    }
    vector<long long> ans(n+1);
    for(long long i = 1; i <= n; i++) {
        while(y < n-1 && edge[y].first == i) {
            a = edge[y].second.first;
            b = edge[y].second.second;
            if(h[a] < h[b]) {
                swap(a,b);
            }
            b = check(b);
            dsu[b] = a;
            ans[a] = max(ans[a],dist(a,b)+ans[b]);
            y++;
        }
    }
    for(long long i = 1; i <= n; i++) {
        if(h[i] == n) {
            cout << ans[i];
        }
    }
    return 0;
}

Subtask #1
7.0 / 7.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 6 ms 9732 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 4 ms 9684 KB Output is correct
6 Correct 4 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 6 ms 9672 KB Output is correct
9 Correct 4 ms 9740 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 6 ms 9812 KB Output is correct
12 Correct 4 ms 9812 KB Output is correct
13 Correct 6 ms 9744 KB Output is correct
14 Correct 4 ms 9812 KB Output is correct
15 Correct 4 ms 9740 KB Output is correct
16 Correct 4 ms 9812 KB Output is correct
17 Correct 4 ms 9732 KB Output is correct
18 Correct 7 ms 11092 KB Output is correct
19 Correct 7 ms 11036 KB Output is correct
20 Correct 10 ms 11092 KB Output is correct
21 Correct 7 ms 11092 KB Output is correct
22 Correct 7 ms 11092 KB Output is correct
23 Correct 7 ms 11092 KB Output is correct
24 Correct 7 ms 11028 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 6 ms 9732 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 4 ms 9684 KB Output is correct
6 Correct 4 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 6 ms 9672 KB Output is correct
9 Correct 4 ms 9740 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 6 ms 9812 KB Output is correct
12 Correct 4 ms 9812 KB Output is correct
13 Correct 6 ms 9744 KB Output is correct
14 Correct 4 ms 9812 KB Output is correct
15 Correct 4 ms 9740 KB Output is correct
16 Correct 4 ms 9812 KB Output is correct
17 Correct 4 ms 9732 KB Output is correct
18 Correct 7 ms 11092 KB Output is correct
19 Correct 7 ms 11036 KB Output is correct
20 Correct 10 ms 11092 KB Output is correct
21 Correct 7 ms 11092 KB Output is correct
22 Correct 7 ms 11092 KB Output is correct
23 Correct 7 ms 11092 KB Output is correct
24 Correct 7 ms 11028 KB Output is correct
25 Correct 5 ms 9684 KB Output is correct
26 Incorrect 9 ms 10964 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 6 ms 9732 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 4 ms 9684 KB Output is correct
6 Correct 4 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 6 ms 9672 KB Output is correct
9 Correct 4 ms 9740 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 6 ms 9812 KB Output is correct
12 Correct 4 ms 9812 KB Output is correct
13 Correct 6 ms 9744 KB Output is correct
14 Correct 4 ms 9812 KB Output is correct
15 Correct 4 ms 9740 KB Output is correct
16 Correct 4 ms 9812 KB Output is correct
17 Correct 4 ms 9732 KB Output is correct
18 Correct 7 ms 11092 KB Output is correct
19 Correct 7 ms 11036 KB Output is correct
20 Correct 10 ms 11092 KB Output is correct
21 Correct 7 ms 11092 KB Output is correct
22 Correct 7 ms 11092 KB Output is correct
23 Correct 7 ms 11092 KB Output is correct
24 Correct 7 ms 11028 KB Output is correct
25 Correct 136 ms 61572 KB Output is correct
26 Correct 150 ms 65128 KB Output is correct
27 Correct 145 ms 65088 KB Output is correct
28 Correct 151 ms 65036 KB Output is correct
29 Correct 169 ms 65068 KB Output is correct
30 Correct 189 ms 65140 KB Output is correct
31 Correct 148 ms 65112 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Incorrect 5 ms 9732 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 6 ms 9732 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 4 ms 9684 KB Output is correct
6 Correct 4 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 6 ms 9672 KB Output is correct
9 Correct 4 ms 9740 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 6 ms 9812 KB Output is correct
12 Correct 4 ms 9812 KB Output is correct
13 Correct 6 ms 9744 KB Output is correct
14 Correct 4 ms 9812 KB Output is correct
15 Correct 4 ms 9740 KB Output is correct
16 Correct 4 ms 9812 KB Output is correct
17 Correct 4 ms 9732 KB Output is correct
18 Correct 7 ms 11092 KB Output is correct
19 Correct 7 ms 11036 KB Output is correct
20 Correct 10 ms 11092 KB Output is correct
21 Correct 7 ms 11092 KB Output is correct
22 Correct 7 ms 11092 KB Output is correct
23 Correct 7 ms 11092 KB Output is correct
24 Correct 7 ms 11028 KB Output is correct
25 Correct 5 ms 9684 KB Output is correct
26 Incorrect 9 ms 10964 KB Output isn't correct
27 Halted 0 ms 0 KB -