oj.uz

Submission #243307

# Submission time Handle Problem Language Result Execution time Memory
243307 2020-06-30T22:03:31 Z johutha Railway (BOI17_railway) C++17
100 / 100
 265 ms 61140 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>

#define int int64_t

using namespace std;

int log2(int n)
{
    int r = 0;
    for (; n; n /= 2) r++;
    return r;
}

struct tree
{
    int n;
    vector<vector<int>> adjlist;
    vector<vector<int>> st;
    vector<vector<int>> en;
    vector<int> res;

    set<int>* smldfs(int curr, int par)
    {
        set<int>* rs = new set<int>(st[curr].begin(), st[curr].end());
        
        for (auto next : adjlist[curr])
        {
            if (next == par) continue;
            set<int>* ot = smldfs(next, curr);
            if (ot->size() > rs->size()) swap(ot, rs);
            for (auto i : (*ot))
            {
                rs->insert(i);
            }
        }
        for (auto i : en[curr])
        {
            rs->erase(i);
        }
        res[curr] = rs->size();
        return rs;
    }

    vector<vector<int>> table;
    vector<int> lvl;
    int logn;

    void dfs(int curr, int par, int lv)
    {
        lvl[curr] = lv;
        table[0][curr] = par;
        for (auto next : adjlist[curr]) if (next != par) dfs(next, curr, lv + 1);
    }

    void prelca()
    {
        logn = log2(n) + 1;
        table.resize(logn, vector<int>(n));
        lvl.resize(n);
        dfs(0, -1, 0);
        table[0][0] = 0;

        for (int i = 1; i < logn; i++)
        {
            for (int j = 0; j < n; j++)
            {
                table[i][j] = table[i - 1][table[i - 1][j]];
            }
        }
    }

