oj.uz

Submission #984743

# Submission time Handle Problem Language Result Execution time Memory
984743 2024-05-17T04:25:03 Z Br3ad Railway (BOI17_railway) C++17
100 / 100
 212 ms 35828 KB 
#include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>

using namespace std;
#define ll long long
#define ull unsigned long long
#define f first
#define s second
#define PF push_front
#define PB push_back
#define MP make_pair
#define max(a, b) ((a > b)? a : b)
#define min(a, b) ((a < b)? a : b)
#define max3(a, b, c) max(max(a, b), c)
#define min3(a, b, c) min(min(a, b), c)

const int N = 1e5 + 5;
const int M = 1e9 + 7; 
const int inf = 0x3f3f3f3f;
const ll int INF = 1e18;

struct BIT {
    int sz;
    vector<int> tree;

    BIT(int n) : sz(n+1), tree(n+1, 0) {};

    void add(int pos, int val){
        for(; pos < sz; pos += pos&-pos) tree[pos] += val;
    }

    int sum(int pos){
        int ans = 0;
        for(; pos >= 1; pos -= pos&-pos) ans += tree[pos];
        return ans;
    }
};

vector<vector<int>> adj(N, vector<int>()), par(19, vector<int>(N));
vector<int> to(N), tin(N), tout(N);
map<pair<int, int>, int> ind;

int timer = 1;
void dfs(int cur, int prev){
    tin[cur] = timer++;
    for(int child : adj[cur]){
        if(child == prev) continue;
        to[child] = cur;
        dfs(child, cur);
    }
    tout[cur] = timer++;
}

bool isAncestor(int anc, int child){
    return (tin[anc] <= tin[child] && tout[anc] >= tout[child]);
}

int get_lca(int a, int b){
    if(isAncestor(b, a)) return b;
    int lca = a, cur = b;
    for(int i = 18; i >= 0; i--){
        int next_cur = par[i][cur];
        if(isAncestor(next_cur, a)){
            lca = next_cur;
        }else {
            cur = next_cur;
        }
    }
    return lca;
}



