oj.uz

Submission #732881

# Submission time Handle Problem Language Result Execution time Memory
732881 2023-04-29T11:21:53 Z Trunkty Railway (BOI17_railway) C++14
100 / 100
 285 ms 74444 KB 
#include <bits/extc++.h>
using namespace std;
typedef long long ll;
#define int ll

int n,m,k;
vector<vector<int>> roads[100005];
int jump[100005][21],dep[100005];
vector<int> toadd[100005],torem[100005];
set<int> s[100005];
int roadid[100005];
vector<int> ans;

void dfs(int x, int p){
    for(vector<int> i:roads[x]){
        if(i[0]!=p){
            dep[i[0]] = dep[x]+1;
            jump[i[0]][0] = x;
            roadid[i[0]] = i[1];
            dfs(i[0],x);
        }
    }
}

int lca(int a, int b){
    if(dep[a]>dep[b]){
        swap(a,b);
    }
    for(int j=20;j>=0;j--){
        if(dep[b]-(1<<j)>=dep[a]){
            b = jump[b][j];
        }
    }
    if(a==b){
        return a;
    }
    for(int j=20;j>=0;j--){
        if(jump[a][j]!=jump[b][j]){
            a = jump[a][j];
            b = jump[b][j];
        }
    }
    return jump[a][0];
}

void dfs2(int x, int p){
    for(int i:toadd[x]){
        s[x].insert(i);
    }
    for(vector<int> i:roads[x]){
        if(i[0]!=p){
            dfs2(i[0],x);
            if(s[i[0]].size()>s[x].size()){
                swap(s[x],s[i[0]]);
            }
            for(int j:s[i[0]]){
                s[x].insert(j);
            }
        }
    }
    for(int i:torem[x]){
        s[x].erase(i);
    }
    if(x==1){
        return;
    }
    if(s[x].size()>=k){
        ans.push_back(roadid[x]);
    }
}

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
    cin >> n >> m >> k;
    for(int i=1;i<=n-1;i++){
        int a,b;
        cin >> a >> b;
        roads[a].push_back({b,i});
        roads[b].push_back({a,i});
    }
    dfs(1,-1);
    for(int j=1;j<=20;j++){
        for(int i=1;i<=n;i++){
            jump[i][j] = jump[jump[i][j-1]][j-1];
        }
    }
    for(int i=1;i<=m;i++){
        int a;
        cin >> a;
        vector<int> v;
        for(int j=1;j<=a;j++){
            int b;
            cin >> b;
            v.push_back(b);
            toadd[b].push_back(i);
        }
        while(v.size()>=2){
            int b = v.back();
            v.pop_back();
            int c = v.back();
            v.pop_back();
            v.push_back(lca(b,c));
        }
        torem[v[0]].push_back(i);
    }
    dfs2(1,-1);
    sort(ans.begin(),ans.end());
    cout << ans.size() << "\n";
    for(int i:ans){
        cout << i << " ";
    }
	return 0;
}

Compilation message

railway.cpp: In function 'void dfs2(ll, ll)':
railway.cpp:67:19: warning: comparison of integer expressions of different signedness: 'std::set<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   67 |     if(s[x].size()>=k){
      |        ~~~~~~~~~~~^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12204 KB Output is correct
