oj.uz

Submission #1069998

# Submission time Handle Problem Language Result Execution time Memory
1069998 2024-08-22T10:55:20 Z vjudge1 Cat Exercise (JOI23_ho_t4) C++17
100 / 100
 176 ms 64336 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX                 200005
#define LOG                     19
vector<int> G[MAX];
int label[MAX], numNode;

int root = 1;


int up[MAX][LOG], depth[MAX];

void pre_dfs(int u, int p = -1){
    for (int &v : G[u]) if(v ^ p){
        up[v][0] = u;
        depth[v] = depth[u] + 1;

        for (int i = 1; i < LOG; ++i) up[v][i] = up[up[v][i - 1]][i - 1];
        pre_dfs(v, u);
    }
}
int low_bit(int p){
    return (p & (-p));
}
int lca(int u, int v){
    if (depth[u] < depth[v]) swap(u, v);
    int dis = depth[u] - depth[v];
    for (; dis > 0; dis ^= low_bit(dis)){
        int i = __builtin_ctz(low_bit(dis));
        u = up[u][i];
    }
    if(u == v) return u;

    for (int i = LOG - 1; i >= 0; --i) if(up[u][i] != up[v][i]){
        u = up[u][i], v = up[v][i];
    }
    return up[u][0];
}

int dis(int a, int b){
    return depth[a] + depth[b] - 2 * depth[lca(a, b)];
}


namespace SUBTASK_4{
    int dp[MAX], del[MAX];

    bool vis[MAX];
    int dfs(int u){
        vis[u] = true;

        int mx_node = u;
        for (int&v : G[u]) if(!vis[v]){
            if(del[v]) continue;
            int x = dfs(v);
            if(label[mx_node] < label[x]){
                mx_node = x;
            }
        }
        return mx_node;
    }
    void main(void){
        queue<int> q;
        q.emplace(root);
        while(q.size()){
            int u = q.front(); q.pop();
            if(del[u]) continue;
            del[u] = true;
            for (int&v : G[u]){
                memset(vis, 0, (numNode + 1) * sizeof(bool));
                int x = dfs(v);
                if(!del[x]){
                    if(maximize(dp[x], dp[u] + dis(x, u))){
                        q.push(x);
                    }
                }
            }
        }
        int ans = 0;
        for (int i = 1; i <= numNode; ++i) maximize(ans, dp[i]);
        cout << ans;
    }
}

namespace SUBTASK_7{

    int mx[MAX], pa[MAX];

    int find(int u){
        return u == pa[u] ? u : pa[u] = find(pa[u]);
    }

    bool joint(int u, int v){
        u = find(u), v = find(v);
        if(u == v) return false;

        if(mx[u] < mx[v]){
            swap(u, v);
        }
        pa[v] = u;
        maximize(mx[u], mx[v]);
        return true;
    }
    int dp[MAX];

