oj.uz

Submission #949237

# Submission time Handle Problem Language Result Execution time Memory
949237 2024-03-19T04:03:21 Z Tuanlinh123 Mergers (JOI19_mergers) C++17
70 / 100
 597 ms 249044 KB 
#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
#define sz(a) ((ll)(a).size())
using namespace std;
 
const ll maxn=500005;
pll sp[20][maxn];
vector <pll> euler;
vector <ll> leaf, A[maxn];
ll P[maxn], col[maxn], lca[maxn], pa[maxn], dsu[maxn], cnt[maxn];
 
void dfs(ll u)
{
    lca[u]=sz(euler)+1, euler.pb({lca[u], u});
    for (ll v:A[u])
        if (v!=pa[u])
            pa[v]=u, dfs(v), euler.pb({lca[u], u});
    if (sz(A[u])==1) leaf.pb(u);
}
 
void initlca()
{
    ll n=sz(euler);
    for (ll i=0; i<n; i++)
        sp[0][i+1]=euler[i];
    for (ll i=1; i<20; i++)
        for (ll j=1; j+(1<<i)<=n+1; j++)
            sp[i][j]=min(sp[i-1][j], sp[i-1][j+(1<<i-1)]);
}
 
ll LCA(ll u, ll v)
{
    if (!u || !v) return u+v;
    ll l=lca[u], r=lca[v];
    if (l>r) swap(l, r);
    ll j=__lg(r-l+1);
    return min(sp[j][l], sp[j][r-(1<<j)+1]).se;
}
 
ll Find(ll i)
{
    if (dsu[i]<0) return i;
    return dsu[i]=Find(dsu[i]);
}
 
void Union(ll a, ll b)
{
    a=Find(a), b=Find(b);
    if (a==b) return;
    if (dsu[a]>dsu[b]) swap(a, b);
    P[a]=LCA(P[a], P[b]), dsu[a]+=dsu[b], dsu[b]=a;
}
 
void dfs1(ll u)
{
    for (ll v:A[u])
        if (v!=pa[u])
            dfs1(v), cnt[u]+=cnt[v];
}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll n, k; cin >> n >> k;
    for (ll i=1; i<n; i++)
    {
        ll u, v; cin >> u >> v;
        A[u].pb(v), A[v].pb(u);
    }
    dfs(1), initlca();
    for (ll i=1; i<=n; i++)
        cin >> col[i], P[col[i]]=LCA(P[col[i]], i), dsu[i]=-1;
    for (ll i=1; i<=n; i++)
        cnt[i]++, cnt[P[col[i]]]--;
    dfs1(1);
    for (ll i=1; i<=n; i++)
        if (pa[i] && cnt[i])
            Union(i, pa[i]);
    for (ll i=1; i<=n; i++) P[i]=0;
    for (ll i=1; i<=n; i++)
        if (!cnt[i] && pa[i])
            P[Find(i)]++, P[Find(pa[i])]++;
    ll cnt=0;
    for (ll i=1; i<=n; i++)
        cnt+=P[i]==1;
    cout << (cnt+1)/2;
 
}

Compilation message

mergers.cpp: In function 'void initlca()':
mergers.cpp:34:53: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   34 |             sp[i][j]=min(sp[i-1][j], sp[i-1][j+(1<<i-1)]);
      |                                                    ~^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 26972 KB Output is correct
