oj.uz

Submission #966244

# Submission time Handle Problem Language Result Execution time Memory
966244 2024-04-19T15:02:37 Z oblantis Railway (BOI17_railway) C++17
100 / 100
 86 ms 27084 KB 
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
//#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define pb push_back
#define ss second
#define ff first
#define vt vector
#define uid(a, b) uniform_int_distribution<int>(a, b)(mt)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 2e9;
const int mod = 1e9+7;
const int maxn = 1e5;
mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
vt<int> g[maxn];
bool was[maxn];
int in[maxn], out[maxn], up[maxn][20], dp[maxn], cnt, p[maxn];
void dfs(int v){
    in[v] = cnt++;
    for(auto i : g[v]){
        if(i == up[v][0])continue;
        up[i][0] = v, dp[i] = dp[v] + 1;
        for(int j = 1; j < 20; j++)up[i][j] = up[up[i][j - 1]][j - 1];
        dfs(i);
    }
    out[v] = cnt++;
}
bool cmp(int x, int y){
    return in[x] < in[y];
}
void checkup(int v){
    for(auto i : g[v]){
        if(i == up[v][0])continue;
        checkup(i);
        p[v] += p[i];
    }
}
int lca(int x, int y){
    if(dp[x] > dp[y])swap(x, y);
    int k = dp[y] - dp[x], j = 0;
    while(k){
        if(k & 1){
            y = up[y][j];
        }
        k >>= 1, j++;
    }
    if(y == x)return x;
    for(int j = 19; j >= 0; j--){
        if(up[x][j] != up[y][j]){
            x = up[x][j], y = up[y][j];
        }
    }
    return up[x][0];
}
int nw, sz;
vt<int> c;
void go(int v){
    p[v]++;
    was[v] = 0;
    while(nw < sz && in[c[nw]] < out[v]){
        nw++;
        p[v]--;
        go(c[nw - 1]);
    }
}
void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    int u[n - 1], v[n - 1];
    for(int i = 0; i < n - 1; i++){
        cin >> u[i] >> v[i];
        --u[i], --v[i];
        g[u[i]].pb(v[i]), g[v[i]].pb(u[i]);
    }
    dfs(0);
    for(int i = 0; i < m; i++){
        cin >> sz;
        c.resize(sz, 0);
        for(int j = 0; j < sz; j++){
            cin >> c[j];
            --c[j];
            was[c[j]] = 1;
        }
        sort(all(c), cmp);
        for(int j = 1; j < sz; j++){
            int LCA = lca(c[j], c[j - 1]);
            if(!was[LCA])c.pb(LCA), was[LCA] = 1;
        }
        sz = c.size();
        sort(all(c), cmp);
        nw = 1;
        go(c[0]);
        p[c[0]]--;
    }
    checkup(0);
    vt<int> ans;
    for(int i = 0; i < n - 1; i++){
        if(dp[u[i]] > dp[v[i]])swap(u[i], v[i]);
        if(p[v[i]] >= k){
            ans.pb(i + 1);
        }
    }
    cout << ans.size() << '\n';
    for(auto i : ans)cout << i << ' ';
}
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int times = 1; //cin >> times;
	for(int i = 1; i <= times; i++) {
		solve();
	}
	return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3928 KB Output is correct
2 Correct 5 ms 5220 KB Output is correct
3 Correct 5 ms 5212 KB Output is correct
4 Correct 1 ms 3932 KB Output is correct
5 Correct 1 ms 3932 KB Output is correct
6 Correct 6 ms 5724 KB Output is correct
7 Correct 5 ms 5212 KB Output is correct
8 Correct 4 ms 5208 KB Output is correct
9 Correct 4 ms 5212 KB Output is correct
10 Correct 1 ms 3932 KB Output is correct
11 Correct 1 ms 3920 KB Output is correct
12 Correct 1 ms 3932 KB Output is correct
13 Correct 1 ms 3932 KB Output is correct
14 Correct 1 ms 3932 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3928 KB Output is correct
2 Correct 5 ms 5220 KB Output is correct
3 Correct 5 ms 5212 KB Output is correct
4 Correct 1 ms 3932 KB Output is correct
5 Correct 1 ms 3932 KB Output is correct
6 Correct 6 ms 5724 KB Output is correct
7 Correct 5 ms 5212 KB Output is correct
8 Correct 4 ms 5208 KB Output is correct
9 Correct 4 ms 5212 KB Output is correct
10 Correct 1 ms 3932 KB Output is correct
11 Correct 1 ms 3920 KB Output is correct
12 Correct 1 ms 3932 KB Output is correct
13 Correct 1 ms 3932 KB Output is correct
14 Correct 1 ms 3932 KB Output is correct
15 Correct 20 ms 5560 KB Output is correct
16 Correct 20 ms 5468 KB Output is correct
17 Correct 21 ms 5976 KB Output is correct
18 Correct 5 ms 5724 KB Output is correct
19 Correct 5 ms 5216 KB Output is correct
20 Correct 19 ms 5720 KB Output is correct
21 Correct 20 ms 5724 KB Output is correct
22 Correct 1 ms 3932 KB Output is correct
23 Correct 6 ms 5212 KB Output is correct
24 Correct 5 ms 5208 KB Output is correct
25 Correct 1 ms 3932 KB Output is correct
26 Correct 1 ms 3924 KB Output is correct
27 Correct 6 ms 5724 KB Output is correct
28 Correct 5 ms 5208 KB Output is correct
29 Correct 4 ms 5212 KB Output is correct
30 Correct 4 ms 5212 KB Output is correct
31 Correct 2 ms 3932 KB Output is correct
32 Correct 1 ms 3932 KB Output is correct
33 Correct 1 ms 3916 KB Output is correct
34 Correct 1 ms 3928 KB Output is correct
35 Correct 1 ms 3928 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 26572 KB Output is correct
2 Correct 1 ms 3932 KB Output is correct
3 Correct 81 ms 26220 KB Output is correct
4 Correct 55 ms 25776 KB Output is correct
5 Correct 58 ms 26572 KB Output is correct
6 Correct 60 ms 26936 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 21708 KB Output is correct
2 Correct 57 ms 18260 KB Output is correct
3 Correct 82 ms 17868 KB Output is correct
4 Correct 61 ms 18004 KB Output is correct
5 Correct 58 ms 17928 KB Output is correct
6 Correct 54 ms 22028 KB Output is correct
7 Correct 52 ms 22004 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 21708 KB Output is correct
2 Correct 57 ms 18260 KB Output is correct
3 Correct 82 ms 17868 KB Output is correct
4 Correct 61 ms 18004 KB Output is correct
5 Correct 58 ms 17928 KB Output is correct
6 Correct 54 ms 22028 KB Output is correct
7 Correct 52 ms 22004 KB Output is correct
8 Correct 65 ms 22100 KB Output is correct
9 Correct 67 ms 21880 KB Output is correct
10 Correct 73 ms 26824 KB Output is correct
11 Correct 58 ms 26572 KB Output is correct
12 Correct 49 ms 17756 KB Output is correct
13 Correct 48 ms 17752 KB Output is correct
14 Correct 65 ms 17996 KB Output is correct
15 Correct 62 ms 18000 KB Output is correct
16 Correct 64 ms 18000 KB Output is correct
17 Correct 57 ms 18000 KB Output is correct
18 Correct 67 ms 18076 KB Output is correct
19 Correct 80 ms 18516 KB Output is correct
20 Correct 59 ms 22124 KB Output is correct
21 Correct 57 ms 22288 KB Output is correct
22 Correct 55 ms 22096 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3928 KB Output is correct
2 Correct 5 ms 5220 KB Output is correct
3 Correct 5 ms 5212 KB Output is correct
4 Correct 1 ms 3932 KB Output is correct
5 Correct 1 ms 3932 KB Output is correct
6 Correct 6 ms 5724 KB Output is correct
7 Correct 5 ms 5212 KB Output is correct
8 Correct 4 ms 5208 KB Output is correct
9 Correct 4 ms 5212 KB Output is correct
10 Correct 1 ms 3932 KB Output is correct
11 Correct 1 ms 3920 KB Output is correct
12 Correct 1 ms 3932 KB Output is correct
13 Correct 1 ms 3932 KB Output is correct
14 Correct 1 ms 3932 KB Output is correct
15 Correct 20 ms 5560 KB Output is correct
16 Correct 20 ms 5468 KB Output is correct
17 Correct 21 ms 5976 KB Output is correct
18 Correct 5 ms 5724 KB Output is correct
19 Correct 5 ms 5216 KB Output is correct
20 Correct 19 ms 5720 KB Output is correct
21 Correct 20 ms 5724 KB Output is correct
22 Correct 1 ms 3932 KB Output is correct
23 Correct 6 ms 5212 KB Output is correct
24 Correct 5 ms 5208 KB Output is correct
25 Correct 1 ms 3932 KB Output is correct
26 Correct 1 ms 3924 KB Output is correct
27 Correct 6 ms 5724 KB Output is correct
28 Correct 5 ms 5208 KB Output is correct
29 Correct 4 ms 5212 KB Output is correct
30 Correct 4 ms 5212 KB Output is correct
31 Correct 2 ms 3932 KB Output is correct
32 Correct 1 ms 3932 KB Output is correct
33 Correct 1 ms 3916 KB Output is correct
34 Correct 1 ms 3928 KB Output is correct
35 Correct 1 ms 3928 KB Output is correct
36 Correct 58 ms 26572 KB Output is correct
37 Correct 1 ms 3932 KB Output is correct
38 Correct 81 ms 26220 KB Output is correct
39 Correct 55 ms 25776 KB Output is correct
40 Correct 58 ms 26572 KB Output is correct
41 Correct 60 ms 26936 KB Output is correct
42 Correct 52 ms 21708 KB Output is correct
43 Correct 57 ms 18260 KB Output is correct
44 Correct 82 ms 17868 KB Output is correct
45 Correct 61 ms 18004 KB Output is correct
46 Correct 58 ms 17928 KB Output is correct
47 Correct 54 ms 22028 KB Output is correct
48 Correct 52 ms 22004 KB Output is correct
49 Correct 65 ms 22100 KB Output is correct
50 Correct 67 ms 21880 KB Output is correct
51 Correct 73 ms 26824 KB Output is correct
52 Correct 58 ms 26572 KB Output is correct
53 Correct 49 ms 17756 KB Output is correct
54 Correct 48 ms 17752 KB Output is correct
55 Correct 65 ms 17996 KB Output is correct
56 Correct 62 ms 18000 KB Output is correct
57 Correct 64 ms 18000 KB Output is correct
58 Correct 57 ms 18000 KB Output is correct
59 Correct 67 ms 18076 KB Output is correct
60 Correct 80 ms 18516 KB Output is correct
61 Correct 59 ms 22124 KB Output is correct
62 Correct 57 ms 22288 KB Output is correct
63 Correct 55 ms 22096 KB Output is correct
64 Correct 62 ms 22092 KB Output is correct
65 Correct 77 ms 18252 KB Output is correct
66 Correct 71 ms 17964 KB Output is correct
67 Correct 65 ms 18000 KB Output is correct
68 Correct 47 ms 17892 KB Output is correct
69 Correct 45 ms 17720 KB Output is correct
70 Correct 57 ms 22484 KB Output is correct
71 Correct 62 ms 21740 KB Output is correct
72 Correct 1 ms 3932 KB Output is correct
73 Correct 5 ms 5212 KB Output is correct
74 Correct 5 ms 5148 KB Output is correct
75 Correct 2 ms 3932 KB Output is correct
76 Correct 1 ms 3932 KB Output is correct
77 Correct 6 ms 5720 KB Output is correct
78 Correct 5 ms 5208 KB Output is correct
79 Correct 4 ms 5212 KB Output is correct
80 Correct 6 ms 5212 KB Output is correct
81 Correct 1 ms 3932 KB Output is correct
82 Correct 1 ms 3932 KB Output is correct
83 Correct 1 ms 3932 KB Output is correct
84 Correct 1 ms 3740 KB Output is correct
85 Correct 1 ms 3932 KB Output is correct
86 Correct 23 ms 5468 KB Output is correct
87 Correct 21 ms 5464 KB Output is correct
88 Correct 21 ms 5716 KB Output is correct
89 Correct 5 ms 5724 KB Output is correct
90 Correct 5 ms 5212 KB Output is correct
91 Correct 19 ms 5724 KB Output is correct
92 Correct 19 ms 5724 KB Output is correct
93 Correct 2 ms 3928 KB Output is correct
94 Correct 60 ms 26572 KB Output is correct
95 Correct 56 ms 26320 KB Output is correct
96 Correct 54 ms 25752 KB Output is correct
97 Correct 56 ms 26568 KB Output is correct
98 Correct 60 ms 27084 KB Output is correct
99 Correct 57 ms 18004 KB Output is correct
100 Correct 57 ms 17984 KB Output is correct
101 Correct 57 ms 17968 KB Output is correct
102 Correct 57 ms 18256 KB Output is correct
103 Correct 53 ms 22004 KB Output is correct
104 Correct 57 ms 22228 KB Output is correct
105 Correct 54 ms 22096 KB Output is correct
106 Correct 62 ms 22152 KB Output is correct
107 Correct 65 ms 22020 KB Output is correct
108 Correct 59 ms 26680 KB Output is correct
109 Correct 56 ms 26824 KB Output is correct
110 Correct 47 ms 17984 KB Output is correct
111 Correct 50 ms 17980 KB Output is correct
112 Correct 68 ms 18004 KB Output is correct
113 Correct 86 ms 17820 KB Output is correct