oj.uz

Submission #885215

# Submission time Handle Problem Language Result Execution time Memory
885215 2023-12-09T09:34:13 Z Arshi Railway (BOI17_railway) C++17
100 / 100
 77 ms 34504 KB 
/**********************GOD**********************/

#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <cstdlib>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <iterator>
#include <map>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll , ll> pll;

#define len                 length()
#define MP                  make_pair
#define fs                  first
#define sc                  second
#define pb                  push_back
#define all(x)              x.begin() , x.end()
#define kill(x)             cout << x , exit(0)


const int MXN = 2e5 + 4;
const int LOG = 23;

int n, m, k;
int tim;

vector<pair<int, int>> E;
vector<int> adj[MXN];
int dp[MXN], h[MXN], st[MXN];
int par[MXN][LOG];


void Build(int v = 1, int p = 0)
{
    st[v] = ++ tim;
    par[v][0] = p;
    for(int i = 1; i < LOG; i ++)
        par[v][i] = par[par[v][i - 1]][i - 1];
    for(int u : adj[v]) {
        if(u == p)
            continue;
        h[u] = h[v] + 1;
        Build(u, v);
    }
}

int Get(int v, int k)
{
    for(int i = 0; i < LOG; i ++)
        if(k >> i & 1)
            v = par[v][i];
    return v;
}

int LCA(int v, int u)
{
    if(h[v] < h[u]) swap(v, u);
    v = Get(v, h[v] - h[u]);
    if(v == u)
        return v;
    for(int i = LOG - 1; i >= 0; i --) {
        if(par[v][i] != par[u][i]) {
            v = par[v][i];
            u = par[u][i];
        }
    }
    return par[v][0];
}

void DFS(int v, int p = 0)
{
    for(int u : adj[v]) {
        if(u == p)
            continue;
        DFS(u, v);
        dp[v] += dp[u];
    }
}

int main()
{
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cin >> n >> m >> k;
    for(int i = 1; i < n; i ++) {
        int v, u; cin >> v >> u;
        adj[v].pb(u);
        adj[u].pb(v);
        E.pb({v, u});
    }

    Build();

    while(m --) {
        vector<int> vc; int s; cin >> s;
        for(int i = 0; i < s; i ++) {
            int v; cin >> v;
            vc.pb(v);
        }
        sort(all(vc), [&](int i, int j) {
            return st[i] < st[j];
        });
        for(int i = 0; i < s; i ++) {
            int v = vc[i], u = vc[(i + 1) % s];
            int w = LCA(v, u);
            dp[v] ++; dp[u] ++;
            dp[w] -= 2;
        }
    }

    DFS(1);

    vector<int> ans;
    for(int i = 0; i < E.size(); i ++) {
        int v, u; tie(v, u) = E[i];
        if(h[v] < h[u])
            swap(v, u);
        if(dp[v] >= 2 * k)
            ans.pb(i + 1);
    }

    cout << ans.size() << '\n';
    for(int i : ans)
        cout << i << ' ';

    return 0;
}