int main(){
    
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    
    // ifstream cin();
    // ofstream cout();
    
    int n, m, k;
    cin >> n >> m >> k;
    for(int i = 1; i <= n-1; i++){
        int a, b;
        cin >> a >> b;

        ind[MP(a, b)] = i;
        ind[MP(b, a)] = i;

        adj[a].PB(b);
        adj[b].PB(a);
    }

    to[1] = 1;
    dfs(1, -1);

    BIT bit(n*2);

    for(int i = 1; i <= n; i++) par[0][i] = to[i];
    for(int i = 1; i < 19; i++){
        for(int j = 1; j <= n; j++){
            par[i][j] = par[i-1][par[i-1][j]];
        }
    }

    for(int i = 0; i < m; i++){
        int num;
        cin >> num;
        vector<int> query(num);
        for(int j = 0; j < num; j++) cin >> query[j];
        sort(query.begin(), query.end(), [](int &a, int &b){return tin[a] < tin[b];});
        query.PB(query[0]);

        for(int j = 0; j < num; j++){
            int lca = get_lca(query[j], query[j+1]);
            bit.add(tin[query[j]], 1);
            bit.add(tin[query[j+1]], 1);
            bit.add(tin[lca], -2);
        }
    }

    vector<int> ans;
    for(int i = 2; i <= n; i++){
        if(bit.sum(tout[i]) - bit.sum(tin[i]-1) >= 2*k){
            ans.PB(ind[MP(i, to[i])]);
        }
    }

    sort(ans.begin(), ans.end());

    cout << ans.size() << endl;
    for(int i : ans) cout << i << ' ';
    
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11220 KB Output is correct
2 Correct 13 ms 13008 KB Output is correct
3 Correct 13 ms 12980 KB Output is correct
4 Correct 6 ms 11220 KB Output is correct
5 Correct 6 ms 11220 KB Output is correct
6 Correct 16 ms 13404 KB Output is correct
7 Correct 13 ms 13260 KB Output is correct
8 Correct 12 ms 13012 KB Output is correct
9 Correct 12 ms 13012 KB Output is correct
10 Correct 5 ms 11220 KB Output is correct
11 Correct 6 ms 11460 KB Output is correct
12 Correct 6 ms 11452 KB Output is correct
13 Correct 6 ms 11220 KB Output is correct
14 Correct 6 ms 11220 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11220 KB Output is correct
2 Correct 13 ms 13008 KB Output is correct
3 Correct 13 ms 12980 KB Output is correct
4 Correct 6 ms 11220 KB Output is correct
5 Correct 6 ms 11220 KB Output is correct
6 Correct 16 ms 13404 KB Output is correct
7 Correct 13 ms 13260 KB Output is correct
8 Correct 12 ms 13012 KB Output is correct
9 Correct 12 ms 13012 KB Output is correct
10 Correct 5 ms 11220 KB Output is correct
11 Correct 6 ms 11460 KB Output is correct
12 Correct 6 ms 11452 KB Output is correct
13 Correct 6 ms 11220 KB Output is correct
14 Correct 6 ms 11220 KB Output is correct
15 Correct 45 ms 13512 KB Output is correct
16 Correct 41 ms 13520 KB Output is correct
17 Correct 40 ms 13552 KB Output is correct
18 Correct 13 ms 13264 KB Output is correct
19 Correct 18 ms 13268 KB Output is correct
20 Correct 40 ms 13524 KB Output is correct
21 Correct 51 ms 13688 KB Output is correct
22 Correct 6 ms 11220 KB Output is correct
23 Correct 13 ms 13016 KB Output is correct
24 Correct 14 ms 13156 KB Output is correct
25 Correct 6 ms 11220 KB Output is correct
26 Correct 6 ms 11220 KB Output is correct
27 Correct 13 ms 13268 KB Output is correct
28 Correct 13 ms 13268 KB Output is correct
29 Correct 12 ms 13012 KB Output is correct
30 Correct 12 ms 13012 KB Output is correct
31 Correct 6 ms 11220 KB Output is correct
32 Correct 6 ms 11220 KB Output is correct
33 Correct 6 ms 11416 KB Output is correct
34 Correct 6 ms 11216 KB Output is correct
35 Correct 6 ms 11220 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 33740 KB Output is correct
2 Correct 5 ms 11220 KB Output is correct
3 Correct 147 ms 33484 KB Output is correct
4 Correct 115 ms 32564 KB Output is correct
5 Correct 171 ms 33840 KB Output is correct
6 Correct 157 ms 33844 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 30152 KB Output is correct
2 Correct 146 ms 28104 KB Output is correct
3 Correct 164 ms 27984 KB Output is correct
4 Correct 176 ms 27768 KB Output is correct
5 Correct 170 ms 27864 KB Output is correct
6 Correct 128 ms 30400 KB Output is correct
7 Correct 122 ms 30240 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 30152 KB Output is correct
2 Correct 146 ms 28104 KB Output is correct
3 Correct 164 ms 27984 KB Output is correct
4 Correct 176 ms 27768 KB Output is correct
5 Correct 170 ms 27864 KB Output is correct
6 Correct 128 ms 30400 KB Output is correct
7 Correct 122 ms 30240 KB Output is correct
8 Correct 144 ms 30412 KB Output is correct
9 Correct 152 ms 30332 KB Output is correct
10 Correct 173 ms 33988 KB Output is correct
11 Correct 142 ms 33864 KB Output is correct
12 Correct 131 ms 28144 KB Output is correct
13 Correct 133 ms 29652 KB Output is correct
14 Correct 164 ms 29644 KB Output is correct
15 Correct 163 ms 29644 KB Output is correct
16 Correct 212 ms 29780 KB Output is correct
17 Correct 166 ms 29708 KB Output is correct
18 Correct 160 ms 29720 KB Output is correct
19 Correct 156 ms 29908 KB Output is correct
20 Correct 117 ms 32324 KB Output is correct
21 Correct 136 ms 32432 KB Output is correct
22 Correct 127 ms 32204 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11220 KB Output is correct
2 Correct 13 ms 13008 KB Output is correct
3 Correct 13 ms 12980 KB Output is correct
4 Correct 6 ms 11220 KB Output is correct
5 Correct 6 ms 11220 KB Output is correct
6 Correct 16 ms 13404 KB Output is correct
7 Correct 13 ms 13260 KB Output is correct
8 Correct 12 ms 13012 KB Output is correct
9 Correct 12 ms 13012 KB Output is correct
10 Correct 5 ms 11220 KB Output is correct
11 Correct 6 ms 11460 KB Output is correct
12 Correct 6 ms 11452 KB Output is correct
13 Correct 6 ms 11220 KB Output is correct
14 Correct 6 ms 11220 KB Output is correct
15 Correct 45 ms 13512 KB Output is correct
16 Correct 41 ms 13520 KB Output is correct
17 Correct 40 ms 13552 KB Output is correct
18 Correct 13 ms 13264 KB Output is correct
19 Correct 18 ms 13268 KB Output is correct
20 Correct 40 ms 13524 KB Output is correct
21 Correct 51 ms 13688 KB Output is correct
22 Correct 6 ms 11220 KB Output is correct
23 Correct 13 ms 13016 KB Output is correct
24 Correct 14 ms 13156 KB Output is correct
25 Correct 6 ms 11220 KB Output is correct
26 Correct 6 ms 11220 KB Output is correct
27 Correct 13 ms 13268 KB Output is correct
28 Correct 13 ms 13268 KB Output is correct
29 Correct 12 ms 13012 KB Output is correct
30 Correct 12 ms 13012 KB Output is correct
31 Correct 6 ms 11220 KB Output is correct
32 Correct 6 ms 11220 KB Output is correct
33 Correct 6 ms 11416 KB Output is correct
34 Correct 6 ms 11216 KB Output is correct
35 Correct 6 ms 11220 KB Output is correct
36 Correct 128 ms 33740 KB Output is correct
37 Correct 5 ms 11220 KB Output is correct
38 Correct 147 ms 33484 KB Output is correct
39 Correct 115 ms 32564 KB Output is correct
40 Correct 171 ms 33840 KB Output is correct
41 Correct 157 ms 33844 KB Output is correct
42 Correct 132 ms 30152 KB Output is correct
43 Correct 146 ms 28104 KB Output is correct
44 Correct 164 ms 27984 KB Output is correct
45 Correct 176 ms 27768 KB Output is correct
46 Correct 170 ms 27864 KB Output is correct
47 Correct 128 ms 30400 KB Output is correct
48 Correct 122 ms 30240 KB Output is correct
49 Correct 144 ms 30412 KB Output is correct
50 Correct 152 ms 30332 KB Output is correct
51 Correct 173 ms 33988 KB Output is correct
52 Correct 142 ms 33864 KB Output is correct
53 Correct 131 ms 28144 KB Output is correct
54 Correct 133 ms 29652 KB Output is correct
55 Correct 164 ms 29644 KB Output is correct
56 Correct 163 ms 29644 KB Output is correct
57 Correct 212 ms 29780 KB Output is correct
58 Correct 166 ms 29708 KB Output is correct
59 Correct 160 ms 29720 KB Output is correct
60 Correct 156 ms 29908 KB Output is correct
61 Correct 117 ms 32324 KB Output is correct
62 Correct 136 ms 32432 KB Output is correct
63 Correct 127 ms 32204 KB Output is correct
64 Correct 136 ms 32272 KB Output is correct
65 Correct 182 ms 29640 KB Output is correct
66 Correct 179 ms 29644 KB Output is correct
67 Correct 168 ms 29580 KB Output is correct
68 Correct 136 ms 29384 KB Output is correct
69 Correct 134 ms 29392 KB Output is correct
70 Correct 134 ms 32716 KB Output is correct
71 Correct 144 ms 31808 KB Output is correct
72 Correct 5 ms 11220 KB Output is correct
73 Correct 13 ms 13012 KB Output is correct
74 Correct 13 ms 13012 KB Output is correct
75 Correct 5 ms 11216 KB Output is correct
76 Correct 6 ms 11220 KB Output is correct
77 Correct 13 ms 13292 KB Output is correct
78 Correct 13 ms 13260 KB Output is correct
79 Correct 11 ms 13012 KB Output is correct
80 Correct 12 ms 13012 KB Output is correct
81 Correct 7 ms 11456 KB Output is correct
82 Correct 6 ms 11256 KB Output is correct
83 Correct 6 ms 11216 KB Output is correct
84 Correct 6 ms 11220 KB Output is correct
85 Correct 6 ms 11220 KB Output is correct
86 Correct 46 ms 13668 KB Output is correct
87 Correct 40 ms 13512 KB Output is correct
88 Correct 46 ms 13516 KB Output is correct
89 Correct 13 ms 13264 KB Output is correct
90 Correct 13 ms 13268 KB Output is correct
91 Correct 42 ms 13684 KB Output is correct
92 Correct 44 ms 13516 KB Output is correct
93 Correct 6 ms 11220 KB Output is correct
94 Correct 153 ms 35564 KB Output is correct
95 Correct 122 ms 34860 KB Output is correct
96 Correct 131 ms 34300 KB Output is correct
97 Correct 166 ms 35576 KB Output is correct
98 Correct 145 ms 35828 KB Output is correct
99 Correct 196 ms 30016 KB Output is correct
100 Correct 160 ms 29664 KB Output is correct
101 Correct 210 ms 29644 KB Output is correct
102 Correct 167 ms 29844 KB Output is correct
103 Correct 125 ms 31944 KB Output is correct
104 Correct 120 ms 32556 KB Output is correct
105 Correct 119 ms 31960 KB Output is correct
106 Correct 170 ms 32536 KB Output is correct
107 Correct 144 ms 32028 KB Output is correct
108 Correct 138 ms 35528 KB Output is correct
109 Correct 143 ms 35688 KB Output is correct
110 Correct 163 ms 29572 KB Output is correct
111 Correct 136 ms 29644 KB Output is correct
112 Correct 165 ms 29436 KB Output is correct
113 Correct 199 ms 29556 KB Output is correct