oj.uz

Submission #599094

# Submission time Handle Problem Language Result Execution time Memory
599094 2022-07-19T10:02:52 Z radal Railway (BOI17_railway) C++17
100 / 100
 136 ms 27284 KB 
#include <bits/stdc++.h>
//#pragma GCC target("sse,sse2,avx2")
#pragma GCC optimize("unroll-loops,O3")
#define rep(i,l,r) for (int i = l; i < r; i++)
#define repr(i,r,l) for (int i = r; i >= l; i--)
#define X first
#define Y second
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define endl '\n'
#define debug(x) cerr << #x << " : " << x << endl;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pll;
constexpr int N = 1e5+20,mod = 1e9+7,inf = 1e9+10,sq = 500;
inline int mkay(int a,int b){
    if (a+b >= mod) return a+b-mod;
    if (a+b < 0) return a+b+mod;
    return a+b;
}
 
inline int poww(int a,int k){
    if (k < 0) return 0;
    int z = 1;
    while (k){
        if (k&1) z = 1ll*z*a%mod;
        a = 1ll*a*a%mod;
        k >>= 1;
    } 
    return z; 
}
int tin[N],T,par[N][20],h[N],calc[N],k;
vector<pll> adj[N];
vector<int> ans;
inline int lca(int u,int v){
    if (h[u] > h[v]) swap(u,v);
    repr(i,19,0){
        if (h[v]-h[u] >= (1 << i))
            v = par[v][i];
    }
    if (u == v) return v;
    repr(i,19,0){
        if (par[v][i] != par[u][i]){
            v = par[v][i];
            u = par[u][i];
        }
    }
    return par[v][0];
}
void dfs2(int v,int p){
    for (pll u : adj[v]){
        if (u.X != p){
            dfs2(u.X,v);
            if (calc[u.X]/2 >= k) ans.pb(u.Y);
            calc[v] += calc[u.X];
        }
    }
} 
void dfs(int v,int p){
    par[v][0] = p;
    tin[v] = T;
    T++;
    for (pll u : adj[v]){
        if (u.X != p){
            h[u.X] = h[v]+1;
            dfs(u.X,v);
        }
    }
}
inline bool cmp(int i,int j){
    return (tin[i] < tin[j]);
}
int main(){
    ios :: sync_with_stdio(0); cin.tie(0);
    int n,m;
    cin >> n >> m >> k;
    rep(i,1,n){
        int u,v;
        cin >> u >> v;
        adj[u].pb({v,i});
        adj[v].pb({u,i});
    }
    dfs(1,0);
    rep(j,1,20){
        rep(i,2,n+1)
            par[i][j] = par[par[i][j-1]][j-1];
    }
    rep(x,0,m){
        int s;
        cin >> s;
        vector<int> ve;
        rep(j,0,s){
            int v;
            cin >> v;
            ve.pb(v);
        }
        sort(all(ve),cmp);
        rep(i,1,s){
            int u = ve[i],v = ve[i-1],w = lca(u,v);
            if (w == v){
                calc[u]++;
                calc[v]--;
                continue;
            }
            calc[v]++;
            calc[u]++;
            calc[w] -= 2;
        }
        int u = ve[s-1],v = ve[0],w = lca(u,v);
        if (v == w){
            calc[u]++;
            calc[v]--;
            continue;
        }
        calc[u]++;
        calc[v]++;
        calc[w] -= 2;
    }
    dfs2(1,0);
    sort(all(ans));
    cout << ans.size() << endl;
    for (int i : ans) cout << i << ' ';
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 7 ms 4052 KB Output is correct
3 Correct 5 ms 3976 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2684 KB Output is correct
6 Correct 6 ms 4488 KB Output is correct
7 Correct 5 ms 4180 KB Output is correct
8 Correct 5 ms 3980 KB Output is correct
9 Correct 6 ms 4052 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 7 ms 4052 KB Output is correct
3 Correct 5 ms 3976 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2684 KB Output is correct
6 Correct 6 ms 4488 KB Output is correct
7 Correct 5 ms 4180 KB Output is correct
8 Correct 5 ms 3980 KB Output is correct
9 Correct 6 ms 4052 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 22 ms 4436 KB Output is correct
16 Correct 19 ms 4488 KB Output is correct
17 Correct 19 ms 4492 KB Output is correct
18 Correct 6 ms 4564 KB Output is correct
19 Correct 6 ms 4180 KB Output is correct
20 Correct 18 ms 4564 KB Output is correct
21 Correct 26 ms 4436 KB Output is correct
22 Correct 3 ms 2688 KB Output is correct
23 Correct 6 ms 3980 KB Output is correct
24 Correct 5 ms 4052 KB Output is correct
25 Correct 1 ms 2644 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 6 ms 4612 KB Output is correct
28 Correct 5 ms 4052 KB Output is correct
29 Correct 5 ms 4052 KB Output is correct
30 Correct 6 ms 4108 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 1 ms 2684 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 26832 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 111 ms 26568 KB Output is correct
4 Correct 103 ms 25956 KB Output is correct
5 Correct 101 ms 26960 KB Output is correct
6 Correct 78 ms 27256 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 21716 KB Output is correct
2 Correct 72 ms 17592 KB Output is correct
3 Correct 79 ms 17176 KB Output is correct
4 Correct 103 ms 17176 KB Output is correct
5 Correct 78 ms 17096 KB Output is correct
6 Correct 65 ms 21852 KB Output is correct
7 Correct 65 ms 21788 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 21716 KB Output is correct
2 Correct 72 ms 17592 KB Output is correct
3 Correct 79 ms 17176 KB Output is correct
4 Correct 103 ms 17176 KB Output is correct
5 Correct 78 ms 17096 KB Output is correct
6 Correct 65 ms 21852 KB Output is correct
7 Correct 65 ms 21788 KB Output is correct
8 Correct 75 ms 21880 KB Output is correct
9 Correct 86 ms 22020 KB Output is correct
10 Correct 79 ms 26916 KB Output is correct
11 Correct 82 ms 26896 KB Output is correct
12 Correct 57 ms 16880 KB Output is correct
13 Correct 59 ms 16880 KB Output is correct
14 Correct 82 ms 17104 KB Output is correct
15 Correct 91 ms 17100 KB Output is correct
16 Correct 77 ms 17184 KB Output is correct
17 Correct 73 ms 17132 KB Output is correct
18 Correct 73 ms 17168 KB Output is correct
19 Correct 76 ms 17660 KB Output is correct
20 Correct 75 ms 22072 KB Output is correct
21 Correct 70 ms 22204 KB Output is correct
22 Correct 74 ms 22092 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 7 ms 4052 KB Output is correct
3 Correct 5 ms 3976 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2684 KB Output is correct
6 Correct 6 ms 4488 KB Output is correct
7 Correct 5 ms 4180 KB Output is correct
8 Correct 5 ms 3980 KB Output is correct
9 Correct 6 ms 4052 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 22 ms 4436 KB Output is correct
16 Correct 19 ms 4488 KB Output is correct
17 Correct 19 ms 4492 KB Output is correct
18 Correct 6 ms 4564 KB Output is correct
19 Correct 6 ms 4180 KB Output is correct
20 Correct 18 ms 4564 KB Output is correct
21 Correct 26 ms 4436 KB Output is correct
22 Correct 3 ms 2688 KB Output is correct
23 Correct 6 ms 3980 KB Output is correct
24 Correct 5 ms 4052 KB Output is correct
25 Correct 1 ms 2644 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 6 ms 4612 KB Output is correct
28 Correct 5 ms 4052 KB Output is correct
29 Correct 5 ms 4052 KB Output is correct
30 Correct 6 ms 4108 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 1 ms 2684 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 91 ms 26832 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 111 ms 26568 KB Output is correct
39 Correct 103 ms 25956 KB Output is correct
40 Correct 101 ms 26960 KB Output is correct
41 Correct 78 ms 27256 KB Output is correct
42 Correct 67 ms 21716 KB Output is correct
43 Correct 72 ms 17592 KB Output is correct
44 Correct 79 ms 17176 KB Output is correct
45 Correct 103 ms 17176 KB Output is correct
46 Correct 78 ms 17096 KB Output is correct
47 Correct 65 ms 21852 KB Output is correct
48 Correct 65 ms 21788 KB Output is correct
49 Correct 75 ms 21880 KB Output is correct
50 Correct 86 ms 22020 KB Output is correct
51 Correct 79 ms 26916 KB Output is correct
52 Correct 82 ms 26896 KB Output is correct
53 Correct 57 ms 16880 KB Output is correct
54 Correct 59 ms 16880 KB Output is correct
55 Correct 82 ms 17104 KB Output is correct
56 Correct 91 ms 17100 KB Output is correct
57 Correct 77 ms 17184 KB Output is correct
58 Correct 73 ms 17132 KB Output is correct
59 Correct 73 ms 17168 KB Output is correct
60 Correct 76 ms 17660 KB Output is correct
61 Correct 75 ms 22072 KB Output is correct
62 Correct 70 ms 22204 KB Output is correct
63 Correct 74 ms 22092 KB Output is correct
64 Correct 88 ms 22028 KB Output is correct
65 Correct 103 ms 17188 KB Output is correct
66 Correct 97 ms 17040 KB Output is correct
67 Correct 136 ms 17044 KB Output is correct
68 Correct 50 ms 16844 KB Output is correct
69 Correct 48 ms 16816 KB Output is correct
70 Correct 130 ms 22384 KB Output is correct
71 Correct 107 ms 21640 KB Output is correct
72 Correct 3 ms 2644 KB Output is correct
73 Correct 8 ms 3996 KB Output is correct
74 Correct 6 ms 3976 KB Output is correct
75 Correct 2 ms 2644 KB Output is correct
76 Correct 2 ms 2644 KB Output is correct
77 Correct 6 ms 4564 KB Output is correct
78 Correct 6 ms 4104 KB Output is correct
79 Correct 5 ms 4080 KB Output is correct
80 Correct 5 ms 4052 KB Output is correct
81 Correct 2 ms 2644 KB Output is correct
82 Correct 2 ms 2644 KB Output is correct
83 Correct 2 ms 2644 KB Output is correct
84 Correct 2 ms 2644 KB Output is correct
85 Correct 2 ms 2644 KB Output is correct
86 Correct 27 ms 4364 KB Output is correct
87 Correct 21 ms 4436 KB Output is correct
88 Correct 20 ms 4484 KB Output is correct
89 Correct 6 ms 4564 KB Output is correct
90 Correct 7 ms 4108 KB Output is correct
91 Correct 21 ms 4560 KB Output is correct
92 Correct 28 ms 4504 KB Output is correct
93 Correct 2 ms 2684 KB Output is correct
94 Correct 133 ms 26856 KB Output is correct
95 Correct 110 ms 26512 KB Output is correct
96 Correct 104 ms 25924 KB Output is correct
97 Correct 98 ms 26896 KB Output is correct
98 Correct 93 ms 27284 KB Output is correct
99 Correct 81 ms 17176 KB Output is correct
100 Correct 107 ms 17168 KB Output is correct
101 Correct 79 ms 17180 KB Output is correct
102 Correct 83 ms 17580 KB Output is correct
103 Correct 71 ms 21940 KB Output is correct
104 Correct 70 ms 22220 KB Output is correct
105 Correct 70 ms 21740 KB Output is correct
106 Correct 72 ms 22008 KB Output is correct
107 Correct 80 ms 21836 KB Output is correct
108 Correct 89 ms 26912 KB Output is correct
109 Correct 78 ms 26944 KB Output is correct
110 Correct 70 ms 16880 KB Output is correct
111 Correct 68 ms 16972 KB Output is correct
112 Correct 105 ms 17016 KB Output is correct
113 Correct 86 ms 17048 KB Output is correct