oj.uz

Submission #482902

# Submission time Handle Problem Language Result Execution time Memory
482902 2021-10-26T17:10:31 Z PoPularPlusPlus Railway (BOI17_railway) C++17
100 / 100
 107 ms 27988 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

const int N = 100002 , l = 25;
int n , m , k;
vector<pair<int,int>> adj[N];
int cnt[N],timer,tin[N], tout[N],up[N][l + 5];
vector<int> ans;

void dfs(int v, int p){
    tin[v] = ++timer;
    up[v][0] = p;
    for (int i = 1; i <= l; ++i)
        up[v][i] = up[up[v][i-1]][i-1];

    for (auto &[u,ldonewjfjiwjjfosfojg] : adj[v]) {
        if (u != p)
            dfs(u, v);
    }

    tout[v] = ++timer;
}

bool is_ancestor(int u, int v){
    return tin[u] <= tin[v] && tout[u] >= tout[v];
}

int lca(int u, int v){
    if (is_ancestor(u, v))
        return u;
    if (is_ancestor(v, u))
        return v;
    for (int i = l; i >= 0; --i) {
        if (!is_ancestor(up[u][i], v))
            u = up[u][i];
    }
    return up[u][0];
}

bool cmp(int x , int y){
	return tin[x] < tin[y];
}

void dfs1(int node , int par = -1){
	for(auto &[i,idx] : adj[node]){
		if(i!=par){
			dfs1(i,node);
			if(cnt[i] >= 2 * k)ans.pb(idx);
				cnt[node] += cnt[i];
		}
	}
}

