oj.uz

Submission #474189

# Submission time Handle Problem Language Result Execution time Memory
474189 2021-09-17T08:49:41 Z NhatMinh0208 Mergers (JOI19_mergers) C++14
100 / 100
 1076 ms 108996 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<pii(int)> gt[500001];
vector<int> buc[500001];
ll n,m,i,j,k,t,t1,u,v,a,b;
int col[500001];
int par[500001];
ll hah[500001];
ll dp[500001];
int eu[500001];
int ev[500001];
int gp[500001];
ll rand60() {
    ll a = (rand()&((1<<30)-1));
    ll b = (rand()&((1<<30)-1))<<10;
    ll c = (rand()&((1<<30)-1))<<20;
    ll d = (rand()&((1<<30)-1))<<30;

    return a^b^c^d;
}
void dfs(int x, int p) {
    dp[x]=hah[x];
    for (auto g : gt[x]) if (g.fi-p) {
        dfs(g.fi,x);
        dp[x]^=dp[g.fi];
    }
    if (dp[x]==0) {
        for (auto g : gt[x]) if (g.fi == p) {
            gp[g.se]=1;
        }
    }
}
void dfs2(int x, int p) {
    col[x]=t;
    for (auto g : gt[x]) if (g.fi-p) dfs2(g.fi,x);
}
int dp2[500001][2];
void dfs3(int x, int p) {
    int u=0,a=0;
    dp2[x][0]=dp2[x][1]=1e9;
    for (auto g : gt[x]) if (g.fi-p) {
        a++;
        dfs3(g.fi,x);
        u+=min(dp2[g.fi][0]+1,dp2[g.fi][1]);
    }
    if (a==0) {
        dp2[x][0]=0;
        dp2[x][1]=1e9;
    } else if (a%2) {
        dp2[x][0]=u-a/2;
        dp2[x][1]=u-a/2;
    } else {
        dp2[x][0]=u-a/2;
        dp2[x][1]=u-(a/2-1);
    }

}
int main()
{
    srand(234123);
	fio;
    cin>>n>>m;
    for (i=1;i<n;i++) {
        cin>>eu[i]>>ev[i];
        gt[eu[i]].push_back({ev[i],i});
        gt[ev[i]].push_back({eu[i],i});
    }
    for (i=1;i<=n;i++) {cin>>col[i]; buc[col[i]].push_back(i);}
    for (i=1;i<=m;i++) {
        u=0;
        for (j=0;j<buc[i].size()-1;j++) {
            hah[buc[i][j]]=rand60();
            u^=hah[buc[i][j]];
        }
        hah[buc[i][buc[i].size()-1]]=u;
    }
    dfs(1,-1);
    for (i=1;i<=n;i++) {
        col[i]=0;
        gt[i].clear();
    }
    for (i=1;i<n;i++) if (!gp[i]) {
        gt[eu[i]].push_back({ev[i],i});
        gt[ev[i]].push_back({eu[i],i});
    }
    t=0;
    for (i=1;i<=n;i++) if (!col[i]) {
        t++;
        dfs2(i,-1);
    }
    for (i=1;i<=n;i++) gt[i].clear();
    for (i=1;i<n;i++) if (gp[i]) {
        // cout<<col[eu[i]]<<' '<<col[ev[i]]<<endl;
        gt[col[eu[i]]].push_back({col[ev[i]],i});
        gt[col[ev[i]]].push_back({col[eu[i]],i});
    }
    
    if (t==1) cout<<0;
    else {
        a=0;
        for (i=1;i<=t;i++) if (gt[i].size()==1) a++;
        cout<<a-a/2;
    }
}
// N;

Compilation message

