oj.uz

Submission #948335

# Submission time Handle Problem Language Result Execution time Memory
948335 2024-03-18T04:20:49 Z steveonalex Railway (BOI17_railway) C++14
100 / 100
 136 ms 45360 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, char separator = ' ', char finish = '\n'){
        for(auto item: container) cout << item << separator;
        cout << finish;
    }
 template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }
 
const long N = 1e5 + 69;
const long LOG_N = 17;
long n, m, k;
map<pair<long, long>, long> mp;
vector<long> graph[N];
long sum[N];
 
long h[N], parent[N][LOG_N], in[N], pos[N];
long dfs_cnt = 0;
 
void dfs(long u, long p){
    in[u] = ++dfs_cnt; pos[dfs_cnt] = u;
    h[u] = (u == p) ? 1 : (h[p] + 1);
    for(long j = 1; MASK(j) < h[u]; ++j) parent[u][j] = parent[parent[u][j-1]][j-1];
    for(long v: graph[u]) if (v != p){
        parent[v][0] = u;
        dfs(v, u);
    }
}
 
long LCA(long u, long v){
    if (h[u] < h[v]) swap(u, v);
    long diff = h[u] - h[v];
    for(long j = 0; j<LOG_N; ++j) if (GETBIT(diff, j)) u = parent[u][j];
    if (u == v) return u;
    for(long j = LOG_N - 1; j>=0; --j) if (parent[u][j] != parent[v][j]){
        u = parent[u][j]; v = parent[v][j];
    }
    return parent[u][0];
}
 
vector<long> ans;
 
void calc(long u, long p){
    for(long v: graph[u]) if (v != p){
        calc(v, u);
        sum[u] += sum[v];
 
        if (sum[v] >= k){
            long x = u, y = v;
            if (x > y) swap(x, y);
            ans.push_back(mp[{x, y}]);
        }
    }
}
 
