oj.uz

Submission #972319

# Submission time Handle Problem Language Result Execution time Memory
972319 2024-04-30T10:51:53 Z c2zi6 Railway (BOI17_railway) C++14
100 / 100
 124 ms 28364 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

VVPI gp;
VI val;

void increment(int u, int v) {
	val[u]--;
	val[v]++;
}
void getall(int u = 0, int p = -1) {
	for (auto[v, i] : gp[u]) if (v != p) {
		getall(v, u);
		val[u] += val[v];
	}
}

VI tin, tout;
VI paredge;
int tc  = 0;
VVI par; 
void dfs(int u = 0, int p = 0, int pi = -1) {
	tin[u] = tc++;
	paredge[u] = pi;
	par[u][0] = p;
	replr(i, 1, 19) par[u][i] = par[par[u][i-1]][i-1];
	for (auto[v, i] : gp[u]) if (v != p) {
		dfs(v, u, i);
	}
	tout[u] = tc++;
}
bool isanc(int u, int v) {
	return tin[u] <= tin[v] && tout[v] <= tout[u];
}
int LCA(int u, int v) {
	if (isanc(u, v)) return u;
	reprl(i, 19, 0) if (!isanc(par[u][i], v)) u = par[u][i];
	return par[u][0];
}

void solve() {
	int n, m, k;
	cin >> n >> m >> k;
	gp = VVPI(n);
	rep(i, n-1) {
		int u, v;
		cin >> u >> v;
		u--, v--;
		gp[u].pb({v, i});
		gp[v].pb({u, i});
	}
	tin = tout = VI(n);
	par = VVI(n, VI(20));
	paredge = VI(n);
	tc = 1;
	dfs();

	val = VI(n);
	rep(i, m) {
		int s;
		cin >> s;
		VPI a(s);
		for (auto&[t, u] : a) {
			cin >> u;
			u--;
			t = tin[u];
		}
		sort(all(a));
		rep(i, s) {
			int j = (i+1)%a.size();
			int lca = LCA(a[i].ss, a[j].ss);
			increment(lca, a[i].ss);
			increment(lca, a[j].ss);
		}
	}
	getall();
	VI ans;
	rep(u, n) if (val[u] >= 2*k) ans.pb(paredge[u]+1);
	sort(all(ans));
	cout << ans.size() << endl;
	for (int x : ans) cout << x << " "; cout << endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    int t = 1;
    /* cin >> t; */
    while (t--) solve();
}

Compilation message

