oj.uz

Submission #491264

# Submission time Handle Problem Language Result Execution time Memory
491264 2021-12-01T08:59:50 Z Rainbowbunny Railway (BOI17_railway) C++17
100 / 100
 81 ms 35000 KB 
#include <bits/stdc++.h>
using namespace std;
 
const int MAXN = 2e5 + 5;
const int MAXL = 20;
 
int n, m, k, tim;
int tin[MAXN], tout[MAXN], ST[MAXL][2 * MAXN], H[MAXN], lg[2 * MAXN], f[MAXN], par[MAXN];
int Stack[MAXN], sz = 0;
vector <pair <int, int> > Adj[MAXN];
 
int Min(int x, int y)
{
    return H[x] > H[y] ? y : x; 
}
 
void DFS(int node, int p = -1)
{
    tim++;
    tin[node] = tim;
    ST[0][tim] = node;
    for(auto x : Adj[node])
    {
        if(x.first == p)
        {
            continue;
        }
        H[x.first] = H[node] + 1;
        par[x.first] = x.second;
        DFS(x.first, node);
        tim++;
        ST[0][tim] = node;
    }
    tout[node] = tim;
}
 
int LCA(int u, int v)
{
    int l = min(tin[u], tin[v]), r = max(tin[u], tin[v]);
    int tmp = lg[r - l + 1];
    return Min(ST[tmp][l], ST[tmp][r - (1 << tmp) + 1]);
}
 
bool Isparent(int u, int v)
{
    return tin[u] <= tin[v] and tout[u] >= tout[v];
}
 
void Update(int u, int v)
{
    if(H[v] < H[u])
    {
        swap(u, v);
    }
    // cout << u << ' ' << v << endl;
    assert(Isparent(u, v));
    f[u]--;
    f[v]++;
}
 
