oj.uz

답안 #595765

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
595765 2022-07-14T06:17:26 Z penguinhacker 수도 (JOI20_capital_city) C++17
11 / 100
 1711 ms 524288 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define ar array
 
const int mxN=2e5;
int n, k, c[mxN], d[mxN], anc[mxN][18], tin[mxN], t, who[19*mxN], cnt[19*mxN], st[11000000], stind;
vector<int> oc[mxN], adj1[mxN], adj2[mxN], adj3[19*mxN];
bitset<19*mxN> vis, out;

void dfs1(int u=0) {
	tin[u]=t++;
	for (int i=1; i<18; ++i)
		anc[u][i]=anc[anc[u][i-1]][i-1];
	for (int v : adj1[u])
		if (v!=anc[u][0]) {
			d[v]=d[u]+1, anc[v][0]=u;
			dfs1(v);
		}
}
 
int lca(int u, int v) {
	if (d[u]>d[v])
		swap(u, v);
	for (int i=17; ~i; --i)
		if (d[v]-(1<<i)>=d[u])
			v=anc[v][i];
	if (u==v)
		return u;
	for (int i=17; ~i; --i)
		if (anc[u][i]!=anc[v][i])
			u=anc[u][i], v=anc[v][i];
	return anc[u][0];
}
 
void dfs2(int u) {
	vis[u]=1;
	if (u<k) {
		for (int v : adj2[u])
			if (!vis[v])
				dfs2(v);
	} else if (u<k+n) {
		if (!vis[c[u-k]])
			dfs2(c[u-k]);
	} else {
		int x=(u-k)%n, l=(u-k)/n;
		if (!vis[u-n])
			dfs2(u-n);
		x=anc[x][l-1];
		if (!vis[k+(l-1)*n+x])
			dfs2(k+(l-1)*n+x);
	}
	st[stind++]=u;
}

int rt;

void dfs3(int u) {
	vis[u]=0, who[u]=rt;
	cnt[rt]+=u<k;
	for (int v : adj3[u])
		if (vis[v])
			dfs3(v);
	if (u>=k&&u+n<k+18*n&&vis[u+n])
		dfs3(u+n);
}
 
void ae(int u, int v) {
	if (u<k)
		adj2[u].push_back(v);
	++cnt[v];
	st[stind++]=u;
	st[stind++]=v;
	//adj3[v].push_back(u);
}
 
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> k;
	for (int i=1; i<n; ++i) {
		int u, v;
		cin >> u >> v, --u, --v;
		adj1[u].push_back(v);
		adj1[v].push_back(u);
	}
	for (int i=0; i<n; ++i) {
		cin >> c[i], --c[i];
		oc[c[i]].push_back(i);
	}
	dfs1();
	for (int i=0; i<n; ++i)
		vector<int>().swap(adj1[i]);
	//st.reserve();
	for (int i=0; i<k; ++i) {
		sort(oc[i].begin(), oc[i].end(), [&](int a, int b) { return tin[a]<tin[b]; } );
		for (int j=1; j<oc[i].size(); ++j) {
			int u=oc[i][j-1], v=oc[i][j];
			int uv=lca(u, v);
			ae(i, uv+k);
			for (int rep=0; rep<2; ++rep) {
				for (int j=17; ~j; --j)
					if (d[u]-(1<<j)>=d[uv]) {
						ae(i, j*n+u+k);
						u=anc[u][j];
					}
				swap(u, v);
			}
		}
		vector<int>().swap(oc[i]);
	}
	for (int i=0; i<n; ++i) {
		ae(i+k, c[i]);
		for (int j=1; j<18; ++j) {
			//ae(j*n+i+k, (j-1)*n+i+k);
			ae(j*n+i+k, (j-1)*n+anc[i][j-1]+k);
		}
	}
	for (int i=0; i<k+18*n; ++i) {
		adj3[i].reserve(cnt[i]);
		cnt[i]=0;
	}
	for (; stind; stind-=2)
		adj3[st[stind-1]].push_back(st[stind-2]);
	assert(stind==0);
	for (int i=0; i<k+18*n; ++i)
		if (!vis[i])
			dfs2(i);
	for (int i=0; i<k+18*n; ++i)
		vector<int>().swap(adj2[i]);
	for (int i=stind-1; ~i; --i)
		if (vis[st[i]])
			rt=st[i], dfs3(st[i]);
	for (int i=0; i<k+18*n; ++i)
		for (int j : adj3[i])
			if (who[i]!=who[j])
				out[who[j]]=1;
	int ans=69696969;
	for (int i=0; i<k; ++i)
		if (!out[who[i]])
			ans=min(ans, cnt[who[i]]-1);
	cout << ans;
	return 0;
}

