oj.uz

Submission #948830

# Submission time Handle Problem Language Result Execution time Memory
948830 2024-03-18T15:02:02 Z koukirocks Railway (BOI17_railway) C++17
100 / 100
 100 ms 28564 KB 
#include <bits/stdc++.h>
#define speed ios_base::sync_with_stdio(0); cin.tie(0)
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
 
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
const ll MAX=1e5+10,P=998244353;
const ll INF=0x3f3f3f3f,oo=0x3f3f3f3f3f3f3f3f;

int n,m,k;
vector<pii> G[MAX];
vector<int> sel[MAX];
int BIT[MAX*2];

void update(int x,int val) {
	while (x<MAX*2) {
		BIT[x]+=val;
		x+=(-x&x);
	}
}

int query(int x) {
	ll ans=0;
	while (x) {
		ans+=BIT[x];
		x-=(-x&x);
	}
	return ans;
}

int tme=1;
int in[MAX],out[MAX];
int up[MAX][20];
int dep[MAX];

void dfs(int v,int p) {
	dep[v]=dep[p]+1;
	up[v][0]=p;
	for (int i=1;i<20;i++) up[v][i]=up[up[v][i-1]][i-1];
	in[v]=tme++;
	for (auto [i,w]:G[v]) {
		if (i==p) continue;
		dfs(i,v);
	}
	out[v]=tme++;
}

int lca(int a,int b) {
	if (dep[a]<dep[b]) swap(a,b);
	int mv=dep[a]-dep[b];
	for (int i=0;i<20;i++) {
		if (mv&(1<<i)) a=up[a][i];
	}
	if (a==b) return a;
	for (int i=19;i>=0;i--) {
		if (up[a][i]!=up[b][i]) {
			a=up[a][i];
			b=up[b][i];
		}
	}
	return up[a][0];
}

void pth(int a,int b) {
	int ans=lca(a,b);
//	cout<<a<<" "<<b<<" "<<ans<<" abans\n"<<flush;
	update(in[a],1);
	update(in[b],1);
	update(in[ans],-2);
}

void dfs2(int v,int p,int id,vector<int>& ans) {
	if (v!=1 and query(out[v])-query(in[v]-1)>=2*k) ans.push_back(id);
	for (auto [i,w]:G[v]) {
		if (i==p) continue;
		dfs2(i,v,w,ans);
	}
}

int main() {
	speed;
	cin>>n>>m>>k;
	for (int i=1;i<n;i++) {
		int a,b;
		cin>>a>>b;
		G[a].emplace_back(b,i);
		G[b].emplace_back(a,i);
	}
	dep[1]=0;
	dfs(1,1);
//	for (int i=1;i<=n;i++) {
//		cout<<in[i]<<" "<<out[i]<<" inout\n";
//	}
	memset(BIT,0,sizeof(BIT));
	for (int i=1;i<=m;i++) {
//		cout<<i<<"\n"<<flush;
		int s;
		cin>>s;
		for (int j=0;j<s;j++) {
			int x;
			cin>>x;
			sel[i].push_back(x);
		}
		if (s<=1) continue;
		sort(all(sel[i]),[=](int a,int b) {
			return in[a]<in[b];
		});
		for (int j=0;j<s;j++) {
			pth(sel[i][j],sel[i][(j+1)%s]);
		}
//		for (int i=1;i<=n;i++) {
//			cout<<query(out[i])-query(in[i]-1)<<" ";
//		}
//		cout<<"\n";
	}
//	cout<<"sgfhfh\n"<<flush;
	vector<int> ans;
	dfs2(1,1,0,ans);
//	for (int i=1;i<=n;i++) {
//		cout<<query(out[i])-query(in[i]-1)<<" ";
//	}
//	cout<<"\n";
	cout<<ans.size()<<"\n";
	sort(all(ans));
	for (int i:ans) cout<<i<<" ";
	cout<<"\n";
	return 0;
}


