oj.uz

Submission #331479

# Submission time Handle Problem Language Result Execution time Memory
331479 2020-11-28T16:28:00 Z rqi Railway (BOI17_railway) C++14
100 / 100
 192 ms 27620 KB 
#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;

#define f first
#define s second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define mp make_pair

const int mx = 100005;

int n, m, k;
int a[mx];
int b[mx];
vpi adj[mx];
vpi s[mx];
int etind[mx];
int edgeind[mx];
int curetind = 0;

void genET(int node, int prv = -1){
	etind[node] = ++curetind;
	for(auto u: adj[node]){
		if(u.f == prv) continue;
		genET(u.f, node);
		edgeind[u.f] = u.s;
	}
}

vi queries[mx];
int sum[mx];

vi ances;
vi e;

int get(int a){
	if(e[a] < 0) return a;
	e[a] = get(e[a]);
	return e[a];
}

bool unite(int a, int b){
	a = get(a);
	b = get(b);
	if(a == b) return 0;
	if(-e[a] < -e[b]) swap(a, b);
	e[a]+=e[b];
	e[b] = a;
	if(etind[ances[a]] > etind[ances[b]]){
		ances[a] = ances[b];
	}
	return 1;
}

void genLCA(int node, int prv = -1){
	for(auto u: queries[node]){
		sum[ances[get(u)]]-=2;
	}
	for(auto u: adj[node]){
		if(u.f == prv) continue;
		genLCA(u.f, node);
		unite(u.f, node);
	}
}

void genSums(int node, int prv = -1){
	for(auto u: adj[node]){
		if(u.f == prv) continue;
		genSums(u.f, node);
		sum[node]+=sum[u.f];
	}
}

