oj.uz

Submission #968036

# Submission time Handle Problem Language Result Execution time Memory
968036 2024-04-23T07:09:41 Z NintsiChkhaidze Railway (BOI17_railway) C++17
100 / 100
 223 ms 37528 KB 
#include <bits/stdc++.h>
#define ll long long
#define s second
#define f first
#define pb push_back
#define pii pair <int,int>
#define int ll
using namespace std;

const int N = 1e5 + 5;
vector <int> v[N];
int timer,tin[N],tout[N],dep[N],d[25][N];
pii a[N];
int fen[N],p[N];

void dfs(int x,int par){
	tin[x] = ++timer;
	d[0][x] = par;
	dep[x] = dep[par] + 1;
	for (int to: v[x])
		if (to != par) dfs(to,x);
	tout[x] = timer;
}

void upd(int idx,int dl){
	while (idx <= 100000){
		fen[idx]+=dl;
		idx+=(idx&(-idx));
	}
}
int get(int idx){
	int s = 0;
	while (idx > 0){
		s += fen[idx];
		idx -= (idx & (-idx));
	}
	return s;
}

int lca(int x,int y){
	if (dep[x] < dep[y]) swap(x,y);
	for (int i = 18; i >= 0; i--)
		if (dep[d[i][x]] >= dep[y]) x = d[i][x];

	if (x == y) return x;
	for (int i = 18; i >= 0; i--)
		if (d[i][x] != d[i][y]) x = d[i][x],y = d[i][y];

	return d[0][x];
}

void updatepath(int x,int y){
	upd(tin[x],+1);
	upd(tin[y],+1);
	upd(tin[lca(x,y)],-2);
}

