oj.uz

답안 #513432

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
513432 2022-01-17T06:16:39 Z Aditya_A_garwal Railway (BOI17_railway) C++17
100 / 100
 105 ms 24124 KB 
// Krishnaya vaasudevaya
// Devaki nandanayacha
// Nanda gopakumaraya
// Govindaya namoh namaha
// Jay ganeshji, Jay Guruji, Jay Ram-bhakt Hanumanji

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

#define ff first
#define ss second

#define pb emplace_back
#define eb emplace

// Competion only
using namespace std;
using namespace __gnu_pbds;

using ll = long long;
using ull = unsigned ll;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;

const int inf = 1e9 + 7;
const ll llinf = 1e18 + 7;

constexpr ll mod = 1e9 + 7;

const vector<pii> dirs4 = {{0, -1}, {0, 1}, {-1, 0}, {1, 0}};
const vector<pii> dirs8 = {{-1, -1}, {-1, 0}, {-1, 1}, {0, -1}, {0, 1}, {1, -1}, {1, 0}, {1, 1}};

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

ll fastPow(ll a, ll b)
{
	ll res = 1;
	while(b) {
		if(b & 1)
			res *= a;
		a *= a, b >>= 1;
	}
	return res;
}

ll fastPow(ll a, ll b, ll m)
{
	ll res = 1;
	a %= m;
	while(b) {
		if(b & 1)
			(res *= a) %= m;
		(a *= a) %= m, b >>= 1;
	}
	return res;
}

ll modinv(ll x, ll m)
{
	return fastPow(x, m - 2, m);
}

ll moddiv(ll numerator, ll denominator, ll m) {
	return numerator * modinv(denominator, m);
}

template<typename T>
inline void maximize(T &trg, T src) {
	trg = max(trg, src);
}

template<typename T>
inline void minimize(T &trg, T src) {
	trg = min(trg, src);
}

template<typename T>
constexpr ostream &operator<<(ostream &stream, const vector<T> &other) {
	stream << '[';
	size_t n = other.size();

	if(n > 0) {
		for(size_t i = 0; i < n - 1; i++)
			stream << other[i] << ", ";
		stream << other[n - 1];
	}

	return stream << ']';
}

template<typename T>
constexpr ostream &operator<<(ostream &stream, const set<T> &other) {
	stream << '{';

	size_t n = other.size();

	if(n > 0) {
		auto it = other.begin();
		for(size_t i = 0; i < n-1; i++)
			stream << *it << ", ", ++it;
		stream << *it;
	}

	return stream << '}';
}

template<typename T>
constexpr ostream &operator<<(ostream &stream, const multiset<T> &other) {
	stream << '{';

	size_t n = other.size();

	if(n > 0) {
		auto it = other.begin();
		for(size_t i = 0; i < n-1; i++)
			stream << *it << ", ", ++it;
		stream << *it;
	}

	return stream << '}';
}

template<typename T>
constexpr ostream &operator<<(ostream &stream, const ordered_set<T> &other) {
	stream << '{';

	size_t n = other.size();

	if(n > 0) {
		auto it = other.begin();
		for(size_t i = 0; i < n-1; i++)
			stream << *it << ", ", ++it;
		stream << *it;
	}

	return stream << '}';
}

template<typename T1, typename T2>
constexpr ostream &operator<<(ostream &stream, const map<T1, T2> &other) {
	stream << '{';

	size_t n = other.size();

	if(n > 0) {
		auto it = other.begin();
		for(size_t i = 0; i < n-1; i++)
			stream << (*it).first << ':' << (*it).second << ", ", ++it;
		stream << (*it).first << ':' << (*it).second;
	}

	return stream << '}';
}

template<typename T1, typename T2>
constexpr ostream &operator<<(ostream &stream, const multimap<T1, T2> &other) {
	stream << '{';

	size_t n = other.size();

	if(n > 0) {
		auto it = other.begin();
		for(size_t i = 0; i < n-1; i++)
			stream << (*it).first << ':' << (*it).second << ", ", ++it;
		stream << (*it).first << ':' << (*it).second;
	}

	return stream << '}';
}

template<typename T1, typename T2>
constexpr ostream &operator<<(ostream &stream, const unordered_map<T1, T2> &other) {
	stream << '{';

	size_t n = other.size();

	if(n > 0) {
		auto it = other.begin();
		for(size_t i = 0; i < n-1; i++)
			stream << (*it).first << ':' << (*it).second << ", ", ++it;
		stream << (*it).first << ':' << (*it).second;
	}

	return stream << '}';
}

