oj.uz

Submission #263073

# Submission time Handle Problem Language Result Execution time Memory
263073 2020-08-13T12:47:27 Z dorijanlendvaj Mergers (JOI19_mergers) C++14
100 / 100
 1189 ms 164264 KB 
//DUEL
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#pragma GCC optimize("unroll-loops")
#define shandom_ruffle(a, b) shuffle(a, b, rng)
#define vi vector<int>
#define vl vector<ll>
#define popcnt __builtin_popcount
#define popcntll __builtin_popcountll
#define all(a) begin(a),end(a)

using namespace std;
using namespace __gnu_pbds;

using ll=long long;
using ull=unsigned long long;
using ld=long double;
int MOD=1000000007;
int MOD2=998244353;
vector<int> bases;
const ll LLINF=1ll<<60;
const char en='\n';

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void yes() {cout<<"YES"<<en; exit(0);}
void no() {cout<<"NO"<<en; exit(0);}
inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;}
template<class T>
void prVec(vector<T> w,bool fl=false)
{
	cout<<w.size()<<en;
	for (int i=0;i<int(w.size())-1;++i) cout<<w[i]<<' ';
	if (w.size()) cout<<w[w.size()-1]<<en;
	if (fl) cout<<flush;
}

void M998()
{
	swap(MOD,MOD2);
}

ll raand()
{
	ll a=rund();
	a*=RAND_MAX;
	a+=rund();
    return a;
}

#define rand raand

ll raaand()
{
	return raand()*(MOD-7)+raand();
}

void compress(vi&v)
{
	set<int> s;
	for (auto a: v) s.insert(a);
	vi o(all(s));
	for (auto&a: v) a=lower_bound(all(o),a)-o.begin();
}

void compress(vl&v)
{
	set<ll> s;
	for (auto a: v) s.insert(a);
	vl o(all(s));
	for (auto&a: v) a=lower_bound(all(o),a)-o.begin();
}

string to_upper(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A';
	return a;
}

string to_lower(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A';
	return a;
}

ll sti(string a,int base=10)
{
	ll k=0;
	for (int i=0;i<(int)a.size();++i)
	{
		k*=base;
		k+=a[i]-'0';
	}
	return k;
}

template<class T>
void eras(vector<T>& a,T b)
{
	a.erase(find(a.begin(),a.end(),b));
}

string its(ll k,int base=10)
{
	if (k==0) return "0";
	string a;
	while (k)
	{
		a.push_back((k%base)+'0');
		k/=base;
	}
	reverse(a.begin(),a.end());
	return a;
}

ll min(ll a,int b)
{
	if (a<b) return a;
	return b;
}

ll min(int a,ll b)
{
	if (a<b) return a;
	return b;
}

ll max(ll a,int b)
{
	if (a>b) return a;
	return b;
}

ll max(int a,ll b)
{
	if (a>b) return a;
	return b;
}

ll gcd(ll a,ll b)
{
	if (b==0) return a;
	return gcd(b,a%b);
}

ll lcm(ll a,ll b)
{
	return a/gcd(a,b)*b;
}

template<class T,class K>
pair<T,K> mp(T a,K b)
{
	return make_pair(a,b);
}

inline int mult(ll a,ll b)
{
	return (a*b)%MOD;
}

inline int pot(int n,int k)
{
	if (k==0) return 1;
	ll a=pot(n,k/2);
	a=mult(a,a);
	if (k%2) return mult(a,n);
	else return a;
}

int divide(int a,int b)
{
	return mult(a,pot(b,MOD-2));
}

inline int sub(int a,int b)
{
	if (a-b>=0) return a-b;
	return a-b+MOD;
}

inline int add(int a,int b)
{
	if (a+b>=MOD) return a+b-MOD;
	return a+b;
}

bool prime(ll a)
{
	if (a==1) return 0;
	for (int i=2;i<=round(sqrt(a));++i)
	{
		if (a%i==0) return 0;
	}
	return 1;
}

const int N=500010;
int k,n,ind[N],deg[N],c,par[20][N],cn[20][N],pa[N],de[N];
vi im[N],ch[N];

bool cmp(int i,int j)
{
	return ind[i]<ind[j];
}

void dfs(int i,int p)
{
	ind[i]=c++;
	par[0][i]=p;
	for (auto a: ch[i]) if (a!=p) de[a]=de[i]+1,dfs(a,i);
}