Compilation message

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

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 103664 KB Output is correct
2 Correct 49 ms 103672 KB Output is correct
3 Correct 49 ms 103640 KB Output is correct
4 Correct 48 ms 103632 KB Output is correct
5 Correct 48 ms 103636 KB Output is correct
6 Correct 48 ms 103632 KB Output is correct
7 Correct 60 ms 103792 KB Output is correct
8 Correct 52 ms 103700 KB Output is correct
9 Correct 50 ms 103652 KB Output is correct
10 Correct 48 ms 103684 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 103664 KB Output is correct
2 Correct 49 ms 103672 KB Output is correct
3 Correct 49 ms 103640 KB Output is correct
4 Correct 48 ms 103632 KB Output is correct
5 Correct 48 ms 103636 KB Output is correct
6 Correct 48 ms 103632 KB Output is correct
7 Correct 60 ms 103792 KB Output is correct
8 Correct 52 ms 103700 KB Output is correct
9 Correct 50 ms 103652 KB Output is correct
10 Correct 48 ms 103684 KB Output is correct
11 Correct 51 ms 104780 KB Output is correct
12 Correct 54 ms 104808 KB Output is correct
13 Correct 58 ms 104928 KB Output is correct
14 Correct 55 ms 104828 KB Output is correct
15 Correct 52 ms 104928 KB Output is correct
16 Correct 53 ms 104764 KB Output is correct
17 Correct 53 ms 104952 KB Output is correct
18 Correct 67 ms 104932 KB Output is correct
19 Correct 55 ms 104928 KB Output is correct
20 Correct 65 ms 104904 KB Output is correct
21 Correct 55 ms 104920 KB Output is correct
22 Correct 53 ms 105436 KB Output is correct
23 Correct 53 ms 105664 KB Output is correct
24 Correct 50 ms 105032 KB Output is correct
25 Correct 55 ms 105256 KB Output is correct
26 Correct 62 ms 105256 KB Output is correct
27 Correct 55 ms 105192 KB Output is correct
28 Correct 52 ms 105124 KB Output is correct
29 Correct 54 ms 104984 KB Output is correct
30 Correct 55 ms 105044 KB Output is correct

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1711 ms 524288 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 59.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 103664 KB Output is correct
2 Correct 49 ms 103672 KB Output is correct
3 Correct 49 ms 103640 KB Output is correct
4 Correct 48 ms 103632 KB Output is correct
5 Correct 48 ms 103636 KB Output is correct
6 Correct 48 ms 103632 KB Output is correct
7 Correct 60 ms 103792 KB Output is correct
8 Correct 52 ms 103700 KB Output is correct
9 Correct 50 ms 103652 KB Output is correct
10 Correct 48 ms 103684 KB Output is correct
11 Correct 51 ms 104780 KB Output is correct
12 Correct 54 ms 104808 KB Output is correct
13 Correct 58 ms 104928 KB Output is correct
14 Correct 55 ms 104828 KB Output is correct
15 Correct 52 ms 104928 KB Output is correct
16 Correct 53 ms 104764 KB Output is correct
17 Correct 53 ms 104952 KB Output is correct
18 Correct 67 ms 104932 KB Output is correct
19 Correct 55 ms 104928 KB Output is correct
20 Correct 65 ms 104904 KB Output is correct
21 Correct 55 ms 104920 KB Output is correct
22 Correct 53 ms 105436 KB Output is correct
23 Correct 53 ms 105664 KB Output is correct
24 Correct 50 ms 105032 KB Output is correct
25 Correct 55 ms 105256 KB Output is correct
26 Correct 62 ms 105256 KB Output is correct
27 Correct 55 ms 105192 KB Output is correct
28 Correct 52 ms 105124 KB Output is correct
29 Correct 54 ms 104984 KB Output is correct
30 Correct 55 ms 105044 KB Output is correct
31 Runtime error 1711 ms 524288 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -