oj.uz

Submission #562779

# Submission time Handle Problem Language Result Execution time Memory
562779 2022-05-15T09:48:14 Z Tien_Noob Railway (BOI17_railway) C++17
100 / 100
 115 ms 27276 KB 
//Make CSP great again
//Vengeance
#include <bits/stdc++.h>
#define TASK "TESTCODE"
#define Log2(x) 31 - __builtin_clz(x)
using namespace std;
const int N = 1e5, cbit = 16;
int dp[N + 1], tin[N + 1], tout[N + 1], timer, n, m, k, x[N], y[N], f[N + 1][cbit + 1], depth[N + 1];
vector<int> adj[N + 1], res, city;
void read()
{
    cin >> n >> m >> k;
    for (int i = 1; i < n; ++ i)
    {
        cin >> x[i] >> y[i];
        adj[x[i]].push_back(i);
        adj[y[i]].push_back(i);
    }
}
void preDFS(int u, int p)
{
    tin[u] = ++timer;
    for (int i : adj[u])
    {
        int v = x[i] ^ u ^ y[i];
        if (v == p)
        {
            continue;
        }
        depth[v] = depth[u] + 1;
        f[v][0] = u;
        for (int j = 1; j <= cbit; ++ j)
        {
            f[v][j] = f[f[v][j - 1]][j - 1];
        }
        preDFS(v, u);
    }
    tout[u] = timer;
}
int LCA(int u, int v)
{
    if (depth[u] > depth[v])
    {
        swap(u, v);
    }
    int x = depth[v] - depth[u];
    for (int i = cbit; i >= 0; -- i)
    {
        if ((x >> i) & 1)
        {
            v = f[v][i];
        }
    }
    if (u == v)
    {
        return u;
    }
    for (int i = cbit; i >= 0; -- i)
    {
        if (f[u][i] != f[v][i])
        {
            u = f[u][i];
            v = f[v][i];
        }
    }
    return f[u][0];
}
void ReadQuery()
{
    int s;
    cin >> s;
    city.clear();
    while(s--)
    {
        int u;
        cin >> u;
        city.push_back(u);
    }
    sort(city.begin(), city.end(), [&] (const int &u, const int &v)
    {
        return tin[u] < tin[v];
    });
    vector<int> t;
    for (int i = 1; i < city.size(); ++ i)
    {
        t.push_back(LCA(city[i], city[i - 1]));
    }
    move(t.begin(), t.end(), back_inserter(city));
    sort(city.begin(), city.end(), [&] (const int &u, const int &v)
    {
        return tin[u] < tin[v];
    });
    city.erase(unique(city.begin(), city.end()), city.end());
}
void DnC()
{
    stack<int> st;
    for (int v : city)
    {
        while(!st.empty())
        {
            int u = st.top();
            if (tin[v] <= tout[u])
            {
                --dp[u];
                ++dp[v];
                break;
            }
            else
            {
                st.pop();
            }
        }
        st.push(v);
    }
}
void DFS(int u, int p)
{
    for (int i : adj[u])
    {
        int v = x[i] ^ y[i] ^ u;
        if (v == p)
        {
            continue;
        }
        DFS(v, u);
        dp[u] += dp[v];
        if (dp[v] >= k)
        {
            res.push_back(i);
        }
    }
}
void solve()
{
    preDFS(1, 0);
    while(m--)
    {
        ReadQuery();
        DnC();
    }
    DFS(1, 0);
    sort(res.begin(), res.end());
    cout << res.size() << '\n';
    for (int i : res)
    {
        cout << i << ' ';
    }
}
int  main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen(TASK".INP", "r"))
    {
        freopen(TASK".INP", "r", stdin);
        //freopen(TASK".OUT", "w", stdout);
    }
    int t = 1;
    bool typetest = false;
    if (typetest)
    {
        cin >> t;
    }
    for (int __ = 1; __ <= t; ++ __)
    {
        //cout << "Case " << __ << ": ";
        read();
        solve();
    }
}

Compilation message

railway.cpp: In function 'void ReadQuery()':
railway.cpp:84:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |     for (int i = 1; i < city.size(); ++ i)
      |                     ~~^~~~~~~~~~~~~
