oj.uz

Submission #529930

# Submission time Handle Problem Language Result Execution time Memory
529930 2022-02-24T05:21:51 Z 79brue Railway (BOI17_railway) C++14
100 / 100
 158 ms 27184 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int n, m, k;
vector<pair<int, int> > link[100002];
int parId[100002];
int in[100002], inCnt;
int DP[100002], par[100002];
int LCADB[100002][22], depth[100002];
vector<int> ans;

void dfs(int x, int p = -1){
    in[x] = ++inCnt;
    for(auto y: link[x]){
        if(y.first == p) continue;
        par[y.first] = x;
        LCADB[y.first][0] = x;
        depth[y.first] = depth[x] + 1;
        parId[y.first] = y.second;
        dfs(y.first, x);
    }
}

int getLCA(int x, int y){
    if(depth[y] > depth[x]) swap(x, y);
    for(int i=0; i<20; i++) if((depth[x] - depth[y]) & (1<<i)) x = LCADB[x][i];
    if(x==y) return x;
    for(int d=19; d>=0; d--) if(LCADB[x][d] != LCADB[y][d]) x = LCADB[x][d], y = LCADB[y][d];
    return par[x];
}

void dfs2(int x, int par = -1){
    for(auto y: link[x]){
        if(y.first == par) continue;
        dfs2(y.first, x);
        DP[x] += DP[y.first];
        if(DP[y.first] >= 2*k) ans.push_back(parId[y.first]);
    }
}

