oj.uz

Submission #768601

# Submission time Handle Problem Language Result Execution time Memory
768601 2023-06-28T09:52:39 Z bachhoangxuan Mergers (JOI19_mergers) C++17
100 / 100
 1069 ms 196260 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
//#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
//const int inf=1e18;
const int mod=1e9+7;
const int maxn=500005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
/*
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
*/
const int base=101;
namespace Tree{
    vector<vector<int>> edge,Min;
    vector<int> lg2,dep,L,R;
    int pos;
    int cmp(int u,int v){
        return (dep[u]<dep[v]?u:v);
    }
    int lca(int u,int v){
        u=L[u];v=L[v];
        if(u>v) swap(u,v);
        int p=lg2[v-u+1];
        return cmp(Min[u][p],Min[v-(1<<p)+1][p]);
    }
    int dist(int u,int v){
        return dep[u]+dep[v]-2*dep[lca(u,v)];
    }
    void dfs(int u,int p){
        L[u]=++pos;Min[pos][0]=u;
        dep[u]=dep[p]+1;
        for(int v:edge[u]){
            if(v==p) continue;
            dfs(v,u);Min[++pos][0]=u;
        }
        R[u]=pos;
    }
    void init(int n){
        lg2.assign(2*n+1,0);
        dep.assign(n+1,0);
        L.assign(n+1,0);
        R.assign(n+1,0);
        edge.resize(n+1);
        Min.assign(2*n+1,vector<int>(maxl,0));
    }
    void build(int n){
        init(n);
        for(int i=1;i<n;i++){
            int u,v;cin >> u >> v;
            edge[u].push_back(v);
            edge[v].push_back(u);
        }
        dfs(1,0);
        for(int i=2;i<=pos;i++) lg2[i]=lg2[i/2]+1;
        for(int i=1;i<20;i++){
            for(int j=1;j<=(pos-(1<<i)+1);j++) Min[j][i]=cmp(Min[j][i-1],Min[j+(1<<(i-1))][i-1]);
        }
    }
}
int num[maxn],p[maxn],par[maxn],cnt[maxn];
int findpar(int u){
    if(u!=par[u]) return par[u]=findpar(par[u]);
    return u;
}
void unions(int u,int v){
    u=findpar(u);v=findpar(v);
    if(u!=v) par[v]=u;
}
void add(int u,int v){
    num[u]++;num[v]++;
    num[Tree::lca(u,v)]-=2;
}
void dfs(int u,int p){
    for(int v:Tree::edge[u]){
        if(v==p) continue;
        dfs(v,u);num[u]+=num[v];
    }
    if(num[u]>=1 && p) unions(u,p);
}
void dfs2(int u,int p){
    if(num[u]==0 && p){
        cnt[findpar(u)]++;
        cnt[findpar(p)]++;
    }
    for(int v:Tree::edge[u]){
        if(v==p) continue;
        dfs2(v,u);
    }
}
void solve(){
    int n,k;cin >> n >> k;
    for(int i=1;i<=n;i++) par[i]=i;
    Tree::build(n);
    for(int i=1;i<=n;i++){
        int s;cin >> s;
        if(p[s]) add(i,p[s]);
        p[s]=i;
    }
    dfs(1,0);dfs2(1,0);
    int leaf=0;
    for(int i=1;i<=n;i++) leaf+=(cnt[i]==1);
    cout << (leaf+1)/2 << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 248 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 1 ms 340 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 248 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 2 ms 1368 KB Output is correct
27 Correct 2 ms 1364 KB Output is correct
28 Correct 2 ms 1364 KB Output is correct
29 Correct 3 ms 1364 KB Output is correct
30 Correct 2 ms 1364 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 2 ms 1492 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 2 ms 1372 KB Output is correct
35 Correct 2 ms 1364 KB Output is correct
36 Correct 2 ms 1364 KB Output is correct
37 Correct 2 ms 1364 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 2 ms 1364 KB Output is correct
40 Correct 2 ms 1236 KB Output is correct
41 Correct 2 ms 1364 KB Output is correct
42 Correct 2 ms 1364 KB Output is correct
43 Correct 2 ms 1492 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 2 ms 1364 KB Output is correct
46 Correct 2 ms 1364 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 2 ms 1364 KB Output is correct
49 Correct 2 ms 1364 KB Output is correct
50 Correct 2 ms 1364 KB Output is correct
51 Correct 2 ms 1364 KB Output is correct
52 Correct 2 ms 1364 KB Output is correct
53 Correct 2 ms 1364 KB Output is correct
54 Correct 2 ms 1236 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 248 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 112 ms 33828 KB Output is correct
27 Correct 110 ms 33548 KB Output is correct
28 Correct 2 ms 1284 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 104 ms 33728 KB Output is correct
32 Correct 3 ms 1364 KB Output is correct
33 Correct 111 ms 40740 KB Output is correct
34 Correct 110 ms 33580 KB Output is correct
35 Correct 2 ms 1364 KB Output is correct
36 Correct 118 ms 34496 KB Output is correct
37 Correct 2 ms 1236 KB Output is correct
38 Correct 3 ms 1276 KB Output is correct
39 Correct 88 ms 33728 KB Output is correct
40 Correct 2 ms 1492 KB Output is correct
41 Correct 108 ms 33512 KB Output is correct
42 Correct 113 ms 35916 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 117 ms 40948 KB Output is correct
45 Correct 112 ms 37260 KB Output is correct
46 Correct 2 ms 1364 KB Output is correct
47 Correct 2 ms 1236 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 33860 KB Output is correct
2 Correct 81 ms 34468 KB Output is correct
3 Correct 2 ms 1364 KB Output is correct
4 Correct 2 ms 1368 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 1368 KB Output is correct
8 Correct 99 ms 34396 KB Output is correct
9 Correct 2 ms 1368 KB Output is correct
10 Correct 99 ms 33964 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 97 ms 34000 KB Output is correct
13 Correct 108 ms 34384 KB Output is correct
14 Correct 90 ms 34632 KB Output is correct
15 Correct 81 ms 33852 KB Output is correct
16 Correct 2 ms 1276 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 76 ms 34880 KB Output is correct
19 Correct 101 ms 38524 KB Output is correct
20 Correct 3 ms 1364 KB Output is correct
21 Correct 0 ms 336 KB Output is correct
22 Correct 80 ms 34736 KB Output is correct
23 Correct 2 ms 1364 KB Output is correct
24 Correct 105 ms 34112 KB Output is correct
25 Correct 88 ms 37196 KB Output is correct
26 Correct 2 ms 1364 KB Output is correct
27 Correct 2 ms 1416 KB Output is correct
28 Correct 2 ms 1364 KB Output is correct
29 Correct 2 ms 1364 KB Output is correct
30 Correct 2 ms 1372 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 248 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 2 ms 1368 KB Output is correct
27 Correct 2 ms 1364 KB Output is correct
28 Correct 2 ms 1364 KB Output is correct
29 Correct 3 ms 1364 KB Output is correct
30 Correct 2 ms 1364 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 2 ms 1492 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 2 ms 1372 KB Output is correct
35 Correct 2 ms 1364 KB Output is correct
36 Correct 2 ms 1364 KB Output is correct
37 Correct 2 ms 1364 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 2 ms 1364 KB Output is correct
40 Correct 2 ms 1236 KB Output is correct
41 Correct 2 ms 1364 KB Output is correct
42 Correct 2 ms 1364 KB Output is correct
43 Correct 2 ms 1492 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 2 ms 1364 KB Output is correct
46 Correct 2 ms 1364 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 2 ms 1364 KB Output is correct
49 Correct 2 ms 1364 KB Output is correct
50 Correct 2 ms 1364 KB Output is correct
51 Correct 2 ms 1364 KB Output is correct
52 Correct 2 ms 1364 KB Output is correct
53 Correct 2 ms 1364 KB Output is correct
54 Correct 2 ms 1236 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 112 ms 33828 KB Output is correct
57 Correct 110 ms 33548 KB Output is correct
58 Correct 2 ms 1284 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 104 ms 33728 KB Output is correct
62 Correct 3 ms 1364 KB Output is correct
63 Correct 111 ms 40740 KB Output is correct
64 Correct 110 ms 33580 KB Output is correct
65 Correct 2 ms 1364 KB Output is correct
66 Correct 118 ms 34496 KB Output is correct
67 Correct 2 ms 1236 KB Output is correct
68 Correct 3 ms 1276 KB Output is correct
69 Correct 88 ms 33728 KB Output is correct
70 Correct 2 ms 1492 KB Output is correct
71 Correct 108 ms 33512 KB Output is correct
72 Correct 113 ms 35916 KB Output is correct
73 Correct 1 ms 340 KB Output is correct
74 Correct 117 ms 40948 KB Output is correct
75 Correct 112 ms 37260 KB Output is correct
76 Correct 2 ms 1364 KB Output is correct
77 Correct 2 ms 1236 KB Output is correct
78 Correct 85 ms 33860 KB Output is correct
79 Correct 81 ms 34468 KB Output is correct
80 Correct 2 ms 1364 KB Output is correct
81 Correct 2 ms 1368 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 2 ms 1368 KB Output is correct
85 Correct 99 ms 34396 KB Output is correct
86 Correct 2 ms 1368 KB Output is correct
87 Correct 99 ms 33964 KB Output is correct
88 Correct 1 ms 340 KB Output is correct
89 Correct 97 ms 34000 KB Output is correct
90 Correct 108 ms 34384 KB Output is correct
91 Correct 90 ms 34632 KB Output is correct
92 Correct 81 ms 33852 KB Output is correct
93 Correct 2 ms 1276 KB Output is correct
94 Correct 1 ms 340 KB Output is correct
95 Correct 76 ms 34880 KB Output is correct
96 Correct 101 ms 38524 KB Output is correct
97 Correct 3 ms 1364 KB Output is correct
98 Correct 0 ms 336 KB Output is correct
99 Correct 80 ms 34736 KB Output is correct
100 Correct 2 ms 1364 KB Output is correct
101 Correct 105 ms 34112 KB Output is correct
102 Correct 88 ms 37196 KB Output is correct
103 Correct 2 ms 1364 KB Output is correct
104 Correct 2 ms 1416 KB Output is correct
105 Correct 2 ms 1364 KB Output is correct
106 Correct 2 ms 1364 KB Output is correct
107 Correct 2 ms 1372 KB Output is correct
108 Correct 593 ms 173412 KB Output is correct
109 Correct 1069 ms 184992 KB Output is correct
110 Correct 1046 ms 196212 KB Output is correct
111 Correct 908 ms 196260 KB Output is correct
112 Correct 821 ms 186484 KB Output is correct
113 Correct 464 ms 174984 KB Output is correct
114 Correct 877 ms 167012 KB Output is correct
115 Correct 852 ms 166908 KB Output is correct
116 Correct 845 ms 170940 KB Output is correct
117 Correct 776 ms 173236 KB Output is correct
118 Correct 809 ms 165996 KB Output is correct
119 Correct 667 ms 173308 KB Output is correct
120 Correct 831 ms 187200 KB Output is correct
121 Correct 758 ms 173244 KB Output is correct
122 Correct 794 ms 172360 KB Output is correct
123 Correct 437 ms 172800 KB Output is correct
124 Correct 872 ms 169636 KB Output is correct