int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
    cin >> n >> m >> k;
    for(long i = 1; i<n; ++i){
        long u, v; cin >> u >> v;
        if (u > v) swap(u, v);
        graph[u].push_back(v);
        graph[v].push_back(u);
        mp[{u, v}] = i;
    }
 
    dfs(1, 1);
 
    while(m--){
        long s; cin >> s;
        vector<long> ver(s);
        for(long i = 0; i<s; ++i){
            cin >> ver[i];
            ver[i] = in[ver[i]];
        }
        remove_dup(ver);
 
        s = ver.size();
        for(long i = 1; i < s; ++i) ver.push_back(in[ LCA(pos[ver[i-1]], pos[ver[i]]) ]);
 
        remove_dup(ver);
        for(long &i: ver) i = pos[i];
        reverse(ALL(ver));
 
        vector<long> st;
        for(long u: ver){
            while(st.size()){
                long v = st.back();
                if (LCA(u, v) == u){
                    sum[u]--;
                    sum[v]++;
                    st.pop_back();
                    continue;
                }
                else break;
            }
            st.push_back(u);
        }
    }
 
    calc(1, 1);
 
    cout << ans.size() << "\n";
    sort(ALL(ans));
    printArr(ans);
 
 
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 6 ms 9832 KB Output is correct
3 Correct 6 ms 9828 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 2 ms 6584 KB Output is correct
6 Correct 6 ms 10612 KB Output is correct
7 Correct 7 ms 10096 KB Output is correct
8 Correct 5 ms 9924 KB Output is correct
9 Correct 7 ms 9912 KB Output is correct
10 Correct 1 ms 6780 KB Output is correct
11 Correct 2 ms 6748 KB Output is correct
12 Correct 2 ms 7012 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 1 ms 6756 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 6 ms 9832 KB Output is correct
3 Correct 6 ms 9828 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 2 ms 6584 KB Output is correct
6 Correct 6 ms 10612 KB Output is correct
7 Correct 7 ms 10096 KB Output is correct
8 Correct 5 ms 9924 KB Output is correct
9 Correct 7 ms 9912 KB Output is correct
10 Correct 1 ms 6780 KB Output is correct
11 Correct 2 ms 6748 KB Output is correct
12 Correct 2 ms 7012 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 1 ms 6756 KB Output is correct
15 Correct 33 ms 10360 KB Output is correct
16 Correct 35 ms 10372 KB Output is correct
17 Correct 31 ms 10392 KB Output is correct
18 Correct 6 ms 10600 KB Output is correct
19 Correct 6 ms 10076 KB Output is correct
20 Correct 34 ms 10440 KB Output is correct
21 Correct 34 ms 10428 KB Output is correct
22 Correct 2 ms 6760 KB Output is correct
23 Correct 6 ms 9832 KB Output is correct
24 Correct 5 ms 9876 KB Output is correct
25 Correct 2 ms 7012 KB Output is correct
26 Correct 2 ms 6788 KB Output is correct
27 Correct 8 ms 10516 KB Output is correct
28 Correct 6 ms 10088 KB Output is correct
29 Correct 5 ms 9832 KB Output is correct
30 Correct 5 ms 9972 KB Output is correct
31 Correct 2 ms 6760 KB Output is correct
32 Correct 1 ms 6760 KB Output is correct
33 Correct 1 ms 6760 KB Output is correct
34 Correct 1 ms 6788 KB Output is correct
35 Correct 1 ms 6760 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 42924 KB Output is correct
2 Correct 2 ms 6760 KB Output is correct
3 Correct 107 ms 43944 KB Output is correct
4 Correct 92 ms 42920 KB Output is correct
5 Correct 104 ms 44764 KB Output is correct
6 Correct 123 ms 45336 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 35232 KB Output is correct
2 Correct 96 ms 31460 KB Output is correct
3 Correct 98 ms 30876 KB Output is correct
4 Correct 102 ms 30828 KB Output is correct
5 Correct 97 ms 30820 KB Output is correct
6 Correct 91 ms 37352 KB Output is correct
7 Correct 84 ms 37120 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 35232 KB Output is correct
2 Correct 96 ms 31460 KB Output is correct
3 Correct 98 ms 30876 KB Output is correct
4 Correct 102 ms 30828 KB Output is correct
5 Correct 97 ms 30820 KB Output is correct
6 Correct 91 ms 37352 KB Output is correct
7 Correct 84 ms 37120 KB Output is correct
8 Correct 123 ms 37472 KB Output is correct
9 Correct 109 ms 37352 KB Output is correct
10 Correct 111 ms 45068 KB Output is correct
11 Correct 109 ms 44904 KB Output is correct
12 Correct 86 ms 30800 KB Output is correct
13 Correct 88 ms 30788 KB Output is correct
14 Correct 94 ms 30896 KB Output is correct
15 Correct 127 ms 30752 KB Output is correct
16 Correct 97 ms 30904 KB Output is correct
17 Correct 93 ms 30828 KB Output is correct
18 Correct 95 ms 31024 KB Output is correct
19 Correct 101 ms 31600 KB Output is correct
20 Correct 107 ms 37840 KB Output is correct
21 Correct 86 ms 38088 KB Output is correct
22 Correct 91 ms 37716 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 6 ms 9832 KB Output is correct
3 Correct 6 ms 9828 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 2 ms 6584 KB Output is correct
6 Correct 6 ms 10612 KB Output is correct
7 Correct 7 ms 10096 KB Output is correct
8 Correct 5 ms 9924 KB Output is correct
9 Correct 7 ms 9912 KB Output is correct
10 Correct 1 ms 6780 KB Output is correct
11 Correct 2 ms 6748 KB Output is correct
12 Correct 2 ms 7012 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 1 ms 6756 KB Output is correct
15 Correct 33 ms 10360 KB Output is correct
16 Correct 35 ms 10372 KB Output is correct
17 Correct 31 ms 10392 KB Output is correct
18 Correct 6 ms 10600 KB Output is correct
19 Correct 6 ms 10076 KB Output is correct
20 Correct 34 ms 10440 KB Output is correct
21 Correct 34 ms 10428 KB Output is correct
22 Correct 2 ms 6760 KB Output is correct
23 Correct 6 ms 9832 KB Output is correct
24 Correct 5 ms 9876 KB Output is correct
25 Correct 2 ms 7012 KB Output is correct
26 Correct 2 ms 6788 KB Output is correct
27 Correct 8 ms 10516 KB Output is correct
28 Correct 6 ms 10088 KB Output is correct
29 Correct 5 ms 9832 KB Output is correct
30 Correct 5 ms 9972 KB Output is correct
31 Correct 2 ms 6760 KB Output is correct
32 Correct 1 ms 6760 KB Output is correct
33 Correct 1 ms 6760 KB Output is correct
34 Correct 1 ms 6788 KB Output is correct
35 Correct 1 ms 6760 KB Output is correct
36 Correct 117 ms 42924 KB Output is correct
37 Correct 2 ms 6760 KB Output is correct
38 Correct 107 ms 43944 KB Output is correct
39 Correct 92 ms 42920 KB Output is correct
40 Correct 104 ms 44764 KB Output is correct
41 Correct 123 ms 45336 KB Output is correct
42 Correct 90 ms 35232 KB Output is correct
43 Correct 96 ms 31460 KB Output is correct
44 Correct 98 ms 30876 KB Output is correct
45 Correct 102 ms 30828 KB Output is correct
46 Correct 97 ms 30820 KB Output is correct
47 Correct 91 ms 37352 KB Output is correct
48 Correct 84 ms 37120 KB Output is correct
49 Correct 123 ms 37472 KB Output is correct
50 Correct 109 ms 37352 KB Output is correct
51 Correct 111 ms 45068 KB Output is correct
52 Correct 109 ms 44904 KB Output is correct
53 Correct 86 ms 30800 KB Output is correct
54 Correct 88 ms 30788 KB Output is correct
55 Correct 94 ms 30896 KB Output is correct
56 Correct 127 ms 30752 KB Output is correct
57 Correct 97 ms 30904 KB Output is correct
58 Correct 93 ms 30828 KB Output is correct
59 Correct 95 ms 31024 KB Output is correct
60 Correct 101 ms 31600 KB Output is correct
61 Correct 107 ms 37840 KB Output is correct
62 Correct 86 ms 38088 KB Output is correct
63 Correct 91 ms 37716 KB Output is correct
64 Correct 94 ms 37716 KB Output is correct
65 Correct 106 ms 31048 KB Output is correct
66 Correct 136 ms 30832 KB Output is correct
67 Correct 103 ms 30900 KB Output is correct
68 Correct 68 ms 30748 KB Output is correct
69 Correct 73 ms 30696 KB Output is correct
70 Correct 127 ms 38232 KB Output is correct
71 Correct 98 ms 36976 KB Output is correct
72 Correct 1 ms 6748 KB Output is correct
73 Correct 6 ms 9904 KB Output is correct
74 Correct 6 ms 9816 KB Output is correct
75 Correct 1 ms 6748 KB Output is correct
76 Correct 1 ms 6748 KB Output is correct
77 Correct 9 ms 10628 KB Output is correct
78 Correct 7 ms 10076 KB Output is correct
79 Correct 5 ms 9816 KB Output is correct
80 Correct 5 ms 9820 KB Output is correct
81 Correct 2 ms 7000 KB Output is correct
82 Correct 1 ms 6580 KB Output is correct
83 Correct 1 ms 6748 KB Output is correct
84 Correct 2 ms 7004 KB Output is correct
85 Correct 1 ms 6748 KB Output is correct
86 Correct 32 ms 10288 KB Output is correct
87 Correct 32 ms 10364 KB Output is correct
88 Correct 31 ms 10328 KB Output is correct
89 Correct 6 ms 10584 KB Output is correct
90 Correct 5 ms 10076 KB Output is correct
91 Correct 30 ms 10472 KB Output is correct
92 Correct 33 ms 10436 KB Output is correct
93 Correct 1 ms 7000 KB Output is correct
94 Correct 107 ms 44800 KB Output is correct
95 Correct 92 ms 43932 KB Output is correct
96 Correct 93 ms 42832 KB Output is correct
97 Correct 109 ms 44748 KB Output is correct
98 Correct 97 ms 45360 KB Output is correct
99 Correct 80 ms 30804 KB Output is correct
100 Correct 114 ms 30800 KB Output is correct
101 Correct 78 ms 30940 KB Output is correct
102 Correct 82 ms 31672 KB Output is correct
103 Correct 100 ms 37512 KB Output is correct
104 Correct 96 ms 37876 KB Output is correct
105 Correct 87 ms 37204 KB Output is correct
106 Correct 114 ms 37628 KB Output is correct
107 Correct 104 ms 37300 KB Output is correct
108 Correct 100 ms 45076 KB Output is correct
109 Correct 100 ms 45004 KB Output is correct
110 Correct 101 ms 30620 KB Output is correct
111 Correct 82 ms 30728 KB Output is correct
112 Correct 92 ms 31124 KB Output is correct
113 Correct 88 ms 30804 KB Output is correct