oj.uz

Submission #915115

# Submission time Handle Problem Language Result Execution time Memory
915115 2024-01-23T11:15:18 Z penguin133 Railway (BOI17_railway) C++17
100 / 100
 215 ms 68552 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second

int sz[1000005], head[1000005], par[1000005], dep[1000005], S[1000005];
int up[1000005];
vector<int>v[1000005];
int n, q;
vector<pii>adj;

int getr(int x){
	return (par[x] == x ? x : par[x] = getr(par[x]));
}

void merge(int a, int b){
	a = getr(a), b = getr(b);
	if(a != b)par[b] = a;
}

void dfs(int x, int p, int d){
	dep[x] = d;
	up[x] = p;
	sz[x] = 1;
	for(auto i : v[x]){
		if(i == p)continue;
		dfs(i, x, d + 1);
		sz[x] += sz[i];
	}
}


struct node{
	int s,e,m,val, lazy = 0;
	node *l, *r;
	node(int _s, int _e){
		s = _s, e = _e, m = (s + e)>>1;
		val = 0;
		if(s != e)l = new node(s, m), r = new node(m+1, e);
	}
	void propo(){
		if(lazy){
			val += lazy * (e - s + 1);
			if(s != e)l->lazy += lazy, r->lazy += lazy;
			lazy = 0;
		}
	}
	void upd(int a, int b, int c){
		//cerr << "UPD " << a << " " << b << " " << c << '\n';
		if(a == s && b == e)lazy += c;
		else{
			if(b <= m)l->upd(a, b, c);
			else if(a > m)r->upd(a, b, c);
			else l->upd(a, m, c), r->upd(m+1, b, c);
			l->propo(), r->propo();
			val = l->val + r->val;
		}
	}
	int query(int a, int b){
		propo();
		if(a == s && b == e)return val;
		else if( b <= m)return l->query(a, b);
		else if(a > m)return r->query(a, b);
		else return (l->query(a, m) + r->query(m+1, b));
	}
}*root;
int cnt = 1;
void dfs2(int x, int h, int par){
	S[x] = cnt++;
	head[x] = h;
	int maxi = 0, in = -1;
	for(auto i : v[x]){
		if(i == par)continue;
		if(maxi < sz[i])maxi = sz[i], in = i;
	}
	for(auto i : v[x]){
		if(i == par)continue;
		if(i == in)dfs2(i, h, x);
	}
	for(auto i : v[x]){
		if(i != par && i != in)dfs2(i, i, x);
	}
}
vector <pi> upds;
void chng(int a, int b) {
    for (; head[a] != head[b]; b = up[head[b]]) {
		//cerr << a << " " << b << " " << head[a] << " " << head[b] << '\n';
        if (dep[head[a]] > dep[head[b]])
            swap(a, b);
        //root->upd(S[head[b]], S[b], 1);
        upds.push_back({S[head[b]], S[b]});
    }
    if (dep[a] > dep[b])
        swap(a, b);
    if(S[a] != S[b])upds.push_back({S[a] + 1, S[b]});//root->upd(S[a]+1, S[b], 1);
}

int query(int a, int b) {
    int res = 0;
    for (; head[a] != head[b]; b = up[head[b]]) {
        if (dep[head[a]] > dep[head[b]])
            swap(a, b);
        int cur_heavy_path_max = root->query(S[head[b]], S[b]);
        res += cur_heavy_path_max;
    }
    if (dep[a] > dep[b])
        swap(a, b);
    if(S[a] != S[b])res += root->query(S[a]+1, S[b]);
    return res;
}

