oj.uz

답안 #1069691

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1069691 2024-08-22T08:18:01 Z Whisper Cat Exercise (JOI23_ho_t4) C++17
31 / 100
 112 ms 60496 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;
    }
}
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;
    }
}
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

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

Subtask #2
7.0 / 7.0

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

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10328 KB Output is correct
2 Correct 3 ms 10368 KB Output is correct
3 Correct 2 ms 10332 KB Output is correct
4 Correct 2 ms 10332 KB Output is correct
5 Correct 3 ms 10332 KB Output is correct
6 Correct 3 ms 10400 KB Output is correct
7 Correct 3 ms 10428 KB Output is correct
8 Correct 2 ms 10332 KB Output is correct
9 Correct 2 ms 10332 KB Output is correct
10 Correct 2 ms 10244 KB Output is correct
11 Correct 3 ms 10328 KB Output is correct
12 Correct 4 ms 10332 KB Output is correct
13 Correct 2 ms 10332 KB Output is correct
14 Correct 2 ms 10328 KB Output is correct
15 Correct 3 ms 10396 KB Output is correct
16 Correct 3 ms 10332 KB Output is correct
17 Correct 3 ms 10332 KB Output is correct
18 Correct 104 ms 10844 KB Output is correct
19 Correct 100 ms 11012 KB Output is correct
20 Correct 106 ms 10844 KB Output is correct
21 Correct 7 ms 10840 KB Output is correct
22 Correct 7 ms 10844 KB Output is correct
23 Correct 5 ms 10844 KB Output is correct
24 Correct 5 ms 10844 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10328 KB Output is correct
2 Correct 3 ms 10368 KB Output is correct
3 Correct 2 ms 10332 KB Output is correct
4 Correct 2 ms 10332 KB Output is correct
5 Correct 3 ms 10332 KB Output is correct
6 Correct 3 ms 10400 KB Output is correct
7 Correct 3 ms 10428 KB Output is correct
8 Correct 2 ms 10332 KB Output is correct
9 Correct 2 ms 10332 KB Output is correct
10 Correct 2 ms 10244 KB Output is correct
11 Correct 3 ms 10328 KB Output is correct
12 Correct 4 ms 10332 KB Output is correct
13 Correct 2 ms 10332 KB Output is correct
14 Correct 2 ms 10328 KB Output is correct
15 Correct 3 ms 10396 KB Output is correct
16 Correct 3 ms 10332 KB Output is correct
17 Correct 3 ms 10332 KB Output is correct
18 Correct 104 ms 10844 KB Output is correct
19 Correct 100 ms 11012 KB Output is correct
20 Correct 106 ms 10844 KB Output is correct
21 Correct 7 ms 10840 KB Output is correct
22 Correct 7 ms 10844 KB Output is correct
23 Correct 5 ms 10844 KB Output is correct
24 Correct 5 ms 10844 KB Output is correct
25 Correct 3 ms 10332 KB Output is correct
26 Correct 99 ms 10844 KB Output is correct
27 Correct 112 ms 10980 KB Output is correct
28 Correct 111 ms 11016 KB Output is correct
29 Correct 104 ms 10844 KB Output is correct
30 Correct 17 ms 11096 KB Output is correct
31 Correct 16 ms 10588 KB Output is correct
32 Correct 13 ms 10732 KB Output is correct
33 Correct 28 ms 10584 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10328 KB Output is correct
2 Correct 3 ms 10368 KB Output is correct
3 Correct 2 ms 10332 KB Output is correct
4 Correct 2 ms 10332 KB Output is correct
5 Correct 3 ms 10332 KB Output is correct
6 Correct 3 ms 10400 KB Output is correct
7 Correct 3 ms 10428 KB Output is correct
8 Correct 2 ms 10332 KB Output is correct
9 Correct 2 ms 10332 KB Output is correct
10 Correct 2 ms 10244 KB Output is correct
11 Correct 3 ms 10328 KB Output is correct
12 Correct 4 ms 10332 KB Output is correct
13 Correct 2 ms 10332 KB Output is correct
14 Correct 2 ms 10328 KB Output is correct
15 Correct 3 ms 10396 KB Output is correct
16 Correct 3 ms 10332 KB Output is correct
17 Correct 3 ms 10332 KB Output is correct
18 Correct 104 ms 10844 KB Output is correct
19 Correct 100 ms 11012 KB Output is correct
20 Correct 106 ms 10844 KB Output is correct
21 Correct 7 ms 10840 KB Output is correct
22 Correct 7 ms 10844 KB Output is correct
23 Correct 5 ms 10844 KB Output is correct
24 Correct 5 ms 10844 KB Output is correct
25 Incorrect 85 ms 60496 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

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

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10328 KB Output is correct
2 Correct 3 ms 10368 KB Output is correct
3 Correct 2 ms 10332 KB Output is correct
4 Correct 2 ms 10332 KB Output is correct
5 Correct 3 ms 10332 KB Output is correct
6 Correct 3 ms 10400 KB Output is correct
7 Correct 3 ms 10428 KB Output is correct
8 Correct 2 ms 10332 KB Output is correct
9 Correct 2 ms 10332 KB Output is correct
10 Correct 2 ms 10244 KB Output is correct
11 Correct 3 ms 10328 KB Output is correct
12 Correct 4 ms 10332 KB Output is correct
13 Correct 2 ms 10332 KB Output is correct
14 Correct 2 ms 10328 KB Output is correct
15 Correct 3 ms 10396 KB Output is correct
16 Correct 3 ms 10332 KB Output is correct
17 Correct 3 ms 10332 KB Output is correct
18 Correct 104 ms 10844 KB Output is correct
19 Correct 100 ms 11012 KB Output is correct
20 Correct 106 ms 10844 KB Output is correct
21 Correct 7 ms 10840 KB Output is correct
22 Correct 7 ms 10844 KB Output is correct
23 Correct 5 ms 10844 KB Output is correct
24 Correct 5 ms 10844 KB Output is correct
25 Correct 3 ms 10332 KB Output is correct
26 Correct 99 ms 10844 KB Output is correct
27 Correct 112 ms 10980 KB Output is correct
28 Correct 111 ms 11016 KB Output is correct
29 Correct 104 ms 10844 KB Output is correct
30 Correct 17 ms 11096 KB Output is correct
31 Correct 16 ms 10588 KB Output is correct
32 Correct 13 ms 10732 KB Output is correct
33 Correct 28 ms 10584 KB Output is correct
34 Incorrect 85 ms 60496 KB Output isn't correct
35 Halted 0 ms 0 KB -