oj.uz

Submission #896534

# Submission time Handle Problem Language Result Execution time Memory
896534 2024-01-01T15:55:39 Z OAleksa Railway (BOI17_railway) C++14
100 / 100
 197 ms 62468 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
const int N = 1e5 + 69;
const int lg = 17;
int up[N][lg];
int n, m, k, tin[N], tout[N], timer;
vector<int> g[N];
set<int> st[N], er[N];
set<tuple<int, int, int>> edges;
vector<int> ans;
bool anc(int v, int u) {
	return tin[v] <= tin[u] && tout[v] >= tout[u];
}
int lca(int a, int b) {
	if (anc(a, b))
		return a;
	else if (anc(b, a))
		return b;
	for (int i = lg - 1;i >= 0;i--) {
		if (!anc(up[a][i], b) && up[a][i] > 0)
			a = up[a][i];
	}
	return up[a][0];
}
void dfs(int v, int p) {
	tin[v] = ++timer;
	up[v][0] = p;
	for (int i = 1;i < lg;i++)
		up[v][i] = up[up[v][i - 1]][i - 1];
	for (auto u : g[v]) {
		if (u == p)
			continue;
		dfs(u, v);
	}
	tout[v] = timer;
}
void solve(int v, int p) {
	for (auto u : g[v]) {
		if (u == p)
			continue;
		solve(u, v);
		if (st[v].size() < st[u].size())
			swap(st[u], st[v]);
		for (auto x : st[u])
			st[v].insert(x);
	}
	for (auto u : er[v]) {
		assert(st[v].count(u) > 0);
		st[v].erase(u);
	}
	if (p != 0) {
		int a = v, b = p;
		if (a > b)
			swap(a, b);
		if (st[v].size() >= k) {
			auto u = *edges.lower_bound({a, b, -1});
			ans.push_back(get<2>(u));
		}
	}
}
signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
    cin >> n >> m >> k;
    for (int i = 1;i <= n - 1;i++) {
    	int a, b;
    	cin >> a >> b;
    	g[a].push_back(b);
    	g[b].push_back(a);
    	if (a > b)	
    		swap(a, b);
    	edges.insert({a, b, i});
    }
    dfs(1, 0);
    for (int i = 1;i <= m;i++) {
    	int s;
    	cin >> s;
    	vector<int> y(s);
    	for (int j = 0;j < s;j++)
    		cin >> y[j];
    	int lc = y[0];
    	for (int j = 1; j < s;j++)
    		lc = lca(lc, y[j]);
    	er[lc].insert(i);
    	for (int j = 0;j < s;j++) {
    		if (y[j] != lc)
    			st[y[j]].insert(i);
    	}
    }
    solve(1, 0);
    sort(ans.begin(), ans.end());
    cout << ans.size() << '\n';
    for (auto u : ans)
    	cout << u << " ";
  }
  return 0;
}

Compilation message

railway.cpp: In function 'void solve(long long int, long long int)':
railway.cpp:58:20: warning: comparison of integer expressions of different signedness: 'std::set<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   58 |   if (st[v].size() >= k) {
      |       ~~~~~~~~~~~~~^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 8 ms 18288 KB Output is correct
