oj.uz

Submission #345502

# Submission time Handle Problem Language Result Execution time Memory
345502 2021-01-07T13:39:36 Z Samboor Capital City (JOI20_capital_city) C++17
100 / 100
 847 ms 72300 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define st first
#define nd second
#define FOR(__VAR, __START, __END) for(int __VAR=__START; __VAR<=__END; __VAR++)
#define FORB(__VAR, __START, __END) for(int __VAR=__START; __VAR>=__END; __VAR--)
#define FORK(__VAR, __START, __END, __DIFF) for(int __VAR=__START; __VAR<=END; __VAR+=__DIFF)
#define all(__VAR) (__VAR).begin(), (__VAR).end()
#define rall(__VAR) (__VAR).rbegin(), (__VAR).rend()
#define DEBUG(__VAR) cout << #__VAR << ": " << __VAR << endl;

template<typename __T1, typename __T2>
ostream & operator<<(ostream &out, pair<__T1, __T2> &__VAR)
{
	cout << "[" << __VAR.st << ", " << __VAR.nd << "]";
	return out;
}

template<typename __T>
ostream & operator<<(ostream &out, vector<__T> &__VAR)
{
	cout << "[";
	FOR(i, 0, (int)__VAR.size()-2)
		cout << __VAR[i] << ", ";
	if(__VAR.size()>0)
		cout << __VAR[__VAR.size()-1];
	cout << "]" << endl;
	
	return out;
}

const int INF=1e9, LOG=20;

int n, k;
vector<int> color;
vector<int> colorLca;
vector<pii> preOrder;
vector<int> depth;
vector<vector<int>> tree, g;
vector<vector<int>> ancestor;
vector<vector<int>> colorInd;
vector<bool> vis;

void dfs1(int cur) {
	static int nextInd=0;
	preOrder[cur].st=preOrder[cur].nd=nextInd++;
	colorInd[color[cur]].pb(preOrder[cur].st);
	vis[cur]=true;
	for(int v:tree[cur])
		if(!vis[v]) {
			ancestor[v][0]=cur;
			depth[v]=depth[cur]+1;
			dfs1(v);
			preOrder[cur].nd=preOrder[v].nd;
		}
}

int lca(int a, int b) {
	if(depth[a]<depth[b])
		swap(a,b);
	int diff=depth[a]-depth[b];
	for(int i=LOG-1; i>=0; i--)
		if((1<<i)<=diff) {
			diff-=1<<i;
			a=ancestor[a][i];
		}
	if(a==b)
		return a;
	for(int i=LOG-1; i>=0; i--)
		if(ancestor[a][i]!=ancestor[b][i]) {
			a=ancestor[a][i];
			b=ancestor[b][i];
		}
	return ancestor[a][0]; 
}

vector<int> comp;
stack<int> s;
vector<vector<int>> ig;
void dfs2(int cur) {
	vis[cur]=true;
	for(int v:g[cur])
		if(!vis[v])
			dfs2(v);
	s.push(cur);
}