int k;
int A[200005], B[200005];
int32_t main(){
	ios::sync_with_stdio(0);cin.tie(0);
	cin >> n >> q >> k;
	for(int i=1;i<n;i++){
		int x, y; cin >> x >> y;
		v[x].push_back(y);
		v[y].push_back(x);
		A[i] = x, B[i] = y;
	}
	root= new node(1, n);
	dfs(1, -1, 1);
	//cerr << "ok\n";
	dfs2(1, 1, -1);
	while(q--){
		int x; cin >> x;
		int prv = -1;
		while(x--){
			int a; cin >> a;
			if(prv != -1)chng(prv, a);
			prv = a;
		}
		sort(upds.begin(), upds.end());
		int mx = 0;
		for(auto [i, j] : upds){
			if(mx >= j)continue;
			root->upd(max(mx + 1, i), j, 1);
			mx = max(mx, j);
		}
		upds.clear();
	}
	vector <int> ans;
	for(int i=1;i<n;i++){
		if(query(A[i], B[i]) >= k)ans.push_back(i);
	}
	cout << (int)ans.size() << '\n';
	for(auto i : ans)cout << i << ' ';
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 35160 KB Output is correct
2 Correct 16 ms 36952 KB Output is correct
3 Correct 15 ms 36956 KB Output is correct
4 Correct 10 ms 35160 KB Output is correct
5 Correct 10 ms 35164 KB Output is correct
6 Correct 18 ms 37468 KB Output is correct
7 Correct 16 ms 37212 KB Output is correct
8 Correct 13 ms 36956 KB Output is correct
9 Correct 14 ms 37156 KB Output is correct
10 Correct 9 ms 35164 KB Output is correct
11 Correct 9 ms 35164 KB Output is correct
12 Correct 9 ms 35280 KB Output is correct
13 Correct 9 ms 35164 KB Output is correct
14 Correct 9 ms 35160 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 35160 KB Output is correct
2 Correct 16 ms 36952 KB Output is correct
3 Correct 15 ms 36956 KB Output is correct
4 Correct 10 ms 35160 KB Output is correct
5 Correct 10 ms 35164 KB Output is correct
6 Correct 18 ms 37468 KB Output is correct
7 Correct 16 ms 37212 KB Output is correct
8 Correct 13 ms 36956 KB Output is correct
9 Correct 14 ms 37156 KB Output is correct
10 Correct 9 ms 35164 KB Output is correct
11 Correct 9 ms 35164 KB Output is correct
12 Correct 9 ms 35280 KB Output is correct
13 Correct 9 ms 35164 KB Output is correct
14 Correct 9 ms 35160 KB Output is correct
15 Correct 60 ms 37468 KB Output is correct
16 Correct 61 ms 37552 KB Output is correct
17 Correct 60 ms 37456 KB Output is correct
18 Correct 16 ms 37468 KB Output is correct
19 Correct 18 ms 37208 KB Output is correct
20 Correct 35 ms 37712 KB Output is correct
21 Correct 43 ms 37468 KB Output is correct
22 Correct 11 ms 35164 KB Output is correct
23 Correct 16 ms 37028 KB Output is correct
24 Correct 15 ms 36956 KB Output is correct
25 Correct 9 ms 35164 KB Output is correct
26 Correct 9 ms 35284 KB Output is correct
27 Correct 15 ms 37464 KB Output is correct
28 Correct 14 ms 37212 KB Output is correct
29 Correct 14 ms 37168 KB Output is correct
30 Correct 15 ms 37112 KB Output is correct
31 Correct 9 ms 35164 KB Output is correct
32 Correct 10 ms 35164 KB Output is correct
33 Correct 10 ms 35160 KB Output is correct
34 Correct 9 ms 35164 KB Output is correct
35 Correct 10 ms 35172 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 68060 KB Output is correct
2 Correct 10 ms 35160 KB Output is correct
3 Correct 106 ms 67536 KB Output is correct
4 Correct 107 ms 66840 KB Output is correct
5 Correct 120 ms 67944 KB Output is correct
6 Correct 104 ms 68552 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 63528 KB Output is correct
2 Correct 111 ms 60016 KB Output is correct
3 Correct 118 ms 59472 KB Output is correct
4 Correct 135 ms 59476 KB Output is correct
5 Correct 127 ms 59568 KB Output is correct
6 Correct 99 ms 63852 KB Output is correct
7 Correct 86 ms 63576 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 63528 KB Output is correct
2 Correct 111 ms 60016 KB Output is correct
3 Correct 118 ms 59472 KB Output is correct
4 Correct 135 ms 59476 KB Output is correct
5 Correct 127 ms 59568 KB Output is correct
6 Correct 99 ms 63852 KB Output is correct
7 Correct 86 ms 63576 KB Output is correct
8 Correct 93 ms 63752 KB Output is correct
9 Correct 92 ms 63828 KB Output is correct
10 Correct 115 ms 68444 KB Output is correct
11 Correct 102 ms 68040 KB Output is correct
12 Correct 99 ms 59308 KB Output is correct
13 Correct 100 ms 59424 KB Output is correct
14 Correct 158 ms 59808 KB Output is correct
15 Correct 153 ms 59428 KB Output is correct
16 Correct 135 ms 59532 KB Output is correct
17 Correct 140 ms 59724 KB Output is correct
18 Correct 127 ms 59692 KB Output is correct
19 Correct 108 ms 59996 KB Output is correct
20 Correct 91 ms 63952 KB Output is correct
21 Correct 91 ms 64000 KB Output is correct
22 Correct 92 ms 63988 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 35160 KB Output is correct
2 Correct 16 ms 36952 KB Output is correct
3 Correct 15 ms 36956 KB Output is correct
4 Correct 10 ms 35160 KB Output is correct
5 Correct 10 ms 35164 KB Output is correct
6 Correct 18 ms 37468 KB Output is correct
7 Correct 16 ms 37212 KB Output is correct
8 Correct 13 ms 36956 KB Output is correct
9 Correct 14 ms 37156 KB Output is correct
10 Correct 9 ms 35164 KB Output is correct
11 Correct 9 ms 35164 KB Output is correct
12 Correct 9 ms 35280 KB Output is correct
13 Correct 9 ms 35164 KB Output is correct
14 Correct 9 ms 35160 KB Output is correct
15 Correct 60 ms 37468 KB Output is correct
16 Correct 61 ms 37552 KB Output is correct
17 Correct 60 ms 37456 KB Output is correct
18 Correct 16 ms 37468 KB Output is correct
19 Correct 18 ms 37208 KB Output is correct
20 Correct 35 ms 37712 KB Output is correct
21 Correct 43 ms 37468 KB Output is correct
22 Correct 11 ms 35164 KB Output is correct
23 Correct 16 ms 37028 KB Output is correct
24 Correct 15 ms 36956 KB Output is correct
25 Correct 9 ms 35164 KB Output is correct
26 Correct 9 ms 35284 KB Output is correct
27 Correct 15 ms 37464 KB Output is correct
28 Correct 14 ms 37212 KB Output is correct
29 Correct 14 ms 37168 KB Output is correct
30 Correct 15 ms 37112 KB Output is correct
31 Correct 9 ms 35164 KB Output is correct
32 Correct 10 ms 35164 KB Output is correct
33 Correct 10 ms 35160 KB Output is correct
34 Correct 9 ms 35164 KB Output is correct
35 Correct 10 ms 35172 KB Output is correct
36 Correct 119 ms 68060 KB Output is correct
37 Correct 10 ms 35160 KB Output is correct
38 Correct 106 ms 67536 KB Output is correct
39 Correct 107 ms 66840 KB Output is correct
40 Correct 120 ms 67944 KB Output is correct
41 Correct 104 ms 68552 KB Output is correct
42 Correct 87 ms 63528 KB Output is correct
43 Correct 111 ms 60016 KB Output is correct
44 Correct 118 ms 59472 KB Output is correct
45 Correct 135 ms 59476 KB Output is correct
46 Correct 127 ms 59568 KB Output is correct
47 Correct 99 ms 63852 KB Output is correct
48 Correct 86 ms 63576 KB Output is correct
49 Correct 93 ms 63752 KB Output is correct
50 Correct 92 ms 63828 KB Output is correct
51 Correct 115 ms 68444 KB Output is correct
52 Correct 102 ms 68040 KB Output is correct
53 Correct 99 ms 59308 KB Output is correct
54 Correct 100 ms 59424 KB Output is correct
55 Correct 158 ms 59808 KB Output is correct
56 Correct 153 ms 59428 KB Output is correct
57 Correct 135 ms 59532 KB Output is correct
58 Correct 140 ms 59724 KB Output is correct
59 Correct 127 ms 59692 KB Output is correct
60 Correct 108 ms 59996 KB Output is correct
61 Correct 91 ms 63952 KB Output is correct
62 Correct 91 ms 64000 KB Output is correct
63 Correct 92 ms 63988 KB Output is correct
64 Correct 104 ms 63860 KB Output is correct
65 Correct 191 ms 59476 KB Output is correct
66 Correct 215 ms 59472 KB Output is correct
67 Correct 174 ms 59584 KB Output is correct
68 Correct 94 ms 59452 KB Output is correct
69 Correct 103 ms 59656 KB Output is correct
70 Correct 108 ms 64204 KB Output is correct
71 Correct 91 ms 63316 KB Output is correct
72 Correct 10 ms 35160 KB Output is correct
73 Correct 15 ms 37164 KB Output is correct
74 Correct 16 ms 36956 KB Output is correct
75 Correct 9 ms 35164 KB Output is correct
76 Correct 10 ms 35280 KB Output is correct
77 Correct 16 ms 37716 KB Output is correct
78 Correct 15 ms 37208 KB Output is correct
79 Correct 15 ms 36956 KB Output is correct
80 Correct 15 ms 36952 KB Output is correct
81 Correct 10 ms 35160 KB Output is correct
82 Correct 9 ms 35164 KB Output is correct
83 Correct 10 ms 35164 KB Output is correct
84 Correct 9 ms 35164 KB Output is correct
85 Correct 11 ms 35336 KB Output is correct
86 Correct 59 ms 37612 KB Output is correct
87 Correct 59 ms 37456 KB Output is correct
88 Correct 62 ms 37544 KB Output is correct
89 Correct 15 ms 37464 KB Output is correct
90 Correct 16 ms 37212 KB Output is correct
91 Correct 36 ms 37716 KB Output is correct
92 Correct 46 ms 37624 KB Output is correct
93 Correct 10 ms 35164 KB Output is correct
94 Correct 111 ms 68044 KB Output is correct
95 Correct 109 ms 67628 KB Output is correct
96 Correct 103 ms 66896 KB Output is correct
97 Correct 119 ms 68180 KB Output is correct
98 Correct 105 ms 68552 KB Output is correct
99 Correct 145 ms 59676 KB Output is correct
100 Correct 144 ms 59472 KB Output is correct
101 Correct 150 ms 59472 KB Output is correct
102 Correct 111 ms 59988 KB Output is correct
103 Correct 92 ms 63604 KB Output is correct
104 Correct 99 ms 64132 KB Output is correct
105 Correct 93 ms 63568 KB Output is correct
106 Correct 93 ms 63948 KB Output is correct
107 Correct 99 ms 63620 KB Output is correct
108 Correct 118 ms 68292 KB Output is correct
109 Correct 107 ms 68304 KB Output is correct
110 Correct 108 ms 59320 KB Output is correct
111 Correct 112 ms 59464 KB Output is correct
112 Correct 177 ms 59728 KB Output is correct
113 Correct 171 ms 59480 KB Output is correct