void DFS2(int node, int p = -1)
{
    for(auto x : Adj[node])
    {
        if(x.first == p)
        {
            continue;
        }
        DFS2(x.first, node);
        f[node] += f[x.first];
    }
}
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    lg[0] = -1;
    for(int i = 1; i < MAXN; i++)
    {
        lg[i] = lg[i >> 1] + 1;
    }
    cin >> n >> m >> k;
    for(int i = 1; i < n; i++)
    {
        int u, v;
        cin >> u >> v;
        Adj[u].emplace_back(v, i);
        Adj[v].emplace_back(u, i);
    }
    DFS(1);
    for(int i = 1; i < MAXL; i++)
    {
        for(int j = 1; j + (1 << i) <= tim + 1; j++)
        {
            ST[i][j] = Min(ST[i - 1][j], ST[i - 1][j + (1 << (i - 1))]);
        }
    }
    for(int i = 1; i <= m; i++)
    {
        int s;
        vector <int> V;
        cin >> s;
        V.resize(s);
        for(auto &x : V)
        {
            cin >> x;
        }
        sort(V.begin(), V.end(), [](int x, int y)
        {
            return tin[x] < tin[y];
        });
        int root = LCA(V[0], V.back());
        sz = 1;
        Stack[1] = root;
        for(auto x : V)
        {
            int oo = LCA(x, Stack[sz]);
            while(sz > 1 and !Isparent(Stack[sz - 1], oo))
            {
                Update(Stack[sz - 1], Stack[sz]);
                sz--;
            }
            if(Stack[sz - 1] == oo)
            {
                Update(Stack[sz - 1], Stack[sz]);
                sz--;
            }
            else
            {
                Update(oo, Stack[sz]);
                Stack[sz] = oo;
            }
            sz++;
            Stack[sz] = x;
        }
        for(int i = 1; i < sz; i++)
        {
            Update(Stack[i], Stack[i + 1]);
        }
    }
    DFS2(1);
    vector <int> Ans;
    for(int i = 2; i <= n; i++)
    {
        if(f[i] >= k)
        {
            Ans.push_back(par[i]);
        }
    }
    sort(Ans.begin(), Ans.end());
    cout << Ans.size() << '\n';
    for(auto x : Ans)
    {
        cout << x << ' ';
    }
    cout << '\n';
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5836 KB Output is correct
2 Correct 11 ms 7756 KB Output is correct
3 Correct 8 ms 7628 KB Output is correct
4 Correct 3 ms 5836 KB Output is correct
5 Correct 3 ms 5836 KB Output is correct
6 Correct 8 ms 7988 KB Output is correct
7 Correct 7 ms 7628 KB Output is correct
8 Correct 6 ms 7628 KB Output is correct
9 Correct 8 ms 7604 KB Output is correct
10 Correct 3 ms 5836 KB Output is correct
11 Correct 3 ms 5836 KB Output is correct
12 Correct 3 ms 5796 KB Output is correct
13 Correct 3 ms 5796 KB Output is correct
14 Correct 3 ms 5836 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5836 KB Output is correct
2 Correct 11 ms 7756 KB Output is correct
3 Correct 8 ms 7628 KB Output is correct
4 Correct 3 ms 5836 KB Output is correct
5 Correct 3 ms 5836 KB Output is correct
6 Correct 8 ms 7988 KB Output is correct
7 Correct 7 ms 7628 KB Output is correct
8 Correct 6 ms 7628 KB Output is correct
9 Correct 8 ms 7604 KB Output is correct
10 Correct 3 ms 5836 KB Output is correct
11 Correct 3 ms 5836 KB Output is correct
12 Correct 3 ms 5796 KB Output is correct
13 Correct 3 ms 5796 KB Output is correct
14 Correct 3 ms 5836 KB Output is correct
15 Correct 20 ms 8004 KB Output is correct
16 Correct 18 ms 8004 KB Output is correct
17 Correct 19 ms 8048 KB Output is correct
18 Correct 10 ms 8012 KB Output is correct
19 Correct 9 ms 7620 KB Output is correct
20 Correct 17 ms 8216 KB Output is correct
21 Correct 18 ms 8076 KB Output is correct
22 Correct 4 ms 5796 KB Output is correct
23 Correct 7 ms 7628 KB Output is correct
24 Correct 7 ms 7612 KB Output is correct
25 Correct 3 ms 5836 KB Output is correct
26 Correct 4 ms 5836 KB Output is correct
27 Correct 8 ms 8064 KB Output is correct
28 Correct 8 ms 7628 KB Output is correct
29 Correct 6 ms 7628 KB Output is correct
30 Correct 7 ms 7612 KB Output is correct
31 Correct 5 ms 5808 KB Output is correct
32 Correct 3 ms 5836 KB Output is correct
33 Correct 3 ms 5836 KB Output is correct
34 Correct 3 ms 5836 KB Output is correct
35 Correct 4 ms 5836 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 34004 KB Output is correct
2 Correct 3 ms 5836 KB Output is correct
3 Correct 69 ms 33668 KB Output is correct
4 Correct 65 ms 33096 KB Output is correct
5 Correct 71 ms 34040 KB Output is correct
6 Correct 79 ms 34196 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 29724 KB Output is correct
2 Correct 67 ms 26764 KB Output is correct
3 Correct 68 ms 26332 KB Output is correct
4 Correct 75 ms 26452 KB Output is correct
5 Correct 69 ms 26420 KB Output is correct
6 Correct 67 ms 30408 KB Output is correct
7 Correct 60 ms 30280 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 29724 KB Output is correct
2 Correct 67 ms 26764 KB Output is correct
3 Correct 68 ms 26332 KB Output is correct
4 Correct 75 ms 26452 KB Output is correct
5 Correct 69 ms 26420 KB Output is correct
6 Correct 67 ms 30408 KB Output is correct
7 Correct 60 ms 30280 KB Output is correct
8 Correct 64 ms 30364 KB Output is correct
9 Correct 66 ms 30332 KB Output is correct
10 Correct 62 ms 34672 KB Output is correct
11 Correct 62 ms 34604 KB Output is correct
12 Correct 50 ms 26160 KB Output is correct
13 Correct 51 ms 26144 KB Output is correct
14 Correct 65 ms 26264 KB Output is correct
15 Correct 65 ms 26316 KB Output is correct
16 Correct 67 ms 26356 KB Output is correct
17 Correct 74 ms 26548 KB Output is correct
18 Correct 67 ms 26436 KB Output is correct
19 Correct 69 ms 26820 KB Output is correct
20 Correct 70 ms 30632 KB Output is correct
21 Correct 64 ms 30672 KB Output is correct
22 Correct 61 ms 30660 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5836 KB Output is correct
2 Correct 11 ms 7756 KB Output is correct
3 Correct 8 ms 7628 KB Output is correct
4 Correct 3 ms 5836 KB Output is correct
5 Correct 3 ms 5836 KB Output is correct
6 Correct 8 ms 7988 KB Output is correct
7 Correct 7 ms 7628 KB Output is correct
8 Correct 6 ms 7628 KB Output is correct
9 Correct 8 ms 7604 KB Output is correct
10 Correct 3 ms 5836 KB Output is correct
11 Correct 3 ms 5836 KB Output is correct
12 Correct 3 ms 5796 KB Output is correct
13 Correct 3 ms 5796 KB Output is correct
14 Correct 3 ms 5836 KB Output is correct
15 Correct 20 ms 8004 KB Output is correct
16 Correct 18 ms 8004 KB Output is correct
17 Correct 19 ms 8048 KB Output is correct
18 Correct 10 ms 8012 KB Output is correct
19 Correct 9 ms 7620 KB Output is correct
20 Correct 17 ms 8216 KB Output is correct
21 Correct 18 ms 8076 KB Output is correct
22 Correct 4 ms 5796 KB Output is correct
23 Correct 7 ms 7628 KB Output is correct
24 Correct 7 ms 7612 KB Output is correct
25 Correct 3 ms 5836 KB Output is correct
26 Correct 4 ms 5836 KB Output is correct
27 Correct 8 ms 8064 KB Output is correct
28 Correct 8 ms 7628 KB Output is correct
29 Correct 6 ms 7628 KB Output is correct
30 Correct 7 ms 7612 KB Output is correct
31 Correct 5 ms 5808 KB Output is correct
32 Correct 3 ms 5836 KB Output is correct
33 Correct 3 ms 5836 KB Output is correct
34 Correct 3 ms 5836 KB Output is correct
35 Correct 4 ms 5836 KB Output is correct
36 Correct 67 ms 34004 KB Output is correct
37 Correct 3 ms 5836 KB Output is correct
38 Correct 69 ms 33668 KB Output is correct
39 Correct 65 ms 33096 KB Output is correct
40 Correct 71 ms 34040 KB Output is correct
41 Correct 79 ms 34196 KB Output is correct
42 Correct 60 ms 29724 KB Output is correct
43 Correct 67 ms 26764 KB Output is correct
44 Correct 68 ms 26332 KB Output is correct
45 Correct 75 ms 26452 KB Output is correct
46 Correct 69 ms 26420 KB Output is correct
47 Correct 67 ms 30408 KB Output is correct
48 Correct 60 ms 30280 KB Output is correct
49 Correct 64 ms 30364 KB Output is correct
50 Correct 66 ms 30332 KB Output is correct
51 Correct 62 ms 34672 KB Output is correct
52 Correct 62 ms 34604 KB Output is correct
53 Correct 50 ms 26160 KB Output is correct
54 Correct 51 ms 26144 KB Output is correct
55 Correct 65 ms 26264 KB Output is correct
56 Correct 65 ms 26316 KB Output is correct
57 Correct 67 ms 26356 KB Output is correct
58 Correct 74 ms 26548 KB Output is correct
59 Correct 67 ms 26436 KB Output is correct
60 Correct 69 ms 26820 KB Output is correct
61 Correct 70 ms 30632 KB Output is correct
62 Correct 64 ms 30672 KB Output is correct
63 Correct 61 ms 30660 KB Output is correct
64 Correct 70 ms 30480 KB Output is correct
65 Correct 73 ms 26464 KB Output is correct
66 Correct 79 ms 26272 KB Output is correct
67 Correct 67 ms 26308 KB Output is correct
68 Correct 49 ms 26156 KB Output is correct
69 Correct 57 ms 26216 KB Output is correct
70 Correct 68 ms 30868 KB Output is correct
71 Correct 60 ms 30168 KB Output is correct
72 Correct 3 ms 5836 KB Output is correct
73 Correct 9 ms 7740 KB Output is correct
74 Correct 10 ms 7628 KB Output is correct
75 Correct 3 ms 5836 KB Output is correct
76 Correct 3 ms 5836 KB Output is correct
77 Correct 8 ms 8012 KB Output is correct
78 Correct 7 ms 7628 KB Output is correct
79 Correct 6 ms 7628 KB Output is correct
80 Correct 7 ms 7628 KB Output is correct
81 Correct 3 ms 5836 KB Output is correct
82 Correct 3 ms 5804 KB Output is correct
83 Correct 5 ms 5836 KB Output is correct
84 Correct 3 ms 5836 KB Output is correct
85 Correct 4 ms 5836 KB Output is correct
86 Correct 18 ms 7996 KB Output is correct
87 Correct 18 ms 8012 KB Output is correct
88 Correct 19 ms 8116 KB Output is correct
89 Correct 7 ms 8012 KB Output is correct
90 Correct 7 ms 7628 KB Output is correct
91 Correct 18 ms 8212 KB Output is correct
92 Correct 18 ms 8132 KB Output is correct
93 Correct 3 ms 5812 KB Output is correct
94 Correct 66 ms 34528 KB Output is correct
95 Correct 64 ms 34224 KB Output is correct
96 Correct 77 ms 33764 KB Output is correct
97 Correct 69 ms 34540 KB Output is correct
98 Correct 68 ms 35000 KB Output is correct
99 Correct 68 ms 26416 KB Output is correct
100 Correct 68 ms 26380 KB Output is correct
101 Correct 81 ms 26452 KB Output is correct
102 Correct 72 ms 26820 KB Output is correct
103 Correct 60 ms 30300 KB Output is correct
104 Correct 71 ms 30684 KB Output is correct
105 Correct 60 ms 30260 KB Output is correct
106 Correct 67 ms 30532 KB Output is correct
107 Correct 62 ms 30376 KB Output is correct
108 Correct 63 ms 34648 KB Output is correct
109 Correct 61 ms 34628 KB Output is correct
110 Correct 52 ms 26160 KB Output is correct
111 Correct 56 ms 26180 KB Output is correct
112 Correct 70 ms 26312 KB Output is correct
113 Correct 76 ms 26324 KB Output is correct