railway.cpp: In function 'int main()':
railway.cpp:156:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  156 |         freopen(TASK".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 6 ms 3972 KB Output is correct
3 Correct 6 ms 3996 KB Output is correct
4 Correct 2 ms 2680 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 8 ms 4552 KB Output is correct
7 Correct 6 ms 4108 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 2 ms 2644 KB Output is correct
14 Correct 2 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 6 ms 3972 KB Output is correct
3 Correct 6 ms 3996 KB Output is correct
4 Correct 2 ms 2680 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 8 ms 4552 KB Output is correct
7 Correct 6 ms 4108 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 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 28 ms 4392 KB Output is correct
16 Correct 29 ms 4396 KB Output is correct
17 Correct 27 ms 4388 KB Output is correct
18 Correct 6 ms 4488 KB Output is correct
19 Correct 6 ms 4112 KB Output is correct
20 Correct 21 ms 4576 KB Output is correct
21 Correct 24 ms 4404 KB Output is correct
22 Correct 2 ms 2676 KB Output is correct
23 Correct 6 ms 3984 KB Output is correct
24 Correct 5 ms 3924 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 6 ms 4572 KB Output is correct
28 Correct 6 ms 4052 KB Output is correct
29 Correct 5 ms 4052 KB Output is correct
30 Correct 5 ms 4052 KB Output is correct
31 Correct 2 ms 2676 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2772 KB Output is correct
34 Correct 2 ms 2644 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 89 ms 24960 KB Output is correct
2 Correct 3 ms 2644 KB Output is correct
3 Correct 79 ms 26552 KB Output is correct
4 Correct 80 ms 25932 KB Output is correct
5 Correct 83 ms 26780 KB Output is correct
6 Correct 82 ms 27212 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 19404 KB Output is correct
2 Correct 84 ms 17144 KB Output is correct
3 Correct 87 ms 16588 KB Output is correct
4 Correct 91 ms 16660 KB Output is correct
5 Correct 87 ms 16628 KB Output is correct
6 Correct 70 ms 21392 KB Output is correct
7 Correct 71 ms 21324 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 19404 KB Output is correct
2 Correct 84 ms 17144 KB Output is correct
3 Correct 87 ms 16588 KB Output is correct
4 Correct 91 ms 16660 KB Output is correct
5 Correct 87 ms 16628 KB Output is correct
6 Correct 70 ms 21392 KB Output is correct
7 Correct 71 ms 21324 KB Output is correct
8 Correct 86 ms 21400 KB Output is correct
9 Correct 79 ms 21424 KB Output is correct
10 Correct 86 ms 26904 KB Output is correct
11 Correct 82 ms 26960 KB Output is correct
12 Correct 66 ms 16488 KB Output is correct
13 Correct 72 ms 16496 KB Output is correct
14 Correct 89 ms 16692 KB Output is correct
15 Correct 91 ms 16544 KB Output is correct
16 Correct 96 ms 16688 KB Output is correct
17 Correct 87 ms 16588 KB Output is correct
18 Correct 92 ms 16644 KB Output is correct
19 Correct 93 ms 17156 KB Output is correct
20 Correct 70 ms 21608 KB Output is correct
21 Correct 70 ms 21708 KB Output is correct
22 Correct 72 ms 21608 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 6 ms 3972 KB Output is correct
3 Correct 6 ms 3996 KB Output is correct
4 Correct 2 ms 2680 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 8 ms 4552 KB Output is correct
7 Correct 6 ms 4108 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 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 28 ms 4392 KB Output is correct
16 Correct 29 ms 4396 KB Output is correct
17 Correct 27 ms 4388 KB Output is correct
18 Correct 6 ms 4488 KB Output is correct
19 Correct 6 ms 4112 KB Output is correct
20 Correct 21 ms 4576 KB Output is correct
21 Correct 24 ms 4404 KB Output is correct
22 Correct 2 ms 2676 KB Output is correct
23 Correct 6 ms 3984 KB Output is correct
24 Correct 5 ms 3924 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 6 ms 4572 KB Output is correct
28 Correct 6 ms 4052 KB Output is correct
29 Correct 5 ms 4052 KB Output is correct
30 Correct 5 ms 4052 KB Output is correct
31 Correct 2 ms 2676 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2772 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 89 ms 24960 KB Output is correct
37 Correct 3 ms 2644 KB Output is correct
38 Correct 79 ms 26552 KB Output is correct
39 Correct 80 ms 25932 KB Output is correct
40 Correct 83 ms 26780 KB Output is correct
41 Correct 82 ms 27212 KB Output is correct
42 Correct 68 ms 19404 KB Output is correct
43 Correct 84 ms 17144 KB Output is correct
44 Correct 87 ms 16588 KB Output is correct
45 Correct 91 ms 16660 KB Output is correct
46 Correct 87 ms 16628 KB Output is correct
47 Correct 70 ms 21392 KB Output is correct
48 Correct 71 ms 21324 KB Output is correct
49 Correct 86 ms 21400 KB Output is correct
50 Correct 79 ms 21424 KB Output is correct
51 Correct 86 ms 26904 KB Output is correct
52 Correct 82 ms 26960 KB Output is correct
53 Correct 66 ms 16488 KB Output is correct
54 Correct 72 ms 16496 KB Output is correct
55 Correct 89 ms 16692 KB Output is correct
56 Correct 91 ms 16544 KB Output is correct
57 Correct 96 ms 16688 KB Output is correct
58 Correct 87 ms 16588 KB Output is correct
59 Correct 92 ms 16644 KB Output is correct
60 Correct 93 ms 17156 KB Output is correct
61 Correct 70 ms 21608 KB Output is correct
62 Correct 70 ms 21708 KB Output is correct
63 Correct 72 ms 21608 KB Output is correct
64 Correct 77 ms 21608 KB Output is correct
65 Correct 97 ms 16672 KB Output is correct
66 Correct 115 ms 16568 KB Output is correct
67 Correct 97 ms 16584 KB Output is correct
68 Correct 64 ms 16452 KB Output is correct
69 Correct 62 ms 16388 KB Output is correct
70 Correct 88 ms 21816 KB Output is correct
71 Correct 91 ms 21360 KB Output is correct
72 Correct 2 ms 2648 KB Output is correct
73 Correct 6 ms 3924 KB Output is correct
74 Correct 6 ms 3924 KB Output is correct
75 Correct 2 ms 2644 KB Output is correct
76 Correct 2 ms 2644 KB Output is correct
77 Correct 7 ms 4564 KB Output is correct
78 Correct 6 ms 4052 KB Output is correct
79 Correct 5 ms 4052 KB Output is correct
80 Correct 5 ms 4052 KB Output is correct
81 Correct 3 ms 2644 KB Output is correct
82 Correct 1 ms 2680 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 26 ms 4300 KB Output is correct
87 Correct 27 ms 4432 KB Output is correct
88 Correct 26 ms 4388 KB Output is correct
89 Correct 7 ms 4552 KB Output is correct
90 Correct 6 ms 4040 KB Output is correct
91 Correct 21 ms 4564 KB Output is correct
92 Correct 24 ms 4464 KB Output is correct
93 Correct 2 ms 2644 KB Output is correct
94 Correct 82 ms 26836 KB Output is correct
95 Correct 95 ms 26564 KB Output is correct
96 Correct 76 ms 25932 KB Output is correct
97 Correct 85 ms 26812 KB Output is correct
98 Correct 93 ms 27276 KB Output is correct
99 Correct 89 ms 16684 KB Output is correct
100 Correct 90 ms 16656 KB Output is correct
101 Correct 88 ms 16604 KB Output is correct
102 Correct 87 ms 17100 KB Output is correct
103 Correct 69 ms 21332 KB Output is correct
104 Correct 75 ms 21736 KB Output is correct
105 Correct 77 ms 21324 KB Output is correct
106 Correct 79 ms 21520 KB Output is correct
107 Correct 81 ms 21356 KB Output is correct
108 Correct 91 ms 26908 KB Output is correct
109 Correct 90 ms 26992 KB Output is correct
110 Correct 77 ms 16564 KB Output is correct
111 Correct 65 ms 16476 KB Output is correct
112 Correct 99 ms 16520 KB Output is correct
113 Correct 91 ms 16608 KB Output is correct