oj.uz

Submission #291324

# Submission time Handle Problem Language Result Execution time Memory
291324 2020-09-05T05:55:53 Z someone_aa Railway (BOI17_railway) C++17
100 / 100
 279 ms 43104 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll, ll>
#define sz(x) int(x.size())
using namespace std;
const int maxn = 100100;
const int maxlog = 20;
vector<int>g[maxn];
vector<int>gt[maxn];
ll n, q, k;

int opent[maxn], euler[maxn];
int sbtsize[maxn], br;
int depth[maxn];

int parent[maxn][maxlog];

void dfs_preprocess(int node, int p, int d) {
	opent[node] = br;
	euler[br] = node;
	sbtsize[node] = 1;
	depth[node] = d;
	br++;

	parent[node][0] = p;

	for(int i:g[node]) {
		if(i == p) continue;

		dfs_preprocess(i, node, d + 1);
		sbtsize[node] += sbtsize[i];
	}
}

void lca_preprocess() {
	for(int level=1;level<maxlog;level++) {
		for(int i=1;i<=n;i++) {
			if(parent[i][level-1] == -1) continue;
			parent[i][level] = parent[parent[i][level-1]][level-1];
		}
	}
}

int lca(int a, int b) {
	if(depth[a] > depth[b]) swap(a, b);
	if(opent[b] >= opent[a] && opent[b] < opent[a] + sbtsize[a]) return a;

	for(int i=maxlog-1;i>=0;i--) {
		if(parent[a][i] == -1) continue;

		int nextnode = parent[a][i];
		if(opent[b] < opent[nextnode] || opent[b] >= opent[nextnode] + sbtsize[nextnode]) a = nextnode;
	}

	return parent[a][0];
}

int start_here[maxn], end_here[maxn];
map<pii, int> ind;
vector<int>result;

int dfs_count(int node, int p) {
	int sum = 0;
	for(int i:g[node]) {
		if(i == p) continue;

		int tmp = dfs_count(i, node);
		if(tmp >= k) {
			result.pb(ind[mp(i, node)]);
		}

		sum += tmp;
	}

	return sum + start_here[node] - end_here[node];
} 


int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	cin>>n>>q>>k;

	ll u, v;
	for(int i=0;i<n-1;i++) {
		cin>>u>>v;
		g[u].pb(v);
		g[v].pb(u);

		ind[mp(u, v)] = ind[mp(v, u)] = i + 1;
	}

	memset(parent, -1, sizeof(parent));
	dfs_preprocess(1, -1,0);
	lca_preprocess();

	int s;
	bool root;
	while(q--) {
		cin>>s;

		vector<pii> v;
		set<int>st;
		for(int i=0;i<s;i++) {
			cin>>u;
			v.pb(mp(opent[u], u));
			st.insert(u);

		}

		sort(v.begin(), v.end());
		for(int i=1;i<sz(v);i++) {
			st.insert(lca(v[i].second, v[i-1].second));
		}

		v.clear();
		for(int i:st) {
			v.pb(mp(opent[i], i));
		}		sort(v.begin(), v.end());

		stack<int>node_stack;
		node_stack.push(v[0].second);
		for(int i=1;i<sz(v);i++) {

			while(!node_stack.empty()) {
				int curr = node_stack.top();
				int nextnode = v[i].second;

				if(opent[nextnode] >= opent[curr] && opent[nextnode] < opent[curr] + sbtsize[curr]) {
					start_here[nextnode]++;
					end_here[curr]++;
					node_stack.push(nextnode);
					break;
				}
				else {
					node_stack.pop();
				}
			}
		}
	}

	dfs_count(1, -1);
	sort(result.begin(), result.end());
	cout<<sz(result)<<"\n";
	for(int i:result) {
		cout<<i<<" ";
	} cout<<"\n";
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:102:7: warning: unused variable 'root' [-Wunused-variable]
  102 |  bool root;
      |       ^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12928 KB Output is correct