2 Correct 7 ms 35164 KB Output is correct
3 Correct 5 ms 35164 KB Output is correct
4 Correct 5 ms 29020 KB Output is correct
5 Correct 5 ms 26972 KB Output is correct
6 Correct 7 ms 35164 KB Output is correct
7 Correct 4 ms 20828 KB Output is correct
8 Correct 5 ms 35164 KB Output is correct
9 Correct 5 ms 29200 KB Output is correct
10 Correct 4 ms 24924 KB Output is correct
11 Correct 6 ms 35164 KB Output is correct
12 Correct 5 ms 35164 KB Output is correct
13 Correct 5 ms 29112 KB Output is correct
14 Correct 6 ms 35164 KB Output is correct
15 Correct 6 ms 35164 KB Output is correct
16 Correct 5 ms 26968 KB Output is correct
17 Correct 5 ms 26972 KB Output is correct
18 Correct 6 ms 35164 KB Output is correct
19 Correct 5 ms 26972 KB Output is correct
20 Correct 5 ms 26972 KB Output is correct
21 Correct 5 ms 35164 KB Output is correct
22 Correct 6 ms 35164 KB Output is correct
23 Correct 5 ms 29200 KB Output is correct
24 Correct 5 ms 29016 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 26972 KB Output is correct
2 Correct 7 ms 35164 KB Output is correct
3 Correct 5 ms 35164 KB Output is correct
4 Correct 5 ms 29020 KB Output is correct
5 Correct 5 ms 26972 KB Output is correct
6 Correct 7 ms 35164 KB Output is correct
7 Correct 4 ms 20828 KB Output is correct
8 Correct 5 ms 35164 KB Output is correct
9 Correct 5 ms 29200 KB Output is correct
10 Correct 4 ms 24924 KB Output is correct
11 Correct 6 ms 35164 KB Output is correct
12 Correct 5 ms 35164 KB Output is correct
13 Correct 5 ms 29112 KB Output is correct
14 Correct 6 ms 35164 KB Output is correct
15 Correct 6 ms 35164 KB Output is correct
16 Correct 5 ms 26968 KB Output is correct
17 Correct 5 ms 26972 KB Output is correct
18 Correct 6 ms 35164 KB Output is correct
19 Correct 5 ms 26972 KB Output is correct
20 Correct 5 ms 26972 KB Output is correct
21 Correct 5 ms 35164 KB Output is correct
22 Correct 6 ms 35164 KB Output is correct
23 Correct 5 ms 29200 KB Output is correct
24 Correct 5 ms 29016 KB Output is correct
25 Correct 5 ms 33116 KB Output is correct
26 Correct 10 ms 47964 KB Output is correct
27 Correct 8 ms 47964 KB Output is correct
28 Correct 9 ms 48220 KB Output is correct
29 Correct 9 ms 48004 KB Output is correct
30 Correct 8 ms 47964 KB Output is correct
31 Correct 6 ms 33116 KB Output is correct
32 Correct 8 ms 48220 KB Output is correct
33 Correct 5 ms 33116 KB Output is correct
34 Correct 8 ms 47964 KB Output is correct
35 Correct 8 ms 47964 KB Output is correct
36 Correct 9 ms 47964 KB Output is correct
37 Correct 9 ms 48144 KB Output is correct
38 Correct 6 ms 35164 KB Output is correct
39 Correct 8 ms 47964 KB Output is correct
40 Correct 9 ms 47964 KB Output is correct
41 Correct 8 ms 47968 KB Output is correct
42 Correct 8 ms 48008 KB Output is correct
43 Correct 8 ms 48220 KB Output is correct
44 Correct 6 ms 35164 KB Output is correct
45 Correct 8 ms 48072 KB Output is correct
46 Correct 9 ms 47964 KB Output is correct
47 Correct 6 ms 35164 KB Output is correct
48 Correct 9 ms 47960 KB Output is correct
49 Correct 8 ms 47964 KB Output is correct
50 Correct 9 ms 47964 KB Output is correct
51 Correct 9 ms 48216 KB Output is correct
52 Correct 8 ms 47968 KB Output is correct
53 Correct 8 ms 47976 KB Output is correct
54 Correct 8 ms 48068 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 26972 KB Output is correct
2 Correct 7 ms 35164 KB Output is correct
3 Correct 5 ms 35164 KB Output is correct
4 Correct 5 ms 29020 KB Output is correct
5 Correct 5 ms 26972 KB Output is correct
6 Correct 7 ms 35164 KB Output is correct
7 Correct 4 ms 20828 KB Output is correct
8 Correct 5 ms 35164 KB Output is correct
9 Correct 5 ms 29200 KB Output is correct
10 Correct 4 ms 24924 KB Output is correct
11 Correct 6 ms 35164 KB Output is correct
12 Correct 5 ms 35164 KB Output is correct
13 Correct 5 ms 29112 KB Output is correct
14 Correct 6 ms 35164 KB Output is correct
15 Correct 6 ms 35164 KB Output is correct
16 Correct 5 ms 26968 KB Output is correct
17 Correct 5 ms 26972 KB Output is correct
18 Correct 6 ms 35164 KB Output is correct
19 Correct 5 ms 26972 KB Output is correct
20 Correct 5 ms 26972 KB Output is correct
21 Correct 5 ms 35164 KB Output is correct
22 Correct 6 ms 35164 KB Output is correct
23 Correct 5 ms 29200 KB Output is correct
24 Correct 5 ms 29016 KB Output is correct
25 Correct 5 ms 33124 KB Output is correct
26 Correct 58 ms 128452 KB Output is correct
27 Correct 73 ms 126908 KB Output is correct
28 Correct 8 ms 47972 KB Output is correct
29 Correct 5 ms 33116 KB Output is correct
30 Correct 6 ms 33124 KB Output is correct
31 Correct 72 ms 126900 KB Output is correct
32 Correct 8 ms 47960 KB Output is correct
33 Correct 76 ms 135616 KB Output is correct
34 Correct 70 ms 127152 KB Output is correct
35 Correct 10 ms 47960 KB Output is correct
36 Correct 69 ms 127156 KB Output is correct
37 Correct 8 ms 47960 KB Output is correct
38 Correct 8 ms 47964 KB Output is correct
39 Correct 56 ms 127584 KB Output is correct
40 Correct 8 ms 48220 KB Output is correct
41 Correct 71 ms 126900 KB Output is correct
42 Correct 76 ms 129212 KB Output is correct
43 Correct 6 ms 35164 KB Output is correct
44 Correct 73 ms 135876 KB Output is correct
45 Correct 87 ms 132788 KB Output is correct
46 Correct 8 ms 47960 KB Output is correct
47 Correct 9 ms 47988 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 127612 KB Output is correct
2 Correct 55 ms 128188 KB Output is correct
3 Correct 9 ms 48216 KB Output is correct
4 Correct 9 ms 47964 KB Output is correct
5 Correct 6 ms 33288 KB Output is correct
6 Correct 6 ms 33368 KB Output is correct
7 Correct 8 ms 48216 KB Output is correct
8 Correct 79 ms 126684 KB Output is correct
9 Correct 8 ms 47964 KB Output is correct
10 Correct 75 ms 126772 KB Output is correct
11 Correct 6 ms 35164 KB Output is correct
12 Correct 81 ms 125936 KB Output is correct
13 Correct 79 ms 126432 KB Output is correct
14 Correct 69 ms 127088 KB Output is correct
15 Correct 53 ms 128312 KB Output is correct
16 Correct 8 ms 47964 KB Output is correct
17 Correct 6 ms 35164 KB Output is correct
18 Correct 58 ms 128060 KB Output is correct
19 Correct 71 ms 131724 KB Output is correct
20 Correct 8 ms 47960 KB Output is correct
21 Correct 5 ms 35164 KB Output is correct
22 Correct 60 ms 127768 KB Output is correct
23 Correct 8 ms 47964 KB Output is correct
24 Correct 99 ms 125680 KB Output is correct
25 Correct 75 ms 131768 KB Output is correct
26 Correct 8 ms 47960 KB Output is correct
27 Correct 8 ms 47964 KB Output is correct
28 Correct 8 ms 48076 KB Output is correct
29 Correct 8 ms 47964 KB Output is correct
30 Correct 8 ms 47964 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 26972 KB Output is correct
2 Correct 7 ms 35164 KB Output is correct
3 Correct 5 ms 35164 KB Output is correct
4 Correct 5 ms 29020 KB Output is correct
5 Correct 5 ms 26972 KB Output is correct
6 Correct 7 ms 35164 KB Output is correct
7 Correct 4 ms 20828 KB Output is correct
8 Correct 5 ms 35164 KB Output is correct
9 Correct 5 ms 29200 KB Output is correct
10 Correct 4 ms 24924 KB Output is correct
11 Correct 6 ms 35164 KB Output is correct
12 Correct 5 ms 35164 KB Output is correct
13 Correct 5 ms 29112 KB Output is correct
14 Correct 6 ms 35164 KB Output is correct
15 Correct 6 ms 35164 KB Output is correct
16 Correct 5 ms 26968 KB Output is correct
17 Correct 5 ms 26972 KB Output is correct
18 Correct 6 ms 35164 KB Output is correct
19 Correct 5 ms 26972 KB Output is correct
20 Correct 5 ms 26972 KB Output is correct
21 Correct 5 ms 35164 KB Output is correct
22 Correct 6 ms 35164 KB Output is correct
23 Correct 5 ms 29200 KB Output is correct
24 Correct 5 ms 29016 KB Output is correct
25 Correct 5 ms 33116 KB Output is correct
26 Correct 10 ms 47964 KB Output is correct
27 Correct 8 ms 47964 KB Output is correct
28 Correct 9 ms 48220 KB Output is correct
29 Correct 9 ms 48004 KB Output is correct
30 Correct 8 ms 47964 KB Output is correct
31 Correct 6 ms 33116 KB Output is correct
32 Correct 8 ms 48220 KB Output is correct
33 Correct 5 ms 33116 KB Output is correct
34 Correct 8 ms 47964 KB Output is correct
35 Correct 8 ms 47964 KB Output is correct
36 Correct 9 ms 47964 KB Output is correct
37 Correct 9 ms 48144 KB Output is correct
38 Correct 6 ms 35164 KB Output is correct
39 Correct 8 ms 47964 KB Output is correct
40 Correct 9 ms 47964 KB Output is correct
41 Correct 8 ms 47968 KB Output is correct
42 Correct 8 ms 48008 KB Output is correct
43 Correct 8 ms 48220 KB Output is correct
44 Correct 6 ms 35164 KB Output is correct
45 Correct 8 ms 48072 KB Output is correct
46 Correct 9 ms 47964 KB Output is correct
47 Correct 6 ms 35164 KB Output is correct
48 Correct 9 ms 47960 KB Output is correct
49 Correct 8 ms 47964 KB Output is correct
50 Correct 9 ms 47964 KB Output is correct
51 Correct 9 ms 48216 KB Output is correct
52 Correct 8 ms 47968 KB Output is correct
53 Correct 8 ms 47976 KB Output is correct
54 Correct 8 ms 48068 KB Output is correct
55 Correct 5 ms 33124 KB Output is correct
56 Correct 58 ms 128452 KB Output is correct
57 Correct 73 ms 126908 KB Output is correct
58 Correct 8 ms 47972 KB Output is correct
59 Correct 5 ms 33116 KB Output is correct
60 Correct 6 ms 33124 KB Output is correct
61 Correct 72 ms 126900 KB Output is correct
62 Correct 8 ms 47960 KB Output is correct
63 Correct 76 ms 135616 KB Output is correct
64 Correct 70 ms 127152 KB Output is correct
65 Correct 10 ms 47960 KB Output is correct
66 Correct 69 ms 127156 KB Output is correct
67 Correct 8 ms 47960 KB Output is correct
68 Correct 8 ms 47964 KB Output is correct
69 Correct 56 ms 127584 KB Output is correct
70 Correct 8 ms 48220 KB Output is correct
71 Correct 71 ms 126900 KB Output is correct
72 Correct 76 ms 129212 KB Output is correct
73 Correct 6 ms 35164 KB Output is correct
74 Correct 73 ms 135876 KB Output is correct
75 Correct 87 ms 132788 KB Output is correct
76 Correct 8 ms 47960 KB Output is correct
77 Correct 9 ms 47988 KB Output is correct
78 Correct 53 ms 127612 KB Output is correct
79 Correct 55 ms 128188 KB Output is correct
80 Correct 9 ms 48216 KB Output is correct
81 Correct 9 ms 47964 KB Output is correct
82 Correct 6 ms 33288 KB Output is correct
83 Correct 6 ms 33368 KB Output is correct
84 Correct 8 ms 48216 KB Output is correct
85 Correct 79 ms 126684 KB Output is correct
86 Correct 8 ms 47964 KB Output is correct
87 Correct 75 ms 126772 KB Output is correct
88 Correct 6 ms 35164 KB Output is correct
89 Correct 81 ms 125936 KB Output is correct
90 Correct 79 ms 126432 KB Output is correct
91 Correct 69 ms 127088 KB Output is correct
92 Correct 53 ms 128312 KB Output is correct
93 Correct 8 ms 47964 KB Output is correct
94 Correct 6 ms 35164 KB Output is correct
95 Correct 58 ms 128060 KB Output is correct
96 Correct 71 ms 131724 KB Output is correct
97 Correct 8 ms 47960 KB Output is correct
98 Correct 5 ms 35164 KB Output is correct
99 Correct 60 ms 127768 KB Output is correct
100 Correct 8 ms 47964 KB Output is correct
101 Correct 99 ms 125680 KB Output is correct
102 Correct 75 ms 131768 KB Output is correct
103 Correct 8 ms 47960 KB Output is correct
104 Correct 8 ms 47964 KB Output is correct
105 Correct 8 ms 48076 KB Output is correct
106 Correct 8 ms 47964 KB Output is correct
107 Correct 8 ms 47964 KB Output is correct
108 Correct 381 ms 234944 KB Output is correct
109 Incorrect 597 ms 249044 KB Output isn't correct
110 Halted 0 ms 0 KB -