oj.uz

Submission #519534

# Submission time Handle Problem Language Result Execution time Memory
519534 2022-01-26T14:56:53 Z Yazan_Alattar Railway (BOI17_railway) C++14
100 / 100
 120 ms 28860 KB 
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <utility>
#include <cmath>
#include <numeric>
#include <assert.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 200007;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};

vector <int> ans;
vector < pair <int,int> > adj[M];
int n, m, k, anc[M][20], dep[M], in[M], out[M], pref[M], timer, edge[M], c[M];

bool cmp(int a, int b)  { return in[a] < in[b]; }

void calc(int node, int p)
{
    in[node] = ++timer;
    for(auto i : adj[node]) if(i.F != p){
        edge[i.F] = i.S;
        dep[i.F] = dep[node] + 1;
        anc[i.F][0] = node;
        calc(i.F, node);
    }
    out[node] = ++timer;
    return;
}

int lca(int x, int y)
{
    if(x == y) return x;
    if(dep[x] > dep[y]) swap(x, y);
    for(int i = 19; i >= 0; --i) if(anc[y][i] && dep[anc[y][i]] >= dep[x]) y = anc[y][i];
    if(x == y) return x;
    for(int i = 19; i >= 0; --i) if(anc[x][i] && anc[x][i] != anc[y][i]){
        x = anc[x][i];
        y = anc[y][i];
    }
    return anc[x][0];
}

void get(int node, int p)
{
    for(auto i : adj[node]) if(i.F != p){
        get(i.F, node);
        pref[node] += pref[i.F];
        if(pref[i.F] >= 2 * k) ans.pb(i.S);
    }
    return;
}

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 a, b;
        cin >> a >> b;
        adj[a].pb({b, i});
        adj[b].pb({a, i});
    }
    calc(1, 0);
    for(int j = 1; j < 20; ++j) for(int i = 1; i <= n; ++i) anc[i][j] = anc[anc[i][j - 1]][j - 1];
    for(int i = 1; i <= m; ++i){
        int s, res = 0;
        cin >> s;
        for(int j = 1; j <= s; ++j) cin >> c[j];
        sort(c + 1, c + s + 1, cmp);
        c[s + 1] = c[1];
        for(int i = 1; i <= s; ++i){
            ++pref[c[i]];
            ++pref[c[i + 1]];
            pref[lca(c[i], c[i + 1])] -= 2;
        }
    }
    get(1, 0);
    sort(all(ans));
    cout << ans.size() << endl;
    for(auto i : ans) cout << i << " ";
    cout << endl;
    return 0;
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:82:16: warning: unused variable 'res' [-Wunused-variable]
   82 |         int s, res = 0;
      |                ^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 8 ms 6496 KB Output is correct
