oj.uz

답안 #972323

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
972323 2024-04-30T10:53:01 Z c2zi6 Railway (BOI17_railway) C++14
100 / 100
 96 ms 26568 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 paredge;
VI tin, tout;
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);
	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-1) {
			int lca = LCA(a[i].ss, a[i+1].ss);
			a.pb({tin[lca], lca});
		}
		sort(all(a));
 
		/* unique */
		VPI b{a[0]};
		for (int i = 1; i < a.size(); i++) if (a[i] != a[i-1]) b.pb(a[i]);
		a = b;
 
		/* for (auto&[t, u] : a) cout << u+1 << " "; cout << endl; */
		for (auto&[t, u] : a) {
			int cur = tin[u];
			while (true) {
				auto it = upper_bound(all(a), mkp(cur, (int)+2e9));
				if (it == a.end() || tin[it->ss] > tout[u]) break;
				/* cout << u+1 << " -> " << it->ss+1 << endl; */
				increment(u, it->ss);
				cur = tout[it->ss];
			}
		}
	}
	getall();
	VI ans;
	rep(u, n) if (val[u] >= 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:91:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   91 |   for (auto&[t, u] : a) {
      |             ^
railway.cpp:105:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |   for (int i = 1; i < a.size(); i++) if (a[i] != a[i-1]) b.pb(a[i]);
      |                   ~~^~~~~~~~~~
railway.cpp:109:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  109 |   for (auto&[t, u] : a) {
      |             ^
railway.cpp:125:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  125 |  for (int x : ans) cout << x << " "; cout << endl;
      |  ^~~
railway.cpp:125:38: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  125 |  for (int x : ans) cout << x << " "; cout << endl;
      |                                      ^~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 4 ms 2396 KB Output is correct
3 Correct 5 ms 2396 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 5 ms 2652 KB Output is correct
7 Correct 5 ms 2440 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 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 4 ms 2396 KB Output is correct
3 Correct 5 ms 2396 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 5 ms 2652 KB Output is correct
7 Correct 5 ms 2440 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 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 27 ms 2408 KB Output is correct
16 Correct 27 ms 2392 KB Output is correct
17 Correct 28 ms 2396 KB Output is correct
18 Correct 5 ms 2648 KB Output is correct
19 Correct 5 ms 2396 KB Output is correct
20 Correct 18 ms 2392 KB Output is correct
21 Correct 21 ms 2392 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 5 ms 2396 KB Output is correct
24 Correct 5 ms 2392 KB Output is correct
25 Correct 0 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 5 ms 2392 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 0 ms 348 KB Output is correct
33 Correct 0 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

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 26160 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 58 ms 26064 KB Output is correct
4 Correct 55 ms 25428 KB Output is correct
5 Correct 60 ms 26368 KB Output is correct
6 Correct 66 ms 26568 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 22692 KB Output is correct
2 Correct 73 ms 20052 KB Output is correct
3 Correct 73 ms 19764 KB Output is correct
4 Correct 74 ms 19792 KB Output is correct
5 Correct 76 ms 19792 KB Output is correct
6 Correct 64 ms 22924 KB Output is correct
7 Correct 68 ms 22864 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 22692 KB Output is correct
2 Correct 73 ms 20052 KB Output is correct
3 Correct 73 ms 19764 KB Output is correct
4 Correct 74 ms 19792 KB Output is correct
5 Correct 76 ms 19792 KB Output is correct
6 Correct 64 ms 22924 KB Output is correct
7 Correct 68 ms 22864 KB Output is correct
8 Correct 87 ms 22948 KB Output is correct
9 Correct 84 ms 23052 KB Output is correct
10 Correct 65 ms 26568 KB Output is correct
11 Correct 75 ms 26456 KB Output is correct
12 Correct 69 ms 19996 KB Output is correct
13 Correct 68 ms 19920 KB Output is correct
14 Correct 80 ms 19792 KB Output is correct
15 Correct 81 ms 19796 KB Output is correct
16 Correct 89 ms 19848 KB Output is correct
17 Correct 75 ms 19796 KB Output is correct
18 Correct 89 ms 19796 KB Output is correct
19 Correct 75 ms 19940 KB Output is correct
20 Correct 67 ms 23212 KB Output is correct
21 Correct 66 ms 23152 KB Output is correct
22 Correct 67 ms 23228 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 4 ms 2396 KB Output is correct
3 Correct 5 ms 2396 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 5 ms 2652 KB Output is correct
7 Correct 5 ms 2440 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 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 27 ms 2408 KB Output is correct
16 Correct 27 ms 2392 KB Output is correct
17 Correct 28 ms 2396 KB Output is correct
18 Correct 5 ms 2648 KB Output is correct
19 Correct 5 ms 2396 KB Output is correct
20 Correct 18 ms 2392 KB Output is correct
21 Correct 21 ms 2392 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 5 ms 2396 KB Output is correct
24 Correct 5 ms 2392 KB Output is correct
25 Correct 0 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 5 ms 2392 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 0 ms 348 KB Output is correct
33 Correct 0 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 69 ms 26160 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 58 ms 26064 KB Output is correct
39 Correct 55 ms 25428 KB Output is correct
40 Correct 60 ms 26368 KB Output is correct
41 Correct 66 ms 26568 KB Output is correct
42 Correct 68 ms 22692 KB Output is correct
43 Correct 73 ms 20052 KB Output is correct
44 Correct 73 ms 19764 KB Output is correct
45 Correct 74 ms 19792 KB Output is correct
46 Correct 76 ms 19792 KB Output is correct
47 Correct 64 ms 22924 KB Output is correct
48 Correct 68 ms 22864 KB Output is correct
49 Correct 87 ms 22948 KB Output is correct
50 Correct 84 ms 23052 KB Output is correct
51 Correct 65 ms 26568 KB Output is correct
52 Correct 75 ms 26456 KB Output is correct
53 Correct 69 ms 19996 KB Output is correct
54 Correct 68 ms 19920 KB Output is correct
55 Correct 80 ms 19792 KB Output is correct
56 Correct 81 ms 19796 KB Output is correct
57 Correct 89 ms 19848 KB Output is correct
58 Correct 75 ms 19796 KB Output is correct
59 Correct 89 ms 19796 KB Output is correct
60 Correct 75 ms 19940 KB Output is correct
61 Correct 67 ms 23212 KB Output is correct
62 Correct 66 ms 23152 KB Output is correct
63 Correct 67 ms 23228 KB Output is correct
64 Correct 81 ms 23120 KB Output is correct
65 Correct 80 ms 19808 KB Output is correct
66 Correct 90 ms 19804 KB Output is correct
67 Correct 83 ms 19796 KB Output is correct
68 Correct 64 ms 20048 KB Output is correct
69 Correct 76 ms 20168 KB Output is correct
70 Correct 72 ms 23208 KB Output is correct
71 Correct 78 ms 22840 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 4 ms 2416 KB Output is correct
74 Correct 5 ms 2396 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 5 ms 2592 KB Output is correct
78 Correct 5 ms 2396 KB Output is correct
79 Correct 4 ms 2396 KB Output is correct
80 Correct 4 ms 2396 KB Output is correct
81 Correct 0 ms 348 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 29 ms 2392 KB Output is correct
87 Correct 29 ms 2392 KB Output is correct
88 Correct 28 ms 2408 KB Output is correct
89 Correct 5 ms 2652 KB Output is correct
90 Correct 5 ms 2252 KB Output is correct
91 Correct 19 ms 2436 KB Output is correct
92 Correct 21 ms 2396 KB Output is correct
93 Correct 0 ms 344 KB Output is correct
94 Correct 60 ms 26228 KB Output is correct
95 Correct 60 ms 25880 KB Output is correct
96 Correct 55 ms 25424 KB Output is correct
97 Correct 60 ms 26260 KB Output is correct
98 Correct 66 ms 26356 KB Output is correct
99 Correct 82 ms 19848 KB Output is correct
100 Correct 72 ms 19792 KB Output is correct
101 Correct 77 ms 19792 KB Output is correct
102 Correct 73 ms 20048 KB Output is correct
103 Correct 63 ms 22868 KB Output is correct
104 Correct 69 ms 23116 KB Output is correct
105 Correct 66 ms 22868 KB Output is correct
106 Correct 81 ms 23124 KB Output is correct
107 Correct 96 ms 23108 KB Output is correct
108 Correct 64 ms 26372 KB Output is correct
109 Correct 81 ms 26316 KB Output is correct
110 Correct 69 ms 20052 KB Output is correct
111 Correct 71 ms 19920 KB Output is correct
112 Correct 84 ms 19964 KB Output is correct
113 Correct 77 ms 19792 KB Output is correct