oj.uz

Submission #873902

# Submission time Handle Problem Language Result Execution time Memory
873902 2023-11-16T02:37:37 Z noiaint Railway (BOI17_railway) C++17
100 / 100
 104 ms 28380 KB 
#include <bits/stdc++.h>

using namespace std;

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 1e5 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

int n, q, k;
vector<pair<int, int> > adj[N];
int fin[N];
int h[N], par[N][lg + 1];
int par_id[N];
int d[N];
vector<int> ans;
int timer = 0;

void dfs(int u, int p) {
	fin[u] = ++timer;
	par[u][0] = p;
	for (int i = 1; i <= lg; ++i) par[u][i] = par[par[u][i - 1]][i - 1];
	for (auto [v, id] : adj[u]) if (v != p) {
		h[v] = h[u] + 1;
		par_id[v] = id;
		dfs(v, u);
	}
}
int lca(int u, int v) {
	if (h[u] < h[v]) swap(u, v);
	for (int i = lg; i >= 0; --i) if (h[par[u][i]] >= h[v]) u = par[u][i];
	if (u == v) return u;
	for (int i = lg; i >= 0; --i) if (par[u][i] != par[v][i]) {
		u = par[u][i];
		v = par[v][i];
	}
	return par[u][0];
}

void dfs_dis(int u, int p) {
	for (auto [v, id] : adj[u]) if (v != p) {
		dfs_dis(v, u);
		d[u] += d[v];
		if (d[v] >= 2 * k) ans.push_back(par_id[v]);
	}
}

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

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

    cin >> n >> q >> k;
    for (int i = 1; i < n; ++i) {
    	int u, v;
    	cin >> u >> v;
    	adj[u].emplace_back(v, i);
    	adj[v].emplace_back(u, i);
    }

    h[0] = -1;
    dfs(1, 0);

    while (q--) {
    	vector<int> node;
    	int num;
    	cin >> num;
    	for (int i = 0; i < num; ++i) {
    		int x;
    		cin >> x;
    		node.push_back(x);
    	}
    	if (num == 1) continue;

    	sort(all(node), [&] (int x, int y) {
    		return fin[x] < fin[y];
    	});

    	node.push_back(node.front());

    	for (int i = 0; i < num; ++i) {
    		d[node[i]]++;
    		d[node[i + 1]]++;
    		d[lca(node[i], node[i + 1])] -= 2;
    	}
    }

    dfs_dis(1, 0);

    sort(all(ans));
    cout << (int) ans.size() << '\n';
    for (int i : ans) cout << i << ' ';

    return 0;
}