    int lca(int a, int b)
    {
        if (lvl[a] < lvl[b]) swap(a, b);
        int ld = lvl[a] - lvl[b];

        for (int j = 0; j < logn; j++)
        {
            if (ld & (1<<j)) a = table[j][a];
        }
        if (a == b) return a;
        for (int j = logn - 1; j >= 0; j--)
        {
            if (table[j][a] != table[j][b])
            {
                a = table[j][a];
                b = table[j][b];
            }
        }
        return table[0][a];
    }
};

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    int n, m, k;
    cin >> n >> m >> k;

    tree t;
    t.n = n;
    t.adjlist.resize(n);
    vector<pair<int,int>> edges;

    for (int i = 0; i < n - 1; i++)
    {
        int a, b;
        cin >> a >> b;
        a--; b--;
        edges.emplace_back(a, b);
        t.adjlist[a].push_back(b);
        t.adjlist[b].push_back(a);
    }

    t.prelca();
    t.st.resize(n);
    t.en.resize(n);

    for (int i = 0; i < m; i++)
    {
        int c;
        cin >> c;
        int l = -1;
        for (int j = 0; j < c; j++)
        {
            int a;
            cin >> a;
            a--;
            t.st[a].push_back(i);
            if (l == -1) l = a;
            else l = t.lca(l, a);
        }
        t.en[l].push_back(i);
    }
    t.res.resize(n);
    t.smldfs(0, -1);

    vector<int> sol;
    for (int i = 0; i < n - 1; i++)
    {
        auto e = edges[i];
        int a = (t.lvl[e.first] > t.lvl[e.second] ? e.first : e.second);
        if (t.res[a] >= k) sol.push_back(i + 1);
    }
    cout << sol.size() << "\n";
    for (auto i : sol) cout << i << " ";
    cout << "\n";
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 11 ms 3836 KB Output is correct
3 Correct 11 ms 3836 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 11 ms 4348 KB Output is correct
7 Correct 12 ms 3836 KB Output is correct
8 Correct 10 ms 3836 KB Output is correct
9 Correct 12 ms 3964 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 11 ms 3836 KB Output is correct
3 Correct 11 ms 3836 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 11 ms 4348 KB Output is correct
7 Correct 12 ms 3836 KB Output is correct
8 Correct 10 ms 3836 KB Output is correct
9 Correct 12 ms 3964 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 43 ms 10612 KB Output is correct
16 Correct 45 ms 10740 KB Output is correct
17 Correct 46 ms 10740 KB Output is correct
18 Correct 13 ms 4476 KB Output is correct
19 Correct 12 ms 3836 KB Output is correct
20 Correct 53 ms 10356 KB Output is correct
21 Correct 45 ms 10232 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 11 ms 3836 KB Output is correct
24 Correct 12 ms 3836 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 12 ms 4348 KB Output is correct
28 Correct 11 ms 3836 KB Output is correct
29 Correct 10 ms 3968 KB Output is correct
30 Correct 11 ms 3964 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 4 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 231 ms 54120 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 227 ms 53100 KB Output is correct
4 Correct 221 ms 52840 KB Output is correct
5 Correct 217 ms 52840 KB Output is correct
6 Correct 170 ms 55784 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 47848 KB Output is correct
2 Correct 172 ms 46568 KB Output is correct
3 Correct 213 ms 51308 KB Output is correct
4 Correct 208 ms 53356 KB Output is correct
5 Correct 219 ms 51820 KB Output is correct
6 Correct 143 ms 47720 KB Output is correct
7 Correct 142 ms 48072 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 47848 KB Output is correct
2 Correct 172 ms 46568 KB Output is correct
3 Correct 213 ms 51308 KB Output is correct
4 Correct 208 ms 53356 KB Output is correct
5 Correct 219 ms 51820 KB Output is correct
6 Correct 143 ms 47720 KB Output is correct
7 Correct 142 ms 48072 KB Output is correct
8 Correct 154 ms 47976 KB Output is correct
9 Correct 160 ms 47848 KB Output is correct
10 Correct 152 ms 52712 KB Output is correct
11 Correct 157 ms 52560 KB Output is correct
12 Correct 119 ms 43112 KB Output is correct
13 Correct 118 ms 42984 KB Output is correct
14 Correct 176 ms 48492 KB Output is correct
15 Correct 164 ms 48492 KB Output is correct
16 Correct 200 ms 54252 KB Output is correct
17 Correct 205 ms 52588 KB Output is correct
18 Correct 190 ms 52716 KB Output is correct
19 Correct 173 ms 47452 KB Output is correct
20 Correct 146 ms 48360 KB Output is correct
21 Correct 140 ms 48920 KB Output is correct
22 Correct 152 ms 48872 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 11 ms 3836 KB Output is correct
3 Correct 11 ms 3836 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 11 ms 4348 KB Output is correct
7 Correct 12 ms 3836 KB Output is correct
8 Correct 10 ms 3836 KB Output is correct
9 Correct 12 ms 3964 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 43 ms 10612 KB Output is correct
16 Correct 45 ms 10740 KB Output is correct
17 Correct 46 ms 10740 KB Output is correct
18 Correct 13 ms 4476 KB Output is correct
19 Correct 12 ms 3836 KB Output is correct
20 Correct 53 ms 10356 KB Output is correct
21 Correct 45 ms 10232 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 11 ms 3836 KB Output is correct
24 Correct 12 ms 3836 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 12 ms 4348 KB Output is correct
28 Correct 11 ms 3836 KB Output is correct
29 Correct 10 ms 3968 KB Output is correct
30 Correct 11 ms 3964 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 4 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 231 ms 54120 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 227 ms 53100 KB Output is correct
39 Correct 221 ms 52840 KB Output is correct
40 Correct 217 ms 52840 KB Output is correct
41 Correct 170 ms 55784 KB Output is correct
42 Correct 142 ms 47848 KB Output is correct
43 Correct 172 ms 46568 KB Output is correct
44 Correct 213 ms 51308 KB Output is correct
45 Correct 208 ms 53356 KB Output is correct
46 Correct 219 ms 51820 KB Output is correct
47 Correct 143 ms 47720 KB Output is correct
48 Correct 142 ms 48072 KB Output is correct
49 Correct 154 ms 47976 KB Output is correct
50 Correct 160 ms 47848 KB Output is correct
51 Correct 152 ms 52712 KB Output is correct
52 Correct 157 ms 52560 KB Output is correct
53 Correct 119 ms 43112 KB Output is correct
54 Correct 118 ms 42984 KB Output is correct
55 Correct 176 ms 48492 KB Output is correct
56 Correct 164 ms 48492 KB Output is correct
57 Correct 200 ms 54252 KB Output is correct
58 Correct 205 ms 52588 KB Output is correct
59 Correct 190 ms 52716 KB Output is correct
60 Correct 173 ms 47452 KB Output is correct
61 Correct 146 ms 48360 KB Output is correct
62 Correct 140 ms 48920 KB Output is correct
63 Correct 152 ms 48872 KB Output is correct
64 Correct 161 ms 48120 KB Output is correct
65 Correct 265 ms 61140 KB Output is correct
66 Correct 213 ms 56456 KB Output is correct
67 Correct 205 ms 51948 KB Output is correct
68 Correct 103 ms 40812 KB Output is correct
69 Correct 110 ms 40812 KB Output is correct
70 Correct 174 ms 49512 KB Output is correct
71 Correct 182 ms 47464 KB Output is correct
72 Correct 5 ms 384 KB Output is correct
73 Correct 11 ms 3864 KB Output is correct
74 Correct 11 ms 3836 KB Output is correct
75 Correct 5 ms 384 KB Output is correct
76 Correct 5 ms 384 KB Output is correct
77 Correct 13 ms 4384 KB Output is correct
78 Correct 11 ms 3836 KB Output is correct
79 Correct 10 ms 3964 KB Output is correct
80 Correct 11 ms 3964 KB Output is correct
81 Correct 5 ms 384 KB Output is correct
82 Correct 5 ms 384 KB Output is correct
83 Correct 5 ms 384 KB Output is correct
84 Correct 5 ms 384 KB Output is correct
85 Correct 5 ms 384 KB Output is correct
86 Correct 43 ms 10612 KB Output is correct
87 Correct 44 ms 10612 KB Output is correct
88 Correct 46 ms 10740 KB Output is correct
89 Correct 12 ms 4476 KB Output is correct
90 Correct 11 ms 3964 KB Output is correct
91 Correct 45 ms 10356 KB Output is correct
92 Correct 44 ms 10232 KB Output is correct
93 Correct 5 ms 384 KB Output is correct
94 Correct 219 ms 54376 KB Output is correct
95 Correct 225 ms 53096 KB Output is correct
96 Correct 208 ms 52840 KB Output is correct
97 Correct 206 ms 53124 KB Output is correct
98 Correct 177 ms 55784 KB Output is correct
99 Correct 229 ms 57068 KB Output is correct
100 Correct 209 ms 54128 KB Output is correct
101 Correct 212 ms 54636 KB Output is correct
102 Correct 170 ms 47208 KB Output is correct
103 Correct 141 ms 47724 KB Output is correct
104 Correct 160 ms 49128 KB Output is correct
105 Correct 150 ms 47592 KB Output is correct
106 Correct 156 ms 48104 KB Output is correct
107 Correct 156 ms 47852 KB Output is correct
108 Correct 150 ms 52688 KB Output is correct
109 Correct 165 ms 52712 KB Output is correct
110 Correct 134 ms 43112 KB Output is correct
111 Correct 106 ms 43112 KB Output is correct
112 Correct 159 ms 48108 KB Output is correct
113 Correct 168 ms 47980 KB Output is correct