template<typename T1, typename T2>
constexpr ostream &operator<<(ostream &stream, const pair<T1, T2> &other) {
	return stream << '(' << other.first << ", " << other.second << ')';
}

template<typename T>
istream &operator>>(istream &stream, vector<T> &other) {
	for(auto &e : other)
		stream >> e;

	return stream;
}

template<typename T1, typename T2>
istream &operator>>(istream &stream, pair<T1, T2> &other) {
	stream >> other.first >> other.second;
	return stream;
}

template<size_t I = 0, typename ...T>
ostream &operator<<(ostream &stream, const tuple<T...> &other) {

	if constexpr(I == 0)
		stream << '(';

	stream << get<I>(other);

	if constexpr(I < sizeof...(T) - 1) {
		stream << ", ";
		return operator<<<I + 1>(stream, other);
	}
	return stream << ')';
}

constexpr int mxn = 100'010;
constexpr int mxlog = 20;

int n, q, k;

int timer = 0;

vii adj[mxn];
int pre[mxn][mxlog];

int dep[mxn]{};

int tin[mxn];
int qry[mxn];

int freq[mxn]{};
vi res;

bool comp(const int &a, const int &b) {
	return tin[a] < tin[b];
}

void dfs1(int cur, int prv) {

	tin[cur] = timer++;

	pre[cur][0] = prv;
	for(int i = 1; i < mxlog; i++)
		pre[cur][i] = pre[pre[cur][i - 1]][i - 1];

	for(auto &[nxt, i]: adj[cur]) {
		if(nxt == prv)
			continue;
		dep[nxt] = 1 + dep[cur];
		dfs1(nxt, cur);
	}
}

void dfs2(int cur, int prv) {

	for(auto &[nxt, i] : adj[cur]) {
		if(nxt == prv)
			continue;

		dfs2(nxt, cur);
		freq[cur] += freq[nxt];

		freq[nxt] /= 2;
		if(freq[nxt] >= k)
			res.pb(i);
	}

	assert(freq[cur] % 2 == 0);
}

int ances(int u, int d) {

	for(int i = mxlog - 1; i >= 0; i--) {
		if(d & (1 << i))
			u = pre[u][i];
	}

	return u;
}

int LCA(int u, int v) {

	if(dep[u] > dep[v])
		swap(u, v);

	v = ances(v, dep[v] - dep[u]);

	if(u == v)
		return u;

	for(int i = mxlog - 1; i >= 0; i--) {
		if(pre[u][i] != pre[v][i]) {
			u = pre[u][i];
			v = pre[v][i];
		}
	}

	assert(pre[u][0] == pre[v][0]);
	return pre[u][0];
}

void query() {

	int m; cin >> m;

	for(int i = 0; i < m; i++) {
		cin >> qry[i], --qry[i];
	}

	sort(qry, qry + m, comp);
	qry[m] = qry[0];

	for(int i = 0; i < m; i++) {

		int &u = qry[i];
		int &v = qry[i + 1];
		int mid = LCA(u, v);

		++freq[u];
		++freq[v];
		freq[mid] -= 2;
	}
}

inline void solve() {

	cin >> n >> q >> k;

	for(int i = 1, u, v; i < n; i++) {

		cin >> u >> v, --u, --v;

		if(u > v)
			swap(u, v);

		adj[u].pb(v, i);
		adj[v].pb(u, i);

		// idx[{u, v}] = i;
	}

	dfs1(0, 0);

	while(q--)
		query();

	dfs2(0, 0);

	sort(res.begin(), res.end());

	cout << res.size() << '\n';
	for(auto &e : res)
		cout << e << ' ';
	cout << '\n';
}

