oj.uz

Submission #642497

# Submission time Handle Problem Language Result Execution time Memory
642497 2022-09-19T15:56:19 Z BackNoob Railway (BOI17_railway) C++14
100 / 100
 275 ms 109600 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()
 
using namespace std;
const int mxN = 5e5 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
}
 
int n;
int m;
int k;
int ed[mxN];
int dep[mxN];
int par[mxN][LOG + 1];
vector<pair<int, int>> adj[mxN];
vector<int> pos[mxN];
vector<int> root[mxN];
vector<int> lca[mxN];
set<int> s[mxN];
bool ans[mxN];

void dfs(int u, int p)
{
    for(auto it : adj[u]) {
        int v = it.fi;
        int idx = it.se;
        if(v == p) continue;
        par[v][0] = u;
        dep[v] = dep[u] + 1;
        ed[v] = idx;
        dfs(v, u);
    }
}

int getlca(int u, int v)
{
    if(dep[u] < dep[v]) swap(u, v);

    for(int j = LOG; j >= 0; j--) if(dep[par[u][j]] >= dep[v]) u = par[u][j];

    if(u == v) return u;

    for(int j = LOG; j >= 0; j--) {
        if(par[u][j] != par[v][j]) {
            u = par[u][j];
            v = par[v][j];
        }
    }
    return par[u][0];
}

void calc(int u, int p)
{
    for(auto it : pos[u]) s[u].insert(it);
    for(auto it : adj[u]) {
        int v = it.fi;
        if(v == p) continue; 
        calc(v, u); 
        if(sz(s[u]) < sz(s[v])) swap(s[u], s[v]);
        for(auto it : s[v]) s[u].insert(it);
    }

    for(auto it : root[u]) s[u].erase(s[u].find(it));

    if(p != -1 && sz(s[u]) >= k) {
        ans[ed[u]] = true;
    }
}
 