int main(){
    scanf("%d %d %d", &n, &m, &k);
    for(int i=1; i<n; i++){
        int x, y;
        scanf("%d %d", &x, &y);
        link[x].push_back(make_pair(y, i));
        link[y].push_back(make_pair(x, i));
    }
    dfs(1);
    for(int d=1; d<20; d++) for(int i=1; i<=n; i++) LCADB[i][d] = LCADB[LCADB[i][d-1]][d-1];

    while(m--){
        vector<int> v;
        int s;
        scanf("%d", &s);
        for(int i=0; i<s; i++){
            int x;
            scanf("%d", &x);
            v.push_back(x);
        }
        if(s==1) continue;

        sort(v.begin(), v.end(), [&](auto &x, auto &y){
            return in[x] < in[y];
        });
        v.push_back(v.front());

        for(int i=0; i<s; i++){
            DP[v[i]]++;
            DP[v[i+1]]++;
            DP[getLCA(v[i], v[i+1])]-=2;
        }
    }

    dfs2(1);
    sort(ans.begin(), ans.end());
    printf("%d\n", (int)ans.size());
    for(auto p: ans) printf("%d ", p);
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:45:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     scanf("%d %d %d", &n, &m, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
railway.cpp:48:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |         scanf("%d %d", &x, &y);
      |         ~~~~~^~~~~~~~~~~~~~~~~
railway.cpp:58:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |         scanf("%d", &s);
      |         ~~~~~^~~~~~~~~~
railway.cpp:61:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |             scanf("%d", &x);
      |             ~~~~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 7 ms 4192 KB Output is correct
3 Correct 6 ms 4192 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 8 ms 4568 KB Output is correct
7 Correct 9 ms 4204 KB Output is correct
8 Correct 6 ms 4180 KB Output is correct
9 Correct 6 ms 4204 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2652 KB Output is correct
14 Correct 2 ms 2688 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 7 ms 4192 KB Output is correct
3 Correct 6 ms 4192 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 8 ms 4568 KB Output is correct
7 Correct 9 ms 4204 KB Output is correct
8 Correct 6 ms 4180 KB Output is correct
9 Correct 6 ms 4204 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2652 KB Output is correct
14 Correct 2 ms 2688 KB Output is correct
15 Correct 26 ms 4544 KB Output is correct
16 Correct 25 ms 4544 KB Output is correct
17 Correct 25 ms 4556 KB Output is correct
18 Correct 8 ms 4592 KB Output is correct
19 Correct 6 ms 4192 KB Output is correct
20 Correct 34 ms 4744 KB Output is correct
21 Correct 37 ms 4668 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 9 ms 4092 KB Output is correct
24 Correct 9 ms 4092 KB Output is correct
25 Correct 1 ms 2636 KB Output is correct
26 Correct 2 ms 2656 KB Output is correct
27 Correct 7 ms 4660 KB Output is correct
28 Correct 9 ms 4188 KB Output is correct
29 Correct 10 ms 4192 KB Output is correct
30 Correct 6 ms 4172 KB Output is correct
31 Correct 2 ms 2636 KB Output is correct
32 Correct 2 ms 2672 KB Output is correct
33 Correct 2 ms 2636 KB Output is correct
34 Correct 2 ms 2636 KB Output is correct
35 Correct 3 ms 2636 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 24932 KB Output is correct
2 Correct 2 ms 2648 KB Output is correct
3 Correct 109 ms 26536 KB Output is correct
4 Correct 113 ms 25960 KB Output is correct
5 Correct 122 ms 26752 KB Output is correct
6 Correct 107 ms 27176 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 20856 KB Output is correct
2 Correct 109 ms 19020 KB Output is correct
3 Correct 115 ms 18608 KB Output is correct
4 Correct 128 ms 18720 KB Output is correct
5 Correct 104 ms 18708 KB Output is correct
6 Correct 124 ms 22644 KB Output is correct
7 Correct 100 ms 22540 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 20856 KB Output is correct
2 Correct 109 ms 19020 KB Output is correct
3 Correct 115 ms 18608 KB Output is correct
4 Correct 128 ms 18720 KB Output is correct
5 Correct 104 ms 18708 KB Output is correct
6 Correct 124 ms 22644 KB Output is correct
7 Correct 100 ms 22540 KB Output is correct
8 Correct 122 ms 22608 KB Output is correct
9 Correct 109 ms 22604 KB Output is correct
10 Correct 108 ms 26952 KB Output is correct
11 Correct 116 ms 26812 KB Output is correct
12 Correct 82 ms 18412 KB Output is correct
13 Correct 88 ms 18416 KB Output is correct
14 Correct 108 ms 18632 KB Output is correct
15 Correct 104 ms 18552 KB Output is correct
16 Correct 141 ms 18612 KB Output is correct
17 Correct 116 ms 18712 KB Output is correct
18 Correct 116 ms 18708 KB Output is correct
19 Correct 111 ms 19040 KB Output is correct
20 Correct 108 ms 22820 KB Output is correct
21 Correct 107 ms 22996 KB Output is correct
22 Correct 94 ms 22824 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 7 ms 4192 KB Output is correct
3 Correct 6 ms 4192 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 8 ms 4568 KB Output is correct
7 Correct 9 ms 4204 KB Output is correct
8 Correct 6 ms 4180 KB Output is correct
9 Correct 6 ms 4204 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2652 KB Output is correct
14 Correct 2 ms 2688 KB Output is correct
15 Correct 26 ms 4544 KB Output is correct
16 Correct 25 ms 4544 KB Output is correct
17 Correct 25 ms 4556 KB Output is correct
18 Correct 8 ms 4592 KB Output is correct
19 Correct 6 ms 4192 KB Output is correct
20 Correct 34 ms 4744 KB Output is correct
21 Correct 37 ms 4668 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 9 ms 4092 KB Output is correct
24 Correct 9 ms 4092 KB Output is correct
25 Correct 1 ms 2636 KB Output is correct
26 Correct 2 ms 2656 KB Output is correct
27 Correct 7 ms 4660 KB Output is correct
28 Correct 9 ms 4188 KB Output is correct
29 Correct 10 ms 4192 KB Output is correct
30 Correct 6 ms 4172 KB Output is correct
31 Correct 2 ms 2636 KB Output is correct
32 Correct 2 ms 2672 KB Output is correct
33 Correct 2 ms 2636 KB Output is correct
34 Correct 2 ms 2636 KB Output is correct
35 Correct 3 ms 2636 KB Output is correct
36 Correct 158 ms 24932 KB Output is correct
37 Correct 2 ms 2648 KB Output is correct
38 Correct 109 ms 26536 KB Output is correct
39 Correct 113 ms 25960 KB Output is correct
40 Correct 122 ms 26752 KB Output is correct
41 Correct 107 ms 27176 KB Output is correct
42 Correct 104 ms 20856 KB Output is correct
43 Correct 109 ms 19020 KB Output is correct
44 Correct 115 ms 18608 KB Output is correct
45 Correct 128 ms 18720 KB Output is correct
46 Correct 104 ms 18708 KB Output is correct
47 Correct 124 ms 22644 KB Output is correct
48 Correct 100 ms 22540 KB Output is correct
49 Correct 122 ms 22608 KB Output is correct
50 Correct 109 ms 22604 KB Output is correct
51 Correct 108 ms 26952 KB Output is correct
52 Correct 116 ms 26812 KB Output is correct
53 Correct 82 ms 18412 KB Output is correct
54 Correct 88 ms 18416 KB Output is correct
55 Correct 108 ms 18632 KB Output is correct
56 Correct 104 ms 18552 KB Output is correct
57 Correct 141 ms 18612 KB Output is correct
58 Correct 116 ms 18712 KB Output is correct
59 Correct 116 ms 18708 KB Output is correct
60 Correct 111 ms 19040 KB Output is correct
61 Correct 108 ms 22820 KB Output is correct
62 Correct 107 ms 22996 KB Output is correct
63 Correct 94 ms 22824 KB Output is correct
64 Correct 102 ms 22744 KB Output is correct
65 Correct 132 ms 18628 KB Output is correct
66 Correct 120 ms 18648 KB Output is correct
67 Correct 104 ms 18756 KB Output is correct
68 Correct 72 ms 18424 KB Output is correct
69 Correct 70 ms 18344 KB Output is correct
70 Correct 106 ms 23116 KB Output is correct
71 Correct 102 ms 22488 KB Output is correct
72 Correct 2 ms 2636 KB Output is correct
73 Correct 8 ms 4200 KB Output is correct
74 Correct 7 ms 4256 KB Output is correct
75 Correct 2 ms 2636 KB Output is correct
76 Correct 2 ms 2636 KB Output is correct
77 Correct 8 ms 4584 KB Output is correct
78 Correct 6 ms 4172 KB Output is correct
79 Correct 6 ms 4172 KB Output is correct
80 Correct 8 ms 4172 KB Output is correct
81 Correct 3 ms 2636 KB Output is correct
82 Correct 2 ms 2636 KB Output is correct
83 Correct 2 ms 2652 KB Output is correct
84 Correct 2 ms 2636 KB Output is correct
85 Correct 3 ms 2636 KB Output is correct
86 Correct 26 ms 4556 KB Output is correct
87 Correct 27 ms 4552 KB Output is correct
88 Correct 38 ms 4600 KB Output is correct
89 Correct 7 ms 4556 KB Output is correct
90 Correct 11 ms 4192 KB Output is correct
91 Correct 30 ms 4668 KB Output is correct
92 Correct 26 ms 4608 KB Output is correct
93 Correct 2 ms 2644 KB Output is correct
94 Correct 132 ms 26824 KB Output is correct
95 Correct 118 ms 26476 KB Output is correct
96 Correct 125 ms 25892 KB Output is correct
97 Correct 144 ms 26744 KB Output is correct
98 Correct 110 ms 27184 KB Output is correct
99 Correct 121 ms 18724 KB Output is correct
100 Correct 119 ms 18692 KB Output is correct
101 Correct 129 ms 18640 KB Output is correct
102 Correct 99 ms 19116 KB Output is correct
103 Correct 90 ms 22540 KB Output is correct
104 Correct 100 ms 22920 KB Output is correct
105 Correct 98 ms 22548 KB Output is correct
106 Correct 99 ms 22824 KB Output is correct
107 Correct 111 ms 22636 KB Output is correct
108 Correct 127 ms 26936 KB Output is correct
109 Correct 101 ms 26884 KB Output is correct
110 Correct 80 ms 18416 KB Output is correct
111 Correct 85 ms 18508 KB Output is correct
112 Correct 110 ms 18636 KB Output is correct
113 Correct 100 ms 18628 KB Output is correct