    int ID[MAX];
    void main(void){
        for (int i = 1; i <= numNode; ++i) mx[i] = label[i], pa[i] = i, ID[label[i]] = i;

        memset(dp, 0, (numNode + 1) * sizeof(int));
        int ans = 0;
        for (int i = 1; i <= numNode; ++i){
            int u = ID[i];

            for (int&v : G[u]){
                if (label[v] < label[u]){
                    int prv = find(v);
                    maximize(dp[u], dp[prv] + dis(prv, u));
                    joint(v, u);
                }
            }
            maximize(ans, dp[u]);
        }
        cout << dp[ID[numNode]];
    }
}
void process(void){
    cin >> numNode;
    for (int i = 1; i <= numNode; ++i){
        cin >> label[i];
        if(label[i] == numNode) root = i;
    }
    for (int i = 1; i < numNode; ++i){
        int u, v; cin >> u >> v;
        G[u].emplace_back(v);
        G[v].emplace_back(u);
    }
    pre_dfs(root, root);
    if(numNode <= 5000) {
        SUBTASK_4 :: main();
        return;
    }

    SUBTASK_7 :: main();
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12376 KB Output is correct
2 Correct 2 ms 12380 KB Output is correct
3 Correct 2 ms 12380 KB Output is correct
4 Correct 2 ms 12380 KB Output is correct
5 Correct 2 ms 12380 KB Output is correct
6 Correct 2 ms 12380 KB Output is correct
7 Correct 2 ms 12472 KB Output is correct
8 Correct 3 ms 12380 KB Output is correct
9 Correct 2 ms 12376 KB Output is correct
10 Correct 2 ms 12380 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12376 KB Output is correct
2 Correct 2 ms 12380 KB Output is correct
3 Correct 2 ms 12380 KB Output is correct
4 Correct 2 ms 12380 KB Output is correct
5 Correct 2 ms 12380 KB Output is correct
6 Correct 2 ms 12380 KB Output is correct
7 Correct 2 ms 12472 KB Output is correct
8 Correct 3 ms 12380 KB Output is correct
9 Correct 2 ms 12376 KB Output is correct
10 Correct 2 ms 12380 KB Output is correct
11 Correct 2 ms 12380 KB Output is correct
12 Correct 2 ms 12380 KB Output is correct
13 Correct 2 ms 12380 KB Output is correct
14 Correct 2 ms 12380 KB Output is correct
15 Correct 2 ms 12380 KB Output is correct
16 Correct 2 ms 12380 KB Output is correct
17 Correct 2 ms 12380 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12376 KB Output is correct
2 Correct 2 ms 12380 KB Output is correct
3 Correct 2 ms 12380 KB Output is correct
4 Correct 2 ms 12380 KB Output is correct
5 Correct 2 ms 12380 KB Output is correct
6 Correct 2 ms 12380 KB Output is correct
7 Correct 2 ms 12472 KB Output is correct
8 Correct 3 ms 12380 KB Output is correct
9 Correct 2 ms 12376 KB Output is correct
10 Correct 2 ms 12380 KB Output is correct
11 Correct 2 ms 12380 KB Output is correct
12 Correct 2 ms 12380 KB Output is correct
13 Correct 2 ms 12380 KB Output is correct
14 Correct 2 ms 12380 KB Output is correct
15 Correct 2 ms 12380 KB Output is correct
16 Correct 2 ms 12380 KB Output is correct
17 Correct 2 ms 12380 KB Output is correct
18 Correct 102 ms 13112 KB Output is correct
19 Correct 101 ms 13112 KB Output is correct
20 Correct 99 ms 13104 KB Output is correct
21 Correct 5 ms 12892 KB Output is correct
22 Correct 5 ms 12892 KB Output is correct
23 Correct 5 ms 12808 KB Output is correct
24 Correct 6 ms 12892 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12376 KB Output is correct
2 Correct 2 ms 12380 KB Output is correct
3 Correct 2 ms 12380 KB Output is correct
4 Correct 2 ms 12380 KB Output is correct
5 Correct 2 ms 12380 KB Output is correct
6 Correct 2 ms 12380 KB Output is correct
7 Correct 2 ms 12472 KB Output is correct
8 Correct 3 ms 12380 KB Output is correct
9 Correct 2 ms 12376 KB Output is correct
10 Correct 2 ms 12380 KB Output is correct
11 Correct 2 ms 12380 KB Output is correct
12 Correct 2 ms 12380 KB Output is correct
13 Correct 2 ms 12380 KB Output is correct
14 Correct 2 ms 12380 KB Output is correct
15 Correct 2 ms 12380 KB Output is correct
16 Correct 2 ms 12380 KB Output is correct
17 Correct 2 ms 12380 KB Output is correct
18 Correct 102 ms 13112 KB Output is correct
19 Correct 101 ms 13112 KB Output is correct
20 Correct 99 ms 13104 KB Output is correct
21 Correct 5 ms 12892 KB Output is correct
22 Correct 5 ms 12892 KB Output is correct
23 Correct 5 ms 12808 KB Output is correct
24 Correct 6 ms 12892 KB Output is correct
25 Correct 2 ms 12376 KB Output is correct
26 Correct 95 ms 12892 KB Output is correct
27 Correct 97 ms 13140 KB Output is correct
28 Correct 95 ms 13104 KB Output is correct
29 Correct 93 ms 12892 KB Output is correct
30 Correct 10 ms 12632 KB Output is correct
31 Correct 15 ms 12892 KB Output is correct
32 Correct 12 ms 12892 KB Output is correct
33 Correct 15 ms 12892 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12376 KB Output is correct
2 Correct 2 ms 12380 KB Output is correct
3 Correct 2 ms 12380 KB Output is correct
4 Correct 2 ms 12380 KB Output is correct
5 Correct 2 ms 12380 KB Output is correct
6 Correct 2 ms 12380 KB Output is correct
7 Correct 2 ms 12472 KB Output is correct
8 Correct 3 ms 12380 KB Output is correct
9 Correct 2 ms 12376 KB Output is correct
10 Correct 2 ms 12380 KB Output is correct
11 Correct 2 ms 12380 KB Output is correct
12 Correct 2 ms 12380 KB Output is correct
13 Correct 2 ms 12380 KB Output is correct
14 Correct 2 ms 12380 KB Output is correct
15 Correct 2 ms 12380 KB Output is correct
16 Correct 2 ms 12380 KB Output is correct
17 Correct 2 ms 12380 KB Output is correct
18 Correct 102 ms 13112 KB Output is correct
19 Correct 101 ms 13112 KB Output is correct
20 Correct 99 ms 13104 KB Output is correct
21 Correct 5 ms 12892 KB Output is correct
22 Correct 5 ms 12892 KB Output is correct
23 Correct 5 ms 12808 KB Output is correct
24 Correct 6 ms 12892 KB Output is correct
25 Correct 84 ms 63060 KB Output is correct
26 Correct 77 ms 63056 KB Output is correct
27 Correct 77 ms 64336 KB Output is correct
28 Correct 89 ms 59984 KB Output is correct
29 Correct 92 ms 61524 KB Output is correct
30 Correct 89 ms 61012 KB Output is correct
31 Correct 92 ms 61780 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12376 KB Output is correct
2 Correct 3 ms 12560 KB Output is correct
3 Correct 98 ms 53332 KB Output is correct
4 Correct 101 ms 52052 KB Output is correct
5 Correct 100 ms 53256 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12376 KB Output is correct
2 Correct 2 ms 12380 KB Output is correct
3 Correct 2 ms 12380 KB Output is correct
4 Correct 2 ms 12380 KB Output is correct
5 Correct 2 ms 12380 KB Output is correct
6 Correct 2 ms 12380 KB Output is correct
7 Correct 2 ms 12472 KB Output is correct
8 Correct 3 ms 12380 KB Output is correct
9 Correct 2 ms 12376 KB Output is correct
10 Correct 2 ms 12380 KB Output is correct
11 Correct 2 ms 12380 KB Output is correct
12 Correct 2 ms 12380 KB Output is correct
13 Correct 2 ms 12380 KB Output is correct
14 Correct 2 ms 12380 KB Output is correct
15 Correct 2 ms 12380 KB Output is correct
16 Correct 2 ms 12380 KB Output is correct
17 Correct 2 ms 12380 KB Output is correct
18 Correct 102 ms 13112 KB Output is correct
19 Correct 101 ms 13112 KB Output is correct
20 Correct 99 ms 13104 KB Output is correct
21 Correct 5 ms 12892 KB Output is correct
22 Correct 5 ms 12892 KB Output is correct
23 Correct 5 ms 12808 KB Output is correct
24 Correct 6 ms 12892 KB Output is correct
25 Correct 2 ms 12376 KB Output is correct
26 Correct 95 ms 12892 KB Output is correct
27 Correct 97 ms 13140 KB Output is correct
28 Correct 95 ms 13104 KB Output is correct
29 Correct 93 ms 12892 KB Output is correct
30 Correct 10 ms 12632 KB Output is correct
31 Correct 15 ms 12892 KB Output is correct
32 Correct 12 ms 12892 KB Output is correct
33 Correct 15 ms 12892 KB Output is correct
34 Correct 84 ms 63060 KB Output is correct
35 Correct 77 ms 63056 KB Output is correct
36 Correct 77 ms 64336 KB Output is correct
37 Correct 89 ms 59984 KB Output is correct
38 Correct 92 ms 61524 KB Output is correct
39 Correct 89 ms 61012 KB Output is correct
40 Correct 92 ms 61780 KB Output is correct
41 Correct 2 ms 12376 KB Output is correct
42 Correct 3 ms 12560 KB Output is correct
43 Correct 98 ms 53332 KB Output is correct
44 Correct 101 ms 52052 KB Output is correct
45 Correct 100 ms 53256 KB Output is correct
46 Correct 167 ms 60968 KB Output is correct
47 Correct 151 ms 59732 KB Output is correct
48 Correct 162 ms 62288 KB Output is correct
49 Correct 176 ms 59732 KB Output is correct
50 Correct 161 ms 52744 KB Output is correct
51 Correct 147 ms 52824 KB Output is correct
52 Correct 143 ms 51540 KB Output is correct
53 Correct 151 ms 52720 KB Output is correct