3 Correct 7 ms 18100 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 4 ms 14940 KB Output is correct
6 Correct 9 ms 19036 KB Output is correct
7 Correct 8 ms 18268 KB Output is correct
8 Correct 10 ms 18268 KB Output is correct
9 Correct 8 ms 18268 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 3 ms 15452 KB Output is correct
13 Correct 3 ms 14940 KB Output is correct
14 Correct 3 ms 14940 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 8 ms 18288 KB Output is correct
3 Correct 7 ms 18100 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 4 ms 14940 KB Output is correct
6 Correct 9 ms 19036 KB Output is correct
7 Correct 8 ms 18268 KB Output is correct
8 Correct 10 ms 18268 KB Output is correct
9 Correct 8 ms 18268 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 3 ms 15452 KB Output is correct
13 Correct 3 ms 14940 KB Output is correct
14 Correct 3 ms 14940 KB Output is correct
15 Correct 31 ms 23992 KB Output is correct
16 Correct 32 ms 24156 KB Output is correct
17 Correct 32 ms 24184 KB Output is correct
18 Correct 9 ms 19036 KB Output is correct
19 Correct 9 ms 18472 KB Output is correct
20 Correct 31 ms 23488 KB Output is correct
21 Correct 31 ms 23120 KB Output is correct
22 Correct 3 ms 14940 KB Output is correct
23 Correct 8 ms 18076 KB Output is correct
24 Correct 8 ms 18268 KB Output is correct
25 Correct 3 ms 14940 KB Output is correct
26 Correct 3 ms 14940 KB Output is correct
27 Correct 9 ms 19036 KB Output is correct
28 Correct 7 ms 18268 KB Output is correct
29 Correct 7 ms 18264 KB Output is correct
30 Correct 10 ms 18268 KB Output is correct
31 Correct 3 ms 14768 KB Output is correct
32 Correct 4 ms 15192 KB Output is correct
33 Correct 3 ms 14940 KB Output is correct
34 Correct 3 ms 14940 KB Output is correct
35 Correct 3 ms 14936 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 57264 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 123 ms 58288 KB Output is correct
4 Correct 106 ms 57680 KB Output is correct
5 Correct 111 ms 57856 KB Output is correct
6 Correct 117 ms 60104 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 52048 KB Output is correct
2 Correct 146 ms 48884 KB Output is correct
3 Correct 164 ms 54868 KB Output is correct
4 Correct 160 ms 54576 KB Output is correct
5 Correct 171 ms 54860 KB Output is correct
6 Correct 143 ms 52480 KB Output is correct
7 Correct 127 ms 51944 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 52048 KB Output is correct
2 Correct 146 ms 48884 KB Output is correct
3 Correct 164 ms 54868 KB Output is correct
4 Correct 160 ms 54576 KB Output is correct
5 Correct 171 ms 54860 KB Output is correct
6 Correct 143 ms 52480 KB Output is correct
7 Correct 127 ms 51944 KB Output is correct
8 Correct 113 ms 50772 KB Output is correct
9 Correct 125 ms 50548 KB Output is correct
10 Correct 97 ms 56516 KB Output is correct
11 Correct 96 ms 56516 KB Output is correct
12 Correct 77 ms 41812 KB Output is correct
13 Correct 75 ms 41808 KB Output is correct
14 Correct 127 ms 47736 KB Output is correct
15 Correct 121 ms 47956 KB Output is correct
16 Correct 165 ms 55804 KB Output is correct
17 Correct 164 ms 56288 KB Output is correct
18 Correct 166 ms 54484 KB Output is correct
19 Correct 157 ms 49520 KB Output is correct
20 Correct 129 ms 52564 KB Output is correct
21 Correct 133 ms 52688 KB Output is correct
22 Correct 139 ms 52948 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 8 ms 18288 KB Output is correct
3 Correct 7 ms 18100 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 4 ms 14940 KB Output is correct
6 Correct 9 ms 19036 KB Output is correct
7 Correct 8 ms 18268 KB Output is correct
8 Correct 10 ms 18268 KB Output is correct
9 Correct 8 ms 18268 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 3 ms 15452 KB Output is correct
13 Correct 3 ms 14940 KB Output is correct
14 Correct 3 ms 14940 KB Output is correct
15 Correct 31 ms 23992 KB Output is correct
16 Correct 32 ms 24156 KB Output is correct
17 Correct 32 ms 24184 KB Output is correct
18 Correct 9 ms 19036 KB Output is correct
19 Correct 9 ms 18472 KB Output is correct
20 Correct 31 ms 23488 KB Output is correct
21 Correct 31 ms 23120 KB Output is correct
22 Correct 3 ms 14940 KB Output is correct
23 Correct 8 ms 18076 KB Output is correct
24 Correct 8 ms 18268 KB Output is correct
25 Correct 3 ms 14940 KB Output is correct
26 Correct 3 ms 14940 KB Output is correct
27 Correct 9 ms 19036 KB Output is correct
28 Correct 7 ms 18268 KB Output is correct
29 Correct 7 ms 18264 KB Output is correct
30 Correct 10 ms 18268 KB Output is correct
31 Correct 3 ms 14768 KB Output is correct
32 Correct 4 ms 15192 KB Output is correct
33 Correct 3 ms 14940 KB Output is correct
34 Correct 3 ms 14940 KB Output is correct
35 Correct 3 ms 14936 KB Output is correct
36 Correct 124 ms 57264 KB Output is correct
37 Correct 3 ms 14940 KB Output is correct
38 Correct 123 ms 58288 KB Output is correct
39 Correct 106 ms 57680 KB Output is correct
40 Correct 111 ms 57856 KB Output is correct
41 Correct 117 ms 60104 KB Output is correct
42 Correct 132 ms 52048 KB Output is correct
43 Correct 146 ms 48884 KB Output is correct
44 Correct 164 ms 54868 KB Output is correct
45 Correct 160 ms 54576 KB Output is correct
46 Correct 171 ms 54860 KB Output is correct
47 Correct 143 ms 52480 KB Output is correct
48 Correct 127 ms 51944 KB Output is correct
49 Correct 113 ms 50772 KB Output is correct
50 Correct 125 ms 50548 KB Output is correct
51 Correct 97 ms 56516 KB Output is correct
52 Correct 96 ms 56516 KB Output is correct
53 Correct 77 ms 41812 KB Output is correct
54 Correct 75 ms 41808 KB Output is correct
55 Correct 127 ms 47736 KB Output is correct
56 Correct 121 ms 47956 KB Output is correct
57 Correct 165 ms 55804 KB Output is correct
58 Correct 164 ms 56288 KB Output is correct
59 Correct 166 ms 54484 KB Output is correct
60 Correct 157 ms 49520 KB Output is correct
61 Correct 129 ms 52564 KB Output is correct
62 Correct 133 ms 52688 KB Output is correct
63 Correct 139 ms 52948 KB Output is correct
64 Correct 120 ms 52684 KB Output is correct
65 Correct 197 ms 62468 KB Output is correct
66 Correct 156 ms 56400 KB Output is correct
67 Correct 134 ms 52052 KB Output is correct
68 Correct 71 ms 41300 KB Output is correct
69 Correct 70 ms 41300 KB Output is correct
70 Correct 131 ms 54216 KB Output is correct
71 Correct 108 ms 51688 KB Output is correct
72 Correct 3 ms 14940 KB Output is correct
73 Correct 7 ms 18268 KB Output is correct
74 Correct 8 ms 18064 KB Output is correct
75 Correct 3 ms 14784 KB Output is correct
76 Correct 3 ms 14936 KB Output is correct
77 Correct 9 ms 19192 KB Output is correct
78 Correct 7 ms 18268 KB Output is correct
79 Correct 9 ms 18268 KB Output is correct
80 Correct 8 ms 18268 KB Output is correct
81 Correct 3 ms 15004 KB Output is correct
82 Correct 3 ms 14940 KB Output is correct
83 Correct 2 ms 14940 KB Output is correct
84 Correct 5 ms 14940 KB Output is correct
85 Correct 3 ms 14940 KB Output is correct
86 Correct 31 ms 24136 KB Output is correct
87 Correct 32 ms 24152 KB Output is correct
88 Correct 41 ms 24408 KB Output is correct
89 Correct 9 ms 19032 KB Output is correct
90 Correct 8 ms 18488 KB Output is correct
91 Correct 30 ms 23388 KB Output is correct
92 Correct 31 ms 23384 KB Output is correct
93 Correct 3 ms 14940 KB Output is correct
94 Correct 124 ms 58656 KB Output is correct
95 Correct 120 ms 58448 KB Output is correct
96 Correct 113 ms 57680 KB Output is correct
97 Correct 103 ms 57596 KB Output is correct
98 Correct 117 ms 60292 KB Output is correct
99 Correct 176 ms 59556 KB Output is correct
100 Correct 162 ms 56660 KB Output is correct
101 Correct 164 ms 56972 KB Output is correct
102 Correct 144 ms 50444 KB Output is correct
103 Correct 130 ms 53588 KB Output is correct
104 Correct 130 ms 54092 KB Output is correct
105 Correct 126 ms 53332 KB Output is correct
106 Correct 114 ms 51976 KB Output is correct
107 Correct 111 ms 51792 KB Output is correct
108 Correct 97 ms 57540 KB Output is correct
109 Correct 98 ms 57544 KB Output is correct
110 Correct 75 ms 42832 KB Output is correct
111 Correct 82 ms 43040 KB Output is correct
112 Correct 122 ms 48596 KB Output is correct
113 Correct 126 ms 48584 KB Output is correct