oj.uz

Submission #955655

# Submission time Handle Problem Language Result Execution time Memory
955655 2024-03-31T09:15:54 Z Alexabcde1 Railway (BOI17_railway) C++14
100 / 100
 226 ms 70604 KB 
#include<bits/stdc++.h>
#define f first
#define s second
using namespace std;
long long n,m,k,aa,bb,cnt,ind[100005],t,timer,in[100005],out[100005],par[100005][50],psum[100005],vis[100005],vis2[100005];
vector<pair<long long,long long> > ve;
vector<long long> adj[100005];
map<pair<long long,long long>,long long> mp;
vector<long long> ans;
void dfs(long long x,long long pre){
	vis[x]=1;
	in[x]=timer; timer++;
	par[x][0]=pre;
	for (int i=1;i<=40;i++) par[x][i]=par[par[x][i-1]][i-1];
	cnt++;
	ind[x]=cnt;
	for (int ii=0;ii<adj[x].size();ii++){
		if (!vis[adj[x][ii]]) dfs(adj[x][ii],x);
	}
	out[x]=timer; timer++;
	return;
}
bool an(long long u,long long v){
	return in[u]<=in[v] && out[u]>=out[v];
}
long long lca(long long u,long long v){
	if (an(u,v)) return u;
	if (an(v,u)) return v;
	for (int i=39;i>=0;--i){
		if (!an(par[u][i],v)) u=par[u][i];
	}
	return par[u][0];
}
void dfs2(long long x,long long pre){
	vis2[x]=1;
	for (int i=0;i<adj[x].size();i++){
		if (vis2[adj[x][i]]) continue;
		dfs2(adj[x][i],x);
		psum[x]+=psum[adj[x][i]];
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin>>n>>m>>k;
	for (int i=1;i<n;i++){
		cin>>aa>>bb;
		mp[{aa,bb}]=i;
		mp[{bb,aa}]=i;
		adj[aa].push_back(bb);
		adj[bb].push_back(aa);
	}
	dfs(1,1);
	while (m--){
		cin>>t;
		ve.clear();
		for (int i=0;i<t;i++){
			long long tmp;
			cin>>tmp;
			ve.push_back({ind[tmp],tmp});
		}
		sort(ve.begin(),ve.end());
		for (int i=0;i<t;i++){
			long long u=ve[i].s;
			long long v=ve[(i+1)%ve.size()].s;
			long long lc=lca(u,v);
			psum[u]++; psum[v]++; psum[lc]-=2;
		}
	}
	dfs2(1,1);
	for (int i=1;i<=n;i++) {
		//cout<<psum[i]<<endl;
		if (psum[i]>=2*k){
			ans.push_back(mp[{i,par[i][0]}]);
		}
	}
	sort(ans.begin(),ans.end());
	cout<<ans.size()<<endl;
	for (int i=0;i<ans.size();i++){
		if (i==0) cout<<ans[i];
		else cout<<" "<<ans[i];
	}
	cout<<endl;
}

Compilation message

railway.cpp: In function 'void dfs(long long int, long long int)':
railway.cpp:17:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |  for (int ii=0;ii<adj[x].size();ii++){
      |                ~~^~~~~~~~~~~~~~
railway.cpp: In function 'void dfs2(long long int, long long int)':
railway.cpp:36:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |  for (int i=0;i<adj[x].size();i++){
      |               ~^~~~~~~~~~~~~~
railway.cpp: In function 'int main()':
railway.cpp:79:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |  for (int i=0;i<ans.size();i++){
      |               ~^~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 11 ms 14684 KB Output is correct
3 Correct 11 ms 14684 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 12 ms 14940 KB Output is correct
7 Correct 13 ms 14684 KB Output is correct
8 Correct 12 ms 14936 KB Output is correct
9 Correct 10 ms 14784 KB Output is correct
10 Correct 2 ms 8796 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 2 ms 8796 KB Output is correct
14 Correct 2 ms 9048 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 11 ms 14684 KB Output is correct
3 Correct 11 ms 14684 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 12 ms 14940 KB Output is correct
7 Correct 13 ms 14684 KB Output is correct
8 Correct 12 ms 14936 KB Output is correct
9 Correct 10 ms 14784 KB Output is correct
10 Correct 2 ms 8796 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 2 ms 8796 KB Output is correct
14 Correct 2 ms 9048 KB Output is correct
15 Correct 34 ms 15112 KB Output is correct
16 Correct 33 ms 15196 KB Output is correct
17 Correct 35 ms 15216 KB Output is correct
18 Correct 11 ms 14940 KB Output is correct
19 Correct 11 ms 14684 KB Output is correct
20 Correct 42 ms 15188 KB Output is correct
21 Correct 43 ms 15188 KB Output is correct
22 Correct 2 ms 8792 KB Output is correct
23 Correct 11 ms 14684 KB Output is correct
24 Correct 11 ms 14756 KB Output is correct
25 Correct 2 ms 8796 KB Output is correct
26 Correct 2 ms 8796 KB Output is correct
27 Correct 11 ms 15024 KB Output is correct
28 Correct 11 ms 14684 KB Output is correct
29 Correct 10 ms 14660 KB Output is correct
30 Correct 11 ms 14684 KB Output is correct
31 Correct 2 ms 8796 KB Output is correct
32 Correct 2 ms 8792 KB Output is correct
33 Correct 2 ms 8796 KB Output is correct
34 Correct 2 ms 8796 KB Output is correct
35 Correct 1 ms 8796 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 69792 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 115 ms 69400 KB Output is correct
4 Correct 106 ms 68772 KB Output is correct
5 Correct 121 ms 69832 KB Output is correct
6 Correct 147 ms 70264 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 66936 KB Output is correct
2 Correct 184 ms 65096 KB Output is correct
3 Correct 194 ms 64484 KB Output is correct
4 Correct 215 ms 64444 KB Output is correct
5 Correct 189 ms 64592 KB Output is correct
6 Correct 172 ms 67204 KB Output is correct
7 Correct 154 ms 66896 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 66936 KB Output is correct
2 Correct 184 ms 65096 KB Output is correct
3 Correct 194 ms 64484 KB Output is correct
4 Correct 215 ms 64444 KB Output is correct
5 Correct 189 ms 64592 KB Output is correct
6 Correct 172 ms 67204 KB Output is correct
7 Correct 154 ms 66896 KB Output is correct
8 Correct 191 ms 67044 KB Output is correct
9 Correct 185 ms 67300 KB Output is correct
10 Correct 154 ms 70048 KB Output is correct
11 Correct 124 ms 70088 KB Output is correct
12 Correct 166 ms 64296 KB Output is correct
13 Correct 167 ms 64372 KB Output is correct
14 Correct 186 ms 64340 KB Output is correct
15 Correct 183 ms 64596 KB Output is correct
16 Correct 192 ms 64596 KB Output is correct
17 Correct 198 ms 64532 KB Output is correct
18 Correct 189 ms 64532 KB Output is correct
19 Correct 180 ms 64848 KB Output is correct
20 Correct 161 ms 67236 KB Output is correct
21 Correct 163 ms 67488 KB Output is correct
22 Correct 165 ms 67392 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 11 ms 14684 KB Output is correct
3 Correct 11 ms 14684 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 12 ms 14940 KB Output is correct
7 Correct 13 ms 14684 KB Output is correct
8 Correct 12 ms 14936 KB Output is correct
9 Correct 10 ms 14784 KB Output is correct
10 Correct 2 ms 8796 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 2 ms 8796 KB Output is correct
14 Correct 2 ms 9048 KB Output is correct
15 Correct 34 ms 15112 KB Output is correct
16 Correct 33 ms 15196 KB Output is correct
17 Correct 35 ms 15216 KB Output is correct
18 Correct 11 ms 14940 KB Output is correct
19 Correct 11 ms 14684 KB Output is correct
20 Correct 42 ms 15188 KB Output is correct
21 Correct 43 ms 15188 KB Output is correct
22 Correct 2 ms 8792 KB Output is correct
23 Correct 11 ms 14684 KB Output is correct
24 Correct 11 ms 14756 KB Output is correct
25 Correct 2 ms 8796 KB Output is correct
26 Correct 2 ms 8796 KB Output is correct
27 Correct 11 ms 15024 KB Output is correct
28 Correct 11 ms 14684 KB Output is correct
29 Correct 10 ms 14660 KB Output is correct
30 Correct 11 ms 14684 KB Output is correct
31 Correct 2 ms 8796 KB Output is correct
32 Correct 2 ms 8792 KB Output is correct
33 Correct 2 ms 8796 KB Output is correct
34 Correct 2 ms 8796 KB Output is correct
35 Correct 1 ms 8796 KB Output is correct
36 Correct 133 ms 69792 KB Output is correct
37 Correct 2 ms 8796 KB Output is correct
38 Correct 115 ms 69400 KB Output is correct
39 Correct 106 ms 68772 KB Output is correct
40 Correct 121 ms 69832 KB Output is correct
41 Correct 147 ms 70264 KB Output is correct
42 Correct 158 ms 66936 KB Output is correct
43 Correct 184 ms 65096 KB Output is correct
44 Correct 194 ms 64484 KB Output is correct
45 Correct 215 ms 64444 KB Output is correct
46 Correct 189 ms 64592 KB Output is correct
47 Correct 172 ms 67204 KB Output is correct
48 Correct 154 ms 66896 KB Output is correct
49 Correct 191 ms 67044 KB Output is correct
50 Correct 185 ms 67300 KB Output is correct
51 Correct 154 ms 70048 KB Output is correct
52 Correct 124 ms 70088 KB Output is correct
53 Correct 166 ms 64296 KB Output is correct
54 Correct 167 ms 64372 KB Output is correct
55 Correct 186 ms 64340 KB Output is correct
56 Correct 183 ms 64596 KB Output is correct
57 Correct 192 ms 64596 KB Output is correct
58 Correct 198 ms 64532 KB Output is correct
59 Correct 189 ms 64532 KB Output is correct
60 Correct 180 ms 64848 KB Output is correct
61 Correct 161 ms 67236 KB Output is correct
62 Correct 163 ms 67488 KB Output is correct
63 Correct 165 ms 67392 KB Output is correct
64 Correct 186 ms 67272 KB Output is correct
65 Correct 212 ms 64596 KB Output is correct
66 Correct 210 ms 64592 KB Output is correct
67 Correct 197 ms 64408 KB Output is correct
68 Correct 151 ms 64340 KB Output is correct
69 Correct 169 ms 64332 KB Output is correct
70 Correct 176 ms 67536 KB Output is correct
71 Correct 179 ms 66752 KB Output is correct
72 Correct 1 ms 8792 KB Output is correct
73 Correct 11 ms 14680 KB Output is correct
74 Correct 11 ms 14684 KB Output is correct
75 Correct 2 ms 8620 KB Output is correct
76 Correct 2 ms 8796 KB Output is correct
77 Correct 11 ms 14940 KB Output is correct
78 Correct 11 ms 14824 KB Output is correct
79 Correct 11 ms 14680 KB Output is correct
80 Correct 10 ms 14684 KB Output is correct
81 Correct 2 ms 8796 KB Output is correct
82 Correct 2 ms 8792 KB Output is correct
83 Correct 2 ms 8796 KB Output is correct
84 Correct 2 ms 8796 KB Output is correct
85 Correct 2 ms 8792 KB Output is correct
86 Correct 30 ms 14936 KB Output is correct
87 Correct 32 ms 15184 KB Output is correct
88 Correct 33 ms 15196 KB Output is correct
89 Correct 12 ms 14940 KB Output is correct
90 Correct 11 ms 14768 KB Output is correct
91 Correct 45 ms 15212 KB Output is correct
92 Correct 45 ms 15188 KB Output is correct
93 Correct 2 ms 8796 KB Output is correct
94 Correct 121 ms 69884 KB Output is correct
95 Correct 113 ms 69460 KB Output is correct
96 Correct 104 ms 68568 KB Output is correct
97 Correct 122 ms 70028 KB Output is correct
98 Correct 124 ms 70604 KB Output is correct
99 Correct 210 ms 64680 KB Output is correct
100 Correct 226 ms 64444 KB Output is correct
101 Correct 190 ms 64592 KB Output is correct
102 Correct 186 ms 64852 KB Output is correct
103 Correct 167 ms 66896 KB Output is correct
104 Correct 184 ms 67392 KB Output is correct
105 Correct 155 ms 66892 KB Output is correct
106 Correct 187 ms 67272 KB Output is correct
107 Correct 200 ms 67008 KB Output is correct
108 Correct 124 ms 70020 KB Output is correct
109 Correct 123 ms 70088 KB Output is correct
110 Correct 187 ms 64476 KB Output is correct
111 Correct 154 ms 64364 KB Output is correct
112 Correct 180 ms 64592 KB Output is correct
113 Correct 193 ms 64848 KB Output is correct