oj.uz

답안 #1082039

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1082039 2024-08-30T15:16:07 Z Tymond Cat Exercise (JOI23_ho_t4) C++17
100 / 100
 126 ms 41728 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

const int MAXN = 2e5 + 7;
const int MAXK = 20;
vi g[MAXN];
int a[MAXN];
ll dp[MAXN];
int pos[MAXN];
int dep[MAXN];
int jump[MAXK][MAXN];
bool ok[MAXN];
int rep[MAXN];
int info[MAXN];
int n;
vi akt;

int Find(int x){
    if(x == rep[x]){
        return x;
    }
    return rep[x] = Find(rep[x]);
}

void dfs(int v, int p, int d){
    dep[v] = d;
    jump[0][v] = p;
    for(auto u : g[v]){
        if(u != p){
            dfs(u, v, d + 1);
        }
    }
}

void preprocessing(){
    dfs(1, 1, 0);
    for(int i = 1; i < MAXK; i++){
        for(int j = 1; j <= n; j++){
            jump[i][j] = jump[i - 1][jump[i - 1][j]];
        }
    }
}

int lca(int u, int v){
    if(dep[u] > dep[v]){
        swap(u, v);
    }

    for(int i = MAXK - 1; i >= 0; i--){
        if(dep[v] - dep[u] >= (1 << i)){
            v = jump[i][v];
        }
    }

    if(u == v){
        return v;
    }

    for(int i = MAXK - 1; i >= 0; i--){
        if(jump[i][u] != jump[i][v]){
            u = jump[i][u];
            v = jump[i][v];
        }
    }

    return jump[0][v];
}

int dist(int u, int v){
    return dep[u] + dep[v] - 2 * dep[lca(u, v)];
}

void getBest(int v){
    for(auto u : g[v]){
        if(!ok[u]){
            continue;
        }

        int r = Find(u);
        akt.pb(pos[info[r]]);
        int our = Find(v);
        rep[r] = our;
        info[our] = max(info[our], info[r]);
    }
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        pos[a[i]] = i;
        rep[i] = i;
        info[i] = a[i];
    }

    for(int i = 1; i < n; i++){
        int u, v;
        cin >> u >> v;
        g[u].pb(v);
        g[v].pb(u);
    }

    preprocessing();
    for(int i = 1; i <= n; i++){
        akt.clear();
        ok[pos[i]] = 1;
        getBest(pos[i]);

        //cout << i << ' ' << pos[i] << '\n';
        for(auto ele : akt){
            //cout << ele << '\n';
            dp[pos[i]] = max(dp[pos[i]], (ll)dp[ele] + dist(pos[i], ele));
        }
    }

    cout << dp[pos[n]] << '\n';

    return 0;
}

Subtask #1
7.0 / 7.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 26200 KB Output is correct
2 Correct 3 ms 26316 KB Output is correct
3 Correct 3 ms 26300 KB Output is correct
4 Correct 3 ms 26204 KB Output is correct
5 Correct 3 ms 26204 KB Output is correct
6 Correct 3 ms 26296 KB Output is correct
7 Correct 3 ms 26312 KB Output is correct
8 Correct 4 ms 26204 KB Output is correct
9 Correct 4 ms 26296 KB Output is correct
10 Correct 4 ms 26204 KB Output is correct
11 Correct 3 ms 26204 KB Output is correct
12 Correct 3 ms 26316 KB Output is correct
13 Correct 4 ms 26204 KB Output is correct
14 Correct 3 ms 26204 KB Output is correct
15 Correct 3 ms 26204 KB Output is correct
16 Correct 3 ms 26204 KB Output is correct
17 Correct 3 ms 26204 KB Output is correct
18 Correct 5 ms 26460 KB Output is correct
19 Correct 5 ms 26460 KB Output is correct
20 Correct 5 ms 26460 KB Output is correct
21 Correct 6 ms 26460 KB Output is correct
22 Correct 4 ms 26460 KB Output is correct
23 Correct 5 ms 26544 KB Output is correct
24 Correct 6 ms 26460 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 26200 KB Output is correct
2 Correct 3 ms 26316 KB Output is correct
3 Correct 3 ms 26300 KB Output is correct
4 Correct 3 ms 26204 KB Output is correct
5 Correct 3 ms 26204 KB Output is correct
6 Correct 3 ms 26296 KB Output is correct
7 Correct 3 ms 26312 KB Output is correct
8 Correct 4 ms 26204 KB Output is correct
9 Correct 4 ms 26296 KB Output is correct
10 Correct 4 ms 26204 KB Output is correct
11 Correct 3 ms 26204 KB Output is correct
12 Correct 3 ms 26316 KB Output is correct
13 Correct 4 ms 26204 KB Output is correct
14 Correct 3 ms 26204 KB Output is correct
15 Correct 3 ms 26204 KB Output is correct
16 Correct 3 ms 26204 KB Output is correct
17 Correct 3 ms 26204 KB Output is correct
18 Correct 5 ms 26460 KB Output is correct
19 Correct 5 ms 26460 KB Output is correct
20 Correct 5 ms 26460 KB Output is correct
21 Correct 6 ms 26460 KB Output is correct
22 Correct 4 ms 26460 KB Output is correct
23 Correct 5 ms 26544 KB Output is correct
24 Correct 6 ms 26460 KB Output is correct
25 Correct 4 ms 26204 KB Output is correct
26 Correct 5 ms 26460 KB Output is correct
27 Correct 5 ms 26460 KB Output is correct
28 Correct 5 ms 26460 KB Output is correct
29 Correct 5 ms 26460 KB Output is correct
30 Correct 5 ms 26460 KB Output is correct
31 Correct 5 ms 26460 KB Output is correct
32 Correct 5 ms 26456 KB Output is correct
33 Correct 5 ms 26500 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 26200 KB Output is correct
2 Correct 3 ms 26316 KB Output is correct
3 Correct 3 ms 26300 KB Output is correct
4 Correct 3 ms 26204 KB Output is correct
5 Correct 3 ms 26204 KB Output is correct
6 Correct 3 ms 26296 KB Output is correct
7 Correct 3 ms 26312 KB Output is correct
8 Correct 4 ms 26204 KB Output is correct
9 Correct 4 ms 26296 KB Output is correct
10 Correct 4 ms 26204 KB Output is correct
11 Correct 3 ms 26204 KB Output is correct
12 Correct 3 ms 26316 KB Output is correct
13 Correct 4 ms 26204 KB Output is correct
14 Correct 3 ms 26204 KB Output is correct
15 Correct 3 ms 26204 KB Output is correct
16 Correct 3 ms 26204 KB Output is correct
17 Correct 3 ms 26204 KB Output is correct
18 Correct 5 ms 26460 KB Output is correct
19 Correct 5 ms 26460 KB Output is correct
20 Correct 5 ms 26460 KB Output is correct
21 Correct 6 ms 26460 KB Output is correct
22 Correct 4 ms 26460 KB Output is correct
23 Correct 5 ms 26544 KB Output is correct
24 Correct 6 ms 26460 KB Output is correct
25 Correct 66 ms 37716 KB Output is correct
26 Correct 68 ms 41552 KB Output is correct
27 Correct 69 ms 41556 KB Output is correct
28 Correct 88 ms 41728 KB Output is correct
29 Correct 118 ms 41556 KB Output is correct
30 Correct 80 ms 41596 KB Output is correct
31 Correct 85 ms 41556 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 26200 KB Output is correct
2 Correct 3 ms 26204 KB Output is correct
3 Correct 89 ms 32504 KB Output is correct
4 Correct 93 ms 36272 KB Output is correct
5 Correct 99 ms 36392 KB Output is correct

