oj.uz

Submission #1076842

# Submission time Handle Problem Language Result Execution time Memory
1076842 2024-08-26T17:11:44 Z steveonalex Mergers (JOI19_mergers) C++17
100 / 100
 781 ms 151540 KB 
// #include "aliens.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }
 
const int N = 5e5 + 69, LOG_N = 19;
 
int root = 1;
int n, k;
int color[N], h[N], parent[N][LOG_N];
vector<int> graph[N];
vector<int> basket[N];
int dp[N], cnt[N];
 
void dfs(int u, int p){
    h[u] = h[p] + 1;
    for(int j = 1; MASK(j) < h[u]; ++j) 
        parent[u][j] = parent[parent[u][j-1]][j-1];
 
    for(int v: graph[u]) if (v != p){
        parent[v][0] = u;
        dfs(v, u);
    }
}
 
int LCA(int u, int v){
    if (h[u] < h[v]) swap(u, v);
    int diff = h[u] - h[v];
    for(int j = 0; j < LOG_N; ++j) if (GETBIT(diff, j)) u = parent[u][j];
    if (u == v) return u;
    for(int j = LOG_N - 1; j>=0; --j) if (parent[u][j] != parent[v][j]){
        u = parent[u][j];
        v = parent[v][j];
    }
    return parent[u][0];
}
 
vector<int> leaf;
void go(int u, int p){
    for(int v: graph[u]) if (v != p){
        go(v, u);
        minimize(dp[u], dp[v]);
    }
    if (u != root && dp[u] == h[u]) {
        leaf.push_back(u);
        cnt[u] = 1;
    }
}

void get_leaf(int u, int p){
    int sum = 0;
    for(int v: graph[u]) if (v != p){
        get_leaf(v, u);
        sum += cnt[v];
    } 
    maximize(cnt[u], sum);
}
 
int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();
 
    cin >> n >> k;
    for(int i = 1; i<n; ++i){
        int u, v; cin >> u >> v;
        graph[u].push_back(v);
        graph[v].push_back(u);
    }
 
    for(int i = 1; i<=n; ++i){
        cin >> color[i];
        basket[color[i]].push_back(i);
    }

    if (n == 1){
        cout << 0 << "\n";
        return 0;
    }
    else if (n == 2){
        cout << (color[1] != color[2]) << "\n";
        return 0;
    }

    for(int i = 1; i<=n; ++i) if (graph[i].size() > 1){
        root = i;
        break;
    }
 
    dfs(root, 0);
 
    for(int i = 1; i<=k; ++i) if (basket[i].size()){
        int lck = basket[i][0];
        for(int j: basket[i]) lck = LCA(lck, j);
        for(int j: basket[i]) dp[j] = h[lck];
    }
 
    go(root, 0);

    sort(ALL(leaf), [&h](int x, int y){return h[x] < h[y];});
    if (leaf.empty()) cout << 0 << "\n";
    else{
        cnt[leaf.back()] = 0;
        get_leaf(leaf.back(),0);

        int ans = cnt[leaf.back()] + 1;
        cout << (ans + 1) / 2 << "\n";
    }
 
    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

Compilation message

mergers.cpp: In function 'int main()':
mergers.cpp:149:23: warning: capture of variable 'h' with non-automatic storage duration
  149 |     sort(ALL(leaf), [&h](int x, int y){return h[x] < h[y];});
      |                       ^
mergers.cpp:60:15: note: 'int h [500069]' declared here
   60 | int color[N], h[N], parent[N][LOG_N];
      |               ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 23896 KB Output is correct