void solve(){
	cin >> n >> m >> k;
	for(int i = 1; i < n; i++){
		int u , v;
		cin >> u >> v;
		adj[u].pb(mp(v,i));
		adj[v].pb(mp(u,i));
	}
	timer = 0;
	dfs(1,1);
	memset(cnt,0,sizeof cnt);
	for(int i = 0; i < m; i++){
		int s;
		cin >> s;
		int arr[s];
		for(int j = 0; j < s; j++){
			cin >> arr[j];
		}
		sort(arr,arr+s,cmp);
		for(int j = 0; j < s; j++){
			int lc = lca(arr[j],arr[(j + 1) % s]);
			cnt[lc]-=2;
			cnt[arr[j]]++;
			cnt[arr[(j + 1) % s]]++;
		}
	}
	dfs1(1);
	sv(ans);
	cout << ans.size() << '\n';
	for(int i : ans)cout << i << ' ';
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3020 KB Output is correct
2 Correct 8 ms 4796 KB Output is correct
3 Correct 7 ms 4684 KB Output is correct
4 Correct 3 ms 3020 KB Output is correct
5 Correct 3 ms 3020 KB Output is correct
6 Correct 8 ms 5068 KB Output is correct
7 Correct 8 ms 4812 KB Output is correct
8 Correct 7 ms 4728 KB Output is correct
9 Correct 7 ms 4812 KB Output is correct
10 Correct 3 ms 3020 KB Output is correct
11 Correct 3 ms 3020 KB Output is correct
12 Correct 3 ms 3048 KB Output is correct
13 Correct 3 ms 3020 KB Output is correct
14 Correct 3 ms 3020 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3020 KB Output is correct
2 Correct 8 ms 4796 KB Output is correct
3 Correct 7 ms 4684 KB Output is correct
4 Correct 3 ms 3020 KB Output is correct
5 Correct 3 ms 3020 KB Output is correct
6 Correct 8 ms 5068 KB Output is correct
7 Correct 8 ms 4812 KB Output is correct
8 Correct 7 ms 4728 KB Output is correct
9 Correct 7 ms 4812 KB Output is correct
10 Correct 3 ms 3020 KB Output is correct
11 Correct 3 ms 3020 KB Output is correct
12 Correct 3 ms 3048 KB Output is correct
13 Correct 3 ms 3020 KB Output is correct
14 Correct 3 ms 3020 KB Output is correct
15 Correct 24 ms 5152 KB Output is correct
16 Correct 25 ms 5160 KB Output is correct
17 Correct 34 ms 5232 KB Output is correct
18 Correct 9 ms 5160 KB Output is correct
19 Correct 8 ms 4816 KB Output is correct
20 Correct 32 ms 5268 KB Output is correct
21 Correct 35 ms 5220 KB Output is correct
22 Correct 3 ms 3020 KB Output is correct
23 Correct 8 ms 4812 KB Output is correct
24 Correct 9 ms 4728 KB Output is correct
25 Correct 3 ms 3020 KB Output is correct
26 Correct 3 ms 3052 KB Output is correct
27 Correct 8 ms 5068 KB Output is correct
28 Correct 7 ms 4812 KB Output is correct
29 Correct 8 ms 4732 KB Output is correct
30 Correct 7 ms 4812 KB Output is correct
31 Correct 3 ms 3028 KB Output is correct
32 Correct 3 ms 3020 KB Output is correct
33 Correct 3 ms 3020 KB Output is correct
34 Correct 3 ms 3020 KB Output is correct
35 Correct 3 ms 3020 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 26668 KB Output is correct
2 Correct 3 ms 3020 KB Output is correct
3 Correct 68 ms 27244 KB Output is correct
4 Correct 56 ms 26736 KB Output is correct
5 Correct 62 ms 27580 KB Output is correct
6 Correct 69 ms 27964 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 23044 KB Output is correct
2 Correct 91 ms 21316 KB Output is correct
3 Correct 101 ms 21060 KB Output is correct
4 Correct 93 ms 21080 KB Output is correct
5 Correct 101 ms 21060 KB Output is correct
6 Correct 78 ms 24260 KB Output is correct
7 Correct 71 ms 24088 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 23044 KB Output is correct
2 Correct 91 ms 21316 KB Output is correct
3 Correct 101 ms 21060 KB Output is correct
4 Correct 93 ms 21080 KB Output is correct
5 Correct 101 ms 21060 KB Output is correct
6 Correct 78 ms 24260 KB Output is correct
7 Correct 71 ms 24088 KB Output is correct
8 Correct 88 ms 24212 KB Output is correct
9 Correct 93 ms 24184 KB Output is correct
10 Correct 66 ms 27712 KB Output is correct
11 Correct 63 ms 27708 KB Output is correct
12 Correct 87 ms 20856 KB Output is correct
13 Correct 77 ms 20804 KB Output is correct
14 Correct 94 ms 20960 KB Output is correct
15 Correct 90 ms 20940 KB Output is correct
16 Correct 95 ms 21060 KB Output is correct
17 Correct 95 ms 21188 KB Output is correct
18 Correct 94 ms 21060 KB Output is correct
19 Correct 92 ms 21288 KB Output is correct
20 Correct 79 ms 24576 KB Output is correct
21 Correct 80 ms 24520 KB Output is correct
22 Correct 85 ms 24444 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3020 KB Output is correct
2 Correct 8 ms 4796 KB Output is correct
3 Correct 7 ms 4684 KB Output is correct
4 Correct 3 ms 3020 KB Output is correct
5 Correct 3 ms 3020 KB Output is correct
6 Correct 8 ms 5068 KB Output is correct
7 Correct 8 ms 4812 KB Output is correct
8 Correct 7 ms 4728 KB Output is correct
9 Correct 7 ms 4812 KB Output is correct
10 Correct 3 ms 3020 KB Output is correct
11 Correct 3 ms 3020 KB Output is correct
12 Correct 3 ms 3048 KB Output is correct
13 Correct 3 ms 3020 KB Output is correct
14 Correct 3 ms 3020 KB Output is correct
15 Correct 24 ms 5152 KB Output is correct
16 Correct 25 ms 5160 KB Output is correct
17 Correct 34 ms 5232 KB Output is correct
18 Correct 9 ms 5160 KB Output is correct
19 Correct 8 ms 4816 KB Output is correct
20 Correct 32 ms 5268 KB Output is correct
21 Correct 35 ms 5220 KB Output is correct
22 Correct 3 ms 3020 KB Output is correct
23 Correct 8 ms 4812 KB Output is correct
24 Correct 9 ms 4728 KB Output is correct
25 Correct 3 ms 3020 KB Output is correct
26 Correct 3 ms 3052 KB Output is correct
27 Correct 8 ms 5068 KB Output is correct
28 Correct 7 ms 4812 KB Output is correct
29 Correct 8 ms 4732 KB Output is correct
30 Correct 7 ms 4812 KB Output is correct
31 Correct 3 ms 3028 KB Output is correct
32 Correct 3 ms 3020 KB Output is correct
33 Correct 3 ms 3020 KB Output is correct
34 Correct 3 ms 3020 KB Output is correct
35 Correct 3 ms 3020 KB Output is correct
36 Correct 68 ms 26668 KB Output is correct
37 Correct 3 ms 3020 KB Output is correct
38 Correct 68 ms 27244 KB Output is correct
39 Correct 56 ms 26736 KB Output is correct
40 Correct 62 ms 27580 KB Output is correct
41 Correct 69 ms 27964 KB Output is correct
42 Correct 75 ms 23044 KB Output is correct
43 Correct 91 ms 21316 KB Output is correct
44 Correct 101 ms 21060 KB Output is correct
45 Correct 93 ms 21080 KB Output is correct
46 Correct 101 ms 21060 KB Output is correct
47 Correct 78 ms 24260 KB Output is correct
48 Correct 71 ms 24088 KB Output is correct
49 Correct 88 ms 24212 KB Output is correct
50 Correct 93 ms 24184 KB Output is correct
51 Correct 66 ms 27712 KB Output is correct
52 Correct 63 ms 27708 KB Output is correct
53 Correct 87 ms 20856 KB Output is correct
54 Correct 77 ms 20804 KB Output is correct
55 Correct 94 ms 20960 KB Output is correct
56 Correct 90 ms 20940 KB Output is correct
57 Correct 95 ms 21060 KB Output is correct
58 Correct 95 ms 21188 KB Output is correct
59 Correct 94 ms 21060 KB Output is correct
60 Correct 92 ms 21288 KB Output is correct
61 Correct 79 ms 24576 KB Output is correct
62 Correct 80 ms 24520 KB Output is correct
63 Correct 85 ms 24444 KB Output is correct
64 Correct 84 ms 24352 KB Output is correct
65 Correct 107 ms 21096 KB Output is correct
66 Correct 103 ms 20976 KB Output is correct
67 Correct 102 ms 21024 KB Output is correct
68 Correct 74 ms 20808 KB Output is correct
69 Correct 74 ms 20756 KB Output is correct
70 Correct 87 ms 24724 KB Output is correct
71 Correct 83 ms 24048 KB Output is correct
72 Correct 3 ms 3020 KB Output is correct
73 Correct 7 ms 4684 KB Output is correct
74 Correct 7 ms 4728 KB Output is correct
75 Correct 3 ms 3020 KB Output is correct
76 Correct 3 ms 3020 KB Output is correct
77 Correct 8 ms 5112 KB Output is correct
78 Correct 8 ms 4940 KB Output is correct
79 Correct 7 ms 4684 KB Output is correct
80 Correct 7 ms 4812 KB Output is correct
81 Correct 2 ms 3020 KB Output is correct
82 Correct 2 ms 3020 KB Output is correct
83 Correct 3 ms 3020 KB Output is correct
84 Correct 3 ms 3020 KB Output is correct
85 Correct 3 ms 3020 KB Output is correct
86 Correct 25 ms 5164 KB Output is correct
87 Correct 25 ms 5164 KB Output is correct
88 Correct 25 ms 5200 KB Output is correct
89 Correct 8 ms 5164 KB Output is correct
90 Correct 10 ms 4860 KB Output is correct
91 Correct 33 ms 5228 KB Output is correct
92 Correct 39 ms 5196 KB Output is correct
93 Correct 4 ms 3048 KB Output is correct
94 Correct 66 ms 27620 KB Output is correct
95 Correct 59 ms 27248 KB Output is correct
96 Correct 62 ms 26696 KB Output is correct
97 Correct 62 ms 27572 KB Output is correct
98 Correct 65 ms 27988 KB Output is correct
99 Correct 93 ms 21084 KB Output is correct
100 Correct 96 ms 21076 KB Output is correct
101 Correct 98 ms 21064 KB Output is correct
102 Correct 91 ms 21316 KB Output is correct
103 Correct 72 ms 24188 KB Output is correct
104 Correct 75 ms 24524 KB Output is correct
105 Correct 92 ms 24260 KB Output is correct
106 Correct 89 ms 24320 KB Output is correct
107 Correct 90 ms 24132 KB Output is correct
108 Correct 62 ms 27708 KB Output is correct
109 Correct 77 ms 27660 KB Output is correct
110 Correct 85 ms 20880 KB Output is correct
111 Correct 78 ms 20812 KB Output is correct
112 Correct 90 ms 21008 KB Output is correct
113 Correct 94 ms 20940 KB Output is correct