void solve()
{
    cin >> n >> m >> k;
    for(int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        adj[u].pb({v, i});
        adj[v].pb({u, i});
    }

    par[1][0] = 1;
    dfs(1, -1);
    for(int j = 1; j <= LOG; j++)
    for(int i = 1; i <= n; i++) par[i][j] = par[par[i][j - 1]][j - 1];

    for(int i = 1; i <= m; i++) {
        int ss;
        cin >> ss;

        int rr = -1;
        for(int j = 1; j <= ss; j++) {
            int x;
            cin >> x;
            pos[x].pb(i);
            if(rr == -1) rr = x;
            else rr = getlca(rr, x);
        }
        root[rr].pb(i);
    }

    calc(1, -1);

    int res = 0;
    for(int i = 1; i < n; i++) res += ans[i];
    cout << res << endl;
    for(int i = 1; i < n; i++) if(ans[i] == true) cout << i << ' ';
}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

 
    int tc = 1;
    //cin >> tc;
    while(tc--) {
        solve();
    }
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 70832 KB Output is correct
2 Correct 38 ms 72224 KB Output is correct
3 Correct 37 ms 72268 KB Output is correct
4 Correct 33 ms 70792 KB Output is correct
5 Correct 33 ms 70776 KB Output is correct
6 Correct 40 ms 72908 KB Output is correct
7 Correct 38 ms 72484 KB Output is correct
8 Correct 40 ms 72340 KB Output is correct
9 Correct 38 ms 72472 KB Output is correct
10 Correct 32 ms 70740 KB Output is correct
11 Correct 33 ms 70812 KB Output is correct
12 Correct 33 ms 70804 KB Output is correct
13 Correct 37 ms 70776 KB Output is correct
14 Correct 34 ms 70828 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 70832 KB Output is correct
2 Correct 38 ms 72224 KB Output is correct
3 Correct 37 ms 72268 KB Output is correct
4 Correct 33 ms 70792 KB Output is correct
5 Correct 33 ms 70776 KB Output is correct
6 Correct 40 ms 72908 KB Output is correct
7 Correct 38 ms 72484 KB Output is correct
8 Correct 40 ms 72340 KB Output is correct
9 Correct 38 ms 72472 KB Output is correct
10 Correct 32 ms 70740 KB Output is correct
11 Correct 33 ms 70812 KB Output is correct
12 Correct 33 ms 70804 KB Output is correct
13 Correct 37 ms 70776 KB Output is correct
14 Correct 34 ms 70828 KB Output is correct
15 Correct 73 ms 78592 KB Output is correct
16 Correct 76 ms 78716 KB Output is correct
17 Correct 76 ms 78680 KB Output is correct
18 Correct 39 ms 73116 KB Output is correct
19 Correct 37 ms 72428 KB Output is correct
20 Correct 88 ms 78164 KB Output is correct
21 Correct 88 ms 78276 KB Output is correct
22 Correct 34 ms 70812 KB Output is correct
23 Correct 41 ms 72396 KB Output is correct
24 Correct 36 ms 72324 KB Output is correct
25 Correct 35 ms 70756 KB Output is correct
26 Correct 32 ms 70800 KB Output is correct
27 Correct 38 ms 72908 KB Output is correct
28 Correct 43 ms 72476 KB Output is correct
29 Correct 47 ms 72372 KB Output is correct
30 Correct 41 ms 72420 KB Output is correct
31 Correct 34 ms 70792 KB Output is correct
32 Correct 32 ms 70740 KB Output is correct
33 Correct 33 ms 70788 KB Output is correct
34 Correct 33 ms 70740 KB Output is correct
35 Correct 33 ms 70720 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 228 ms 107016 KB Output is correct
2 Correct 34 ms 70760 KB Output is correct
3 Correct 189 ms 106576 KB Output is correct
4 Correct 186 ms 106224 KB Output is correct
5 Correct 155 ms 104836 KB Output is correct
6 Correct 168 ms 107124 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 98640 KB Output is correct
2 Correct 159 ms 95360 KB Output is correct
3 Correct 205 ms 101548 KB Output is correct
4 Correct 175 ms 101456 KB Output is correct
5 Correct 176 ms 101700 KB Output is correct
6 Correct 170 ms 98836 KB Output is correct
7 Correct 153 ms 98968 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 98640 KB Output is correct
2 Correct 159 ms 95360 KB Output is correct
3 Correct 205 ms 101548 KB Output is correct
4 Correct 175 ms 101456 KB Output is correct
5 Correct 176 ms 101700 KB Output is correct
6 Correct 170 ms 98836 KB Output is correct
7 Correct 153 ms 98968 KB Output is correct
8 Correct 146 ms 98400 KB Output is correct
9 Correct 162 ms 98408 KB Output is correct
10 Correct 167 ms 104412 KB Output is correct
11 Correct 163 ms 104424 KB Output is correct
12 Correct 126 ms 91812 KB Output is correct
13 Correct 129 ms 91884 KB Output is correct
14 Correct 166 ms 96564 KB Output is correct
15 Correct 173 ms 96788 KB Output is correct
16 Correct 175 ms 102600 KB Output is correct
17 Correct 186 ms 103064 KB Output is correct
18 Correct 167 ms 100840 KB Output is correct
19 Correct 159 ms 95940 KB Output is correct
20 Correct 141 ms 98968 KB Output is correct
21 Correct 157 ms 99240 KB Output is correct
22 Correct 140 ms 98948 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 70832 KB Output is correct
2 Correct 38 ms 72224 KB Output is correct
3 Correct 37 ms 72268 KB Output is correct
4 Correct 33 ms 70792 KB Output is correct
5 Correct 33 ms 70776 KB Output is correct
6 Correct 40 ms 72908 KB Output is correct
7 Correct 38 ms 72484 KB Output is correct
8 Correct 40 ms 72340 KB Output is correct
9 Correct 38 ms 72472 KB Output is correct
10 Correct 32 ms 70740 KB Output is correct
11 Correct 33 ms 70812 KB Output is correct
12 Correct 33 ms 70804 KB Output is correct
13 Correct 37 ms 70776 KB Output is correct
14 Correct 34 ms 70828 KB Output is correct
15 Correct 73 ms 78592 KB Output is correct
16 Correct 76 ms 78716 KB Output is correct
17 Correct 76 ms 78680 KB Output is correct
18 Correct 39 ms 73116 KB Output is correct
19 Correct 37 ms 72428 KB Output is correct
20 Correct 88 ms 78164 KB Output is correct
21 Correct 88 ms 78276 KB Output is correct
22 Correct 34 ms 70812 KB Output is correct
23 Correct 41 ms 72396 KB Output is correct
24 Correct 36 ms 72324 KB Output is correct
25 Correct 35 ms 70756 KB Output is correct
26 Correct 32 ms 70800 KB Output is correct
27 Correct 38 ms 72908 KB Output is correct
28 Correct 43 ms 72476 KB Output is correct
29 Correct 47 ms 72372 KB Output is correct
30 Correct 41 ms 72420 KB Output is correct
31 Correct 34 ms 70792 KB Output is correct
32 Correct 32 ms 70740 KB Output is correct
33 Correct 33 ms 70788 KB Output is correct
34 Correct 33 ms 70740 KB Output is correct
35 Correct 33 ms 70720 KB Output is correct
36 Correct 228 ms 107016 KB Output is correct
37 Correct 34 ms 70760 KB Output is correct
38 Correct 189 ms 106576 KB Output is correct
39 Correct 186 ms 106224 KB Output is correct
40 Correct 155 ms 104836 KB Output is correct
41 Correct 168 ms 107124 KB Output is correct
42 Correct 140 ms 98640 KB Output is correct
43 Correct 159 ms 95360 KB Output is correct
44 Correct 205 ms 101548 KB Output is correct
45 Correct 175 ms 101456 KB Output is correct
46 Correct 176 ms 101700 KB Output is correct
47 Correct 170 ms 98836 KB Output is correct
48 Correct 153 ms 98968 KB Output is correct
49 Correct 146 ms 98400 KB Output is correct
50 Correct 162 ms 98408 KB Output is correct
51 Correct 167 ms 104412 KB Output is correct
52 Correct 163 ms 104424 KB Output is correct
53 Correct 126 ms 91812 KB Output is correct
54 Correct 129 ms 91884 KB Output is correct
55 Correct 166 ms 96564 KB Output is correct
56 Correct 173 ms 96788 KB Output is correct
57 Correct 175 ms 102600 KB Output is correct
58 Correct 186 ms 103064 KB Output is correct
59 Correct 167 ms 100840 KB Output is correct
60 Correct 159 ms 95940 KB Output is correct
61 Correct 141 ms 98968 KB Output is correct
62 Correct 157 ms 99240 KB Output is correct
63 Correct 140 ms 98948 KB Output is correct
64 Correct 182 ms 99152 KB Output is correct
65 Correct 275 ms 109600 KB Output is correct
66 Correct 208 ms 105248 KB Output is correct
67 Correct 191 ms 100536 KB Output is correct
68 Correct 126 ms 89676 KB Output is correct
69 Correct 109 ms 89656 KB Output is correct
70 Correct 151 ms 100128 KB Output is correct
71 Correct 163 ms 98596 KB Output is correct
72 Correct 37 ms 70792 KB Output is correct
73 Correct 38 ms 72220 KB Output is correct
74 Correct 38 ms 72256 KB Output is correct
75 Correct 32 ms 70732 KB Output is correct
76 Correct 37 ms 70732 KB Output is correct
77 Correct 38 ms 72876 KB Output is correct
78 Correct 40 ms 72528 KB Output is correct
79 Correct 38 ms 72452 KB Output is correct
80 Correct 37 ms 72408 KB Output is correct
81 Correct 33 ms 70816 KB Output is correct
82 Correct 33 ms 70784 KB Output is correct
83 Correct 33 ms 70788 KB Output is correct
84 Correct 34 ms 70740 KB Output is correct
85 Correct 34 ms 70796 KB Output is correct
86 Correct 92 ms 78700 KB Output is correct
87 Correct 74 ms 78744 KB Output is correct
88 Correct 72 ms 78668 KB Output is correct
89 Correct 39 ms 73104 KB Output is correct
90 Correct 40 ms 72524 KB Output is correct
91 Correct 85 ms 78064 KB Output is correct
92 Correct 77 ms 78072 KB Output is correct
93 Correct 34 ms 70740 KB Output is correct
94 Correct 197 ms 106864 KB Output is correct
95 Correct 194 ms 106564 KB Output is correct
96 Correct 184 ms 106260 KB Output is correct
97 Correct 169 ms 104908 KB Output is correct
98 Correct 172 ms 107212 KB Output is correct
99 Correct 181 ms 105248 KB Output is correct
100 Correct 186 ms 102524 KB Output is correct
101 Correct 187 ms 102856 KB Output is correct
102 Correct 157 ms 95656 KB Output is correct
103 Correct 141 ms 98804 KB Output is correct
104 Correct 159 ms 99016 KB Output is correct
105 Correct 182 ms 98768 KB Output is correct
106 Correct 147 ms 98780 KB Output is correct
107 Correct 146 ms 98844 KB Output is correct
108 Correct 168 ms 104348 KB Output is correct
109 Correct 151 ms 104364 KB Output is correct
110 Correct 134 ms 91820 KB Output is correct
111 Correct 137 ms 91800 KB Output is correct
112 Correct 187 ms 96356 KB Output is correct
113 Correct 151 ms 96292 KB Output is correct