Submission #210685

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
210685	2020-03-18T02:35:18 Z	super_j6	Railway (BOI17_railway)	C++14	7 / 100	459 ms	29816 KB

railway

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
#define endl '\n'
#define pi pair<int, int>
#define f first
#define s second

struct segTree{
	int l, r;
	segTree *left, *right;
	int val = 0;
	
	segTree(int a, int b){
		l = a;
		r = b;
		
		if(l != r){
			int mid = (l + r) / 2;
			left = new segTree(l, mid);
			right = new segTree(mid + 1, r);
		}
	}
	
	void add(int x, int v){
		if(x < l || r < x) return;
		if(l == r){
			val += v;
			return;
		}
		
		left->add(x, v);
		right->add(x, v);
		val = left->val + right->val;
	}
	
	int qry(int a, int b){
		if(b < l || r < a) return 0;
		if(a <= l && r <= b) return val;
		
		return left->qry(a, b) + right->qry(a, b);
	}
};

const int maxn = 100000, w = 18;
int n, m, k;
int l[maxn], r[maxn], d[maxn], dp[maxn];
int p[w][maxn];
vector<pi> graph[maxn];
segTree tre(0, maxn);
vector<int> ans;

auto cmp = [&](int x, int y){
	return (pi){r[x], -l[x]} < (pi){r[y], -l[y]};
};
set<int, decltype(cmp)> a(cmp);
vector<pi> b;

int dfs(int c){
	r[c] = l[c];
	for(pi i : graph[c]){
		if(i.f == p[0][c]) continue;
		d[i.f] = d[c] + 1;
		l[i.f] = r[c] + 1;
		p[0][i.f] = c;
		r[c] = dfs(i.f);
	}
	return r[c];
}

int lca(int x, int y){
	if(d[x] < d[y]) swap(x, y);
	for(int i = w - 1; i >= 0; i--) if(p[i][x] != -1 && d[p[i][x]] >= d[y]) x = p[i][x];
	for(int i = w - 1; i >= 0; i--){
		if(p[i][x] != p[i][y]){
			x = p[i][x];
			y = p[i][y];
		}
	}
	return x == y ? x : p[0][x];
}

void dfs2(int c){
	for(pi i : graph[c]){
		if(i.f == p[0][c]) continue;
		dfs2(i.f);
		if(dp[i.f] >= k) ans.push_back(i.s);
		dp[c] += dp[i.f];
	}
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	
	cin >> n >> m >> k;

	for(int i = 1; i < n; i++){
		int u, v;
		cin >> u >> v;
		u--, v--;
		graph[u].push_back({v, i});
		graph[v].push_back({u, i});
	}
	
	p[0][0] = -1;
	dfs(0);
	
	for(int i = 1; i < w; i++)
	for(int j = 0; j < n; j++){
		p[i][j] = p[i - 1][j] == -1 ? -1 : p[i - 1][p[i - 1][j]];
	}
	
	for(int i = 0; i < m; i++){
		int s;
		cin >> s;
		
		b.clear();
		for(int j = 0; j < s; j++){
			int x;
			cin >> x;
			x--;
			a.insert(x);
		}
		while(!a.empty()){
			if(!b.empty()) a.insert(lca(b.back().f, *a.begin()));
			b.push_back({*a.begin(), 0});
			a.erase(a.begin());
			b.back().s = -tre.qry(l[b.back().f], r[b.back().f]) + 1;
			tre.add(b.back().f, b.back().s);
			dp[b.back().f] += b.back().s;
		}
		dp[b.back().f]--;
		for(pi i : b){
			tre.add(i.f, -i.s);
		}
	}
	
	dfs2(0);
	sort(ans.begin(), ans.end());
	
	cout << ans.size() << endl;
	if(!ans.empty()) cout << ans[0];
	for(int i = 1; i < ans.size(); i++) cout << " " << ans[i];
	cout << endl;

	return 0;
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:147:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 1; i < ans.size(); i++) cout << " " << ans[i];
                 ~~^~~~~~~~~~~~

Subtask #1
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	15 ms	12024 KB	Output is correct
2	Incorrect	22 ms	13560 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	15 ms	12024 KB	Output is correct
2	Incorrect	22 ms	13560 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #3
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	384 ms	29740 KB	Output is correct
2	Correct	15 ms	12152 KB	Output is correct
3	Correct	360 ms	29304 KB	Output is correct
4	Correct	347 ms	28820 KB	Output is correct
5	Correct	459 ms	29808 KB	Output is correct
6	Correct	359 ms	29816 KB	Output is correct