mergers.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      | 
mergers.cpp: In function 'int main()':
mergers.cpp:168:19: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  168 |         for (j=0;j<buc[i].size()-1;j++) {
      |                  ~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23756 KB Output is correct
2 Correct 14 ms 23760 KB Output is correct
3 Correct 13 ms 23772 KB Output is correct
4 Correct 14 ms 23828 KB Output is correct
5 Correct 13 ms 23844 KB Output is correct
6 Correct 16 ms 23796 KB Output is correct
7 Correct 13 ms 23756 KB Output is correct
8 Correct 13 ms 23780 KB Output is correct
9 Correct 14 ms 23832 KB Output is correct
10 Correct 13 ms 23756 KB Output is correct
11 Correct 14 ms 23756 KB Output is correct
12 Correct 14 ms 23868 KB Output is correct
13 Correct 13 ms 23756 KB Output is correct
14 Correct 14 ms 23804 KB Output is correct
15 Correct 14 ms 23756 KB Output is correct
16 Correct 14 ms 23744 KB Output is correct
17 Correct 14 ms 23808 KB Output is correct
18 Correct 14 ms 23756 KB Output is correct
19 Correct 14 ms 23756 KB Output is correct
20 Correct 14 ms 23756 KB Output is correct
21 Correct 14 ms 23800 KB Output is correct
22 Correct 14 ms 23864 KB Output is correct
23 Correct 14 ms 23804 KB Output is correct
24 Correct 14 ms 23804 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23756 KB Output is correct
2 Correct 14 ms 23760 KB Output is correct
3 Correct 13 ms 23772 KB Output is correct
4 Correct 14 ms 23828 KB Output is correct
5 Correct 13 ms 23844 KB Output is correct
6 Correct 16 ms 23796 KB Output is correct
7 Correct 13 ms 23756 KB Output is correct
8 Correct 13 ms 23780 KB Output is correct
9 Correct 14 ms 23832 KB Output is correct
10 Correct 13 ms 23756 KB Output is correct
11 Correct 14 ms 23756 KB Output is correct
12 Correct 14 ms 23868 KB Output is correct
13 Correct 13 ms 23756 KB Output is correct
14 Correct 14 ms 23804 KB Output is correct
15 Correct 14 ms 23756 KB Output is correct
16 Correct 14 ms 23744 KB Output is correct
17 Correct 14 ms 23808 KB Output is correct
18 Correct 14 ms 23756 KB Output is correct
19 Correct 14 ms 23756 KB Output is correct
20 Correct 14 ms 23756 KB Output is correct
21 Correct 14 ms 23800 KB Output is correct
22 Correct 14 ms 23864 KB Output is correct
23 Correct 14 ms 23804 KB Output is correct
24 Correct 14 ms 23804 KB Output is correct
25 Correct 15 ms 23756 KB Output is correct
26 Correct 16 ms 24068 KB Output is correct
27 Correct 16 ms 24068 KB Output is correct
28 Correct 16 ms 24320 KB Output is correct
29 Correct 16 ms 24140 KB Output is correct
30 Correct 16 ms 24084 KB Output is correct
31 Correct 13 ms 23756 KB Output is correct
32 Correct 15 ms 24316 KB Output is correct
33 Correct 13 ms 23804 KB Output is correct
34 Correct 15 ms 24012 KB Output is correct
35 Correct 16 ms 24140 KB Output is correct
36 Correct 19 ms 24012 KB Output is correct
37 Correct 16 ms 24068 KB Output is correct
38 Correct 14 ms 23764 KB Output is correct
39 Correct 16 ms 24140 KB Output is correct
40 Correct 17 ms 24012 KB Output is correct
41 Correct 15 ms 24012 KB Output is correct
42 Correct 15 ms 24140 KB Output is correct
43 Correct 15 ms 24268 KB Output is correct
44 Correct 14 ms 23840 KB Output is correct
45 Correct 16 ms 24140 KB Output is correct
46 Correct 16 ms 24140 KB Output is correct
47 Correct 13 ms 23792 KB Output is correct
48 Correct 16 ms 24076 KB Output is correct
49 Correct 15 ms 24200 KB Output is correct
50 Correct 16 ms 24268 KB Output is correct
51 Correct 16 ms 24020 KB Output is correct
52 Correct 15 ms 24072 KB Output is correct
53 Correct 16 ms 24140 KB Output is correct
54 Correct 15 ms 24012 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23756 KB Output is correct
2 Correct 14 ms 23760 KB Output is correct
3 Correct 13 ms 23772 KB Output is correct
4 Correct 14 ms 23828 KB Output is correct
5 Correct 13 ms 23844 KB Output is correct
6 Correct 16 ms 23796 KB Output is correct
7 Correct 13 ms 23756 KB Output is correct
8 Correct 13 ms 23780 KB Output is correct
9 Correct 14 ms 23832 KB Output is correct
10 Correct 13 ms 23756 KB Output is correct
11 Correct 14 ms 23756 KB Output is correct
12 Correct 14 ms 23868 KB Output is correct
13 Correct 13 ms 23756 KB Output is correct
14 Correct 14 ms 23804 KB Output is correct
15 Correct 14 ms 23756 KB Output is correct
16 Correct 14 ms 23744 KB Output is correct
17 Correct 14 ms 23808 KB Output is correct
18 Correct 14 ms 23756 KB Output is correct
19 Correct 14 ms 23756 KB Output is correct
20 Correct 14 ms 23756 KB Output is correct
21 Correct 14 ms 23800 KB Output is correct
22 Correct 14 ms 23864 KB Output is correct
23 Correct 14 ms 23804 KB Output is correct
24 Correct 14 ms 23804 KB Output is correct
25 Correct 13 ms 23756 KB Output is correct
26 Correct 67 ms 32448 KB Output is correct
27 Correct 96 ms 32228 KB Output is correct
28 Correct 16 ms 24084 KB Output is correct
29 Correct 16 ms 23796 KB Output is correct
30 Correct 14 ms 23752 KB Output is correct
31 Correct 88 ms 32304 KB Output is correct
32 Correct 16 ms 24012 KB Output is correct
33 Correct 100 ms 40324 KB Output is correct
34 Correct 93 ms 32196 KB Output is correct
35 Correct 16 ms 24012 KB Output is correct
36 Correct 102 ms 32848 KB Output is correct
37 Correct 16 ms 24012 KB Output is correct
38 Correct 15 ms 24012 KB Output is correct
39 Correct 80 ms 32364 KB Output is correct
40 Correct 16 ms 24364 KB Output is correct
41 Correct 104 ms 32116 KB Output is correct
42 Correct 114 ms 34560 KB Output is correct
43 Correct 14 ms 23836 KB Output is correct
44 Correct 120 ms 40696 KB Output is correct
45 Correct 99 ms 37456 KB Output is correct
46 Correct 16 ms 24072 KB Output is correct
47 Correct 15 ms 24076 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 31004 KB Output is correct
2 Correct 88 ms 33976 KB Output is correct
3 Correct 17 ms 24060 KB Output is correct
4 Correct 15 ms 24012 KB Output is correct
5 Correct 14 ms 23780 KB Output is correct
6 Correct 14 ms 23808 KB Output is correct
7 Correct 15 ms 24012 KB Output is correct
8 Correct 100 ms 34052 KB Output is correct
9 Correct 15 ms 24012 KB Output is correct
10 Correct 103 ms 32812 KB Output is correct
11 Correct 14 ms 23832 KB Output is correct
12 Correct 124 ms 32304 KB Output is correct
13 Correct 105 ms 34044 KB Output is correct
14 Correct 105 ms 35500 KB Output is correct
15 Correct 69 ms 32348 KB Output is correct
16 Correct 16 ms 24176 KB Output is correct
17 Correct 14 ms 23884 KB Output is correct
18 Correct 97 ms 36556 KB Output is correct
19 Correct 126 ms 39844 KB Output is correct
20 Correct 16 ms 24140 KB Output is correct
21 Correct 13 ms 23816 KB Output is correct
22 Correct 88 ms 34384 KB Output is correct
23 Correct 18 ms 24084 KB Output is correct
24 Correct 128 ms 32964 KB Output is correct
25 Correct 127 ms 38980 KB Output is correct
26 Correct 16 ms 24204 KB Output is correct
27 Correct 16 ms 24192 KB Output is correct
28 Correct 15 ms 24068 KB Output is correct
29 Correct 15 ms 24048 KB Output is correct
30 Correct 16 ms 24184 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23756 KB Output is correct
2 Correct 14 ms 23760 KB Output is correct
3 Correct 13 ms 23772 KB Output is correct
4 Correct 14 ms 23828 KB Output is correct
5 Correct 13 ms 23844 KB Output is correct
6 Correct 16 ms 23796 KB Output is correct
7 Correct 13 ms 23756 KB Output is correct
8 Correct 13 ms 23780 KB Output is correct
9 Correct 14 ms 23832 KB Output is correct
10 Correct 13 ms 23756 KB Output is correct
11 Correct 14 ms 23756 KB Output is correct
12 Correct 14 ms 23868 KB Output is correct
13 Correct 13 ms 23756 KB Output is correct
14 Correct 14 ms 23804 KB Output is correct
15 Correct 14 ms 23756 KB Output is correct
16 Correct 14 ms 23744 KB Output is correct
17 Correct 14 ms 23808 KB Output is correct
18 Correct 14 ms 23756 KB Output is correct
19 Correct 14 ms 23756 KB Output is correct
20 Correct 14 ms 23756 KB Output is correct
21 Correct 14 ms 23800 KB Output is correct
22 Correct 14 ms 23864 KB Output is correct
23 Correct 14 ms 23804 KB Output is correct
24 Correct 14 ms 23804 KB Output is correct
25 Correct 15 ms 23756 KB Output is correct
26 Correct 16 ms 24068 KB Output is correct
27 Correct 16 ms 24068 KB Output is correct
28 Correct 16 ms 24320 KB Output is correct
29 Correct 16 ms 24140 KB Output is correct
30 Correct 16 ms 24084 KB Output is correct
31 Correct 13 ms 23756 KB Output is correct
32 Correct 15 ms 24316 KB Output is correct
33 Correct 13 ms 23804 KB Output is correct
34 Correct 15 ms 24012 KB Output is correct
35 Correct 16 ms 24140 KB Output is correct
36 Correct 19 ms 24012 KB Output is correct
37 Correct 16 ms 24068 KB Output is correct
38 Correct 14 ms 23764 KB Output is correct
39 Correct 16 ms 24140 KB Output is correct
40 Correct 17 ms 24012 KB Output is correct
41 Correct 15 ms 24012 KB Output is correct
42 Correct 15 ms 24140 KB Output is correct
43 Correct 15 ms 24268 KB Output is correct
44 Correct 14 ms 23840 KB Output is correct
45 Correct 16 ms 24140 KB Output is correct
46 Correct 16 ms 24140 KB Output is correct
47 Correct 13 ms 23792 KB Output is correct
48 Correct 16 ms 24076 KB Output is correct
49 Correct 15 ms 24200 KB Output is correct
50 Correct 16 ms 24268 KB Output is correct
51 Correct 16 ms 24020 KB Output is correct
52 Correct 15 ms 24072 KB Output is correct
53 Correct 16 ms 24140 KB Output is correct
54 Correct 15 ms 24012 KB Output is correct
55 Correct 13 ms 23756 KB Output is correct
56 Correct 67 ms 32448 KB Output is correct
57 Correct 96 ms 32228 KB Output is correct
58 Correct 16 ms 24084 KB Output is correct
59 Correct 16 ms 23796 KB Output is correct
60 Correct 14 ms 23752 KB Output is correct
61 Correct 88 ms 32304 KB Output is correct
62 Correct 16 ms 24012 KB Output is correct
63 Correct 100 ms 40324 KB Output is correct
64 Correct 93 ms 32196 KB Output is correct
65 Correct 16 ms 24012 KB Output is correct
66 Correct 102 ms 32848 KB Output is correct
67 Correct 16 ms 24012 KB Output is correct
68 Correct 15 ms 24012 KB Output is correct
69 Correct 80 ms 32364 KB Output is correct
70 Correct 16 ms 24364 KB Output is correct
71 Correct 104 ms 32116 KB Output is correct
72 Correct 114 ms 34560 KB Output is correct
73 Correct 14 ms 23836 KB Output is correct
74 Correct 120 ms 40696 KB Output is correct
75 Correct 99 ms 37456 KB Output is correct
76 Correct 16 ms 24072 KB Output is correct
77 Correct 15 ms 24076 KB Output is correct
78 Correct 65 ms 31004 KB Output is correct
79 Correct 88 ms 33976 KB Output is correct
80 Correct 17 ms 24060 KB Output is correct
81 Correct 15 ms 24012 KB Output is correct
82 Correct 14 ms 23780 KB Output is correct
83 Correct 14 ms 23808 KB Output is correct
84 Correct 15 ms 24012 KB Output is correct
85 Correct 100 ms 34052 KB Output is correct
86 Correct 15 ms 24012 KB Output is correct
87 Correct 103 ms 32812 KB Output is correct
88 Correct 14 ms 23832 KB Output is correct
89 Correct 124 ms 32304 KB Output is correct
90 Correct 105 ms 34044 KB Output is correct
91 Correct 105 ms 35500 KB Output is correct
92 Correct 69 ms 32348 KB Output is correct
93 Correct 16 ms 24176 KB Output is correct
94 Correct 14 ms 23884 KB Output is correct
95 Correct 97 ms 36556 KB Output is correct
96 Correct 126 ms 39844 KB Output is correct
97 Correct 16 ms 24140 KB Output is correct
98 Correct 13 ms 23816 KB Output is correct
99 Correct 88 ms 34384 KB Output is correct
100 Correct 18 ms 24084 KB Output is correct
101 Correct 128 ms 32964 KB Output is correct
102 Correct 127 ms 38980 KB Output is correct
103 Correct 16 ms 24204 KB Output is correct
104 Correct 16 ms 24192 KB Output is correct
105 Correct 15 ms 24068 KB Output is correct
106 Correct 15 ms 24048 KB Output is correct
107 Correct 16 ms 24184 KB Output is correct
108 Correct 598 ms 76212 KB Output is correct
109 Correct 796 ms 85172 KB Output is correct
110 Correct 782 ms 98636 KB Output is correct
111 Correct 930 ms 108996 KB Output is correct
112 Correct 902 ms 103676 KB Output is correct
113 Correct 686 ms 87288 KB Output is correct
114 Correct 689 ms 65888 KB Output is correct
115 Correct 677 ms 65800 KB Output is correct
116 Correct 810 ms 72604 KB Output is correct
117 Correct 849 ms 83780 KB Output is correct
118 Correct 686 ms 68540 KB Output is correct
119 Correct 998 ms 88208 KB Output is correct
120 Correct 973 ms 102188 KB Output is correct
121 Correct 1076 ms 88392 KB Output is correct
122 Correct 839 ms 78572 KB Output is correct
123 Correct 620 ms 84616 KB Output is correct
124 Correct 882 ms 80204 KB Output is correct