/*
6 3 2
1 3
2 3
3 4
6 4
4 5
4 1 3 2 5
2 6 3
2 3 2

2
2 3
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5980 KB Output is correct
2 Correct 5 ms 6492 KB Output is correct
3 Correct 5 ms 6492 KB Output is correct
4 Correct 1 ms 5980 KB Output is correct
5 Correct 1 ms 5980 KB Output is correct
6 Correct 6 ms 7004 KB Output is correct
7 Correct 5 ms 6748 KB Output is correct
8 Correct 5 ms 6600 KB Output is correct
9 Correct 5 ms 6492 KB Output is correct
10 Correct 2 ms 5976 KB Output is correct
11 Correct 2 ms 5980 KB Output is correct
12 Correct 1 ms 5980 KB Output is correct
13 Correct 1 ms 5980 KB Output is correct
14 Correct 1 ms 5980 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5980 KB Output is correct
2 Correct 5 ms 6492 KB Output is correct
3 Correct 5 ms 6492 KB Output is correct
4 Correct 1 ms 5980 KB Output is correct
5 Correct 1 ms 5980 KB Output is correct
6 Correct 6 ms 7004 KB Output is correct
7 Correct 5 ms 6748 KB Output is correct
8 Correct 5 ms 6600 KB Output is correct
9 Correct 5 ms 6492 KB Output is correct
10 Correct 2 ms 5976 KB Output is correct
11 Correct 2 ms 5980 KB Output is correct
12 Correct 1 ms 5980 KB Output is correct
13 Correct 1 ms 5980 KB Output is correct
14 Correct 1 ms 5980 KB Output is correct
15 Correct 29 ms 7004 KB Output is correct
16 Correct 32 ms 7256 KB Output is correct
17 Correct 27 ms 7256 KB Output is correct
18 Correct 6 ms 7000 KB Output is correct
19 Correct 6 ms 6748 KB Output is correct
20 Correct 32 ms 7000 KB Output is correct
21 Correct 33 ms 7004 KB Output is correct
22 Correct 2 ms 5980 KB Output is correct
23 Correct 5 ms 6492 KB Output is correct
24 Correct 5 ms 6492 KB Output is correct
25 Correct 1 ms 5980 KB Output is correct
26 Correct 2 ms 6236 KB Output is correct
27 Correct 7 ms 7144 KB Output is correct
28 Correct 5 ms 6748 KB Output is correct
29 Correct 5 ms 6492 KB Output is correct
30 Correct 5 ms 6504 KB Output is correct
31 Correct 1 ms 5980 KB Output is correct
32 Correct 2 ms 6236 KB Output is correct
33 Correct 1 ms 5980 KB Output is correct
34 Correct 2 ms 5980 KB Output is correct
35 Correct 1 ms 5980 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 28008 KB Output is correct
2 Correct 2 ms 5980 KB Output is correct
3 Correct 90 ms 27732 KB Output is correct
4 Correct 77 ms 27220 KB Output is correct
5 Correct 85 ms 27988 KB Output is correct
6 Correct 104 ms 28380 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 23888 KB Output is correct
2 Correct 91 ms 20212 KB Output is correct
3 Correct 83 ms 20052 KB Output is correct
4 Correct 83 ms 20048 KB Output is correct
5 Correct 87 ms 20296 KB Output is correct
6 Correct 73 ms 24052 KB Output is correct
7 Correct 72 ms 23760 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 23888 KB Output is correct
2 Correct 91 ms 20212 KB Output is correct
3 Correct 83 ms 20052 KB Output is correct
4 Correct 83 ms 20048 KB Output is correct
5 Correct 87 ms 20296 KB Output is correct
6 Correct 73 ms 24052 KB Output is correct
7 Correct 72 ms 23760 KB Output is correct
8 Correct 77 ms 23892 KB Output is correct
9 Correct 77 ms 23952 KB Output is correct
10 Correct 77 ms 28116 KB Output is correct
11 Correct 78 ms 28036 KB Output is correct
12 Correct 64 ms 19624 KB Output is correct
13 Correct 64 ms 19852 KB Output is correct
14 Correct 89 ms 20052 KB Output is correct
15 Correct 78 ms 19984 KB Output is correct
16 Correct 81 ms 20052 KB Output is correct
17 Correct 85 ms 20048 KB Output is correct
18 Correct 85 ms 20048 KB Output is correct
19 Correct 77 ms 20300 KB Output is correct
20 Correct 73 ms 24048 KB Output is correct
21 Correct 76 ms 24180 KB Output is correct
22 Correct 75 ms 24080 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5980 KB Output is correct
2 Correct 5 ms 6492 KB Output is correct
3 Correct 5 ms 6492 KB Output is correct
4 Correct 1 ms 5980 KB Output is correct
5 Correct 1 ms 5980 KB Output is correct
6 Correct 6 ms 7004 KB Output is correct
7 Correct 5 ms 6748 KB Output is correct
8 Correct 5 ms 6600 KB Output is correct
9 Correct 5 ms 6492 KB Output is correct
10 Correct 2 ms 5976 KB Output is correct
11 Correct 2 ms 5980 KB Output is correct
12 Correct 1 ms 5980 KB Output is correct
13 Correct 1 ms 5980 KB Output is correct
14 Correct 1 ms 5980 KB Output is correct
15 Correct 29 ms 7004 KB Output is correct
16 Correct 32 ms 7256 KB Output is correct
17 Correct 27 ms 7256 KB Output is correct
18 Correct 6 ms 7000 KB Output is correct
19 Correct 6 ms 6748 KB Output is correct
20 Correct 32 ms 7000 KB Output is correct
21 Correct 33 ms 7004 KB Output is correct
22 Correct 2 ms 5980 KB Output is correct
23 Correct 5 ms 6492 KB Output is correct
24 Correct 5 ms 6492 KB Output is correct
25 Correct 1 ms 5980 KB Output is correct
26 Correct 2 ms 6236 KB Output is correct
27 Correct 7 ms 7144 KB Output is correct
28 Correct 5 ms 6748 KB Output is correct
29 Correct 5 ms 6492 KB Output is correct
30 Correct 5 ms 6504 KB Output is correct
31 Correct 1 ms 5980 KB Output is correct
32 Correct 2 ms 6236 KB Output is correct
33 Correct 1 ms 5980 KB Output is correct
34 Correct 2 ms 5980 KB Output is correct
35 Correct 1 ms 5980 KB Output is correct
36 Correct 86 ms 28008 KB Output is correct
37 Correct 2 ms 5980 KB Output is correct
38 Correct 90 ms 27732 KB Output is correct
39 Correct 77 ms 27220 KB Output is correct
40 Correct 85 ms 27988 KB Output is correct
41 Correct 104 ms 28380 KB Output is correct
42 Correct 74 ms 23888 KB Output is correct
43 Correct 91 ms 20212 KB Output is correct
44 Correct 83 ms 20052 KB Output is correct
45 Correct 83 ms 20048 KB Output is correct
46 Correct 87 ms 20296 KB Output is correct
47 Correct 73 ms 24052 KB Output is correct
48 Correct 72 ms 23760 KB Output is correct
49 Correct 77 ms 23892 KB Output is correct
50 Correct 77 ms 23952 KB Output is correct
51 Correct 77 ms 28116 KB Output is correct
52 Correct 78 ms 28036 KB Output is correct
53 Correct 64 ms 19624 KB Output is correct
54 Correct 64 ms 19852 KB Output is correct
55 Correct 89 ms 20052 KB Output is correct
56 Correct 78 ms 19984 KB Output is correct
57 Correct 81 ms 20052 KB Output is correct
58 Correct 85 ms 20048 KB Output is correct
59 Correct 85 ms 20048 KB Output is correct
60 Correct 77 ms 20300 KB Output is correct
61 Correct 73 ms 24048 KB Output is correct
62 Correct 76 ms 24180 KB Output is correct
63 Correct 75 ms 24080 KB Output is correct
64 Correct 79 ms 24144 KB Output is correct
65 Correct 87 ms 20048 KB Output is correct
66 Correct 87 ms 19876 KB Output is correct
67 Correct 94 ms 19796 KB Output is correct
68 Correct 57 ms 19540 KB Output is correct
69 Correct 54 ms 19756 KB Output is correct
70 Correct 81 ms 24272 KB Output is correct
71 Correct 79 ms 23636 KB Output is correct
72 Correct 1 ms 5980 KB Output is correct
73 Correct 5 ms 6492 KB Output is correct
74 Correct 5 ms 6492 KB Output is correct
75 Correct 1 ms 5976 KB Output is correct
76 Correct 2 ms 5976 KB Output is correct
77 Correct 6 ms 7024 KB Output is correct
78 Correct 6 ms 6748 KB Output is correct
79 Correct 5 ms 6492 KB Output is correct
80 Correct 5 ms 6688 KB Output is correct
81 Correct 1 ms 5980 KB Output is correct
82 Correct 1 ms 6232 KB Output is correct
83 Correct 1 ms 5980 KB Output is correct
84 Correct 1 ms 5980 KB Output is correct
85 Correct 1 ms 5980 KB Output is correct
86 Correct 27 ms 7004 KB Output is correct
87 Correct 30 ms 7004 KB Output is correct
88 Correct 27 ms 7004 KB Output is correct
89 Correct 6 ms 7004 KB Output is correct
90 Correct 7 ms 6748 KB Output is correct
91 Correct 32 ms 7132 KB Output is correct
92 Correct 33 ms 7008 KB Output is correct
93 Correct 1 ms 5976 KB Output is correct
94 Correct 81 ms 28104 KB Output is correct
95 Correct 90 ms 27852 KB Output is correct
96 Correct 76 ms 27232 KB Output is correct
97 Correct 82 ms 28112 KB Output is correct
98 Correct 91 ms 28344 KB Output is correct
99 Correct 81 ms 20052 KB Output is correct
100 Correct 79 ms 19844 KB Output is correct
101 Correct 89 ms 20308 KB Output is correct
102 Correct 79 ms 20308 KB Output is correct
103 Correct 73 ms 23916 KB Output is correct
104 Correct 75 ms 24152 KB Output is correct
105 Correct 73 ms 23892 KB Output is correct
106 Correct 83 ms 24040 KB Output is correct
107 Correct 74 ms 23892 KB Output is correct
108 Correct 78 ms 28208 KB Output is correct
109 Correct 76 ms 28164 KB Output is correct
110 Correct 75 ms 19792 KB Output is correct
111 Correct 63 ms 19784 KB Output is correct
112 Correct 79 ms 19796 KB Output is correct
113 Correct 79 ms 19796 KB Output is correct