oj.uz

Submission #169950

# Submission time Handle Problem Language Result Execution time Memory
169950 2019-12-23T11:03:46 Z moonrabbit2 Railway (BOI17_railway) C++17
100 / 100
 322 ms 24048 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<db,db> pdb;
typedef tuple<int,int,int> tii;
typedef tuple<ll,ll,ll> tll;
typedef vector<vector<ll>> mat;
const ll mod=1e9+7;
const int N=1e5+5;
int n,q,k;
int in[N],out[N],rev[N],cur,h[N],p[18][N],ep[N],s[N];
int tree[4*N];
vector<pii> g[N];
vector<int> ans;
void upd(int nd,int l,int r,int x,int v){
	if(l==r){
		tree[nd]=v;
		return;
	}
	int m=(l+r)>>1;
	if(x<=m) upd(nd<<1,l,m,x,v);
	else upd(nd<<1|1,m+1,r,x,v);
	tree[nd]=min(tree[nd<<1],tree[nd<<1|1]);
}
int qry(int nd,int l,int r,int s,int e){
	if(r<s||e<l) return 1e9;
	if(s<=l&&r<=e) return tree[nd];
	int m=(l+r)>>1;
	return min(qry(nd<<1,l,m,s,e),qry(nd<<1|1,m+1,r,s,e));
}
void dfs(int u){
	in[u]=++cur; rev[in[u]]=u;
	for(auto &it : g[u]) if(it.fi!=p[0][u]){
		p[0][it.fi]=u;
		ep[it.fi]=it.se;
		h[it.fi]=h[u]+1;
		dfs(it.fi);
	}
	out[u]=cur;
}
int lca(int u,int v){
	if(h[u]>h[v]) swap(u,v);
	int d=h[v]-h[u];
	for(int bit=17;bit>=0;bit--) if(d&(1<<bit)) v=p[bit][v];
	if(u==v) return u;
	for(int bit=17;bit>=0;bit--) if(p[bit][u]!=p[bit][v]){
		u=p[bit][u]; v=p[bit][v];
	}
	return p[0][u];
}
void dfs2(int u){
	upd(1,1,n,in[u],1e9);
	while(qry(1,1,n,in[u],out[u])!=1e9){
		int v=rev[qry(1,1,n,in[u],out[u])];
		s[v]++; s[u]--;
		dfs2(v);
	}
}
void dfs3(int u){
	for(auto &it : g[u]) if(it.fi!=p[0][u]){
		dfs3(it.fi);
		s[u]+=s[it.fi];
	}
	if(s[u]>=k) ans.emplace_back(ep[u]);
}
int main(){
    ios::sync_with_stdio(false); cin.tie(0);
    cin>>n>>q>>k;
	for(int u,v,i=1;i<n;i++){
		cin>>u>>v;
		g[u].emplace_back(v,i);
		g[v].emplace_back(u,i);
	}
	dfs(1);
	for(int bit=1;bit<18;bit++) for(int i=1;i<=n;i++) p[bit][i]=p[bit-1][p[bit-1][i]];
	for(int i=1;i<=n;i++) upd(1,1,n,i,1e9);
	for(int s,i=1;i<=q;i++){
		vector<int> vec;
		cin>>s;
		int u=-1;
		for(int v,j=1;j<=s;j++){
			cin>>v;
			vec.emplace_back(in[v]);
			if(u==-1) u=v;
			u=lca(u,v);
		}
		sort(vec.begin(),vec.end());
		for(auto &it : vec) upd(1,1,n,it,it);
		for(int j=1;j<vec.size();j++){
			int uv=lca(rev[vec[j-1]],rev[vec[j]]);
			upd(1,1,n,in[uv],in[uv]);
		}
		dfs2(u);
	}
	dfs3(1);
	sort(ans.begin(),ans.end());
	cout<<ans.size()<<"\n";
	for(auto &it : ans) cout<<it<<" ";
    return 0;
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:94:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j=1;j<vec.size();j++){
               ~^~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2936 KB Output is correct
2 Correct 12 ms 4344 KB Output is correct
3 Correct 12 ms 4344 KB Output is correct
4 Correct 4 ms 2808 KB Output is correct
5 Correct 4 ms 2808 KB Output is correct
6 Correct 13 ms 4600 KB Output is correct
7 Correct 13 ms 4344 KB Output is correct
8 Correct 11 ms 4344 KB Output is correct
9 Correct 11 ms 4344 KB Output is correct
10 Correct 5 ms 2808 KB Output is correct
11 Correct 4 ms 2808 KB Output is correct
12 Correct 4 ms 2808 KB Output is correct
13 Correct 4 ms 2808 KB Output is correct
14 Correct 4 ms 2808 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2936 KB Output is correct
2 Correct 12 ms 4344 KB Output is correct
3 Correct 12 ms 4344 KB Output is correct
4 Correct 4 ms 2808 KB Output is correct
5 Correct 4 ms 2808 KB Output is correct
6 Correct 13 ms 4600 KB Output is correct
7 Correct 13 ms 4344 KB Output is correct
8 Correct 11 ms 4344 KB Output is correct
9 Correct 11 ms 4344 KB Output is correct
10 Correct 5 ms 2808 KB Output is correct
11 Correct 4 ms 2808 KB Output is correct
12 Correct 4 ms 2808 KB Output is correct
13 Correct 4 ms 2808 KB Output is correct
14 Correct 4 ms 2808 KB Output is correct
15 Correct 96 ms 4728 KB Output is correct
16 Correct 97 ms 4728 KB Output is correct
17 Correct 95 ms 4924 KB Output is correct
18 Correct 14 ms 4600 KB Output is correct
19 Correct 13 ms 4472 KB Output is correct
20 Correct 79 ms 4984 KB Output is correct
21 Correct 98 ms 4856 KB Output is correct
22 Correct 5 ms 2808 KB Output is correct
23 Correct 14 ms 4344 KB Output is correct
24 Correct 13 ms 4344 KB Output is correct
25 Correct 4 ms 2808 KB Output is correct
26 Correct 4 ms 2808 KB Output is correct
27 Correct 14 ms 4728 KB Output is correct
28 Correct 14 ms 4344 KB Output is correct
29 Correct 11 ms 4344 KB Output is correct
30 Correct 11 ms 4344 KB Output is correct
31 Correct 4 ms 2808 KB Output is correct
32 Correct 4 ms 2808 KB Output is correct
33 Correct 4 ms 2808 KB Output is correct
34 Correct 4 ms 2808 KB Output is correct
35 Correct 4 ms 2808 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 241 ms 23696 KB Output is correct
2 Correct 5 ms 2808 KB Output is correct
3 Correct 233 ms 23404 KB Output is correct
4 Correct 276 ms 22776 KB Output is correct
5 Correct 303 ms 23688 KB Output is correct
6 Correct 272 ms 24048 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 20852 KB Output is correct
2 Correct 211 ms 19068 KB Output is correct
3 Correct 231 ms 18808 KB Output is correct
4 Correct 191 ms 18808 KB Output is correct
5 Correct 240 ms 18700 KB Output is correct
6 Correct 189 ms 21112 KB Output is correct
7 Correct 188 ms 20976 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 20852 KB Output is correct
2 Correct 211 ms 19068 KB Output is correct
3 Correct 231 ms 18808 KB Output is correct
4 Correct 191 ms 18808 KB Output is correct
5 Correct 240 ms 18700 KB Output is correct
6 Correct 189 ms 21112 KB Output is correct
7 Correct 188 ms 20976 KB Output is correct
8 Correct 275 ms 21040 KB Output is correct
9 Correct 272 ms 21064 KB Output is correct
10 Correct 240 ms 23732 KB Output is correct
11 Correct 238 ms 23740 KB Output is correct
12 Correct 224 ms 18368 KB Output is correct
13 Correct 228 ms 18396 KB Output is correct
14 Correct 258 ms 18636 KB Output is correct
15 Correct 254 ms 18648 KB Output is correct
16 Correct 240 ms 18708 KB Output is correct
17 Correct 232 ms 18688 KB Output is correct
18 Correct 187 ms 18704 KB Output is correct
19 Correct 204 ms 18936 KB Output is correct
20 Correct 191 ms 21272 KB Output is correct
21 Correct 196 ms 21392 KB Output is correct
22 Correct 192 ms 21432 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2936 KB Output is correct
2 Correct 12 ms 4344 KB Output is correct
3 Correct 12 ms 4344 KB Output is correct
4 Correct 4 ms 2808 KB Output is correct
5 Correct 4 ms 2808 KB Output is correct
6 Correct 13 ms 4600 KB Output is correct
7 Correct 13 ms 4344 KB Output is correct
8 Correct 11 ms 4344 KB Output is correct
9 Correct 11 ms 4344 KB Output is correct
10 Correct 5 ms 2808 KB Output is correct
11 Correct 4 ms 2808 KB Output is correct
12 Correct 4 ms 2808 KB Output is correct
13 Correct 4 ms 2808 KB Output is correct
14 Correct 4 ms 2808 KB Output is correct
15 Correct 96 ms 4728 KB Output is correct
16 Correct 97 ms 4728 KB Output is correct
17 Correct 95 ms 4924 KB Output is correct
18 Correct 14 ms 4600 KB Output is correct
19 Correct 13 ms 4472 KB Output is correct
20 Correct 79 ms 4984 KB Output is correct
21 Correct 98 ms 4856 KB Output is correct
22 Correct 5 ms 2808 KB Output is correct
23 Correct 14 ms 4344 KB Output is correct
24 Correct 13 ms 4344 KB Output is correct
25 Correct 4 ms 2808 KB Output is correct
26 Correct 4 ms 2808 KB Output is correct
27 Correct 14 ms 4728 KB Output is correct
28 Correct 14 ms 4344 KB Output is correct
29 Correct 11 ms 4344 KB Output is correct
30 Correct 11 ms 4344 KB Output is correct
31 Correct 4 ms 2808 KB Output is correct
32 Correct 4 ms 2808 KB Output is correct
33 Correct 4 ms 2808 KB Output is correct
34 Correct 4 ms 2808 KB Output is correct
35 Correct 4 ms 2808 KB Output is correct
36 Correct 241 ms 23696 KB Output is correct
37 Correct 5 ms 2808 KB Output is correct
38 Correct 233 ms 23404 KB Output is correct
39 Correct 276 ms 22776 KB Output is correct
40 Correct 303 ms 23688 KB Output is correct
41 Correct 272 ms 24048 KB Output is correct
42 Correct 192 ms 20852 KB Output is correct
43 Correct 211 ms 19068 KB Output is correct
44 Correct 231 ms 18808 KB Output is correct
45 Correct 191 ms 18808 KB Output is correct
46 Correct 240 ms 18700 KB Output is correct
47 Correct 189 ms 21112 KB Output is correct
48 Correct 188 ms 20976 KB Output is correct
49 Correct 275 ms 21040 KB Output is correct
50 Correct 272 ms 21064 KB Output is correct
51 Correct 240 ms 23732 KB Output is correct
52 Correct 238 ms 23740 KB Output is correct
53 Correct 224 ms 18368 KB Output is correct
54 Correct 228 ms 18396 KB Output is correct
55 Correct 258 ms 18636 KB Output is correct
56 Correct 254 ms 18648 KB Output is correct
57 Correct 240 ms 18708 KB Output is correct
58 Correct 232 ms 18688 KB Output is correct
59 Correct 187 ms 18704 KB Output is correct
60 Correct 204 ms 18936 KB Output is correct
61 Correct 191 ms 21272 KB Output is correct
62 Correct 196 ms 21392 KB Output is correct
63 Correct 192 ms 21432 KB Output is correct
64 Correct 229 ms 21300 KB Output is correct
65 Correct 268 ms 18832 KB Output is correct
66 Correct 319 ms 18572 KB Output is correct
67 Correct 280 ms 18572 KB Output is correct
68 Correct 185 ms 18488 KB Output is correct
69 Correct 184 ms 18468 KB Output is correct
70 Correct 228 ms 21620 KB Output is correct
71 Correct 285 ms 20940 KB Output is correct
72 Correct 4 ms 2732 KB Output is correct
73 Correct 12 ms 4344 KB Output is correct
74 Correct 12 ms 4344 KB Output is correct
75 Correct 4 ms 2808 KB Output is correct
76 Correct 4 ms 2808 KB Output is correct
77 Correct 13 ms 4600 KB Output is correct
78 Correct 13 ms 4344 KB Output is correct
79 Correct 11 ms 4344 KB Output is correct
80 Correct 11 ms 4344 KB Output is correct
81 Correct 4 ms 2808 KB Output is correct
82 Correct 4 ms 2808 KB Output is correct
83 Correct 4 ms 2808 KB Output is correct
84 Correct 4 ms 2808 KB Output is correct
85 Correct 4 ms 2808 KB Output is correct
86 Correct 95 ms 4844 KB Output is correct
87 Correct 95 ms 4728 KB Output is correct
88 Correct 97 ms 4856 KB Output is correct
89 Correct 13 ms 4600 KB Output is correct
90 Correct 13 ms 4344 KB Output is correct
91 Correct 80 ms 4988 KB Output is correct
92 Correct 96 ms 4872 KB Output is correct
93 Correct 4 ms 2808 KB Output is correct
94 Correct 237 ms 23660 KB Output is correct
95 Correct 230 ms 23408 KB Output is correct
96 Correct 241 ms 22776 KB Output is correct
97 Correct 322 ms 23664 KB Output is correct
98 Correct 268 ms 24048 KB Output is correct
99 Correct 204 ms 18708 KB Output is correct
100 Correct 227 ms 18708 KB Output is correct
101 Correct 196 ms 18580 KB Output is correct
102 Correct 207 ms 18944 KB Output is correct
103 Correct 187 ms 21012 KB Output is correct
104 Correct 193 ms 21384 KB Output is correct
105 Correct 185 ms 20984 KB Output is correct
106 Correct 274 ms 21208 KB Output is correct
107 Correct 257 ms 21048 KB Output is correct
108 Correct 243 ms 23752 KB Output is correct
109 Correct 261 ms 23764 KB Output is correct
110 Correct 223 ms 18424 KB Output is correct
111 Correct 226 ms 18460 KB Output is correct
112 Correct 268 ms 18716 KB Output is correct
113 Correct 260 ms 18564 KB Output is correct