Submission #851036

# Submission time Handle Problem Language Result Execution time Memory
851036 2023-09-18T09:01:59 Z LCJLY Railway (BOI17_railway) C++14
100 / 100
291 ms 58260 KB
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define show(x,y) //cout << y << " " << #x << "\n";
#define show2(x,y,i,j) //cout << y << " " << #x << "  " << j << " " << #i << "\n";
typedef pair<int,int>pii;

void solve(){
}

int n,m,k;
vector<pii>adj[100005];
int color[100005];

const int MAXN = 100050;
const int LOGN = 17;
int p[LOGN+1][MAXN], h[MAXN];   //h: number of edges from root
long long d[MAXN];     //dist: sum of edge weight from root
bitset<MAXN> visited;
void dfs(int x) {
    if (visited[x]) return;
    visited[x] = 1;
    for (int k = 0; k < LOGN; ++k) {
        if (p[k][x] == -1) break;
        p[k+1][x] = p[k][p[k][x]];
    }
    for (auto it:adj[x]) {
        if (visited[it.first]) continue;
        p[0][it.first] = x;
        d[it.first] = d[x] + 1;
        h[it.first] = h[x] + 1;
        color[it.first]=it.second;
        dfs(it.first);
    }
}

/* Query */
int lca(int a, int b) { //h[a] < h[b]
    if (h[a] > h[b]) swap(a, b);
    /* advance b by h[b] - h[a] parents */
    for (int k = 0, d = h[b] - h[a]; k < LOGN; ++k) {
        if (d & (1<<k))  b = p[k][b];
    }
    if (a == b) return a;
    assert(h[a] == h[b]); //same height
    /* to be continued */
    for (int k = LOGN-1; k >= 0; --k) {
        if (p[k][a] != p[k][b]) 
            a = p[k][a], b = p[k][b];
    }
    assert(p[0][a] == p[0][b]);        //same immediate parent
    return p[0][a];
}

set<pii>storage[100005]; //end ind
vector<int>ans;

void dp(int index, int par){
	for(auto it:adj[index]){
		if(it.first==par) continue;
		dp(it.first,index);
		show(neigh,it.first);
		if(storage[it.first].size()>storage[index].size()) swap(storage[it.first],storage[index]);
		
		for(auto it2:storage[it.first]) storage[index].insert(it2);
	}
	show(visit,index);
	//remove end nodes
	auto ite=storage[index].lower_bound({index,0});
	while(ite!=storage[index].end()&&ite->first==index){
		storage[index].erase(ite);
		ite=storage[index].lower_bound({index,0});
	}
	
	if(storage[index].size()>=k){
		ans.push_back(color[index]);
	}
}

int32_t main(){
	//ios::sync_with_stdio(0);
	//cin.tie(0);
	
	cin >> n >> m >> k;
	
	int temp,temp2;
	for(int x=0;x<n-1;x++){
		cin >> temp >> temp2;
		adj[temp].push_back({temp2,x+1});
		adj[temp2].push_back({temp,x+1});
	}
	
	dfs(1);
	
	show(done,1);
	
	for(int x=0;x<m;x++){
		cin >> temp;
		vector<int>v;
		for(int y=0;y<temp;y++){
			cin >> temp2;
			v.push_back(temp2);
		}
		
		int ancestor=v[0];
		for(int y=1;y<temp;y++){
			ancestor=lca(ancestor,v[y]);
		}
		
		for(int y=0;y<temp;y++){
			storage[v[y]].insert({ancestor,x});
		}
	}	
	
	show(done,2);
	
	dp(1,-1);
	
	show(done,3);
	
	sort(ans.begin(),ans.end());
	cout << ans.size() << "\n";
	for(auto it:ans){
		cout << it << " ";
	}
	
}


Compilation message

