oj.uz

Submission #953896

# Submission time Handle Problem Language Result Execution time Memory
953896 2024-03-26T20:07:08 Z RadicaI Railway (BOI17_railway) C++17
100 / 100
 259 ms 48976 KB 
#include <bits/stdc++.h>
#define int long long
#define pi pair<int,int>
#define pb push_back
#define V vector
#define vi V<int>
#define mi map<int,int>
#define MOD 1000000007
#define MOD2 998244353
#define mp make_pair
#define ins insert
#define qi queue<int>
#define pqi priority_queue<int>
#define si set<int>
#define v2i V<vi>
#define v3i V<v2i>
#define v4i V<v3i>
#define v5i V<v4i>
#define INF 1e18
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
#define fastio ios_base::sync_with_stdio(false); cin.tie(nullptr);
#define endl "\n"
#define lb lower_bound
#define ub upper_bound
#define print(x) cout << x<<" ";
#define vpi V<pi>
#define Y cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define msi multiset<int>
#define F first
#define S second
#define ld long double
#define RE return;
#define IMP cout<<-1<<endl;return;
using namespace std;

template <typename T>
std::istream& operator>>(std::istream& in, std::vector<T>& vec) {
    for (T& x : vec) {
        in >> x;
    }
    return in;
}

v2i adj;
map<pi,int> edge;
v2i bin;
const int mx = 17;
vi cnt;
vi order; int k;
vi depth;
int zawg=0;
void dfs(int node, int x){
	bin[node][0] = x;
	order[node] = zawg++;
	for(int i=1; i<mx; i++) bin[node][i] = bin[bin[node][i-1]][i-1];
	for(auto &y: adj[node])if(y!=x){
		depth[y] = depth[node]+1;
		dfs(y, node);
		cnt[node] += cnt[y];
	}
}
int kth(int x, int k){
	for(int i=0; i<mx; i++)if((1<<i)&k) x = bin[x][i];
	return x;
}
int lca(int x, int y){
	if(depth[x]>depth[y]) swap(x,y);
	y = kth(y, depth[y]-depth[x]);
	if(x==y) return x;
	for(int i=mx-1; i>=0; i--){
		if(bin[x][i] != bin[y][i]) x = bin[x][i], y = bin[y][i];
	}
	return bin[x][0];
	
}
bool ord(int a, int b){return order[a]<order[b];}