2 Correct 19 ms 14720 KB Output is correct
3 Correct 19 ms 14712 KB Output is correct
4 Correct 8 ms 12928 KB Output is correct
5 Correct 8 ms 12928 KB Output is correct
6 Correct 19 ms 15352 KB Output is correct
7 Correct 25 ms 14848 KB Output is correct
8 Correct 16 ms 14720 KB Output is correct
9 Correct 19 ms 14720 KB Output is correct
10 Correct 8 ms 12928 KB Output is correct
11 Correct 8 ms 12928 KB Output is correct
12 Correct 8 ms 12928 KB Output is correct
13 Correct 8 ms 12928 KB Output is correct
14 Correct 8 ms 12928 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12928 KB Output is correct
2 Correct 19 ms 14720 KB Output is correct
3 Correct 19 ms 14712 KB Output is correct
4 Correct 8 ms 12928 KB Output is correct
5 Correct 8 ms 12928 KB Output is correct
6 Correct 19 ms 15352 KB Output is correct
7 Correct 25 ms 14848 KB Output is correct
8 Correct 16 ms 14720 KB Output is correct
9 Correct 19 ms 14720 KB Output is correct
10 Correct 8 ms 12928 KB Output is correct
11 Correct 8 ms 12928 KB Output is correct
12 Correct 8 ms 12928 KB Output is correct
13 Correct 8 ms 12928 KB Output is correct
14 Correct 8 ms 12928 KB Output is correct
15 Correct 56 ms 14720 KB Output is correct
16 Correct 58 ms 14720 KB Output is correct
17 Correct 60 ms 14840 KB Output is correct
18 Correct 20 ms 15232 KB Output is correct
19 Correct 20 ms 14848 KB Output is correct
20 Correct 45 ms 14840 KB Output is correct
21 Correct 49 ms 14720 KB Output is correct
22 Correct 8 ms 12928 KB Output is correct
23 Correct 19 ms 14720 KB Output is correct
24 Correct 19 ms 14720 KB Output is correct
25 Correct 9 ms 12928 KB Output is correct
26 Correct 8 ms 12928 KB Output is correct
27 Correct 19 ms 15360 KB Output is correct
28 Correct 20 ms 14848 KB Output is correct
29 Correct 17 ms 14720 KB Output is correct
30 Correct 18 ms 14720 KB Output is correct
31 Correct 8 ms 12832 KB Output is correct
32 Correct 8 ms 12928 KB Output is correct
33 Correct 8 ms 12928 KB Output is correct
34 Correct 8 ms 12928 KB Output is correct
35 Correct 8 ms 12928 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 42708 KB Output is correct
2 Correct 8 ms 12928 KB Output is correct
3 Correct 156 ms 42472 KB Output is correct
4 Correct 149 ms 41848 KB Output is correct
5 Correct 161 ms 42864 KB Output is correct
6 Correct 180 ms 43104 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 35832 KB Output is correct
2 Correct 256 ms 31096 KB Output is correct
3 Correct 254 ms 30584 KB Output is correct
4 Correct 260 ms 30556 KB Output is correct
5 Correct 251 ms 30648 KB Output is correct
6 Correct 200 ms 36088 KB Output is correct
7 Correct 194 ms 35832 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 35832 KB Output is correct
2 Correct 256 ms 31096 KB Output is correct
3 Correct 254 ms 30584 KB Output is correct
4 Correct 260 ms 30556 KB Output is correct
5 Correct 251 ms 30648 KB Output is correct
6 Correct 200 ms 36088 KB Output is correct
7 Correct 194 ms 35832 KB Output is correct
8 Correct 216 ms 36472 KB Output is correct
9 Correct 218 ms 36484 KB Output is correct
10 Correct 160 ms 42992 KB Output is correct
11 Correct 162 ms 42864 KB Output is correct
12 Correct 187 ms 30968 KB Output is correct
13 Correct 184 ms 30968 KB Output is correct
14 Correct 260 ms 30968 KB Output is correct
15 Correct 264 ms 31016 KB Output is correct
16 Correct 244 ms 30584 KB Output is correct
17 Correct 247 ms 30584 KB Output is correct
18 Correct 257 ms 30584 KB Output is correct
19 Correct 253 ms 31224 KB Output is correct
20 Correct 199 ms 36260 KB Output is correct
21 Correct 197 ms 36340 KB Output is correct
22 Correct 199 ms 36300 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12928 KB Output is correct
2 Correct 19 ms 14720 KB Output is correct
3 Correct 19 ms 14712 KB Output is correct
4 Correct 8 ms 12928 KB Output is correct
5 Correct 8 ms 12928 KB Output is correct
6 Correct 19 ms 15352 KB Output is correct
7 Correct 25 ms 14848 KB Output is correct
8 Correct 16 ms 14720 KB Output is correct
9 Correct 19 ms 14720 KB Output is correct
10 Correct 8 ms 12928 KB Output is correct
11 Correct 8 ms 12928 KB Output is correct
12 Correct 8 ms 12928 KB Output is correct
13 Correct 8 ms 12928 KB Output is correct
14 Correct 8 ms 12928 KB Output is correct
15 Correct 56 ms 14720 KB Output is correct
16 Correct 58 ms 14720 KB Output is correct
17 Correct 60 ms 14840 KB Output is correct
18 Correct 20 ms 15232 KB Output is correct
19 Correct 20 ms 14848 KB Output is correct
20 Correct 45 ms 14840 KB Output is correct
21 Correct 49 ms 14720 KB Output is correct
22 Correct 8 ms 12928 KB Output is correct
23 Correct 19 ms 14720 KB Output is correct
24 Correct 19 ms 14720 KB Output is correct
25 Correct 9 ms 12928 KB Output is correct
26 Correct 8 ms 12928 KB Output is correct
27 Correct 19 ms 15360 KB Output is correct
28 Correct 20 ms 14848 KB Output is correct
29 Correct 17 ms 14720 KB Output is correct
30 Correct 18 ms 14720 KB Output is correct
31 Correct 8 ms 12832 KB Output is correct
32 Correct 8 ms 12928 KB Output is correct
33 Correct 8 ms 12928 KB Output is correct
34 Correct 8 ms 12928 KB Output is correct
35 Correct 8 ms 12928 KB Output is correct
36 Correct 164 ms 42708 KB Output is correct
37 Correct 8 ms 12928 KB Output is correct
38 Correct 156 ms 42472 KB Output is correct
39 Correct 149 ms 41848 KB Output is correct
40 Correct 161 ms 42864 KB Output is correct
41 Correct 180 ms 43104 KB Output is correct
42 Correct 193 ms 35832 KB Output is correct
43 Correct 256 ms 31096 KB Output is correct
44 Correct 254 ms 30584 KB Output is correct
45 Correct 260 ms 30556 KB Output is correct
46 Correct 251 ms 30648 KB Output is correct
47 Correct 200 ms 36088 KB Output is correct
48 Correct 194 ms 35832 KB Output is correct
49 Correct 216 ms 36472 KB Output is correct
50 Correct 218 ms 36484 KB Output is correct
51 Correct 160 ms 42992 KB Output is correct
52 Correct 162 ms 42864 KB Output is correct
53 Correct 187 ms 30968 KB Output is correct
54 Correct 184 ms 30968 KB Output is correct
55 Correct 260 ms 30968 KB Output is correct
56 Correct 264 ms 31016 KB Output is correct
57 Correct 244 ms 30584 KB Output is correct
58 Correct 247 ms 30584 KB Output is correct
59 Correct 257 ms 30584 KB Output is correct
60 Correct 253 ms 31224 KB Output is correct
61 Correct 199 ms 36260 KB Output is correct
62 Correct 197 ms 36340 KB Output is correct
63 Correct 199 ms 36300 KB Output is correct
64 Correct 204 ms 36576 KB Output is correct
65 Correct 261 ms 30840 KB Output is correct
66 Correct 279 ms 31096 KB Output is correct
67 Correct 258 ms 30968 KB Output is correct
68 Correct 192 ms 30968 KB Output is correct
69 Correct 197 ms 31124 KB Output is correct
70 Correct 204 ms 36852 KB Output is correct
71 Correct 205 ms 36576 KB Output is correct
72 Correct 8 ms 12928 KB Output is correct
73 Correct 19 ms 14720 KB Output is correct
74 Correct 20 ms 14720 KB Output is correct
75 Correct 8 ms 12928 KB Output is correct
76 Correct 8 ms 12928 KB Output is correct
77 Correct 19 ms 15360 KB Output is correct
78 Correct 21 ms 14848 KB Output is correct
79 Correct 16 ms 14720 KB Output is correct
80 Correct 18 ms 14720 KB Output is correct
81 Correct 8 ms 12928 KB Output is correct
82 Correct 8 ms 12928 KB Output is correct
83 Correct 8 ms 12928 KB Output is correct
84 Correct 8 ms 12928 KB Output is correct
85 Correct 8 ms 12928 KB Output is correct
86 Correct 57 ms 14720 KB Output is correct
87 Correct 60 ms 14720 KB Output is correct
88 Correct 59 ms 14840 KB Output is correct
89 Correct 20 ms 15232 KB Output is correct
90 Correct 20 ms 14848 KB Output is correct
91 Correct 44 ms 14840 KB Output is correct
92 Correct 50 ms 14720 KB Output is correct
93 Correct 8 ms 12928 KB Output is correct
94 Correct 161 ms 42840 KB Output is correct
95 Correct 153 ms 42356 KB Output is correct
96 Correct 141 ms 41848 KB Output is correct
97 Correct 154 ms 42864 KB Output is correct
98 Correct 174 ms 42976 KB Output is correct
99 Correct 235 ms 30584 KB Output is correct
100 Correct 248 ms 30712 KB Output is correct
101 Correct 242 ms 30584 KB Output is correct
102 Correct 247 ms 31096 KB Output is correct
103 Correct 190 ms 35960 KB Output is correct
104 Correct 209 ms 36472 KB Output is correct
105 Correct 197 ms 35832 KB Output is correct
106 Correct 218 ms 36600 KB Output is correct
107 Correct 217 ms 36484 KB Output is correct
108 Correct 168 ms 42864 KB Output is correct
109 Correct 169 ms 42864 KB Output is correct
110 Correct 183 ms 30968 KB Output is correct
111 Correct 181 ms 30968 KB Output is correct
112 Correct 254 ms 30968 KB Output is correct
113 Correct 267 ms 30844 KB Output is correct