int main(){
	int n, m, k;
	cin >> n >> m >> k;

	ances = e = vi(n+5, -1);
	for(int i = 1; i <= n; i++){
		ances[i] = i;
	}

	for(int i = 1; i <= n-1; i++){
		cin >> a[i] >> b[i];
		adj[a[i]].pb(mp(b[i], i));
		adj[b[i]].pb(mp(a[i], i));
	}

	genET(1);

	for(int i = 1; i <= m; i++){
		int num;
		cin >> num;
		for(int j = 0; j < num; j++){
			int x;
			cin >> x;
			s[i].pb(mp(etind[x], x));
		}
		sort(all(s[i]));
		s[i].pb(s[i][0]);
	}

	for(int i = 1; i <= m; i++){
		for(int j = 0; j < sz(s[i])-1; j++){
			int a = s[i][j].s;
			int b = s[i][j+1].s;
			if(etind[a] > etind[b]) swap(a, b);
			queries[b].pb(a);
			sum[a]++;
			sum[b]++;
		}
	}

	genLCA(1);
	genSums(1);

	vi ans;
	for(int i = 2; i <= n; i++){
		if(sum[i]/2 >= k){
			ans.pb(edgeind[i]);
		}
	}
	sort(all(ans));
	cout << sz(ans) << "\n";
	for(auto u: ans){
		cout << u << " ";
	}
	cout << "\n";

}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 14 ms 8172 KB Output is correct
3 Correct 14 ms 8172 KB Output is correct
4 Correct 5 ms 7404 KB Output is correct
5 Correct 6 ms 7404 KB Output is correct
6 Correct 15 ms 8684 KB Output is correct
7 Correct 14 ms 8300 KB Output is correct
8 Correct 12 ms 8172 KB Output is correct
9 Correct 13 ms 8172 KB Output is correct
10 Correct 7 ms 7404 KB Output is correct
11 Correct 6 ms 7404 KB Output is correct
12 Correct 5 ms 7404 KB Output is correct
13 Correct 5 ms 7404 KB Output is correct
14 Correct 5 ms 7404 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 14 ms 8172 KB Output is correct
3 Correct 14 ms 8172 KB Output is correct
4 Correct 5 ms 7404 KB Output is correct
5 Correct 6 ms 7404 KB Output is correct
6 Correct 15 ms 8684 KB Output is correct
7 Correct 14 ms 8300 KB Output is correct
8 Correct 12 ms 8172 KB Output is correct
9 Correct 13 ms 8172 KB Output is correct
10 Correct 7 ms 7404 KB Output is correct
11 Correct 6 ms 7404 KB Output is correct
12 Correct 5 ms 7404 KB Output is correct
13 Correct 5 ms 7404 KB Output is correct
14 Correct 5 ms 7404 KB Output is correct
15 Correct 44 ms 10220 KB Output is correct
16 Correct 45 ms 10220 KB Output is correct
17 Correct 45 ms 10220 KB Output is correct
18 Correct 16 ms 8684 KB Output is correct
19 Correct 15 ms 8300 KB Output is correct
20 Correct 52 ms 10476 KB Output is correct
21 Correct 50 ms 10648 KB Output is correct
22 Correct 6 ms 7404 KB Output is correct
23 Correct 14 ms 8172 KB Output is correct
24 Correct 14 ms 8172 KB Output is correct
25 Correct 5 ms 7404 KB Output is correct
26 Correct 6 ms 7404 KB Output is correct
27 Correct 15 ms 8684 KB Output is correct
28 Correct 14 ms 8300 KB Output is correct
29 Correct 14 ms 8316 KB Output is correct
30 Correct 15 ms 8300 KB Output is correct
31 Correct 5 ms 7404 KB Output is correct
32 Correct 6 ms 7404 KB Output is correct
33 Correct 6 ms 7404 KB Output is correct
34 Correct 6 ms 7404 KB Output is correct
35 Correct 6 ms 7404 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 27364 KB Output is correct
2 Correct 5 ms 7404 KB Output is correct
3 Correct 154 ms 27004 KB Output is correct
4 Correct 150 ms 26476 KB Output is correct
5 Correct 160 ms 27108 KB Output is correct
6 Correct 169 ms 27620 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 22448 KB Output is correct
2 Correct 170 ms 19052 KB Output is correct
3 Correct 172 ms 18668 KB Output is correct
4 Correct 177 ms 18668 KB Output is correct
5 Correct 179 ms 18668 KB Output is correct
6 Correct 157 ms 22764 KB Output is correct
7 Correct 148 ms 22508 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 22448 KB Output is correct
2 Correct 170 ms 19052 KB Output is correct
3 Correct 172 ms 18668 KB Output is correct
4 Correct 177 ms 18668 KB Output is correct
5 Correct 179 ms 18668 KB Output is correct
6 Correct 157 ms 22764 KB Output is correct
7 Correct 148 ms 22508 KB Output is correct
8 Correct 156 ms 22764 KB Output is correct
9 Correct 153 ms 22764 KB Output is correct
10 Correct 157 ms 26604 KB Output is correct
11 Correct 154 ms 26604 KB Output is correct
12 Correct 127 ms 18144 KB Output is correct
13 Correct 128 ms 18156 KB Output is correct
14 Correct 170 ms 17516 KB Output is correct
15 Correct 170 ms 17516 KB Output is correct
16 Correct 173 ms 18668 KB Output is correct
17 Correct 176 ms 18540 KB Output is correct
18 Correct 179 ms 18540 KB Output is correct
19 Correct 170 ms 18924 KB Output is correct
20 Correct 153 ms 22892 KB Output is correct
21 Correct 149 ms 22896 KB Output is correct
22 Correct 148 ms 22764 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 14 ms 8172 KB Output is correct
3 Correct 14 ms 8172 KB Output is correct
4 Correct 5 ms 7404 KB Output is correct
5 Correct 6 ms 7404 KB Output is correct
6 Correct 15 ms 8684 KB Output is correct
7 Correct 14 ms 8300 KB Output is correct
8 Correct 12 ms 8172 KB Output is correct
9 Correct 13 ms 8172 KB Output is correct
10 Correct 7 ms 7404 KB Output is correct
11 Correct 6 ms 7404 KB Output is correct
12 Correct 5 ms 7404 KB Output is correct
13 Correct 5 ms 7404 KB Output is correct
14 Correct 5 ms 7404 KB Output is correct
15 Correct 44 ms 10220 KB Output is correct
16 Correct 45 ms 10220 KB Output is correct
17 Correct 45 ms 10220 KB Output is correct
18 Correct 16 ms 8684 KB Output is correct
19 Correct 15 ms 8300 KB Output is correct
20 Correct 52 ms 10476 KB Output is correct
21 Correct 50 ms 10648 KB Output is correct
22 Correct 6 ms 7404 KB Output is correct
23 Correct 14 ms 8172 KB Output is correct
24 Correct 14 ms 8172 KB Output is correct
25 Correct 5 ms 7404 KB Output is correct
26 Correct 6 ms 7404 KB Output is correct
27 Correct 15 ms 8684 KB Output is correct
28 Correct 14 ms 8300 KB Output is correct
29 Correct 14 ms 8316 KB Output is correct
30 Correct 15 ms 8300 KB Output is correct
31 Correct 5 ms 7404 KB Output is correct
32 Correct 6 ms 7404 KB Output is correct
33 Correct 6 ms 7404 KB Output is correct
34 Correct 6 ms 7404 KB Output is correct
35 Correct 6 ms 7404 KB Output is correct
36 Correct 169 ms 27364 KB Output is correct
37 Correct 5 ms 7404 KB Output is correct
38 Correct 154 ms 27004 KB Output is correct
39 Correct 150 ms 26476 KB Output is correct
40 Correct 160 ms 27108 KB Output is correct
41 Correct 169 ms 27620 KB Output is correct
42 Correct 145 ms 22448 KB Output is correct
43 Correct 170 ms 19052 KB Output is correct
44 Correct 172 ms 18668 KB Output is correct
45 Correct 177 ms 18668 KB Output is correct
46 Correct 179 ms 18668 KB Output is correct
47 Correct 157 ms 22764 KB Output is correct
48 Correct 148 ms 22508 KB Output is correct
49 Correct 156 ms 22764 KB Output is correct
50 Correct 153 ms 22764 KB Output is correct
51 Correct 157 ms 26604 KB Output is correct
52 Correct 154 ms 26604 KB Output is correct
53 Correct 127 ms 18144 KB Output is correct
54 Correct 128 ms 18156 KB Output is correct
55 Correct 170 ms 17516 KB Output is correct
56 Correct 170 ms 17516 KB Output is correct
57 Correct 173 ms 18668 KB Output is correct
58 Correct 176 ms 18540 KB Output is correct
59 Correct 179 ms 18540 KB Output is correct
60 Correct 170 ms 18924 KB Output is correct
61 Correct 153 ms 22892 KB Output is correct
62 Correct 149 ms 22896 KB Output is correct
63 Correct 148 ms 22764 KB Output is correct
64 Correct 159 ms 23148 KB Output is correct
65 Correct 192 ms 19180 KB Output is correct
66 Correct 188 ms 18796 KB Output is correct
67 Correct 182 ms 18412 KB Output is correct
68 Correct 122 ms 17260 KB Output is correct
69 Correct 122 ms 17260 KB Output is correct
70 Correct 160 ms 23308 KB Output is correct
71 Correct 154 ms 22764 KB Output is correct
72 Correct 5 ms 7404 KB Output is correct
73 Correct 14 ms 8172 KB Output is correct
74 Correct 14 ms 8172 KB Output is correct
75 Correct 5 ms 7404 KB Output is correct
76 Correct 5 ms 7404 KB Output is correct
77 Correct 15 ms 8684 KB Output is correct
78 Correct 14 ms 8300 KB Output is correct
79 Correct 12 ms 8172 KB Output is correct
80 Correct 13 ms 8300 KB Output is correct
81 Correct 5 ms 7404 KB Output is correct
82 Correct 5 ms 7404 KB Output is correct
83 Correct 5 ms 7404 KB Output is correct
84 Correct 5 ms 7404 KB Output is correct
85 Correct 5 ms 7404 KB Output is correct
86 Correct 45 ms 10220 KB Output is correct
87 Correct 45 ms 10220 KB Output is correct
88 Correct 45 ms 10220 KB Output is correct
89 Correct 17 ms 8684 KB Output is correct
90 Correct 16 ms 8300 KB Output is correct
91 Correct 50 ms 10476 KB Output is correct
92 Correct 54 ms 10476 KB Output is correct
93 Correct 5 ms 7404 KB Output is correct
94 Correct 167 ms 27388 KB Output is correct
95 Correct 155 ms 26984 KB Output is correct
96 Correct 153 ms 26392 KB Output is correct
97 Correct 159 ms 26980 KB Output is correct
98 Correct 166 ms 27620 KB Output is correct
99 Correct 177 ms 18668 KB Output is correct
100 Correct 177 ms 18668 KB Output is correct
101 Correct 176 ms 18668 KB Output is correct
102 Correct 170 ms 19052 KB Output is correct
103 Correct 152 ms 22636 KB Output is correct
104 Correct 151 ms 22892 KB Output is correct
105 Correct 153 ms 22508 KB Output is correct
106 Correct 156 ms 22892 KB Output is correct
107 Correct 156 ms 22740 KB Output is correct
108 Correct 149 ms 26600 KB Output is correct
109 Correct 153 ms 26600 KB Output is correct
110 Correct 127 ms 18284 KB Output is correct
111 Correct 127 ms 18284 KB Output is correct
112 Correct 168 ms 17644 KB Output is correct
113 Correct 166 ms 17644 KB Output is correct