void sol(int a,int b)
{
	for (int j=18;j>=0;--j) if (de[a]-de[b]>=(1<<j)) ++cn[j][a],a=par[j][a];
	for (int j=18;j>=0;--j) if (de[b]-de[a]>=(1<<j)) ++cn[j][b],b=par[j][b];
	for (int j=18;j>=0;--j) if (par[j][a]!=par[j][b]) ++cn[j][a],a=par[j][a],++cn[j][b],b=par[j][b];
	if (a!=b)
	{
		int j=0;
		++cn[j][a],a=par[j][a],++cn[j][b],b=par[j][b];
	}
}

int find(int i)
{
	if (i==pa[i]) return i;
	return pa[i]=find(pa[i]);
}

void mer(int a,int b)
{
	a=find(a);
	b=find(b);
	if (a==b) return;
	pa[a]=b;
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	for (int i=0;i<10;++i) bases.push_back(rand()%(MOD-13893829*2)+13893829);
	cin>>n>>k;
	for (int i=1;i<n;++i)
	{
		int a,b;
		cin>>a>>b;
		ch[a].pb(b);
		ch[b].pb(a);
	}
	dfs(1,1);
	for (int i=1;i<=n;++i)
	{
		pa[i]=i;
		int z;
		cin>>z;
		im[z].pb(i);
	}
	for (int j=1;j<19;++j) for (int i=1;i<=n;++i) par[j][i]=par[j-1][par[j-1][i]];
	for (int i=1;i<=k;++i)
	{
		sort(all(im[i]),cmp);
		for (int j=1;j<im[i].size();++j) sol(im[i][j-1],im[i][j]);
	}
	for (int j=18;j>=1;--j) for (int i=1;i<=n;++i)
	{
		cn[j-1][i]+=cn[j][i];
		cn[j-1][par[j-1][i]]+=cn[j][i];
	}
	/*for (int i=2;i<=n;++i) cout<<cn[0][i]<<' ';
	cout<<en;*/
	for (int i=2;i<=n;++i) if (cn[0][i]) mer(i,par[0][i]);
	for (int i=2;i<=n;++i) if (!cn[0][i]) ++deg[find(i)],++deg[find(par[0][i])];
	int le=0;
	for (int i=1;i<=n;++i) if (i==find(i) && deg[i]<=1) ++le;
	if (le>1) cout<<(le+1)/2<<en;
	else cout<<0<<en;
}

Compilation message

mergers.cpp: In function 'int main()':
mergers.cpp:269:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  269 |   for (int j=1;j<im[i].size();++j) sol(im[i][j-1],im[i][j]);
      |                ~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