/*!
ahkh
*/

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:124:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |     for(int i = 0; i < E.size(); i ++) {
      |                    ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 9048 KB Output is correct
2 Correct 6 ms 11608 KB Output is correct
3 Correct 5 ms 11612 KB Output is correct
4 Correct 2 ms 8920 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 6 ms 12000 KB Output is correct
7 Correct 5 ms 11608 KB Output is correct
8 Correct 5 ms 11608 KB Output is correct
9 Correct 7 ms 11608 KB Output is correct
10 Correct 3 ms 8796 KB Output is correct
11 Correct 2 ms 8792 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 1 ms 8796 KB Output is correct
14 Correct 2 ms 8796 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 9048 KB Output is correct
2 Correct 6 ms 11608 KB Output is correct
3 Correct 5 ms 11612 KB Output is correct
4 Correct 2 ms 8920 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 6 ms 12000 KB Output is correct
7 Correct 5 ms 11608 KB Output is correct
8 Correct 5 ms 11608 KB Output is correct
9 Correct 7 ms 11608 KB Output is correct
10 Correct 3 ms 8796 KB Output is correct
11 Correct 2 ms 8792 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 1 ms 8796 KB Output is correct
14 Correct 2 ms 8796 KB Output is correct
15 Correct 17 ms 11940 KB Output is correct
16 Correct 17 ms 11868 KB Output is correct
17 Correct 20 ms 11864 KB Output is correct
18 Correct 6 ms 11864 KB Output is correct
19 Correct 6 ms 11612 KB Output is correct
20 Correct 16 ms 12124 KB Output is correct
21 Correct 18 ms 12124 KB Output is correct
22 Correct 2 ms 8796 KB Output is correct
23 Correct 5 ms 11612 KB Output is correct
24 Correct 5 ms 11608 KB Output is correct
25 Correct 1 ms 8796 KB Output is correct
26 Correct 2 ms 8796 KB Output is correct
27 Correct 6 ms 12000 KB Output is correct
28 Correct 5 ms 11612 KB Output is correct
29 Correct 6 ms 11612 KB Output is correct
30 Correct 7 ms 11612 KB Output is correct
31 Correct 2 ms 8796 KB Output is correct
32 Correct 1 ms 8796 KB Output is correct
33 Correct 2 ms 8796 KB Output is correct
34 Correct 2 ms 8796 KB Output is correct
35 Correct 2 ms 8796 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 34088 KB Output is correct
2 Correct 2 ms 9048 KB Output is correct
3 Correct 64 ms 33388 KB Output is correct
4 Correct 58 ms 32704 KB Output is correct
5 Correct 61 ms 33952 KB Output is correct
6 Correct 61 ms 34504 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 28868 KB Output is correct
2 Correct 65 ms 25536 KB Output is correct
3 Correct 60 ms 25144 KB Output is correct
4 Correct 60 ms 25140 KB Output is correct
5 Correct 74 ms 24904 KB Output is correct
6 Correct 58 ms 29124 KB Output is correct
7 Correct 56 ms 28856 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 28868 KB Output is correct
2 Correct 65 ms 25536 KB Output is correct
3 Correct 60 ms 25144 KB Output is correct
4 Correct 60 ms 25140 KB Output is correct
5 Correct 74 ms 24904 KB Output is correct
6 Correct 58 ms 29124 KB Output is correct
7 Correct 56 ms 28856 KB Output is correct
8 Correct 60 ms 29120 KB Output is correct
9 Correct 65 ms 29160 KB Output is correct
10 Correct 60 ms 34244 KB Output is correct
11 Correct 59 ms 34108 KB Output is correct
12 Correct 56 ms 25160 KB Output is correct
13 Correct 63 ms 24988 KB Output is correct
14 Correct 66 ms 25048 KB Output is correct
15 Correct 57 ms 24980 KB Output is correct
16 Correct 60 ms 25084 KB Output is correct
17 Correct 75 ms 25032 KB Output is correct
18 Correct 64 ms 25028 KB Output is correct
19 Correct 60 ms 25540 KB Output is correct
20 Correct 58 ms 29380 KB Output is correct
21 Correct 61 ms 29536 KB Output is correct
22 Correct 57 ms 29352 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 9048 KB Output is correct
2 Correct 6 ms 11608 KB Output is correct
3 Correct 5 ms 11612 KB Output is correct
4 Correct 2 ms 8920 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 6 ms 12000 KB Output is correct
7 Correct 5 ms 11608 KB Output is correct
8 Correct 5 ms 11608 KB Output is correct
9 Correct 7 ms 11608 KB Output is correct
10 Correct 3 ms 8796 KB Output is correct
11 Correct 2 ms 8792 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 1 ms 8796 KB Output is correct
14 Correct 2 ms 8796 KB Output is correct
15 Correct 17 ms 11940 KB Output is correct
16 Correct 17 ms 11868 KB Output is correct
17 Correct 20 ms 11864 KB Output is correct
18 Correct 6 ms 11864 KB Output is correct
19 Correct 6 ms 11612 KB Output is correct
20 Correct 16 ms 12124 KB Output is correct
21 Correct 18 ms 12124 KB Output is correct
22 Correct 2 ms 8796 KB Output is correct
23 Correct 5 ms 11612 KB Output is correct
24 Correct 5 ms 11608 KB Output is correct
25 Correct 1 ms 8796 KB Output is correct
26 Correct 2 ms 8796 KB Output is correct
27 Correct 6 ms 12000 KB Output is correct
28 Correct 5 ms 11612 KB Output is correct
29 Correct 6 ms 11612 KB Output is correct
30 Correct 7 ms 11612 KB Output is correct
31 Correct 2 ms 8796 KB Output is correct
32 Correct 1 ms 8796 KB Output is correct
33 Correct 2 ms 8796 KB Output is correct
34 Correct 2 ms 8796 KB Output is correct
35 Correct 2 ms 8796 KB Output is correct
36 Correct 66 ms 34088 KB Output is correct
37 Correct 2 ms 9048 KB Output is correct
38 Correct 64 ms 33388 KB Output is correct
39 Correct 58 ms 32704 KB Output is correct
40 Correct 61 ms 33952 KB Output is correct
41 Correct 61 ms 34504 KB Output is correct
42 Correct 57 ms 28868 KB Output is correct
43 Correct 65 ms 25536 KB Output is correct
44 Correct 60 ms 25144 KB Output is correct
45 Correct 60 ms 25140 KB Output is correct
46 Correct 74 ms 24904 KB Output is correct
47 Correct 58 ms 29124 KB Output is correct
48 Correct 56 ms 28856 KB Output is correct
49 Correct 60 ms 29120 KB Output is correct
50 Correct 65 ms 29160 KB Output is correct
51 Correct 60 ms 34244 KB Output is correct
52 Correct 59 ms 34108 KB Output is correct
53 Correct 56 ms 25160 KB Output is correct
54 Correct 63 ms 24988 KB Output is correct
55 Correct 66 ms 25048 KB Output is correct
56 Correct 57 ms 24980 KB Output is correct
57 Correct 60 ms 25084 KB Output is correct
58 Correct 75 ms 25032 KB Output is correct
59 Correct 64 ms 25028 KB Output is correct
60 Correct 60 ms 25540 KB Output is correct
61 Correct 58 ms 29380 KB Output is correct
62 Correct 61 ms 29536 KB Output is correct
63 Correct 57 ms 29352 KB Output is correct
64 Correct 62 ms 29248 KB Output is correct
65 Correct 72 ms 25160 KB Output is correct
66 Correct 63 ms 24904 KB Output is correct
67 Correct 70 ms 25032 KB Output is correct
68 Correct 56 ms 24784 KB Output is correct
69 Correct 48 ms 24784 KB Output is correct
70 Correct 67 ms 29640 KB Output is correct
71 Correct 63 ms 28820 KB Output is correct
72 Correct 2 ms 8796 KB Output is correct
73 Correct 6 ms 11612 KB Output is correct
74 Correct 6 ms 11612 KB Output is correct
75 Correct 2 ms 8796 KB Output is correct
76 Correct 2 ms 8796 KB Output is correct
77 Correct 6 ms 12008 KB Output is correct
78 Correct 5 ms 11612 KB Output is correct
79 Correct 6 ms 11612 KB Output is correct
80 Correct 5 ms 11612 KB Output is correct
81 Correct 1 ms 8796 KB Output is correct
82 Correct 2 ms 8796 KB Output is correct
83 Correct 2 ms 8796 KB Output is correct
84 Correct 2 ms 8796 KB Output is correct
85 Correct 2 ms 8792 KB Output is correct
86 Correct 16 ms 11808 KB Output is correct
87 Correct 19 ms 12016 KB Output is correct
88 Correct 17 ms 12120 KB Output is correct
89 Correct 6 ms 12004 KB Output is correct
90 Correct 6 ms 11748 KB Output is correct
91 Correct 17 ms 12004 KB Output is correct
92 Correct 18 ms 12124 KB Output is correct
93 Correct 1 ms 8796 KB Output is correct
94 Correct 77 ms 34500 KB Output is correct
95 Correct 72 ms 33420 KB Output is correct
96 Correct 71 ms 32872 KB Output is correct
97 Correct 62 ms 34008 KB Output is correct
98 Correct 63 ms 34496 KB Output is correct
99 Correct 68 ms 24992 KB Output is correct
100 Correct 64 ms 25024 KB Output is correct
101 Correct 62 ms 25032 KB Output is correct
102 Correct 63 ms 25504 KB Output is correct
103 Correct 74 ms 29128 KB Output is correct
104 Correct 73 ms 29340 KB Output is correct
105 Correct 60 ms 28828 KB Output is correct
106 Correct 60 ms 29120 KB Output is correct
107 Correct 61 ms 29096 KB Output is correct
108 Correct 70 ms 34116 KB Output is correct
109 Correct 68 ms 34244 KB Output is correct
110 Correct 49 ms 24916 KB Output is correct
111 Correct 60 ms 24984 KB Output is correct
112 Correct 72 ms 25024 KB Output is correct
113 Correct 72 ms 24904 KB Output is correct