railway.cpp: In function 'void getall(int, int)':
railway.cpp:41:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   41 |  for (auto[v, i] : gp[u]) if (v != p) {
      |           ^
railway.cpp: In function 'void dfs(int, int, int)':
railway.cpp:56:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   56 |  for (auto[v, i] : gp[u]) if (v != p) {
      |           ^
railway.cpp: In function 'void solve()':
railway.cpp:92:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   92 |   for (auto&[t, u] : a) {
      |             ^
railway.cpp:110:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  110 |  for (int x : ans) cout << x << " "; cout << endl;
      |  ^~~
railway.cpp:110:38: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  110 |  for (int x : ans) cout << x << " "; cout << endl;
      |                                      ^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 4 ms 2396 KB Output is correct
3 Correct 4 ms 2512 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 2652 KB Output is correct
7 Correct 5 ms 2392 KB Output is correct
8 Correct 4 ms 2396 KB Output is correct
9 Correct 4 ms 2396 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 452 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 4 ms 2396 KB Output is correct
3 Correct 4 ms 2512 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 2652 KB Output is correct
7 Correct 5 ms 2392 KB Output is correct
8 Correct 4 ms 2396 KB Output is correct
9 Correct 4 ms 2396 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 452 KB Output is correct
15 Correct 14 ms 2652 KB Output is correct
16 Correct 14 ms 2864 KB Output is correct
17 Correct 14 ms 2908 KB Output is correct
18 Correct 5 ms 2652 KB Output is correct
19 Correct 7 ms 2396 KB Output is correct
20 Correct 13 ms 3048 KB Output is correct
21 Correct 15 ms 2908 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 4 ms 2396 KB Output is correct
24 Correct 5 ms 2396 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 5 ms 2652 KB Output is correct
28 Correct 4 ms 2396 KB Output is correct
29 Correct 4 ms 2396 KB Output is correct
30 Correct 4 ms 2396 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 26356 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 99 ms 25840 KB Output is correct
4 Correct 96 ms 25460 KB Output is correct
5 Correct 76 ms 26400 KB Output is correct
6 Correct 57 ms 26444 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 22720 KB Output is correct
2 Correct 66 ms 20076 KB Output is correct
3 Correct 124 ms 19848 KB Output is correct
4 Correct 99 ms 19844 KB Output is correct
5 Correct 87 ms 19624 KB Output is correct
6 Correct 79 ms 22960 KB Output is correct
7 Correct 68 ms 22716 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 22720 KB Output is correct
2 Correct 66 ms 20076 KB Output is correct
3 Correct 124 ms 19848 KB Output is correct
4 Correct 99 ms 19844 KB Output is correct
5 Correct 87 ms 19624 KB Output is correct
6 Correct 79 ms 22960 KB Output is correct
7 Correct 68 ms 22716 KB Output is correct
8 Correct 86 ms 22844 KB Output is correct
9 Correct 83 ms 22896 KB Output is correct
10 Correct 54 ms 26356 KB Output is correct
11 Correct 66 ms 26312 KB Output is correct
12 Correct 65 ms 20044 KB Output is correct
13 Correct 57 ms 21072 KB Output is correct
14 Correct 77 ms 20824 KB Output is correct
15 Correct 75 ms 20824 KB Output is correct
16 Correct 81 ms 20792 KB Output is correct
17 Correct 77 ms 20792 KB Output is correct
18 Correct 76 ms 20664 KB Output is correct
19 Correct 85 ms 21072 KB Output is correct
20 Correct 71 ms 24292 KB Output is correct
21 Correct 72 ms 24528 KB Output is correct
22 Correct 69 ms 24152 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 4 ms 2396 KB Output is correct
3 Correct 4 ms 2512 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 2652 KB Output is correct
7 Correct 5 ms 2392 KB Output is correct
8 Correct 4 ms 2396 KB Output is correct
9 Correct 4 ms 2396 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 452 KB Output is correct
15 Correct 14 ms 2652 KB Output is correct
16 Correct 14 ms 2864 KB Output is correct
17 Correct 14 ms 2908 KB Output is correct
18 Correct 5 ms 2652 KB Output is correct
19 Correct 7 ms 2396 KB Output is correct
20 Correct 13 ms 3048 KB Output is correct
21 Correct 15 ms 2908 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 4 ms 2396 KB Output is correct
24 Correct 5 ms 2396 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 5 ms 2652 KB Output is correct
28 Correct 4 ms 2396 KB Output is correct
29 Correct 4 ms 2396 KB Output is correct
30 Correct 4 ms 2396 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 89 ms 26356 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 99 ms 25840 KB Output is correct
39 Correct 96 ms 25460 KB Output is correct
40 Correct 76 ms 26400 KB Output is correct
41 Correct 57 ms 26444 KB Output is correct
42 Correct 72 ms 22720 KB Output is correct
43 Correct 66 ms 20076 KB Output is correct
44 Correct 124 ms 19848 KB Output is correct
45 Correct 99 ms 19844 KB Output is correct
46 Correct 87 ms 19624 KB Output is correct
47 Correct 79 ms 22960 KB Output is correct
48 Correct 68 ms 22716 KB Output is correct
49 Correct 86 ms 22844 KB Output is correct
50 Correct 83 ms 22896 KB Output is correct
51 Correct 54 ms 26356 KB Output is correct
52 Correct 66 ms 26312 KB Output is correct
53 Correct 65 ms 20044 KB Output is correct
54 Correct 57 ms 21072 KB Output is correct
55 Correct 77 ms 20824 KB Output is correct
56 Correct 75 ms 20824 KB Output is correct
57 Correct 81 ms 20792 KB Output is correct
58 Correct 77 ms 20792 KB Output is correct
59 Correct 76 ms 20664 KB Output is correct
60 Correct 85 ms 21072 KB Output is correct
61 Correct 71 ms 24292 KB Output is correct
62 Correct 72 ms 24528 KB Output is correct
63 Correct 69 ms 24152 KB Output is correct
64 Correct 72 ms 24916 KB Output is correct
65 Correct 84 ms 21588 KB Output is correct
66 Correct 78 ms 21504 KB Output is correct
67 Correct 96 ms 21496 KB Output is correct
68 Correct 71 ms 21332 KB Output is correct
69 Correct 68 ms 21328 KB Output is correct
70 Correct 83 ms 25028 KB Output is correct
71 Correct 74 ms 24404 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Correct 5 ms 2396 KB Output is correct
74 Correct 4 ms 2392 KB Output is correct
75 Correct 1 ms 348 KB Output is correct
76 Correct 0 ms 452 KB Output is correct
77 Correct 5 ms 2768 KB Output is correct
78 Correct 5 ms 2648 KB Output is correct
79 Correct 5 ms 2416 KB Output is correct
80 Correct 5 ms 2396 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 1 ms 348 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 14 ms 2788 KB Output is correct
87 Correct 14 ms 2872 KB Output is correct
88 Correct 15 ms 2908 KB Output is correct
89 Correct 5 ms 2772 KB Output is correct
90 Correct 5 ms 2396 KB Output is correct
91 Correct 14 ms 2904 KB Output is correct
92 Correct 15 ms 3160 KB Output is correct
93 Correct 0 ms 348 KB Output is correct
94 Correct 82 ms 28020 KB Output is correct
95 Correct 87 ms 27856 KB Output is correct
96 Correct 101 ms 27168 KB Output is correct
97 Correct 65 ms 28020 KB Output is correct
98 Correct 61 ms 28364 KB Output is correct
99 Correct 77 ms 21588 KB Output is correct
100 Correct 74 ms 21500 KB Output is correct
101 Correct 74 ms 21588 KB Output is correct
102 Correct 83 ms 21996 KB Output is correct
103 Correct 67 ms 24744 KB Output is correct
104 Correct 79 ms 25000 KB Output is correct
105 Correct 68 ms 24656 KB Output is correct
106 Correct 69 ms 24916 KB Output is correct
107 Correct 71 ms 24600 KB Output is correct
108 Correct 56 ms 28276 KB Output is correct
109 Correct 63 ms 28104 KB Output is correct
110 Correct 56 ms 21320 KB Output is correct
111 Correct 55 ms 21200 KB Output is correct
112 Correct 88 ms 21600 KB Output is correct
113 Correct 75 ms 21492 KB Output is correct