24.0 / 24.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 24188 KB Output is correct
2 Correct 17 ms 24192 KB Output is correct
3 Correct 16 ms 24192 KB Output is correct
4 Correct 16 ms 24192 KB Output is correct
5 Correct 16 ms 24192 KB Output is correct
6 Correct 16 ms 24192 KB Output is correct
7 Correct 16 ms 24192 KB Output is correct
8 Correct 16 ms 24192 KB Output is correct
9 Correct 16 ms 24192 KB Output is correct
10 Correct 16 ms 24192 KB Output is correct
11 Correct 16 ms 24192 KB Output is correct
12 Correct 17 ms 24192 KB Output is correct
13 Correct 16 ms 24192 KB Output is correct
14 Correct 17 ms 24192 KB Output is correct
15 Correct 18 ms 24192 KB Output is correct
16 Correct 16 ms 24192 KB Output is correct
17 Correct 17 ms 24192 KB Output is correct
18 Correct 16 ms 24192 KB Output is correct
19 Correct 16 ms 24192 KB Output is correct
20 Correct 17 ms 24192 KB Output is correct
21 Correct 17 ms 24192 KB Output is correct
22 Correct 17 ms 24192 KB Output is correct
23 Correct 18 ms 24192 KB Output is correct
24 Correct 16 ms 24192 KB Output is correct
25 Correct 17 ms 24192 KB Output is correct
26 Correct 117 ms 45296 KB Output is correct
27 Correct 163 ms 44920 KB Output is correct
28 Correct 22 ms 24768 KB Output is correct
29 Correct 17 ms 24192 KB Output is correct
30 Correct 17 ms 24192 KB Output is correct
31 Correct 138 ms 45048 KB Output is correct
32 Correct 19 ms 24832 KB Output is correct
33 Correct 207 ms 50852 KB Output is correct
34 Correct 155 ms 44920 KB Output is correct
35 Correct 20 ms 24824 KB Output is correct
36 Correct 150 ms 45688 KB Output is correct
37 Correct 19 ms 24832 KB Output is correct
38 Correct 19 ms 24832 KB Output is correct
39 Correct 120 ms 45168 KB Output is correct
40 Correct 19 ms 24960 KB Output is correct
41 Correct 163 ms 45040 KB Output is correct
42 Correct 184 ms 46840 KB Output is correct
43 Correct 16 ms 24192 KB Output is correct
44 Correct 164 ms 50796 KB Output is correct
45 Correct 196 ms 47864 KB Output is correct
46 Correct 21 ms 24832 KB Output is correct
47 Correct 19 ms 24832 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 44016 KB Output is correct
2 Correct 92 ms 47344 KB Output is correct
3 Correct 19 ms 24824 KB Output is correct
4 Correct 23 ms 24832 KB Output is correct
5 Correct 19 ms 24192 KB Output is correct
6 Correct 16 ms 24192 KB Output is correct
7 Correct 18 ms 24832 KB Output is correct
8 Correct 138 ms 46712 KB Output is correct
9 Correct 19 ms 24824 KB Output is correct
10 Correct 139 ms 45504 KB Output is correct
11 Correct 17 ms 24192 KB Output is correct
12 Correct 147 ms 45688 KB Output is correct
13 Correct 143 ms 46584 KB Output is correct
14 Correct 114 ms 48268 KB Output is correct
15 Correct 118 ms 45168 KB Output is correct
16 Correct 21 ms 24832 KB Output is correct
17 Correct 18 ms 24184 KB Output is correct
18 Correct 104 ms 48364 KB Output is correct
19 Correct 134 ms 51448 KB Output is correct
20 Correct 19 ms 24832 KB Output is correct
21 Correct 17 ms 24192 KB Output is correct
22 Correct 111 ms 46956 KB Output is correct
23 Correct 19 ms 24832 KB Output is correct
24 Correct 138 ms 46020 KB Output is correct
25 Correct 116 ms 50300 KB Output is correct
26 Correct 18 ms 24832 KB Output is correct
27 Correct 19 ms 24960 KB Output is correct
28 Correct 19 ms 24832 KB Output is correct
29 Correct 19 ms 24832 KB Output is correct
30 Correct 18 ms 24832 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 24188 KB Output is correct
2 Correct 17 ms 24192 KB Output is correct
3 Correct 16 ms 24192 KB Output is correct
4 Correct 16 ms 24192 KB Output is correct
5 Correct 16 ms 24192 KB Output is correct
6 Correct 16 ms 24192 KB Output is correct
7 Correct 16 ms 24192 KB Output is correct
8 Correct 16 ms 24192 KB Output is correct
9 Correct 16 ms 24192 KB Output is correct
10 Correct 16 ms 24192 KB Output is correct
11 Correct 16 ms 24192 KB Output is correct
12 Correct 17 ms 24192 KB Output is correct
13 Correct 16 ms 24192 KB Output is correct
14 Correct 17 ms 24192 KB Output is correct
15 Correct 18 ms 24192 KB Output is correct
16 Correct 16 ms 24192 KB Output is correct
17 Correct 17 ms 24192 KB Output is correct
18 Correct 16 ms 24192 KB Output is correct
19 Correct 16 ms 24192 KB Output is correct
20 Correct 17 ms 24192 KB Output is correct
21 Correct 17 ms 24192 KB Output is correct
22 Correct 17 ms 24192 KB Output is correct
23 Correct 18 ms 24192 KB Output is correct
24 Correct 16 ms 24192 KB Output is correct
25 Correct 17 ms 24192 KB Output is correct
26 Correct 19 ms 24832 KB Output is correct
27 Correct 21 ms 24832 KB Output is correct
28 Correct 19 ms 24960 KB Output is correct
29 Correct 19 ms 24832 KB Output is correct
30 Correct 19 ms 24832 KB Output is correct
31 Correct 16 ms 24192 KB Output is correct
32 Correct 19 ms 24960 KB Output is correct
33 Correct 17 ms 24192 KB Output is correct
34 Correct 18 ms 24832 KB Output is correct
35 Correct 19 ms 24832 KB Output is correct
36 Correct 19 ms 24824 KB Output is correct
37 Correct 19 ms 24832 KB Output is correct
38 Correct 16 ms 24192 KB Output is correct
39 Correct 19 ms 24832 KB Output is correct
40 Correct 19 ms 24832 KB Output is correct
41 Correct 19 ms 24960 KB Output is correct
42 Correct 19 ms 24832 KB Output is correct
43 Correct 19 ms 24960 KB Output is correct
44 Correct 17 ms 24192 KB Output is correct
45 Correct 19 ms 24832 KB Output is correct
46 Correct 19 ms 24832 KB Output is correct
47 Correct 17 ms 24192 KB Output is correct
48 Correct 22 ms 24832 KB Output is correct
49 Correct 19 ms 24832 KB Output is correct
50 Correct 22 ms 24832 KB Output is correct
51 Correct 19 ms 24832 KB Output is correct
52 Correct 19 ms 24832 KB Output is correct
53 Correct 22 ms 24824 KB Output is correct
54 Correct 19 ms 24832 KB Output is correct
55 Correct 17 ms 24192 KB Output is correct
56 Correct 117 ms 45296 KB Output is correct
57 Correct 163 ms 44920 KB Output is correct
58 Correct 22 ms 24768 KB Output is correct
59 Correct 17 ms 24192 KB Output is correct
60 Correct 17 ms 24192 KB Output is correct
61 Correct 138 ms 45048 KB Output is correct
62 Correct 19 ms 24832 KB Output is correct
63 Correct 207 ms 50852 KB Output is correct
64 Correct 155 ms 44920 KB Output is correct
65 Correct 20 ms 24824 KB Output is correct
66 Correct 150 ms 45688 KB Output is correct
67 Correct 19 ms 24832 KB Output is correct
68 Correct 19 ms 24832 KB Output is correct
69 Correct 120 ms 45168 KB Output is correct
70 Correct 19 ms 24960 KB Output is correct
71 Correct 163 ms 45040 KB Output is correct
72 Correct 184 ms 46840 KB Output is correct
73 Correct 16 ms 24192 KB Output is correct
74 Correct 164 ms 50796 KB Output is correct
75 Correct 196 ms 47864 KB Output is correct
76 Correct 21 ms 24832 KB Output is correct
77 Correct 19 ms 24832 KB Output is correct
78 Correct 141 ms 44016 KB Output is correct
79 Correct 92 ms 47344 KB Output is correct
80 Correct 19 ms 24824 KB Output is correct
81 Correct 23 ms 24832 KB Output is correct
82 Correct 19 ms 24192 KB Output is correct
83 Correct 16 ms 24192 KB Output is correct
84 Correct 18 ms 24832 KB Output is correct
85 Correct 138 ms 46712 KB Output is correct
86 Correct 19 ms 24824 KB Output is correct
87 Correct 139 ms 45504 KB Output is correct
88 Correct 17 ms 24192 KB Output is correct
89 Correct 147 ms 45688 KB Output is correct
90 Correct 143 ms 46584 KB Output is correct
91 Correct 114 ms 48268 KB Output is correct
92 Correct 118 ms 45168 KB Output is correct
93 Correct 21 ms 24832 KB Output is correct
94 Correct 18 ms 24184 KB Output is correct
95 Correct 104 ms 48364 KB Output is correct
96 Correct 134 ms 51448 KB Output is correct
97 Correct 19 ms 24832 KB Output is correct
98 Correct 17 ms 24192 KB Output is correct
99 Correct 111 ms 46956 KB Output is correct
100 Correct 19 ms 24832 KB Output is correct
101 Correct 138 ms 46020 KB Output is correct
102 Correct 116 ms 50300 KB Output is correct
103 Correct 18 ms 24832 KB Output is correct
104 Correct 19 ms 24960 KB Output is correct
105 Correct 19 ms 24832 KB Output is correct
106 Correct 19 ms 24832 KB Output is correct
107 Correct 18 ms 24832 KB Output is correct
108 Correct 738 ms 138236 KB Output is correct
109 Correct 982 ms 142384 KB Output is correct
110 Correct 1010 ms 151396 KB Output is correct
111 Correct 872 ms 164264 KB Output is correct
112 Correct 811 ms 156408 KB Output is correct
113 Correct 613 ms 145880 KB Output is correct
114 Correct 927 ms 128116 KB Output is correct
115 Correct 923 ms 128100 KB Output is correct
116 Correct 1189 ms 134476 KB Output is correct
117 Correct 784 ms 145996 KB Output is correct
118 Correct 972 ms 129664 KB Output is correct
119 Correct 787 ms 145892 KB Output is correct
120 Correct 854 ms 156912 KB Output is correct
121 Correct 800 ms 146076 KB Output is correct
122 Correct 1063 ms 139656 KB Output is correct
123 Correct 701 ms 147368 KB Output is correct
124 Correct 901 ms 143460 KB Output is correct