railway.cpp: In function 'void dp(long long int, long long int)':
railway.cpp:76:26: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   76 |  if(storage[index].size()>=k){
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
# Verdict Execution time Memory Grader output
1 Correct 4 ms 23896 KB Output is correct
2 Correct 10 ms 24412 KB Output is correct
3 Correct 10 ms 24476 KB Output is correct
4 Correct 4 ms 23900 KB Output is correct
5 Correct 4 ms 23900 KB Output is correct
6 Correct 11 ms 25276 KB Output is correct
7 Correct 10 ms 24668 KB Output is correct
8 Correct 9 ms 24480 KB Output is correct
9 Correct 10 ms 24668 KB Output is correct
10 Correct 4 ms 23900 KB Output is correct
11 Correct 4 ms 23944 KB Output is correct
12 Correct 4 ms 23896 KB Output is correct
13 Correct 4 ms 23900 KB Output is correct
14 Correct 4 ms 23900 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 23896 KB Output is correct
2 Correct 10 ms 24412 KB Output is correct
3 Correct 10 ms 24476 KB Output is correct
4 Correct 4 ms 23900 KB Output is correct
5 Correct 4 ms 23900 KB Output is correct
6 Correct 11 ms 25276 KB Output is correct
7 Correct 10 ms 24668 KB Output is correct
8 Correct 9 ms 24480 KB Output is correct
9 Correct 10 ms 24668 KB Output is correct
10 Correct 4 ms 23900 KB Output is correct
11 Correct 4 ms 23944 KB Output is correct
12 Correct 4 ms 23896 KB Output is correct
13 Correct 4 ms 23900 KB Output is correct
14 Correct 4 ms 23900 KB Output is correct
15 Correct 55 ms 32088 KB Output is correct
16 Correct 50 ms 31824 KB Output is correct
17 Correct 51 ms 31824 KB Output is correct
18 Correct 11 ms 25688 KB Output is correct
19 Correct 12 ms 24668 KB Output is correct
20 Correct 51 ms 30812 KB Output is correct
21 Correct 50 ms 30548 KB Output is correct
22 Correct 4 ms 23900 KB Output is correct
23 Correct 10 ms 24408 KB Output is correct
24 Correct 10 ms 24412 KB Output is correct
25 Correct 4 ms 23908 KB Output is correct
26 Correct 4 ms 23900 KB Output is correct
27 Correct 11 ms 25432 KB Output is correct
28 Correct 10 ms 24664 KB Output is correct
29 Correct 9 ms 24412 KB Output is correct
30 Correct 11 ms 24632 KB Output is correct
31 Correct 4 ms 23924 KB Output is correct
32 Correct 4 ms 23900 KB Output is correct
33 Correct 4 ms 23900 KB Output is correct
34 Correct 4 ms 23896 KB Output is correct
35 Correct 4 ms 23900 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 150 ms 52160 KB Output is correct
2 Correct 4 ms 23896 KB Output is correct
3 Correct 165 ms 51788 KB Output is correct
4 Correct 142 ms 51284 KB Output is correct
5 Correct 151 ms 50952 KB Output is correct
6 Correct 155 ms 54220 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 155 ms 46492 KB Output is correct
2 Correct 180 ms 42320 KB Output is correct
3 Correct 199 ms 50168 KB Output is correct
4 Correct 206 ms 50204 KB Output is correct
5 Correct 202 ms 50260 KB Output is correct
6 Correct 154 ms 46564 KB Output is correct
7 Correct 158 ms 46676 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 155 ms 46492 KB Output is correct
2 Correct 180 ms 42320 KB Output is correct
3 Correct 199 ms 50168 KB Output is correct
4 Correct 206 ms 50204 KB Output is correct
5 Correct 202 ms 50260 KB Output is correct
6 Correct 154 ms 46564 KB Output is correct
7 Correct 158 ms 46676 KB Output is correct
8 Correct 151 ms 44876 KB Output is correct
9 Correct 148 ms 44872 KB Output is correct
10 Correct 128 ms 50892 KB Output is correct
11 Correct 140 ms 50980 KB Output is correct
12 Correct 101 ms 35280 KB Output is correct
13 Correct 104 ms 35288 KB Output is correct
14 Correct 170 ms 43940 KB Output is correct
15 Correct 174 ms 43380 KB Output is correct
16 Correct 212 ms 50892 KB Output is correct
17 Correct 230 ms 51448 KB Output is correct
18 Correct 194 ms 48388 KB Output is correct
19 Correct 179 ms 42580 KB Output is correct
20 Correct 175 ms 46464 KB Output is correct
21 Correct 164 ms 46292 KB Output is correct
22 Correct 158 ms 46320 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 23896 KB Output is correct
2 Correct 10 ms 24412 KB Output is correct
3 Correct 10 ms 24476 KB Output is correct
4 Correct 4 ms 23900 KB Output is correct
5 Correct 4 ms 23900 KB Output is correct
6 Correct 11 ms 25276 KB Output is correct
7 Correct 10 ms 24668 KB Output is correct
8 Correct 9 ms 24480 KB Output is correct
9 Correct 10 ms 24668 KB Output is correct
10 Correct 4 ms 23900 KB Output is correct
11 Correct 4 ms 23944 KB Output is correct
12 Correct 4 ms 23896 KB Output is correct
13 Correct 4 ms 23900 KB Output is correct
14 Correct 4 ms 23900 KB Output is correct
15 Correct 55 ms 32088 KB Output is correct
16 Correct 50 ms 31824 KB Output is correct
17 Correct 51 ms 31824 KB Output is correct
18 Correct 11 ms 25688 KB Output is correct
19 Correct 12 ms 24668 KB Output is correct
20 Correct 51 ms 30812 KB Output is correct
21 Correct 50 ms 30548 KB Output is correct
22 Correct 4 ms 23900 KB Output is correct
23 Correct 10 ms 24408 KB Output is correct
24 Correct 10 ms 24412 KB Output is correct
25 Correct 4 ms 23908 KB Output is correct
26 Correct 4 ms 23900 KB Output is correct
27 Correct 11 ms 25432 KB Output is correct
28 Correct 10 ms 24664 KB Output is correct
29 Correct 9 ms 24412 KB Output is correct
30 Correct 11 ms 24632 KB Output is correct
31 Correct 4 ms 23924 KB Output is correct
32 Correct 4 ms 23900 KB Output is correct
33 Correct 4 ms 23900 KB Output is correct
34 Correct 4 ms 23896 KB Output is correct
35 Correct 4 ms 23900 KB Output is correct
36 Correct 150 ms 52160 KB Output is correct
37 Correct 4 ms 23896 KB Output is correct
38 Correct 165 ms 51788 KB Output is correct
39 Correct 142 ms 51284 KB Output is correct
40 Correct 151 ms 50952 KB Output is correct
41 Correct 155 ms 54220 KB Output is correct
42 Correct 155 ms 46492 KB Output is correct
43 Correct 180 ms 42320 KB Output is correct
44 Correct 199 ms 50168 KB Output is correct
45 Correct 206 ms 50204 KB Output is correct
46 Correct 202 ms 50260 KB Output is correct
47 Correct 154 ms 46564 KB Output is correct
48 Correct 158 ms 46676 KB Output is correct
49 Correct 151 ms 44876 KB Output is correct
50 Correct 148 ms 44872 KB Output is correct
51 Correct 128 ms 50892 KB Output is correct
52 Correct 140 ms 50980 KB Output is correct
53 Correct 101 ms 35280 KB Output is correct
54 Correct 104 ms 35288 KB Output is correct
55 Correct 170 ms 43940 KB Output is correct
56 Correct 174 ms 43380 KB Output is correct
57 Correct 212 ms 50892 KB Output is correct
58 Correct 230 ms 51448 KB Output is correct
59 Correct 194 ms 48388 KB Output is correct
60 Correct 179 ms 42580 KB Output is correct
61 Correct 175 ms 46464 KB Output is correct
62 Correct 164 ms 46292 KB Output is correct
63 Correct 158 ms 46320 KB Output is correct
64 Correct 160 ms 44624 KB Output is correct
65 Correct 291 ms 58260 KB Output is correct
66 Correct 197 ms 52820 KB Output is correct
67 Correct 188 ms 47444 KB Output is correct
68 Correct 92 ms 32908 KB Output is correct
69 Correct 88 ms 33104 KB Output is correct
70 Correct 157 ms 46028 KB Output is correct
71 Correct 159 ms 44280 KB Output is correct
72 Correct 4 ms 23896 KB Output is correct
73 Correct 10 ms 24412 KB Output is correct
74 Correct 10 ms 24412 KB Output is correct
75 Correct 4 ms 23896 KB Output is correct
76 Correct 4 ms 23900 KB Output is correct
77 Correct 10 ms 25180 KB Output is correct
78 Correct 10 ms 24672 KB Output is correct
79 Correct 12 ms 24612 KB Output is correct
80 Correct 11 ms 24668 KB Output is correct
81 Correct 4 ms 23900 KB Output is correct
82 Correct 4 ms 23900 KB Output is correct
83 Correct 4 ms 23896 KB Output is correct
84 Correct 4 ms 23900 KB Output is correct
85 Correct 4 ms 23900 KB Output is correct
86 Correct 46 ms 31872 KB Output is correct
87 Correct 46 ms 31876 KB Output is correct
88 Correct 47 ms 31920 KB Output is correct
89 Correct 11 ms 25432 KB Output is correct
90 Correct 10 ms 24668 KB Output is correct
91 Correct 47 ms 30824 KB Output is correct
92 Correct 51 ms 30556 KB Output is correct
93 Correct 4 ms 23900 KB Output is correct
94 Correct 150 ms 51416 KB Output is correct
95 Correct 165 ms 51148 KB Output is correct
96 Correct 161 ms 50512 KB Output is correct
97 Correct 171 ms 50364 KB Output is correct
98 Correct 153 ms 53456 KB Output is correct
99 Correct 214 ms 54372 KB Output is correct
100 Correct 205 ms 50552 KB Output is correct
101 Correct 203 ms 51176 KB Output is correct
102 Correct 173 ms 42068 KB Output is correct
103 Correct 171 ms 45776 KB Output is correct
104 Correct 175 ms 46400 KB Output is correct
105 Correct 163 ms 45772 KB Output is correct
106 Correct 178 ms 44620 KB Output is correct
107 Correct 145 ms 44324 KB Output is correct
108 Correct 140 ms 50372 KB Output is correct
109 Correct 132 ms 50316 KB Output is correct
110 Correct 116 ms 35276 KB Output is correct
111 Correct 99 ms 34904 KB Output is correct
112 Correct 165 ms 42836 KB Output is correct
113 Correct 164 ms 42836 KB Output is correct