oj.uz

Submission #700069

# Submission time Handle Problem Language Result Execution time Memory
700069 2023-02-18T15:38:46 Z TS_2392 Railway (BOI17_railway) C++14
100 / 100
 93 ms 24900 KB 
#include <bits/stdc++.h>

#define fileIO(name) if(fopen(name".inp", "r")) {freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);}
#define SPEED ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0)

#define epl emplace
#define eb emplace_back

#define EL cout << '\n'
#define dbg(x) cout << #x << " = " << (x) << ' '
#define dbgp(x) cout << #x << " = (" << (x.fi) << ", " << (x.se) << ") "

#define fi first
#define se second
#define mp make_pair

#define sqr(x) (x) * (x)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

#define lwb lower_bound
#define upb upper_bound
#define ctz __builtin_ctzll
#define pct __builtin_popcountll

using namespace std;

typedef long long ll;
typedef long double ldb;
typedef unsigned int uint;
typedef unsigned long long ull;

typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef pair<int, int> pii;
typedef pair<ldb, ldb> pld;
typedef pair<double, double> pdd;

template<class T1, class T2> bool minimize(T1 &a, T2 &b){return a > b ? a = b, true : false;}
template<class T1, class T2> bool maximize(T1 &a, T2 &b){return a < b ? a = b, true : false;}
const int N = 1e5 + 3;
int n, m, k, node[N], cnt[N];
int Tin[N], Timer, jmp[N][18], dep[N];
bool mark[N];
vector<int> res;
vector<pii> adj[N];
void dfsLca(int u, int par){
    Tin[u] = ++Timer;
    for(int i = 0; i < adj[u].size(); ++i){
        int v = adj[u][i].fi;
        if(v == par) continue;
        jmp[v][0] = u; dep[v] = dep[u] + 1;
        for(int j = 1; j <= 17; ++j){
            if(!jmp[v][j - 1]) break;
            jmp[v][j] = jmp[jmp[v][j - 1]][j - 1];
        }
        dfsLca(v, u);
    }
}
bool cmp(const int &a, const int &b){
    return Tin[a] < Tin[b];
}
int Lca(int u, int v){
    if(dep[u] < dep[v]) swap(u, v);
    for(int i = 17; i >= 0; --i) if(dep[u] - (1 << i) >= dep[v]){
        u = jmp[u][i];
    }
    if(u == v) return u;
    for(int i = 17; i >= 0; --i) if(jmp[u][i] != jmp[v][i]){
        u = jmp[u][i]; v = jmp[v][i];
    }
    return jmp[u][0];
}
void dfs(int u, int pre_id){
    for(int i = 0; i < adj[u].size(); ++i){
        int v, id; tie(v, id) = adj[u][i];
        if(id == pre_id) continue;
        dfs(v, id); cnt[u] += cnt[v];
    }
    if(pre_id && cnt[u] / 2 >= k) res.eb(pre_id);
}
int main(){
    SPEED;
    cin >> n >> m >> k;
    for(int i = 1; i < n; ++i){
        int u, v; cin >> u >> v;
        adj[u].eb(v, i); adj[v].eb(u, i);
    }
    dfsLca(1, 0);
    while(m--){
        int sz; cin >> sz;
        for(int i = 1; i <= sz; ++i) cin >> node[i];
        sort(node + 1, node + 1 + sz, cmp);
        node[sz + 1] = node[1];
        for(int i = 1; i <= sz; ++i){
            int u = node[i], v = node[i + 1];
            int lca = Lca(u, v);
            ++cnt[u]; ++cnt[v]; cnt[lca] -= 2;
        }
    }
    dfs(1, 0); sort(all(res));
    cout << res.size() << '\n';
    for(int &x : res) cout << x << ' ';
    return 0;
}

Compilation message