2 Correct 19 ms 15316 KB Output is correct
3 Correct 19 ms 15316 KB Output is correct
4 Correct 7 ms 12072 KB Output is correct
5 Correct 7 ms 11988 KB Output is correct
6 Correct 20 ms 16316 KB Output is correct
7 Correct 18 ms 15536 KB Output is correct
8 Correct 17 ms 15392 KB Output is correct
9 Correct 20 ms 15472 KB Output is correct
10 Correct 8 ms 12076 KB Output is correct
11 Correct 8 ms 12080 KB Output is correct
12 Correct 9 ms 12104 KB Output is correct
13 Correct 9 ms 12028 KB Output is correct
14 Correct 8 ms 12048 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12204 KB Output is correct
2 Correct 19 ms 15316 KB Output is correct
3 Correct 19 ms 15316 KB Output is correct
4 Correct 7 ms 12072 KB Output is correct
5 Correct 7 ms 11988 KB Output is correct
6 Correct 20 ms 16316 KB Output is correct
7 Correct 18 ms 15536 KB Output is correct
8 Correct 17 ms 15392 KB Output is correct
9 Correct 20 ms 15472 KB Output is correct
10 Correct 8 ms 12076 KB Output is correct
11 Correct 8 ms 12080 KB Output is correct
12 Correct 9 ms 12104 KB Output is correct
13 Correct 9 ms 12028 KB Output is correct
14 Correct 8 ms 12048 KB Output is correct
15 Correct 59 ms 22288 KB Output is correct
16 Correct 56 ms 22248 KB Output is correct
17 Correct 58 ms 22192 KB Output is correct
18 Correct 21 ms 16496 KB Output is correct
19 Correct 18 ms 15544 KB Output is correct
20 Correct 55 ms 21728 KB Output is correct
21 Correct 57 ms 21752 KB Output is correct
22 Correct 7 ms 11988 KB Output is correct
23 Correct 17 ms 15412 KB Output is correct
24 Correct 17 ms 15420 KB Output is correct
25 Correct 7 ms 11988 KB Output is correct
26 Correct 9 ms 11988 KB Output is correct
27 Correct 21 ms 16432 KB Output is correct
28 Correct 16 ms 15544 KB Output is correct
29 Correct 17 ms 15400 KB Output is correct
30 Correct 15 ms 15488 KB Output is correct
31 Correct 8 ms 11988 KB Output is correct
32 Correct 9 ms 12076 KB Output is correct
33 Correct 9 ms 12076 KB Output is correct
34 Correct 7 ms 11988 KB Output is correct
35 Correct 9 ms 11988 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 72744 KB Output is correct
2 Correct 7 ms 11988 KB Output is correct
3 Correct 217 ms 72376 KB Output is correct
4 Correct 254 ms 71768 KB Output is correct
5 Correct 199 ms 71388 KB Output is correct
6 Correct 185 ms 74444 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 61260 KB Output is correct
2 Correct 222 ms 55548 KB Output is correct
3 Correct 237 ms 61656 KB Output is correct
4 Correct 258 ms 61520 KB Output is correct
5 Correct 215 ms 61696 KB Output is correct
6 Correct 177 ms 61648 KB Output is correct
7 Correct 182 ms 61276 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 61260 KB Output is correct
2 Correct 222 ms 55548 KB Output is correct
3 Correct 237 ms 61656 KB Output is correct
4 Correct 258 ms 61520 KB Output is correct
5 Correct 215 ms 61696 KB Output is correct
6 Correct 177 ms 61648 KB Output is correct
7 Correct 182 ms 61276 KB Output is correct
8 Correct 206 ms 60912 KB Output is correct
9 Correct 187 ms 60900 KB Output is correct
10 Correct 165 ms 71220 KB Output is correct
11 Correct 157 ms 71236 KB Output is correct
12 Correct 136 ms 49980 KB Output is correct
13 Correct 152 ms 49980 KB Output is correct
14 Correct 213 ms 56400 KB Output is correct
15 Correct 204 ms 56644 KB Output is correct
16 Correct 245 ms 62804 KB Output is correct
17 Correct 225 ms 63044 KB Output is correct
18 Correct 207 ms 60824 KB Output is correct
19 Correct 213 ms 56268 KB Output is correct
20 Correct 180 ms 62296 KB Output is correct
21 Correct 201 ms 62412 KB Output is correct
22 Correct 183 ms 61924 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12204 KB Output is correct
2 Correct 19 ms 15316 KB Output is correct
3 Correct 19 ms 15316 KB Output is correct
4 Correct 7 ms 12072 KB Output is correct
5 Correct 7 ms 11988 KB Output is correct
6 Correct 20 ms 16316 KB Output is correct
7 Correct 18 ms 15536 KB Output is correct
8 Correct 17 ms 15392 KB Output is correct
9 Correct 20 ms 15472 KB Output is correct
10 Correct 8 ms 12076 KB Output is correct
11 Correct 8 ms 12080 KB Output is correct
12 Correct 9 ms 12104 KB Output is correct
13 Correct 9 ms 12028 KB Output is correct
14 Correct 8 ms 12048 KB Output is correct
15 Correct 59 ms 22288 KB Output is correct
16 Correct 56 ms 22248 KB Output is correct
17 Correct 58 ms 22192 KB Output is correct
18 Correct 21 ms 16496 KB Output is correct
19 Correct 18 ms 15544 KB Output is correct
20 Correct 55 ms 21728 KB Output is correct
21 Correct 57 ms 21752 KB Output is correct
22 Correct 7 ms 11988 KB Output is correct
23 Correct 17 ms 15412 KB Output is correct
24 Correct 17 ms 15420 KB Output is correct
25 Correct 7 ms 11988 KB Output is correct
26 Correct 9 ms 11988 KB Output is correct
27 Correct 21 ms 16432 KB Output is correct
28 Correct 16 ms 15544 KB Output is correct
29 Correct 17 ms 15400 KB Output is correct
30 Correct 15 ms 15488 KB Output is correct
31 Correct 8 ms 11988 KB Output is correct
32 Correct 9 ms 12076 KB Output is correct
33 Correct 9 ms 12076 KB Output is correct
34 Correct 7 ms 11988 KB Output is correct
35 Correct 9 ms 11988 KB Output is correct
36 Correct 234 ms 72744 KB Output is correct
37 Correct 7 ms 11988 KB Output is correct
38 Correct 217 ms 72376 KB Output is correct
39 Correct 254 ms 71768 KB Output is correct
40 Correct 199 ms 71388 KB Output is correct
41 Correct 185 ms 74444 KB Output is correct
42 Correct 227 ms 61260 KB Output is correct
43 Correct 222 ms 55548 KB Output is correct
44 Correct 237 ms 61656 KB Output is correct
45 Correct 258 ms 61520 KB Output is correct
46 Correct 215 ms 61696 KB Output is correct
47 Correct 177 ms 61648 KB Output is correct
48 Correct 182 ms 61276 KB Output is correct
49 Correct 206 ms 60912 KB Output is correct
50 Correct 187 ms 60900 KB Output is correct
51 Correct 165 ms 71220 KB Output is correct
52 Correct 157 ms 71236 KB Output is correct
53 Correct 136 ms 49980 KB Output is correct
54 Correct 152 ms 49980 KB Output is correct
55 Correct 213 ms 56400 KB Output is correct
56 Correct 204 ms 56644 KB Output is correct
57 Correct 245 ms 62804 KB Output is correct
58 Correct 225 ms 63044 KB Output is correct
59 Correct 207 ms 60824 KB Output is correct
60 Correct 213 ms 56268 KB Output is correct
61 Correct 180 ms 62296 KB Output is correct
62 Correct 201 ms 62412 KB Output is correct
63 Correct 183 ms 61924 KB Output is correct
64 Correct 212 ms 61372 KB Output is correct
65 Correct 285 ms 69080 KB Output is correct
66 Correct 276 ms 64612 KB Output is correct
67 Correct 229 ms 60148 KB Output is correct
68 Correct 140 ms 47948 KB Output is correct
69 Correct 131 ms 47948 KB Output is correct
70 Correct 199 ms 62708 KB Output is correct
71 Correct 191 ms 60660 KB Output is correct
72 Correct 8 ms 12076 KB Output is correct
73 Correct 15 ms 15420 KB Output is correct
74 Correct 15 ms 15416 KB Output is correct
75 Correct 7 ms 12116 KB Output is correct
76 Correct 7 ms 12072 KB Output is correct
77 Correct 16 ms 16384 KB Output is correct
78 Correct 16 ms 15612 KB Output is correct
79 Correct 14 ms 15316 KB Output is correct
80 Correct 14 ms 15412 KB Output is correct
81 Correct 7 ms 12092 KB Output is correct
82 Correct 6 ms 11988 KB Output is correct
83 Correct 7 ms 11988 KB Output is correct
84 Correct 6 ms 11988 KB Output is correct
85 Correct 6 ms 11988 KB Output is correct
86 Correct 50 ms 22288 KB Output is correct
87 Correct 47 ms 22228 KB Output is correct
88 Correct 47 ms 22284 KB Output is correct
89 Correct 21 ms 16500 KB Output is correct
90 Correct 17 ms 15640 KB Output is correct
91 Correct 48 ms 21600 KB Output is correct
92 Correct 50 ms 21640 KB Output is correct
93 Correct 6 ms 12076 KB Output is correct
94 Correct 204 ms 72748 KB Output is correct
95 Correct 201 ms 72460 KB Output is correct
96 Correct 195 ms 71692 KB Output is correct
97 Correct 194 ms 71352 KB Output is correct
98 Correct 165 ms 74300 KB Output is correct
99 Correct 230 ms 65288 KB Output is correct
100 Correct 229 ms 62604 KB Output is correct
101 Correct 232 ms 62880 KB Output is correct
102 Correct 219 ms 56008 KB Output is correct
103 Correct 175 ms 62176 KB Output is correct
104 Correct 200 ms 62292 KB Output is correct
105 Correct 174 ms 61592 KB Output is correct
106 Correct 183 ms 61016 KB Output is correct
107 Correct 172 ms 61004 KB Output is correct
108 Correct 183 ms 71300 KB Output is correct
109 Correct 160 ms 71236 KB Output is correct
110 Correct 135 ms 50032 KB Output is correct
111 Correct 139 ms 50064 KB Output is correct
112 Correct 198 ms 56176 KB Output is correct
113 Correct 188 ms 56232 KB Output is correct