Subtask #7
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 26200 KB Output is correct
2 Correct 3 ms 26316 KB Output is correct
3 Correct 3 ms 26300 KB Output is correct
4 Correct 3 ms 26204 KB Output is correct
5 Correct 3 ms 26204 KB Output is correct
6 Correct 3 ms 26296 KB Output is correct
7 Correct 3 ms 26312 KB Output is correct
8 Correct 4 ms 26204 KB Output is correct
9 Correct 4 ms 26296 KB Output is correct
10 Correct 4 ms 26204 KB Output is correct
11 Correct 3 ms 26204 KB Output is correct
12 Correct 3 ms 26316 KB Output is correct
13 Correct 4 ms 26204 KB Output is correct
14 Correct 3 ms 26204 KB Output is correct
15 Correct 3 ms 26204 KB Output is correct
16 Correct 3 ms 26204 KB Output is correct
17 Correct 3 ms 26204 KB Output is correct
18 Correct 5 ms 26460 KB Output is correct
19 Correct 5 ms 26460 KB Output is correct
20 Correct 5 ms 26460 KB Output is correct
21 Correct 6 ms 26460 KB Output is correct
22 Correct 4 ms 26460 KB Output is correct
23 Correct 5 ms 26544 KB Output is correct
24 Correct 6 ms 26460 KB Output is correct
25 Correct 4 ms 26204 KB Output is correct
26 Correct 5 ms 26460 KB Output is correct
27 Correct 5 ms 26460 KB Output is correct
28 Correct 5 ms 26460 KB Output is correct
29 Correct 5 ms 26460 KB Output is correct
30 Correct 5 ms 26460 KB Output is correct
31 Correct 5 ms 26460 KB Output is correct
32 Correct 5 ms 26456 KB Output is correct
33 Correct 5 ms 26500 KB Output is correct
34 Correct 66 ms 37716 KB Output is correct
35 Correct 68 ms 41552 KB Output is correct
36 Correct 69 ms 41556 KB Output is correct
37 Correct 88 ms 41728 KB Output is correct
38 Correct 118 ms 41556 KB Output is correct
39 Correct 80 ms 41596 KB Output is correct
40 Correct 85 ms 41556 KB Output is correct
41 Correct 4 ms 26200 KB Output is correct
42 Correct 3 ms 26204 KB Output is correct
43 Correct 89 ms 32504 KB Output is correct
44 Correct 93 ms 36272 KB Output is correct
45 Correct 99 ms 36392 KB Output is correct
46 Correct 110 ms 39268 KB Output is correct
47 Correct 126 ms 38852 KB Output is correct
48 Correct 107 ms 39500 KB Output is correct
49 Correct 120 ms 38844 KB Output is correct
50 Correct 116 ms 36436 KB Output is correct
51 Correct 108 ms 36612 KB Output is correct
52 Correct 114 ms 36620 KB Output is correct
53 Correct 111 ms 36436 KB Output is correct