int main(int argc, char *argv[]) {
// #ifndef ONLINE_JUDGE
// 	freopen("input.txt", "r", stdin);
// 	freopen("output.txt",  "w", stdout);
// #endif

	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

	solve();

	return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 6 ms 4044 KB Output is correct
3 Correct 6 ms 4044 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 1 ms 2636 KB Output is correct
6 Correct 6 ms 4428 KB Output is correct
7 Correct 6 ms 4080 KB Output is correct
8 Correct 5 ms 4076 KB Output is correct
9 Correct 6 ms 4060 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2664 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 6 ms 4044 KB Output is correct
3 Correct 6 ms 4044 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 1 ms 2636 KB Output is correct
6 Correct 6 ms 4428 KB Output is correct
7 Correct 6 ms 4080 KB Output is correct
8 Correct 5 ms 4076 KB Output is correct
9 Correct 6 ms 4060 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2664 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 19 ms 4424 KB Output is correct
16 Correct 20 ms 4428 KB Output is correct
17 Correct 20 ms 4460 KB Output is correct
18 Correct 7 ms 4348 KB Output is correct
19 Correct 7 ms 4092 KB Output is correct
20 Correct 19 ms 4508 KB Output is correct
21 Correct 22 ms 4556 KB Output is correct
22 Correct 2 ms 2636 KB Output is correct
23 Correct 5 ms 4044 KB Output is correct
24 Correct 6 ms 3960 KB Output is correct
25 Correct 1 ms 2636 KB Output is correct
26 Correct 1 ms 2636 KB Output is correct
27 Correct 6 ms 4428 KB Output is correct
28 Correct 7 ms 4136 KB Output is correct
29 Correct 5 ms 4044 KB Output is correct
30 Correct 5 ms 4044 KB Output is correct
31 Correct 2 ms 2636 KB Output is correct
32 Correct 1 ms 2636 KB Output is correct
33 Correct 1 ms 2636 KB Output is correct
34 Correct 1 ms 2684 KB Output is correct
35 Correct 2 ms 2672 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 85 ms 21884 KB Output is correct
2 Correct 1 ms 2636 KB Output is correct
3 Correct 93 ms 21624 KB Output is correct
4 Correct 89 ms 21128 KB Output is correct
5 Correct 104 ms 21900 KB Output is correct
6 Correct 78 ms 22072 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 18320 KB Output is correct
2 Correct 76 ms 15692 KB Output is correct
3 Correct 100 ms 15400 KB Output is correct
4 Correct 81 ms 15460 KB Output is correct
5 Correct 80 ms 15300 KB Output is correct
6 Correct 86 ms 18500 KB Output is correct
7 Correct 65 ms 18432 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 18320 KB Output is correct
2 Correct 76 ms 15692 KB Output is correct
3 Correct 100 ms 15400 KB Output is correct
4 Correct 81 ms 15460 KB Output is correct
5 Correct 80 ms 15300 KB Output is correct
6 Correct 86 ms 18500 KB Output is correct
7 Correct 65 ms 18432 KB Output is correct
8 Correct 72 ms 18524 KB Output is correct
9 Correct 79 ms 18548 KB Output is correct
10 Correct 77 ms 22076 KB Output is correct
11 Correct 76 ms 22056 KB Output is correct
12 Correct 59 ms 15564 KB Output is correct
13 Correct 72 ms 16884 KB Output is correct
14 Correct 88 ms 17032 KB Output is correct
15 Correct 78 ms 17108 KB Output is correct
16 Correct 88 ms 17192 KB Output is correct
17 Correct 90 ms 17168 KB Output is correct
18 Correct 83 ms 17184 KB Output is correct
19 Correct 80 ms 17508 KB Output is correct
20 Correct 68 ms 20500 KB Output is correct
21 Correct 70 ms 20640 KB Output is correct
22 Correct 69 ms 20548 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 6 ms 4044 KB Output is correct
3 Correct 6 ms 4044 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 1 ms 2636 KB Output is correct
6 Correct 6 ms 4428 KB Output is correct
7 Correct 6 ms 4080 KB Output is correct
8 Correct 5 ms 4076 KB Output is correct
9 Correct 6 ms 4060 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2664 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 19 ms 4424 KB Output is correct
16 Correct 20 ms 4428 KB Output is correct
17 Correct 20 ms 4460 KB Output is correct
18 Correct 7 ms 4348 KB Output is correct
19 Correct 7 ms 4092 KB Output is correct
20 Correct 19 ms 4508 KB Output is correct
21 Correct 22 ms 4556 KB Output is correct
22 Correct 2 ms 2636 KB Output is correct
23 Correct 5 ms 4044 KB Output is correct
24 Correct 6 ms 3960 KB Output is correct
25 Correct 1 ms 2636 KB Output is correct
26 Correct 1 ms 2636 KB Output is correct
27 Correct 6 ms 4428 KB Output is correct
28 Correct 7 ms 4136 KB Output is correct
29 Correct 5 ms 4044 KB Output is correct
30 Correct 5 ms 4044 KB Output is correct
31 Correct 2 ms 2636 KB Output is correct
32 Correct 1 ms 2636 KB Output is correct
33 Correct 1 ms 2636 KB Output is correct
34 Correct 1 ms 2684 KB Output is correct
35 Correct 2 ms 2672 KB Output is correct
36 Correct 85 ms 21884 KB Output is correct
37 Correct 1 ms 2636 KB Output is correct
38 Correct 93 ms 21624 KB Output is correct
39 Correct 89 ms 21128 KB Output is correct
40 Correct 104 ms 21900 KB Output is correct
41 Correct 78 ms 22072 KB Output is correct
42 Correct 64 ms 18320 KB Output is correct
43 Correct 76 ms 15692 KB Output is correct
44 Correct 100 ms 15400 KB Output is correct
45 Correct 81 ms 15460 KB Output is correct
46 Correct 80 ms 15300 KB Output is correct
47 Correct 86 ms 18500 KB Output is correct
48 Correct 65 ms 18432 KB Output is correct
49 Correct 72 ms 18524 KB Output is correct
50 Correct 79 ms 18548 KB Output is correct
51 Correct 77 ms 22076 KB Output is correct
52 Correct 76 ms 22056 KB Output is correct
53 Correct 59 ms 15564 KB Output is correct
54 Correct 72 ms 16884 KB Output is correct
55 Correct 88 ms 17032 KB Output is correct
56 Correct 78 ms 17108 KB Output is correct
57 Correct 88 ms 17192 KB Output is correct
58 Correct 90 ms 17168 KB Output is correct
59 Correct 83 ms 17184 KB Output is correct
60 Correct 80 ms 17508 KB Output is correct
61 Correct 68 ms 20500 KB Output is correct
62 Correct 70 ms 20640 KB Output is correct
63 Correct 69 ms 20548 KB Output is correct
64 Correct 73 ms 20488 KB Output is correct
65 Correct 89 ms 17092 KB Output is correct
66 Correct 93 ms 17052 KB Output is correct
67 Correct 101 ms 17112 KB Output is correct
68 Correct 61 ms 16836 KB Output is correct
69 Correct 56 ms 16808 KB Output is correct
70 Correct 81 ms 20848 KB Output is correct
71 Correct 71 ms 20164 KB Output is correct
72 Correct 2 ms 2636 KB Output is correct
73 Correct 6 ms 4044 KB Output is correct
74 Correct 6 ms 4044 KB Output is correct
75 Correct 1 ms 2636 KB Output is correct
76 Correct 1 ms 2636 KB Output is correct
77 Correct 6 ms 4348 KB Output is correct
78 Correct 6 ms 4044 KB Output is correct
79 Correct 6 ms 4000 KB Output is correct
80 Correct 7 ms 4100 KB Output is correct
81 Correct 1 ms 2636 KB Output is correct
82 Correct 2 ms 2636 KB Output is correct
83 Correct 1 ms 2636 KB Output is correct
84 Correct 1 ms 2636 KB Output is correct
85 Correct 1 ms 2636 KB Output is correct
86 Correct 19 ms 4320 KB Output is correct
87 Correct 20 ms 4440 KB Output is correct
88 Correct 24 ms 4536 KB Output is correct
89 Correct 7 ms 4428 KB Output is correct
90 Correct 6 ms 4044 KB Output is correct
91 Correct 19 ms 4536 KB Output is correct
92 Correct 21 ms 4456 KB Output is correct
93 Correct 2 ms 2636 KB Output is correct
94 Correct 90 ms 23736 KB Output is correct
95 Correct 80 ms 23420 KB Output is correct
96 Correct 75 ms 22832 KB Output is correct
97 Correct 105 ms 23712 KB Output is correct
98 Correct 81 ms 24124 KB Output is correct
99 Correct 81 ms 17180 KB Output is correct
100 Correct 88 ms 17148 KB Output is correct
101 Correct 96 ms 17168 KB Output is correct
102 Correct 78 ms 17480 KB Output is correct
103 Correct 73 ms 20248 KB Output is correct
104 Correct 69 ms 20660 KB Output is correct
105 Correct 70 ms 20264 KB Output is correct
106 Correct 73 ms 20424 KB Output is correct
107 Correct 71 ms 20284 KB Output is correct
108 Correct 79 ms 23840 KB Output is correct
109 Correct 82 ms 23820 KB Output is correct
110 Correct 59 ms 16900 KB Output is correct
111 Correct 60 ms 16896 KB Output is correct
112 Correct 81 ms 17012 KB Output is correct
113 Correct 92 ms 17104 KB Output is correct