signed main(){
	int n,m;cin>>n>>m>>k; bin= v2i(n, vi(17)); adj.resize(n);  cnt.resize(n); order.resize(n); depth.resize(n);
	for(int i=1; i<n; i++){
		int x,y; cin>>x>>y; x--;y--;
		edge[{x,y}]=i; edge[{y,x}]=i;
		adj[x].pb(y); adj[y].pb(x);
	}
	dfs(0,0);
	for(int i=0; i<m; i++){
		int s; cin >> s;
		vi jhxt(s); cin >>jhxt; for(auto &j: jhxt) j--;
		sort(all(jhxt), ord);
		jhxt.pb(jhxt[0]);
		for(int j=0; j<s; j++){
			int lc = lca(jhxt[j], jhxt[j+1]);
			cnt[lc]-=2; cnt[jhxt[j]]++; cnt[jhxt[j+1]]++;
		}
	}
	dfs(0,0);
	si ans;
	for(int i=1; i<n; i++)if(cnt[i]>=2*k) ans.ins(edge[{i,bin[i][0]}]);
	cout<<sz(ans)<<endl;
	for(auto &x: ans) cout<<x<<" ";
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 12 ms 4208 KB Output is correct
3 Correct 12 ms 4188 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 13 ms 4644 KB Output is correct
7 Correct 12 ms 4188 KB Output is correct
8 Correct 10 ms 4188 KB Output is correct
9 Correct 11 ms 4188 KB Output is correct
10 Correct 1 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 348 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 12 ms 4208 KB Output is correct
3 Correct 12 ms 4188 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 13 ms 4644 KB Output is correct
7 Correct 12 ms 4188 KB Output is correct
8 Correct 10 ms 4188 KB Output is correct
9 Correct 11 ms 4188 KB Output is correct
10 Correct 1 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 348 KB Output is correct
15 Correct 32 ms 4628 KB Output is correct
16 Correct 38 ms 4692 KB Output is correct
17 Correct 34 ms 4796 KB Output is correct
18 Correct 14 ms 4672 KB Output is correct
19 Correct 12 ms 4284 KB Output is correct
20 Correct 35 ms 4944 KB Output is correct
21 Correct 35 ms 4696 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 12 ms 4096 KB Output is correct
24 Correct 12 ms 4292 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 13 ms 4768 KB Output is correct
28 Correct 14 ms 4188 KB Output is correct
29 Correct 10 ms 4244 KB Output is correct
30 Correct 11 ms 4184 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 1 ms 344 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 47696 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 192 ms 45892 KB Output is correct
4 Correct 179 ms 43588 KB Output is correct
5 Correct 212 ms 47964 KB Output is correct
6 Correct 196 ms 48976 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 41784 KB Output is correct
2 Correct 240 ms 39672 KB Output is correct
3 Correct 252 ms 39504 KB Output is correct
4 Correct 241 ms 39688 KB Output is correct
5 Correct 243 ms 39604 KB Output is correct
6 Correct 199 ms 42324 KB Output is correct
7 Correct 200 ms 42188 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 41784 KB Output is correct
2 Correct 240 ms 39672 KB Output is correct
3 Correct 252 ms 39504 KB Output is correct
4 Correct 241 ms 39688 KB Output is correct
5 Correct 243 ms 39604 KB Output is correct
6 Correct 199 ms 42324 KB Output is correct
7 Correct 200 ms 42188 KB Output is correct
8 Correct 210 ms 42472 KB Output is correct
9 Correct 206 ms 42316 KB Output is correct
10 Correct 190 ms 48600 KB Output is correct
11 Correct 213 ms 48456 KB Output is correct
12 Correct 163 ms 39252 KB Output is correct
13 Correct 165 ms 39396 KB Output is correct
14 Correct 224 ms 39480 KB Output is correct
15 Correct 233 ms 39548 KB Output is correct
16 Correct 241 ms 39604 KB Output is correct
17 Correct 235 ms 39592 KB Output is correct
18 Correct 257 ms 39624 KB Output is correct
19 Correct 245 ms 39760 KB Output is correct
20 Correct 200 ms 43088 KB Output is correct
21 Correct 216 ms 43744 KB Output is correct
22 Correct 209 ms 43372 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 12 ms 4208 KB Output is correct
3 Correct 12 ms 4188 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 13 ms 4644 KB Output is correct
7 Correct 12 ms 4188 KB Output is correct
8 Correct 10 ms 4188 KB Output is correct
9 Correct 11 ms 4188 KB Output is correct
10 Correct 1 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 348 KB Output is correct
15 Correct 32 ms 4628 KB Output is correct
16 Correct 38 ms 4692 KB Output is correct
17 Correct 34 ms 4796 KB Output is correct
18 Correct 14 ms 4672 KB Output is correct
19 Correct 12 ms 4284 KB Output is correct
20 Correct 35 ms 4944 KB Output is correct
21 Correct 35 ms 4696 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 12 ms 4096 KB Output is correct
24 Correct 12 ms 4292 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 13 ms 4768 KB Output is correct
28 Correct 14 ms 4188 KB Output is correct
29 Correct 10 ms 4244 KB Output is correct
30 Correct 11 ms 4184 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 1 ms 344 KB Output is correct
36 Correct 258 ms 47696 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 192 ms 45892 KB Output is correct
39 Correct 179 ms 43588 KB Output is correct
40 Correct 212 ms 47964 KB Output is correct
41 Correct 196 ms 48976 KB Output is correct
42 Correct 203 ms 41784 KB Output is correct
43 Correct 240 ms 39672 KB Output is correct
44 Correct 252 ms 39504 KB Output is correct
45 Correct 241 ms 39688 KB Output is correct
46 Correct 243 ms 39604 KB Output is correct
47 Correct 199 ms 42324 KB Output is correct
48 Correct 200 ms 42188 KB Output is correct
49 Correct 210 ms 42472 KB Output is correct
50 Correct 206 ms 42316 KB Output is correct
51 Correct 190 ms 48600 KB Output is correct
52 Correct 213 ms 48456 KB Output is correct
53 Correct 163 ms 39252 KB Output is correct
54 Correct 165 ms 39396 KB Output is correct
55 Correct 224 ms 39480 KB Output is correct
56 Correct 233 ms 39548 KB Output is correct
57 Correct 241 ms 39604 KB Output is correct
58 Correct 235 ms 39592 KB Output is correct
59 Correct 257 ms 39624 KB Output is correct
60 Correct 245 ms 39760 KB Output is correct
61 Correct 200 ms 43088 KB Output is correct
62 Correct 216 ms 43744 KB Output is correct
63 Correct 209 ms 43372 KB Output is correct
64 Correct 223 ms 42640 KB Output is correct
65 Correct 240 ms 39508 KB Output is correct
66 Correct 243 ms 39308 KB Output is correct
67 Correct 252 ms 39504 KB Output is correct
68 Correct 179 ms 39292 KB Output is correct
69 Correct 182 ms 39252 KB Output is correct
70 Correct 234 ms 44368 KB Output is correct
71 Correct 213 ms 41816 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 12 ms 4188 KB Output is correct
74 Correct 12 ms 4188 KB Output is correct
75 Correct 1 ms 348 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 13 ms 4700 KB Output is correct
78 Correct 12 ms 4188 KB Output is correct
79 Correct 11 ms 4184 KB Output is correct
80 Correct 11 ms 4188 KB Output is correct
81 Correct 0 ms 348 KB Output is correct
82 Correct 1 ms 600 KB Output is correct
83 Correct 1 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 32 ms 4700 KB Output is correct
87 Correct 36 ms 4816 KB Output is correct
88 Correct 40 ms 4788 KB Output is correct
89 Correct 13 ms 4444 KB Output is correct
90 Correct 12 ms 4188 KB Output is correct
91 Correct 34 ms 4944 KB Output is correct
92 Correct 37 ms 4564 KB Output is correct
93 Correct 0 ms 344 KB Output is correct
94 Correct 201 ms 47596 KB Output is correct
95 Correct 191 ms 45904 KB Output is correct
96 Correct 180 ms 43604 KB Output is correct
97 Correct 203 ms 48036 KB Output is correct
98 Correct 205 ms 48812 KB Output is correct
99 Correct 259 ms 39536 KB Output is correct
100 Correct 245 ms 39508 KB Output is correct
101 Correct 247 ms 39648 KB Output is correct
102 Correct 240 ms 39960 KB Output is correct
103 Correct 210 ms 42116 KB Output is correct
104 Correct 202 ms 43392 KB Output is correct
105 Correct 211 ms 41820 KB Output is correct
106 Correct 221 ms 42924 KB Output is correct
107 Correct 204 ms 42320 KB Output is correct
108 Correct 192 ms 48976 KB Output is correct
109 Correct 211 ms 48552 KB Output is correct
110 Correct 170 ms 39200 KB Output is correct
111 Correct 162 ms 39248 KB Output is correct
112 Correct 249 ms 39536 KB Output is correct
113 Correct 226 ms 39504 KB Output is correct