signed main(){
	ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
	
	int n,m,k;
	cin>>n>>m>>k;

	vector <pii> edges;
	for (int i = 1; i < n; i++){
		int a,b;
		cin>>a>>b;
		v[a].pb(b);
		v[b].pb(a);
		edges.pb({a,b});
	}

	dfs(1,1);
	for (int j = 1; j <= 18; j++)
		for (int i = 1; i <= n; i++)
			d[j][i] = d[j - 1][d[j - 1][i]];

	for (int i=0;i<edges.size();i++){
		int x = edges[i].f,y = edges[i].s;
		if (dep[x] < dep[y]) swap(x,y);
		p[x] = i + 1;
	}

	for (int i = 1; i <= m; i++){
		int t;
		cin>>t;

		for (int j = 1; j <= t; j++){
			cin >> a[j].s;
			a[j].f = tin[a[j].s];
		}

		sort(a+1,a+t+1);
		for (int j = 2; j <= t; j++)
			updatepath(a[j-1].s,a[j].s);
		updatepath(a[t].s,a[1].s);
	}

	vector <int> ans;
	for (int i = 2; i <= n; i++){
		if (get(tout[i]) - get(tin[i] - 1) >= 2*k) ans.pb(p[i]);
	}
	cout<<ans.size()<<endl;
	sort(ans.begin(),ans.end());
	for (int x: ans)
		cout<<x<<" ";
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:78:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |  for (int i=0;i<edges.size();i++){
      |               ~^~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 23388 KB Output is correct
2 Correct 8 ms 24276 KB Output is correct
3 Correct 7 ms 24280 KB Output is correct
4 Correct 3 ms 23388 KB Output is correct
5 Correct 4 ms 23488 KB Output is correct
6 Correct 7 ms 24532 KB Output is correct
7 Correct 7 ms 24280 KB Output is correct
8 Correct 7 ms 24532 KB Output is correct
9 Correct 7 ms 24412 KB Output is correct
10 Correct 4 ms 23388 KB Output is correct
11 Correct 3 ms 23388 KB Output is correct
12 Correct 4 ms 23388 KB Output is correct
13 Correct 3 ms 23384 KB Output is correct
14 Correct 3 ms 23388 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 23388 KB Output is correct
2 Correct 8 ms 24276 KB Output is correct
3 Correct 7 ms 24280 KB Output is correct
4 Correct 3 ms 23388 KB Output is correct
5 Correct 4 ms 23488 KB Output is correct
6 Correct 7 ms 24532 KB Output is correct
7 Correct 7 ms 24280 KB Output is correct
8 Correct 7 ms 24532 KB Output is correct
9 Correct 7 ms 24412 KB Output is correct
10 Correct 4 ms 23388 KB Output is correct
11 Correct 3 ms 23388 KB Output is correct
12 Correct 4 ms 23388 KB Output is correct
13 Correct 3 ms 23384 KB Output is correct
14 Correct 3 ms 23388 KB Output is correct
15 Correct 39 ms 24712 KB Output is correct
16 Correct 39 ms 24780 KB Output is correct
17 Correct 39 ms 24780 KB Output is correct
18 Correct 8 ms 24536 KB Output is correct
19 Correct 8 ms 24192 KB Output is correct
20 Correct 47 ms 25032 KB Output is correct
21 Correct 50 ms 24760 KB Output is correct
22 Correct 3 ms 23388 KB Output is correct
23 Correct 7 ms 24280 KB Output is correct
24 Correct 7 ms 24280 KB Output is correct
25 Correct 3 ms 23388 KB Output is correct
26 Correct 4 ms 23388 KB Output is correct
27 Correct 8 ms 24536 KB Output is correct
28 Correct 7 ms 24400 KB Output is correct
29 Correct 7 ms 24412 KB Output is correct
30 Correct 8 ms 24196 KB Output is correct
31 Correct 3 ms 23636 KB Output is correct
32 Correct 3 ms 23388 KB Output is correct
33 Correct 4 ms 23388 KB Output is correct
34 Correct 3 ms 23388 KB Output is correct
35 Correct 4 ms 23388 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 35236 KB Output is correct
2 Correct 3 ms 23388 KB Output is correct
3 Correct 95 ms 34228 KB Output is correct
4 Correct 117 ms 33200 KB Output is correct
5 Correct 147 ms 35260 KB Output is correct
6 Correct 111 ms 35516 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 31180 KB Output is correct
2 Correct 76 ms 29336 KB Output is correct
3 Correct 95 ms 29004 KB Output is correct
4 Correct 98 ms 29108 KB Output is correct
5 Correct 96 ms 29000 KB Output is correct
6 Correct 59 ms 31580 KB Output is correct
7 Correct 63 ms 31424 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 31180 KB Output is correct
2 Correct 76 ms 29336 KB Output is correct
3 Correct 95 ms 29004 KB Output is correct
4 Correct 98 ms 29108 KB Output is correct
5 Correct 96 ms 29000 KB Output is correct
6 Correct 59 ms 31580 KB Output is correct
7 Correct 63 ms 31424 KB Output is correct
8 Correct 112 ms 31580 KB Output is correct
9 Correct 136 ms 31420 KB Output is correct
10 Correct 115 ms 35516 KB Output is correct
11 Correct 120 ms 35264 KB Output is correct
12 Correct 143 ms 29260 KB Output is correct
13 Correct 160 ms 30536 KB Output is correct
14 Correct 118 ms 30936 KB Output is correct
15 Correct 100 ms 30784 KB Output is correct
16 Correct 94 ms 30788 KB Output is correct
17 Correct 97 ms 30904 KB Output is correct
18 Correct 87 ms 30792 KB Output is correct
19 Correct 71 ms 30908 KB Output is correct
20 Correct 60 ms 33724 KB Output is correct
21 Correct 75 ms 33980 KB Output is correct
22 Correct 62 ms 33608 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 23388 KB Output is correct
2 Correct 8 ms 24276 KB Output is correct
3 Correct 7 ms 24280 KB Output is correct
4 Correct 3 ms 23388 KB Output is correct
5 Correct 4 ms 23488 KB Output is correct
6 Correct 7 ms 24532 KB Output is correct
7 Correct 7 ms 24280 KB Output is correct
8 Correct 7 ms 24532 KB Output is correct
9 Correct 7 ms 24412 KB Output is correct
10 Correct 4 ms 23388 KB Output is correct
11 Correct 3 ms 23388 KB Output is correct
12 Correct 4 ms 23388 KB Output is correct
13 Correct 3 ms 23384 KB Output is correct
14 Correct 3 ms 23388 KB Output is correct
15 Correct 39 ms 24712 KB Output is correct
16 Correct 39 ms 24780 KB Output is correct
17 Correct 39 ms 24780 KB Output is correct
18 Correct 8 ms 24536 KB Output is correct
19 Correct 8 ms 24192 KB Output is correct
20 Correct 47 ms 25032 KB Output is correct
21 Correct 50 ms 24760 KB Output is correct
22 Correct 3 ms 23388 KB Output is correct
23 Correct 7 ms 24280 KB Output is correct
24 Correct 7 ms 24280 KB Output is correct
25 Correct 3 ms 23388 KB Output is correct
26 Correct 4 ms 23388 KB Output is correct
27 Correct 8 ms 24536 KB Output is correct
28 Correct 7 ms 24400 KB Output is correct
29 Correct 7 ms 24412 KB Output is correct
30 Correct 8 ms 24196 KB Output is correct
31 Correct 3 ms 23636 KB Output is correct
32 Correct 3 ms 23388 KB Output is correct
33 Correct 4 ms 23388 KB Output is correct
34 Correct 3 ms 23388 KB Output is correct
35 Correct 4 ms 23388 KB Output is correct
36 Correct 124 ms 35236 KB Output is correct
37 Correct 3 ms 23388 KB Output is correct
38 Correct 95 ms 34228 KB Output is correct
39 Correct 117 ms 33200 KB Output is correct
40 Correct 147 ms 35260 KB Output is correct
41 Correct 111 ms 35516 KB Output is correct
42 Correct 59 ms 31180 KB Output is correct
43 Correct 76 ms 29336 KB Output is correct
44 Correct 95 ms 29004 KB Output is correct
45 Correct 98 ms 29108 KB Output is correct
46 Correct 96 ms 29000 KB Output is correct
47 Correct 59 ms 31580 KB Output is correct
48 Correct 63 ms 31424 KB Output is correct
49 Correct 112 ms 31580 KB Output is correct
50 Correct 136 ms 31420 KB Output is correct
51 Correct 115 ms 35516 KB Output is correct
52 Correct 120 ms 35264 KB Output is correct
53 Correct 143 ms 29260 KB Output is correct
54 Correct 160 ms 30536 KB Output is correct
55 Correct 118 ms 30936 KB Output is correct
56 Correct 100 ms 30784 KB Output is correct
57 Correct 94 ms 30788 KB Output is correct
58 Correct 97 ms 30904 KB Output is correct
59 Correct 87 ms 30792 KB Output is correct
60 Correct 71 ms 30908 KB Output is correct
61 Correct 60 ms 33724 KB Output is correct
62 Correct 75 ms 33980 KB Output is correct
63 Correct 62 ms 33608 KB Output is correct
64 Correct 83 ms 33468 KB Output is correct
65 Correct 165 ms 30788 KB Output is correct
66 Correct 163 ms 30632 KB Output is correct
67 Correct 140 ms 30784 KB Output is correct
68 Correct 114 ms 30536 KB Output is correct
69 Correct 121 ms 30528 KB Output is correct
70 Correct 84 ms 34236 KB Output is correct
71 Correct 120 ms 33492 KB Output is correct
72 Correct 3 ms 23384 KB Output is correct
73 Correct 7 ms 24280 KB Output is correct
74 Correct 7 ms 24356 KB Output is correct
75 Correct 3 ms 23388 KB Output is correct
76 Correct 3 ms 23388 KB Output is correct
77 Correct 7 ms 24532 KB Output is correct
78 Correct 7 ms 24280 KB Output is correct
79 Correct 8 ms 24272 KB Output is correct
80 Correct 7 ms 24200 KB Output is correct
81 Correct 3 ms 23560 KB Output is correct
82 Correct 4 ms 23388 KB Output is correct
83 Correct 3 ms 23540 KB Output is correct
84 Correct 3 ms 23388 KB Output is correct
85 Correct 3 ms 23388 KB Output is correct
86 Correct 40 ms 24536 KB Output is correct
87 Correct 40 ms 24712 KB Output is correct
88 Correct 41 ms 24788 KB Output is correct
89 Correct 7 ms 24536 KB Output is correct
90 Correct 8 ms 24304 KB Output is correct
91 Correct 46 ms 24792 KB Output is correct
92 Correct 55 ms 24792 KB Output is correct
93 Correct 3 ms 23388 KB Output is correct
94 Correct 95 ms 37056 KB Output is correct
95 Correct 134 ms 36020 KB Output is correct
96 Correct 90 ms 34952 KB Output is correct
97 Correct 171 ms 36976 KB Output is correct
98 Correct 132 ms 37528 KB Output is correct
99 Correct 111 ms 30888 KB Output is correct
100 Correct 97 ms 30784 KB Output is correct
101 Correct 109 ms 30884 KB Output is correct
102 Correct 76 ms 31040 KB Output is correct
103 Correct 60 ms 33216 KB Output is correct
104 Correct 65 ms 33920 KB Output is correct
105 Correct 60 ms 33212 KB Output is correct
106 Correct 116 ms 33620 KB Output is correct
107 Correct 110 ms 33100 KB Output is correct
108 Correct 116 ms 37148 KB Output is correct
109 Correct 112 ms 37056 KB Output is correct
110 Correct 135 ms 30532 KB Output is correct
111 Correct 223 ms 30532 KB Output is correct
112 Correct 106 ms 30628 KB Output is correct
113 Correct 101 ms 30768 KB Output is correct