2 Correct 11 ms 23900 KB Output is correct
3 Correct 11 ms 23932 KB Output is correct
4 Correct 10 ms 23900 KB Output is correct
5 Correct 11 ms 23916 KB Output is correct
6 Correct 11 ms 23900 KB Output is correct
7 Correct 11 ms 23900 KB Output is correct
8 Correct 14 ms 23896 KB Output is correct
9 Correct 11 ms 23900 KB Output is correct
10 Correct 11 ms 23900 KB Output is correct
11 Correct 11 ms 23856 KB Output is correct
12 Correct 12 ms 23952 KB Output is correct
13 Correct 10 ms 23896 KB Output is correct
14 Correct 12 ms 23896 KB Output is correct
15 Correct 11 ms 23900 KB Output is correct
16 Correct 11 ms 23912 KB Output is correct
17 Correct 15 ms 23896 KB Output is correct
18 Correct 11 ms 23868 KB Output is correct
19 Correct 12 ms 23900 KB Output is correct
20 Correct 11 ms 23900 KB Output is correct
21 Correct 12 ms 24000 KB Output is correct
22 Correct 15 ms 23900 KB Output is correct
23 Correct 10 ms 23900 KB Output is correct
24 Correct 11 ms 23900 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 23896 KB Output is correct
2 Correct 11 ms 23900 KB Output is correct
3 Correct 11 ms 23932 KB Output is correct
4 Correct 10 ms 23900 KB Output is correct
5 Correct 11 ms 23916 KB Output is correct
6 Correct 11 ms 23900 KB Output is correct
7 Correct 11 ms 23900 KB Output is correct
8 Correct 14 ms 23896 KB Output is correct
9 Correct 11 ms 23900 KB Output is correct
10 Correct 11 ms 23900 KB Output is correct
11 Correct 11 ms 23856 KB Output is correct
12 Correct 12 ms 23952 KB Output is correct
13 Correct 10 ms 23896 KB Output is correct
14 Correct 12 ms 23896 KB Output is correct
15 Correct 11 ms 23900 KB Output is correct
16 Correct 11 ms 23912 KB Output is correct
17 Correct 15 ms 23896 KB Output is correct
18 Correct 11 ms 23868 KB Output is correct
19 Correct 12 ms 23900 KB Output is correct
20 Correct 11 ms 23900 KB Output is correct
21 Correct 12 ms 24000 KB Output is correct
22 Correct 15 ms 23900 KB Output is correct
23 Correct 10 ms 23900 KB Output is correct
24 Correct 11 ms 23900 KB Output is correct
25 Correct 11 ms 23900 KB Output is correct
26 Correct 12 ms 24292 KB Output is correct
27 Correct 12 ms 24412 KB Output is correct
28 Correct 12 ms 24412 KB Output is correct
29 Correct 13 ms 24412 KB Output is correct
30 Correct 12 ms 24412 KB Output is correct
31 Correct 12 ms 23960 KB Output is correct
32 Correct 13 ms 24608 KB Output is correct
33 Correct 11 ms 23900 KB Output is correct
34 Correct 11 ms 24412 KB Output is correct
35 Correct 13 ms 24412 KB Output is correct
36 Correct 11 ms 24412 KB Output is correct
37 Correct 13 ms 24224 KB Output is correct
38 Correct 11 ms 23900 KB Output is correct
39 Correct 12 ms 24412 KB Output is correct
40 Correct 12 ms 24412 KB Output is correct
41 Correct 12 ms 24412 KB Output is correct
42 Correct 11 ms 24412 KB Output is correct
43 Correct 15 ms 24412 KB Output is correct
44 Correct 10 ms 23884 KB Output is correct
45 Correct 13 ms 24492 KB Output is correct
46 Correct 11 ms 24412 KB Output is correct
47 Correct 11 ms 23932 KB Output is correct
48 Correct 12 ms 24412 KB Output is correct
49 Correct 14 ms 24412 KB Output is correct
50 Correct 13 ms 24412 KB Output is correct
51 Correct 13 ms 24320 KB Output is correct
52 Correct 11 ms 24412 KB Output is correct
53 Correct 12 ms 24412 KB Output is correct
54 Correct 12 ms 24332 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 23896 KB Output is correct
2 Correct 11 ms 23900 KB Output is correct
3 Correct 11 ms 23932 KB Output is correct
4 Correct 10 ms 23900 KB Output is correct
5 Correct 11 ms 23916 KB Output is correct
6 Correct 11 ms 23900 KB Output is correct
7 Correct 11 ms 23900 KB Output is correct
8 Correct 14 ms 23896 KB Output is correct
9 Correct 11 ms 23900 KB Output is correct
10 Correct 11 ms 23900 KB Output is correct
11 Correct 11 ms 23856 KB Output is correct
12 Correct 12 ms 23952 KB Output is correct
13 Correct 10 ms 23896 KB Output is correct
14 Correct 12 ms 23896 KB Output is correct
15 Correct 11 ms 23900 KB Output is correct
16 Correct 11 ms 23912 KB Output is correct
17 Correct 15 ms 23896 KB Output is correct
18 Correct 11 ms 23868 KB Output is correct
19 Correct 12 ms 23900 KB Output is correct
20 Correct 11 ms 23900 KB Output is correct
21 Correct 12 ms 24000 KB Output is correct
22 Correct 15 ms 23900 KB Output is correct
23 Correct 10 ms 23900 KB Output is correct
24 Correct 11 ms 23900 KB Output is correct
25 Correct 12 ms 24152 KB Output is correct
26 Correct 46 ms 38092 KB Output is correct
27 Correct 55 ms 37716 KB Output is correct
28 Correct 13 ms 24412 KB Output is correct
29 Correct 12 ms 23900 KB Output is correct
30 Correct 12 ms 23900 KB Output is correct
31 Correct 59 ms 38036 KB Output is correct
32 Correct 13 ms 24412 KB Output is correct
33 Correct 87 ms 43364 KB Output is correct
34 Correct 58 ms 37796 KB Output is correct
35 Correct 13 ms 24408 KB Output is correct
36 Correct 67 ms 38684 KB Output is correct
37 Correct 12 ms 24260 KB Output is correct
38 Correct 12 ms 24432 KB Output is correct
39 Correct 38 ms 37964 KB Output is correct
40 Correct 12 ms 24412 KB Output is correct
41 Correct 51 ms 37580 KB Output is correct
42 Correct 92 ms 40260 KB Output is correct
43 Correct 11 ms 23900 KB Output is correct
44 Correct 82 ms 43400 KB Output is correct
45 Correct 70 ms 40532 KB Output is correct
46 Correct 12 ms 24412 KB Output is correct
47 Correct 12 ms 24332 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 36552 KB Output is correct
2 Correct 60 ms 40392 KB Output is correct
3 Correct 11 ms 24412 KB Output is correct
4 Correct 15 ms 24368 KB Output is correct
5 Correct 12 ms 23900 KB Output is correct
6 Correct 11 ms 23968 KB Output is correct
7 Correct 11 ms 24412 KB Output is correct
8 Correct 71 ms 39524 KB Output is correct
9 Correct 11 ms 24412 KB Output is correct
10 Correct 68 ms 38284 KB Output is correct
11 Correct 10 ms 23900 KB Output is correct
12 Correct 64 ms 38236 KB Output is correct
13 Correct 64 ms 39508 KB Output is correct
14 Correct 70 ms 41680 KB Output is correct
15 Correct 47 ms 37972 KB Output is correct
16 Correct 14 ms 24412 KB Output is correct
17 Correct 15 ms 23856 KB Output is correct
18 Correct 54 ms 41740 KB Output is correct
19 Correct 90 ms 49100 KB Output is correct
20 Correct 12 ms 24412 KB Output is correct
21 Correct 11 ms 23900 KB Output is correct
22 Correct 51 ms 39888 KB Output is correct
23 Correct 12 ms 24220 KB Output is correct
24 Correct 76 ms 38740 KB Output is correct
25 Correct 80 ms 45260 KB Output is correct
26 Correct 12 ms 24484 KB Output is correct
27 Correct 13 ms 24412 KB Output is correct
28 Correct 12 ms 24412 KB Output is correct
29 Correct 11 ms 24412 KB Output is correct
30 Correct 12 ms 24224 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 23896 KB Output is correct
2 Correct 11 ms 23900 KB Output is correct
3 Correct 11 ms 23932 KB Output is correct
4 Correct 10 ms 23900 KB Output is correct
5 Correct 11 ms 23916 KB Output is correct
6 Correct 11 ms 23900 KB Output is correct
7 Correct 11 ms 23900 KB Output is correct
8 Correct 14 ms 23896 KB Output is correct
9 Correct 11 ms 23900 KB Output is correct
10 Correct 11 ms 23900 KB Output is correct
11 Correct 11 ms 23856 KB Output is correct
12 Correct 12 ms 23952 KB Output is correct
13 Correct 10 ms 23896 KB Output is correct
14 Correct 12 ms 23896 KB Output is correct
15 Correct 11 ms 23900 KB Output is correct
16 Correct 11 ms 23912 KB Output is correct
17 Correct 15 ms 23896 KB Output is correct
18 Correct 11 ms 23868 KB Output is correct
19 Correct 12 ms 23900 KB Output is correct
20 Correct 11 ms 23900 KB Output is correct
21 Correct 12 ms 24000 KB Output is correct
22 Correct 15 ms 23900 KB Output is correct
23 Correct 10 ms 23900 KB Output is correct
24 Correct 11 ms 23900 KB Output is correct
25 Correct 11 ms 23900 KB Output is correct
26 Correct 12 ms 24292 KB Output is correct
27 Correct 12 ms 24412 KB Output is correct
28 Correct 12 ms 24412 KB Output is correct
29 Correct 13 ms 24412 KB Output is correct
30 Correct 12 ms 24412 KB Output is correct
31 Correct 12 ms 23960 KB Output is correct
32 Correct 13 ms 24608 KB Output is correct
33 Correct 11 ms 23900 KB Output is correct
34 Correct 11 ms 24412 KB Output is correct
35 Correct 13 ms 24412 KB Output is correct
36 Correct 11 ms 24412 KB Output is correct
37 Correct 13 ms 24224 KB Output is correct
38 Correct 11 ms 23900 KB Output is correct
39 Correct 12 ms 24412 KB Output is correct
40 Correct 12 ms 24412 KB Output is correct
41 Correct 12 ms 24412 KB Output is correct
42 Correct 11 ms 24412 KB Output is correct
43 Correct 15 ms 24412 KB Output is correct
44 Correct 10 ms 23884 KB Output is correct
45 Correct 13 ms 24492 KB Output is correct
46 Correct 11 ms 24412 KB Output is correct
47 Correct 11 ms 23932 KB Output is correct
48 Correct 12 ms 24412 KB Output is correct
49 Correct 14 ms 24412 KB Output is correct
50 Correct 13 ms 24412 KB Output is correct
51 Correct 13 ms 24320 KB Output is correct
52 Correct 11 ms 24412 KB Output is correct
53 Correct 12 ms 24412 KB Output is correct
54 Correct 12 ms 24332 KB Output is correct
55 Correct 12 ms 24152 KB Output is correct
56 Correct 46 ms 38092 KB Output is correct
57 Correct 55 ms 37716 KB Output is correct
58 Correct 13 ms 24412 KB Output is correct
59 Correct 12 ms 23900 KB Output is correct
60 Correct 12 ms 23900 KB Output is correct
61 Correct 59 ms 38036 KB Output is correct
62 Correct 13 ms 24412 KB Output is correct
63 Correct 87 ms 43364 KB Output is correct
64 Correct 58 ms 37796 KB Output is correct
65 Correct 13 ms 24408 KB Output is correct
66 Correct 67 ms 38684 KB Output is correct
67 Correct 12 ms 24260 KB Output is correct
68 Correct 12 ms 24432 KB Output is correct
69 Correct 38 ms 37964 KB Output is correct
70 Correct 12 ms 24412 KB Output is correct
71 Correct 51 ms 37580 KB Output is correct
72 Correct 92 ms 40260 KB Output is correct
73 Correct 11 ms 23900 KB Output is correct
74 Correct 82 ms 43400 KB Output is correct
75 Correct 70 ms 40532 KB Output is correct
76 Correct 12 ms 24412 KB Output is correct
77 Correct 12 ms 24332 KB Output is correct
78 Correct 39 ms 36552 KB Output is correct
79 Correct 60 ms 40392 KB Output is correct
80 Correct 11 ms 24412 KB Output is correct
81 Correct 15 ms 24368 KB Output is correct
82 Correct 12 ms 23900 KB Output is correct
83 Correct 11 ms 23968 KB Output is correct
84 Correct 11 ms 24412 KB Output is correct
85 Correct 71 ms 39524 KB Output is correct
86 Correct 11 ms 24412 KB Output is correct
87 Correct 68 ms 38284 KB Output is correct
88 Correct 10 ms 23900 KB Output is correct
89 Correct 64 ms 38236 KB Output is correct
90 Correct 64 ms 39508 KB Output is correct
91 Correct 70 ms 41680 KB Output is correct
92 Correct 47 ms 37972 KB Output is correct
93 Correct 14 ms 24412 KB Output is correct
94 Correct 15 ms 23856 KB Output is correct
95 Correct 54 ms 41740 KB Output is correct
96 Correct 90 ms 49100 KB Output is correct
97 Correct 12 ms 24412 KB Output is correct
98 Correct 11 ms 23900 KB Output is correct
99 Correct 51 ms 39888 KB Output is correct
100 Correct 12 ms 24220 KB Output is correct
101 Correct 76 ms 38740 KB Output is correct
102 Correct 80 ms 45260 KB Output is correct
103 Correct 12 ms 24484 KB Output is correct
104 Correct 13 ms 24412 KB Output is correct
105 Correct 12 ms 24412 KB Output is correct
106 Correct 11 ms 24412 KB Output is correct
107 Correct 12 ms 24224 KB Output is correct
108 Correct 365 ms 103376 KB Output is correct
109 Correct 660 ms 106976 KB Output is correct
110 Correct 613 ms 116160 KB Output is correct
111 Correct 781 ms 151540 KB Output is correct
112 Correct 685 ms 131004 KB Output is correct
113 Correct 319 ms 112772 KB Output is correct
114 Correct 359 ms 92780 KB Output is correct
115 Correct 359 ms 92920 KB Output is correct
116 Correct 459 ms 99412 KB Output is correct
117 Correct 490 ms 112908 KB Output is correct
118 Correct 358 ms 95336 KB Output is correct
119 Correct 479 ms 112860 KB Output is correct
120 Correct 701 ms 131780 KB Output is correct
121 Correct 552 ms 112844 KB Output is correct
122 Correct 470 ms 104912 KB Output is correct
123 Correct 303 ms 115136 KB Output is correct
124 Correct 556 ms 110884 KB Output is correct