void dfs3(int ind, int cur) {
	vis[cur]=true;
	comp[cur]=ind;
	for(int v:ig[cur])
		if(!vis[v])
			dfs3(ind, v);
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	cin >> n >> k;
	tree.resize(n);
	color.resize(n);
	preOrder.resize(n);
	colorLca.resize(k);
	colorInd.resize(k);
	g.resize(k);
	vis.resize(n,0);
	depth.resize(n,1);
	ancestor.resize(n, vector<int>(LOG,0));
	for(int i=0; i<n-1; i++) {
		int a,b;
		cin >> a >> b;
		a--,b--;
		tree[a].pb(b);
		tree[b].pb(a);
	}
	for(int i=0; i<n; i++) {
		cin >> color[i];
		color[i]--;
	}
	dfs1(0);
	for(int i=1; i<LOG; i++)
		for(int v=0; v<n; v++)
			ancestor[v][i]=ancestor[ancestor[v][i-1]][i-1];
	for(int i=0; i<k; i++)
		sort(colorInd[i].begin(), colorInd[i].end());
	for(int i=0; i<n; i++)
		colorLca[color[i]]=i;
	for(int i=0; i<n; i++)
		colorLca[color[i]]=lca(colorLca[color[i]], i);
	for(int i=0; i<n; i++) {
		int c=color[i];
		if(depth[colorLca[c]]<depth[i])
			g[c].pb(color[ancestor[i][0]]);
		for(int v:tree[i])
			if(preOrder[v].st>preOrder[i].st) {
				auto it=lower_bound(colorInd[c].begin(), colorInd[c].end(), preOrder[v].st);
				if(it!=colorInd[c].end() && (*it)<=preOrder[v].nd)
					g[c].pb(color[v]);
			}
	}
	comp.resize(k,0);
	vis.resize(k);
	fill(vis.begin(), vis.end(), false);
	for(int i=0; i<k; i++)
		if(!vis[i])
			dfs2(i);
	ig.resize(k);
	for(int i=0; i<k; i++)
		for(int j:g[i])
			ig[j].pb(i);
	int nextInd=0;
	fill(vis.begin(), vis.end(), false);
	while(!s.empty()) {
		int cur=s.top();
		s.pop();
		if(vis[cur])
			continue;
		dfs3(nextInd++, cur);
	}
	vector<int> compSize(nextInd,0);
	vector<bool> valid(nextInd,1);
	for(int i=0; i<k; i++)
		compSize[comp[i]]++;
	for(int i=0; i<k; i++)
		for(int j:g[i])
			if(comp[i]!=comp[j])
				valid[comp[i]]=0;
	int result=INF;
	for(int i=0; i<nextInd; i++)
		if(valid[i])
			result=min(result, compSize[i]);
	cout << result-1 << '\n';
	return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 3 ms 748 KB Output is correct
12 Correct 3 ms 748 KB Output is correct
13 Correct 3 ms 896 KB Output is correct
14 Correct 4 ms 876 KB Output is correct
15 Correct 3 ms 876 KB Output is correct
16 Correct 3 ms 876 KB Output is correct
17 Correct 3 ms 876 KB Output is correct
18 Correct 3 ms 872 KB Output is correct
19 Correct 4 ms 876 KB Output is correct
20 Correct 3 ms 876 KB Output is correct
21 Correct 3 ms 876 KB Output is correct
22 Correct 3 ms 1044 KB Output is correct
23 Correct 4 ms 1004 KB Output is correct
24 Correct 3 ms 1004 KB Output is correct
25 Correct 3 ms 876 KB Output is correct
26 Correct 3 ms 1004 KB Output is correct
27 Correct 3 ms 1004 KB Output is correct
28 Correct 3 ms 896 KB Output is correct
29 Correct 4 ms 876 KB Output is correct
30 Correct 3 ms 876 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 847 ms 71744 KB Output is correct
2 Correct 226 ms 72244 KB Output is correct
3 Correct 776 ms 71532 KB Output is correct
4 Correct 220 ms 72172 KB Output is correct
5 Correct 769 ms 68176 KB Output is correct
6 Correct 232 ms 72044 KB Output is correct
7 Correct 745 ms 67696 KB Output is correct
8 Correct 225 ms 69868 KB Output is correct
9 Correct 543 ms 61868 KB Output is correct
10 Correct 595 ms 59632 KB Output is correct
11 Correct 552 ms 61944 KB Output is correct
12 Correct 562 ms 64108 KB Output is correct
13 Correct 568 ms 59428 KB Output is correct
14 Correct 568 ms 64236 KB Output is correct
15 Correct 583 ms 64252 KB Output is correct
16 Correct 548 ms 60140 KB Output is correct
17 Correct 580 ms 60780 KB Output is correct
18 Correct 560 ms 60764 KB Output is correct
19 Correct 565 ms 63308 KB Output is correct
20 Correct 608 ms 64880 KB Output is correct
21 Correct 1 ms 364 KB Output is correct

Subtask #4
59.0 / 59.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 3 ms 748 KB Output is correct
12 Correct 3 ms 748 KB Output is correct
13 Correct 3 ms 896 KB Output is correct
14 Correct 4 ms 876 KB Output is correct
15 Correct 3 ms 876 KB Output is correct
16 Correct 3 ms 876 KB Output is correct
17 Correct 3 ms 876 KB Output is correct
18 Correct 3 ms 872 KB Output is correct
19 Correct 4 ms 876 KB Output is correct
20 Correct 3 ms 876 KB Output is correct
21 Correct 3 ms 876 KB Output is correct
22 Correct 3 ms 1044 KB Output is correct
23 Correct 4 ms 1004 KB Output is correct
24 Correct 3 ms 1004 KB Output is correct
25 Correct 3 ms 876 KB Output is correct
26 Correct 3 ms 1004 KB Output is correct
27 Correct 3 ms 1004 KB Output is correct
28 Correct 3 ms 896 KB Output is correct
29 Correct 4 ms 876 KB Output is correct
30 Correct 3 ms 876 KB Output is correct
31 Correct 847 ms 71744 KB Output is correct
32 Correct 226 ms 72244 KB Output is correct
33 Correct 776 ms 71532 KB Output is correct
34 Correct 220 ms 72172 KB Output is correct
35 Correct 769 ms 68176 KB Output is correct
36 Correct 232 ms 72044 KB Output is correct
37 Correct 745 ms 67696 KB Output is correct
38 Correct 225 ms 69868 KB Output is correct
39 Correct 543 ms 61868 KB Output is correct
40 Correct 595 ms 59632 KB Output is correct
41 Correct 552 ms 61944 KB Output is correct
42 Correct 562 ms 64108 KB Output is correct
43 Correct 568 ms 59428 KB Output is correct
44 Correct 568 ms 64236 KB Output is correct
45 Correct 583 ms 64252 KB Output is correct
46 Correct 548 ms 60140 KB Output is correct
47 Correct 580 ms 60780 KB Output is correct
48 Correct 560 ms 60764 KB Output is correct
49 Correct 565 ms 63308 KB Output is correct
50 Correct 608 ms 64880 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 465 ms 48364 KB Output is correct
53 Correct 426 ms 48188 KB Output is correct
54 Correct 417 ms 48236 KB Output is correct
55 Correct 426 ms 48284 KB Output is correct
56 Correct 421 ms 48272 KB Output is correct
57 Correct 446 ms 48312 KB Output is correct
58 Correct 627 ms 57196 KB Output is correct
59 Correct 539 ms 57708 KB Output is correct
60 Correct 674 ms 58220 KB Output is correct
61 Correct 631 ms 57964 KB Output is correct
62 Correct 264 ms 72172 KB Output is correct
63 Correct 222 ms 72300 KB Output is correct
64 Correct 226 ms 70504 KB Output is correct
65 Correct 217 ms 72044 KB Output is correct
66 Correct 502 ms 59016 KB Output is correct
67 Correct 489 ms 58888 KB Output is correct
68 Correct 539 ms 58980 KB Output is correct
69 Correct 536 ms 58980 KB Output is correct
70 Correct 463 ms 58852 KB Output is correct
71 Correct 484 ms 58884 KB Output is correct
72 Correct 470 ms 58848 KB Output is correct
73 Correct 505 ms 58284 KB Output is correct
74 Correct 497 ms 59108 KB Output is correct
75 Correct 488 ms 59004 KB Output is correct
76 Correct 491 ms 64292 KB Output is correct
77 Correct 553 ms 62828 KB Output is correct
78 Correct 551 ms 61032 KB Output is correct
79 Correct 539 ms 58988 KB Output is correct
80 Correct 564 ms 64612 KB Output is correct
81 Correct 558 ms 61728 KB Output is correct
82 Correct 567 ms 62128 KB Output is correct
83 Correct 535 ms 59272 KB Output is correct
84 Correct 589 ms 64076 KB Output is correct
85 Correct 570 ms 62836 KB Output is correct
86 Correct 531 ms 58988 KB Output is correct
87 Correct 575 ms 60340 KB Output is correct
88 Correct 556 ms 61188 KB Output is correct
89 Correct 606 ms 57656 KB Output is correct
90 Correct 539 ms 57576 KB Output is correct
91 Correct 569 ms 59724 KB Output is correct
92 Correct 585 ms 58860 KB Output is correct
93 Correct 551 ms 58092 KB Output is correct
94 Correct 571 ms 57836 KB Output is correct
95 Correct 581 ms 58732 KB Output is correct
96 Correct 560 ms 58092 KB Output is correct
97 Correct 584 ms 59500 KB Output is correct