/*
6 3 2
1 3
2 3
3 4
6 4
4 5
4 1 3 2 5
2 6 3
2 3 2
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 6 ms 10844 KB Output is correct
3 Correct 6 ms 10844 KB Output is correct
4 Correct 2 ms 10840 KB Output is correct
5 Correct 3 ms 10588 KB Output is correct
6 Correct 6 ms 11356 KB Output is correct
7 Correct 6 ms 11100 KB Output is correct
8 Correct 5 ms 11100 KB Output is correct
9 Correct 5 ms 11100 KB Output is correct
10 Correct 2 ms 10588 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 3 ms 10584 KB Output is correct
13 Correct 2 ms 10588 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 6 ms 10844 KB Output is correct
3 Correct 6 ms 10844 KB Output is correct
4 Correct 2 ms 10840 KB Output is correct
5 Correct 3 ms 10588 KB Output is correct
6 Correct 6 ms 11356 KB Output is correct
7 Correct 6 ms 11100 KB Output is correct
8 Correct 5 ms 11100 KB Output is correct
9 Correct 5 ms 11100 KB Output is correct
10 Correct 2 ms 10588 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 3 ms 10584 KB Output is correct
13 Correct 2 ms 10588 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 20 ms 11612 KB Output is correct
16 Correct 21 ms 11608 KB Output is correct
17 Correct 21 ms 11468 KB Output is correct
18 Correct 6 ms 11356 KB Output is correct
19 Correct 6 ms 11100 KB Output is correct
20 Correct 22 ms 11612 KB Output is correct
21 Correct 24 ms 11612 KB Output is correct
22 Correct 2 ms 10844 KB Output is correct
23 Correct 6 ms 10844 KB Output is correct
24 Correct 6 ms 10844 KB Output is correct
25 Correct 2 ms 10588 KB Output is correct
26 Correct 3 ms 10588 KB Output is correct
27 Correct 8 ms 11356 KB Output is correct
28 Correct 6 ms 11100 KB Output is correct
29 Correct 5 ms 11100 KB Output is correct
30 Correct 5 ms 11100 KB Output is correct
31 Correct 2 ms 10584 KB Output is correct
32 Correct 2 ms 10588 KB Output is correct
33 Correct 3 ms 10588 KB Output is correct
34 Correct 3 ms 10584 KB Output is correct
35 Correct 2 ms 10588 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 26568 KB Output is correct
2 Correct 3 ms 10584 KB Output is correct
3 Correct 71 ms 28104 KB Output is correct
4 Correct 62 ms 27480 KB Output is correct
5 Correct 78 ms 27840 KB Output is correct
6 Correct 67 ms 28104 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 23300 KB Output is correct
2 Correct 70 ms 22120 KB Output is correct
3 Correct 70 ms 21844 KB Output is correct
4 Correct 80 ms 21844 KB Output is correct
5 Correct 72 ms 21840 KB Output is correct
6 Correct 64 ms 25076 KB Output is correct
7 Correct 70 ms 24928 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 23300 KB Output is correct
2 Correct 70 ms 22120 KB Output is correct
3 Correct 70 ms 21844 KB Output is correct
4 Correct 80 ms 21844 KB Output is correct
5 Correct 72 ms 21840 KB Output is correct
6 Correct 64 ms 25076 KB Output is correct
7 Correct 70 ms 24928 KB Output is correct
8 Correct 76 ms 24560 KB Output is correct
9 Correct 71 ms 24424 KB Output is correct
10 Correct 61 ms 27496 KB Output is correct
11 Correct 62 ms 27352 KB Output is correct
12 Correct 49 ms 20404 KB Output is correct
13 Correct 72 ms 20388 KB Output is correct
14 Correct 69 ms 20824 KB Output is correct
15 Correct 73 ms 21080 KB Output is correct
16 Correct 90 ms 21840 KB Output is correct
17 Correct 82 ms 21844 KB Output is correct
18 Correct 77 ms 22100 KB Output is correct
19 Correct 72 ms 22096 KB Output is correct
20 Correct 64 ms 25192 KB Output is correct
21 Correct 64 ms 25476 KB Output is correct
22 Correct 68 ms 25352 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 6 ms 10844 KB Output is correct
3 Correct 6 ms 10844 KB Output is correct
4 Correct 2 ms 10840 KB Output is correct
5 Correct 3 ms 10588 KB Output is correct
6 Correct 6 ms 11356 KB Output is correct
7 Correct 6 ms 11100 KB Output is correct
8 Correct 5 ms 11100 KB Output is correct
9 Correct 5 ms 11100 KB Output is correct
10 Correct 2 ms 10588 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 3 ms 10584 KB Output is correct
13 Correct 2 ms 10588 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 20 ms 11612 KB Output is correct
16 Correct 21 ms 11608 KB Output is correct
17 Correct 21 ms 11468 KB Output is correct
18 Correct 6 ms 11356 KB Output is correct
19 Correct 6 ms 11100 KB Output is correct
20 Correct 22 ms 11612 KB Output is correct
21 Correct 24 ms 11612 KB Output is correct
22 Correct 2 ms 10844 KB Output is correct
23 Correct 6 ms 10844 KB Output is correct
24 Correct 6 ms 10844 KB Output is correct
25 Correct 2 ms 10588 KB Output is correct
26 Correct 3 ms 10588 KB Output is correct
27 Correct 8 ms 11356 KB Output is correct
28 Correct 6 ms 11100 KB Output is correct
29 Correct 5 ms 11100 KB Output is correct
30 Correct 5 ms 11100 KB Output is correct
31 Correct 2 ms 10584 KB Output is correct
32 Correct 2 ms 10588 KB Output is correct
33 Correct 3 ms 10588 KB Output is correct
34 Correct 3 ms 10584 KB Output is correct
35 Correct 2 ms 10588 KB Output is correct
36 Correct 70 ms 26568 KB Output is correct
37 Correct 3 ms 10584 KB Output is correct
38 Correct 71 ms 28104 KB Output is correct
39 Correct 62 ms 27480 KB Output is correct
40 Correct 78 ms 27840 KB Output is correct
41 Correct 67 ms 28104 KB Output is correct
42 Correct 67 ms 23300 KB Output is correct
43 Correct 70 ms 22120 KB Output is correct
44 Correct 70 ms 21844 KB Output is correct
45 Correct 80 ms 21844 KB Output is correct
46 Correct 72 ms 21840 KB Output is correct
47 Correct 64 ms 25076 KB Output is correct
48 Correct 70 ms 24928 KB Output is correct
49 Correct 76 ms 24560 KB Output is correct
50 Correct 71 ms 24424 KB Output is correct
51 Correct 61 ms 27496 KB Output is correct
52 Correct 62 ms 27352 KB Output is correct
53 Correct 49 ms 20404 KB Output is correct
54 Correct 72 ms 20388 KB Output is correct
55 Correct 69 ms 20824 KB Output is correct
56 Correct 73 ms 21080 KB Output is correct
57 Correct 90 ms 21840 KB Output is correct
58 Correct 82 ms 21844 KB Output is correct
59 Correct 77 ms 22100 KB Output is correct
60 Correct 72 ms 22096 KB Output is correct
61 Correct 64 ms 25192 KB Output is correct
62 Correct 64 ms 25476 KB Output is correct
63 Correct 68 ms 25352 KB Output is correct
64 Correct 89 ms 25168 KB Output is correct
65 Correct 76 ms 21840 KB Output is correct
66 Correct 74 ms 21080 KB Output is correct
67 Correct 86 ms 20896 KB Output is correct
68 Correct 46 ms 20308 KB Output is correct
69 Correct 48 ms 20308 KB Output is correct
70 Correct 67 ms 25496 KB Output is correct
71 Correct 65 ms 24400 KB Output is correct
72 Correct 2 ms 10588 KB Output is correct
73 Correct 7 ms 11096 KB Output is correct
74 Correct 7 ms 11100 KB Output is correct
75 Correct 2 ms 10656 KB Output is correct
76 Correct 2 ms 10588 KB Output is correct
77 Correct 6 ms 11356 KB Output is correct
78 Correct 6 ms 11100 KB Output is correct
79 Correct 5 ms 11100 KB Output is correct
80 Correct 5 ms 11100 KB Output is correct
81 Correct 2 ms 10660 KB Output is correct
82 Correct 2 ms 10652 KB Output is correct
83 Correct 2 ms 10588 KB Output is correct
84 Correct 2 ms 10652 KB Output is correct
85 Correct 2 ms 10588 KB Output is correct
86 Correct 21 ms 11984 KB Output is correct
87 Correct 21 ms 12124 KB Output is correct
88 Correct 21 ms 12152 KB Output is correct
89 Correct 7 ms 11356 KB Output is correct
90 Correct 6 ms 11100 KB Output is correct
91 Correct 22 ms 12244 KB Output is correct
92 Correct 28 ms 12120 KB Output is correct
93 Correct 2 ms 10584 KB Output is correct
94 Correct 68 ms 28564 KB Output is correct
95 Correct 69 ms 28252 KB Output is correct
96 Correct 65 ms 27556 KB Output is correct
97 Correct 65 ms 27708 KB Output is correct
98 Correct 68 ms 28104 KB Output is correct
99 Correct 75 ms 21840 KB Output is correct
100 Correct 72 ms 21840 KB Output is correct
101 Correct 100 ms 21844 KB Output is correct
102 Correct 71 ms 22268 KB Output is correct
103 Correct 64 ms 25104 KB Output is correct
104 Correct 64 ms 25304 KB Output is correct
105 Correct 67 ms 24836 KB Output is correct
106 Correct 66 ms 24656 KB Output is correct
107 Correct 65 ms 24400 KB Output is correct
108 Correct 62 ms 27348 KB Output is correct
109 Correct 74 ms 27352 KB Output is correct
110 Correct 67 ms 20668 KB Output is correct
111 Correct 50 ms 20560 KB Output is correct
112 Correct 70 ms 20824 KB Output is correct
113 Correct 72 ms 20992 KB Output is correct