3 Correct 7 ms 6476 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 4 ms 5024 KB Output is correct
6 Correct 8 ms 6936 KB Output is correct
7 Correct 7 ms 6572 KB Output is correct
8 Correct 6 ms 6440 KB Output is correct
9 Correct 6 ms 6440 KB Output is correct
10 Correct 4 ms 4940 KB Output is correct
11 Correct 3 ms 5020 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 5016 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 8 ms 6496 KB Output is correct
3 Correct 7 ms 6476 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 4 ms 5024 KB Output is correct
6 Correct 8 ms 6936 KB Output is correct
7 Correct 7 ms 6572 KB Output is correct
8 Correct 6 ms 6440 KB Output is correct
9 Correct 6 ms 6440 KB Output is correct
10 Correct 4 ms 4940 KB Output is correct
11 Correct 3 ms 5020 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 5016 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 23 ms 6816 KB Output is correct
16 Correct 22 ms 6848 KB Output is correct
17 Correct 21 ms 6836 KB Output is correct
18 Correct 7 ms 6820 KB Output is correct
19 Correct 8 ms 6476 KB Output is correct
20 Correct 22 ms 6940 KB Output is correct
21 Correct 22 ms 6988 KB Output is correct
22 Correct 3 ms 5024 KB Output is correct
23 Correct 7 ms 6556 KB Output is correct
24 Correct 7 ms 6480 KB Output is correct
25 Correct 3 ms 4940 KB Output is correct
26 Correct 3 ms 4940 KB Output is correct
27 Correct 10 ms 6952 KB Output is correct
28 Correct 10 ms 6564 KB Output is correct
29 Correct 7 ms 6444 KB Output is correct
30 Correct 8 ms 6440 KB Output is correct
31 Correct 3 ms 4940 KB Output is correct
32 Correct 3 ms 4940 KB Output is correct
33 Correct 3 ms 4940 KB Output is correct
34 Correct 3 ms 4940 KB Output is correct
35 Correct 3 ms 4940 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 28456 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 102 ms 28084 KB Output is correct
4 Correct 85 ms 27536 KB Output is correct
5 Correct 105 ms 28476 KB Output is correct
6 Correct 88 ms 28860 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 24152 KB Output is correct
2 Correct 84 ms 20656 KB Output is correct
3 Correct 86 ms 20344 KB Output is correct
4 Correct 86 ms 20396 KB Output is correct
5 Correct 85 ms 20324 KB Output is correct
6 Correct 87 ms 24244 KB Output is correct
7 Correct 74 ms 24176 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 24152 KB Output is correct
2 Correct 84 ms 20656 KB Output is correct
3 Correct 86 ms 20344 KB Output is correct
4 Correct 86 ms 20396 KB Output is correct
5 Correct 85 ms 20324 KB Output is correct
6 Correct 87 ms 24244 KB Output is correct
7 Correct 74 ms 24176 KB Output is correct
8 Correct 81 ms 24288 KB Output is correct
9 Correct 95 ms 24336 KB Output is correct
10 Correct 93 ms 28604 KB Output is correct
11 Correct 83 ms 28496 KB Output is correct
12 Correct 62 ms 20120 KB Output is correct
13 Correct 59 ms 20044 KB Output is correct
14 Correct 90 ms 20268 KB Output is correct
15 Correct 84 ms 20204 KB Output is correct
16 Correct 83 ms 20336 KB Output is correct
17 Correct 76 ms 20260 KB Output is correct
18 Correct 85 ms 20332 KB Output is correct
19 Correct 78 ms 20636 KB Output is correct
20 Correct 70 ms 24532 KB Output is correct
21 Correct 70 ms 24548 KB Output is correct
22 Correct 69 ms 24492 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 8 ms 6496 KB Output is correct
3 Correct 7 ms 6476 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 4 ms 5024 KB Output is correct
6 Correct 8 ms 6936 KB Output is correct
7 Correct 7 ms 6572 KB Output is correct
8 Correct 6 ms 6440 KB Output is correct
9 Correct 6 ms 6440 KB Output is correct
10 Correct 4 ms 4940 KB Output is correct
11 Correct 3 ms 5020 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 5016 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 23 ms 6816 KB Output is correct
16 Correct 22 ms 6848 KB Output is correct
17 Correct 21 ms 6836 KB Output is correct
18 Correct 7 ms 6820 KB Output is correct
19 Correct 8 ms 6476 KB Output is correct
20 Correct 22 ms 6940 KB Output is correct
21 Correct 22 ms 6988 KB Output is correct
22 Correct 3 ms 5024 KB Output is correct
23 Correct 7 ms 6556 KB Output is correct
24 Correct 7 ms 6480 KB Output is correct
25 Correct 3 ms 4940 KB Output is correct
26 Correct 3 ms 4940 KB Output is correct
27 Correct 10 ms 6952 KB Output is correct
28 Correct 10 ms 6564 KB Output is correct
29 Correct 7 ms 6444 KB Output is correct
30 Correct 8 ms 6440 KB Output is correct
31 Correct 3 ms 4940 KB Output is correct
32 Correct 3 ms 4940 KB Output is correct
33 Correct 3 ms 4940 KB Output is correct
34 Correct 3 ms 4940 KB Output is correct
35 Correct 3 ms 4940 KB Output is correct
36 Correct 93 ms 28456 KB Output is correct
37 Correct 3 ms 4940 KB Output is correct
38 Correct 102 ms 28084 KB Output is correct
39 Correct 85 ms 27536 KB Output is correct
40 Correct 105 ms 28476 KB Output is correct
41 Correct 88 ms 28860 KB Output is correct
42 Correct 66 ms 24152 KB Output is correct
43 Correct 84 ms 20656 KB Output is correct
44 Correct 86 ms 20344 KB Output is correct
45 Correct 86 ms 20396 KB Output is correct
46 Correct 85 ms 20324 KB Output is correct
47 Correct 87 ms 24244 KB Output is correct
48 Correct 74 ms 24176 KB Output is correct
49 Correct 81 ms 24288 KB Output is correct
50 Correct 95 ms 24336 KB Output is correct
51 Correct 93 ms 28604 KB Output is correct
52 Correct 83 ms 28496 KB Output is correct
53 Correct 62 ms 20120 KB Output is correct
54 Correct 59 ms 20044 KB Output is correct
55 Correct 90 ms 20268 KB Output is correct
56 Correct 84 ms 20204 KB Output is correct
57 Correct 83 ms 20336 KB Output is correct
58 Correct 76 ms 20260 KB Output is correct
59 Correct 85 ms 20332 KB Output is correct
60 Correct 78 ms 20636 KB Output is correct
61 Correct 70 ms 24532 KB Output is correct
62 Correct 70 ms 24548 KB Output is correct
63 Correct 69 ms 24492 KB Output is correct
64 Correct 80 ms 24420 KB Output is correct
65 Correct 84 ms 20328 KB Output is correct
66 Correct 120 ms 20216 KB Output is correct
67 Correct 107 ms 20284 KB Output is correct
68 Correct 59 ms 19936 KB Output is correct
69 Correct 67 ms 19968 KB Output is correct
70 Correct 82 ms 24772 KB Output is correct
71 Correct 82 ms 24020 KB Output is correct
72 Correct 3 ms 4940 KB Output is correct
73 Correct 7 ms 6452 KB Output is correct
74 Correct 7 ms 6516 KB Output is correct
75 Correct 3 ms 5020 KB Output is correct
76 Correct 3 ms 4940 KB Output is correct
77 Correct 7 ms 6860 KB Output is correct
78 Correct 7 ms 6604 KB Output is correct
79 Correct 6 ms 6440 KB Output is correct
80 Correct 6 ms 6476 KB Output is correct
81 Correct 4 ms 4940 KB Output is correct
82 Correct 3 ms 4940 KB Output is correct
83 Correct 4 ms 4940 KB Output is correct
84 Correct 3 ms 4940 KB Output is correct
85 Correct 3 ms 5020 KB Output is correct
86 Correct 22 ms 6860 KB Output is correct
87 Correct 25 ms 6912 KB Output is correct
88 Correct 21 ms 6868 KB Output is correct
89 Correct 7 ms 6940 KB Output is correct
90 Correct 7 ms 6572 KB Output is correct
91 Correct 22 ms 7116 KB Output is correct
92 Correct 21 ms 6920 KB Output is correct
93 Correct 3 ms 4940 KB Output is correct
94 Correct 109 ms 28444 KB Output is correct
95 Correct 100 ms 28080 KB Output is correct
96 Correct 93 ms 27696 KB Output is correct
97 Correct 103 ms 28408 KB Output is correct
98 Correct 105 ms 28788 KB Output is correct
99 Correct 100 ms 20264 KB Output is correct
100 Correct 91 ms 20288 KB Output is correct
101 Correct 73 ms 20364 KB Output is correct
102 Correct 94 ms 20632 KB Output is correct
103 Correct 79 ms 24260 KB Output is correct
104 Correct 68 ms 24516 KB Output is correct
105 Correct 81 ms 24132 KB Output is correct
106 Correct 92 ms 24412 KB Output is correct
107 Correct 83 ms 24260 KB Output is correct
108 Correct 94 ms 28516 KB Output is correct
109 Correct 84 ms 28524 KB Output is correct
110 Correct 59 ms 20016 KB Output is correct
111 Correct 66 ms 20136 KB Output is correct
112 Correct 80 ms 20204 KB Output is correct
113 Correct 102 ms 20272 KB Output is correct