railway.cpp: In function 'void dfsLca(int, int)':
railway.cpp:50: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]
   50 |     for(int i = 0; i < adj[u].size(); ++i){
      |                    ~~^~~~~~~~~~~~~~~
railway.cpp: In function 'void dfs(int, int)':
railway.cpp:76: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]
   76 |     for(int i = 0; i < adj[u].size(); ++i){
      |                    ~~^~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 7 ms 3976 KB Output is correct
3 Correct 5 ms 3924 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 6 ms 4436 KB Output is correct
7 Correct 6 ms 4096 KB Output is correct
8 Correct 5 ms 3968 KB Output is correct
9 Correct 4 ms 3924 KB Output is correct
10 Correct 2 ms 2676 KB Output is correct
11 Correct 2 ms 2680 KB Output is correct
12 Correct 2 ms 2684 KB Output is correct
13 Correct 2 ms 2684 KB Output is correct
14 Correct 2 ms 2680 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 7 ms 3976 KB Output is correct
3 Correct 5 ms 3924 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 6 ms 4436 KB Output is correct
7 Correct 6 ms 4096 KB Output is correct
8 Correct 5 ms 3968 KB Output is correct
9 Correct 4 ms 3924 KB Output is correct
10 Correct 2 ms 2676 KB Output is correct
11 Correct 2 ms 2680 KB Output is correct
12 Correct 2 ms 2684 KB Output is correct
13 Correct 2 ms 2684 KB Output is correct
14 Correct 2 ms 2680 KB Output is correct
15 Correct 19 ms 4272 KB Output is correct
16 Correct 19 ms 4368 KB Output is correct
17 Correct 19 ms 4360 KB Output is correct
18 Correct 6 ms 4436 KB Output is correct
19 Correct 6 ms 3976 KB Output is correct
20 Correct 17 ms 4480 KB Output is correct
21 Correct 18 ms 4436 KB Output is correct
22 Correct 1 ms 2644 KB Output is correct
23 Correct 5 ms 3924 KB Output is correct
24 Correct 5 ms 3972 KB Output is correct
25 Correct 1 ms 2644 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 6 ms 4436 KB Output is correct
28 Correct 5 ms 3976 KB Output is correct
29 Correct 4 ms 3924 KB Output is correct
30 Correct 4 ms 3924 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 2 ms 2684 KB Output is correct
33 Correct 2 ms 2680 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 83 ms 22688 KB Output is correct
2 Correct 2 ms 2684 KB Output is correct
3 Correct 83 ms 24120 KB Output is correct
4 Correct 81 ms 23660 KB Output is correct
5 Correct 92 ms 24528 KB Output is correct
6 Correct 83 ms 24880 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 18348 KB Output is correct
2 Correct 76 ms 16900 KB Output is correct
3 Correct 70 ms 16400 KB Output is correct
4 Correct 68 ms 16348 KB Output is correct
5 Correct 66 ms 16348 KB Output is correct
6 Correct 68 ms 20384 KB Output is correct
7 Correct 66 ms 20248 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 18348 KB Output is correct
2 Correct 76 ms 16900 KB Output is correct
3 Correct 70 ms 16400 KB Output is correct
4 Correct 68 ms 16348 KB Output is correct
5 Correct 66 ms 16348 KB Output is correct
6 Correct 68 ms 20384 KB Output is correct
7 Correct 66 ms 20248 KB Output is correct
8 Correct 80 ms 20300 KB Output is correct
9 Correct 78 ms 20404 KB Output is correct
10 Correct 78 ms 24592 KB Output is correct
11 Correct 79 ms 24516 KB Output is correct
12 Correct 48 ms 16108 KB Output is correct
13 Correct 48 ms 16096 KB Output is correct
14 Correct 71 ms 16332 KB Output is correct
15 Correct 66 ms 16404 KB Output is correct
16 Correct 72 ms 16404 KB Output is correct
17 Correct 66 ms 16404 KB Output is correct
18 Correct 66 ms 16336 KB Output is correct
19 Correct 76 ms 16716 KB Output is correct
20 Correct 69 ms 20604 KB Output is correct
21 Correct 70 ms 20660 KB Output is correct
22 Correct 66 ms 20524 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 7 ms 3976 KB Output is correct
3 Correct 5 ms 3924 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 6 ms 4436 KB Output is correct
7 Correct 6 ms 4096 KB Output is correct
8 Correct 5 ms 3968 KB Output is correct
9 Correct 4 ms 3924 KB Output is correct
10 Correct 2 ms 2676 KB Output is correct
11 Correct 2 ms 2680 KB Output is correct
12 Correct 2 ms 2684 KB Output is correct
13 Correct 2 ms 2684 KB Output is correct
14 Correct 2 ms 2680 KB Output is correct
15 Correct 19 ms 4272 KB Output is correct
16 Correct 19 ms 4368 KB Output is correct
17 Correct 19 ms 4360 KB Output is correct
18 Correct 6 ms 4436 KB Output is correct
19 Correct 6 ms 3976 KB Output is correct
20 Correct 17 ms 4480 KB Output is correct
21 Correct 18 ms 4436 KB Output is correct
22 Correct 1 ms 2644 KB Output is correct
23 Correct 5 ms 3924 KB Output is correct
24 Correct 5 ms 3972 KB Output is correct
25 Correct 1 ms 2644 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 6 ms 4436 KB Output is correct
28 Correct 5 ms 3976 KB Output is correct
29 Correct 4 ms 3924 KB Output is correct
30 Correct 4 ms 3924 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 2 ms 2684 KB Output is correct
33 Correct 2 ms 2680 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 83 ms 22688 KB Output is correct
37 Correct 2 ms 2684 KB Output is correct
38 Correct 83 ms 24120 KB Output is correct
39 Correct 81 ms 23660 KB Output is correct
40 Correct 92 ms 24528 KB Output is correct
41 Correct 83 ms 24880 KB Output is correct
42 Correct 63 ms 18348 KB Output is correct
43 Correct 76 ms 16900 KB Output is correct
44 Correct 70 ms 16400 KB Output is correct
45 Correct 68 ms 16348 KB Output is correct
46 Correct 66 ms 16348 KB Output is correct
47 Correct 68 ms 20384 KB Output is correct
48 Correct 66 ms 20248 KB Output is correct
49 Correct 80 ms 20300 KB Output is correct
50 Correct 78 ms 20404 KB Output is correct
51 Correct 78 ms 24592 KB Output is correct
52 Correct 79 ms 24516 KB Output is correct
53 Correct 48 ms 16108 KB Output is correct
54 Correct 48 ms 16096 KB Output is correct
55 Correct 71 ms 16332 KB Output is correct
56 Correct 66 ms 16404 KB Output is correct
57 Correct 72 ms 16404 KB Output is correct
58 Correct 66 ms 16404 KB Output is correct
59 Correct 66 ms 16336 KB Output is correct
60 Correct 76 ms 16716 KB Output is correct
61 Correct 69 ms 20604 KB Output is correct
62 Correct 70 ms 20660 KB Output is correct
63 Correct 66 ms 20524 KB Output is correct
64 Correct 69 ms 20440 KB Output is correct
65 Correct 76 ms 16404 KB Output is correct
66 Correct 73 ms 16340 KB Output is correct
67 Correct 75 ms 16272 KB Output is correct
68 Correct 55 ms 16072 KB Output is correct
69 Correct 43 ms 16076 KB Output is correct
70 Correct 72 ms 20816 KB Output is correct
71 Correct 70 ms 20184 KB Output is correct
72 Correct 1 ms 2644 KB Output is correct
73 Correct 5 ms 3924 KB Output is correct
74 Correct 6 ms 3924 KB Output is correct
75 Correct 2 ms 2680 KB Output is correct
76 Correct 2 ms 2684 KB Output is correct
77 Correct 6 ms 4428 KB Output is correct
78 Correct 5 ms 4052 KB Output is correct
79 Correct 4 ms 3924 KB Output is correct
80 Correct 4 ms 3968 KB Output is correct
81 Correct 2 ms 2644 KB Output is correct
82 Correct 2 ms 2680 KB Output is correct
83 Correct 2 ms 2644 KB Output is correct
84 Correct 2 ms 2676 KB Output is correct
85 Correct 2 ms 2644 KB Output is correct
86 Correct 19 ms 4368 KB Output is correct
87 Correct 18 ms 4400 KB Output is correct
88 Correct 18 ms 4372 KB Output is correct
89 Correct 6 ms 4448 KB Output is correct
90 Correct 6 ms 3980 KB Output is correct
91 Correct 17 ms 4564 KB Output is correct
92 Correct 19 ms 4480 KB Output is correct
93 Correct 2 ms 2684 KB Output is correct
94 Correct 92 ms 24472 KB Output is correct
95 Correct 78 ms 24244 KB Output is correct
96 Correct 76 ms 23612 KB Output is correct
97 Correct 90 ms 24556 KB Output is correct
98 Correct 85 ms 24900 KB Output is correct
99 Correct 69 ms 16416 KB Output is correct
100 Correct 66 ms 16328 KB Output is correct
101 Correct 65 ms 16380 KB Output is correct
102 Correct 93 ms 16716 KB Output is correct
103 Correct 79 ms 20352 KB Output is correct
104 Correct 71 ms 20576 KB Output is correct
105 Correct 64 ms 20192 KB Output is correct
106 Correct 75 ms 20528 KB Output is correct
107 Correct 80 ms 20304 KB Output is correct
108 Correct 78 ms 24588 KB Output is correct
109 Correct 80 ms 24592 KB Output is correct
110 Correct 48 ms 16108 KB Output is correct
111 Correct 47 ms 16200 KB Output is correct
112 Correct 64 ms 16256 KB Output is correct
113 Correct 70 ms 16392 KB Output is correct