oj.uz

Submission #205800

# Submission time Handle Problem Language Result Execution time Memory
205800 2020-03-01T02:33:33 Z PeppaPig Railway (BOI17_railway) C++14
100 / 100
 166 ms 24692 KB 
#include <bits/stdc++.h>

#define pii pair<int, int>
#define x first
#define y  second

using namespace std;

const int N = 1e5+5;

int n, m, k;
int in[N], out[N], pos[N], hv[N], sz[N];
vector<pii> g[N];

int dfs(int u, int p) {
    static int idx = 0;

    pii ret(0, -1);
    pos[in[u] = ++idx] = u, sz[u] = 1;
    for(pii v : g[u]) if(v.x != p) {
        int z = dfs(v.x, u);
        sz[u] += z, ret = max(ret, pii(z, v.x));
    }
    hv[u] = ret.y, out[u] = idx;
    return sz[u];
}

vector<int> vec[N], ans;
int pol_sz[N], cnt[N], cur_ans;

void add(int u, bool b) {
    for(int x : vec[u]) {
        if(b) {
            if(cnt[x] == 0) ++cur_ans;
            ++cnt[x];
            if(cnt[x] == pol_sz[x]) --cur_ans;
        } else {
            if(cnt[x] == pol_sz[x]) ++cur_ans;
            --cnt[x];
            if(cnt[x] == 0) --cur_ans;
        }
    }
}

void sack(int u, int p, bool keep, int id) {
    for(pii v : g[u]) if(v.x != p && v.x != hv[u])
        sack(v.x, u, 0, v.y);
    for(pii v : g[u]) if(v.x == hv[u])
        sack(v.x, u, 1, v.y);
    for(pii v : g[u]) if(v.x != p && v.x != hv[u])
        for(int i = in[v.x]; i <= out[v.x]; i++) 
            add(pos[i], 1);
    add(u, 1);
    if(cur_ans >= k) ans.emplace_back(id);
    if(!keep) for(int i = in[u]; i <= out[u]; i++)
        add(pos[i], 0);
}

int main() {
    scanf("%d %d %d", &n, &m, &k);
    for(int i = 1, a, b; i < n; i++) {
        scanf("%d %d", &a, &b);
        g[a].emplace_back(b, i);
        g[b].emplace_back(a, i);
    }
    dfs(1, 0);
    for(int i = 1, a; i <= m; i++) {
        scanf("%d", &a);
        pol_sz[i] = a;
        for(int j = 1, b; j <= a; j++) {
            scanf("%d", &b);
            vec[b].emplace_back(i);
        }
    }
    sack(1, 0, 1, -1);

    sort(ans.begin(), ans.end());
    printf("%d\n", ans.size());
    for(int x : ans) printf("%d ", x);
    printf("\n");

    return 0;
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:78:30: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
     printf("%d\n", ans.size());
                    ~~~~~~~~~~^
railway.cpp:60:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &n, &m, &k);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
railway.cpp:62:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &a, &b);
         ~~~~~^~~~~~~~~~~~~~~~~
railway.cpp:68:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a);
         ~~~~~^~~~~~~~~~
railway.cpp:71:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &b);
             ~~~~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 4984 KB Output is correct
2 Correct 14 ms 5752 KB Output is correct
3 Correct 13 ms 5752 KB Output is correct
4 Correct 8 ms 4856 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 14 ms 6264 KB Output is correct
7 Correct 13 ms 5880 KB Output is correct
8 Correct 12 ms 5624 KB Output is correct
9 Correct 15 ms 5752 KB Output is correct
10 Correct 8 ms 4984 KB Output is correct
11 Correct 9 ms 5160 KB Output is correct
12 Correct 8 ms 4984 KB Output is correct
13 Correct 8 ms 4984 KB Output is correct
14 Correct 8 ms 4984 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 4984 KB Output is correct
2 Correct 14 ms 5752 KB Output is correct
3 Correct 13 ms 5752 KB Output is correct
4 Correct 8 ms 4856 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 14 ms 6264 KB Output is correct
7 Correct 13 ms 5880 KB Output is correct
8 Correct 12 ms 5624 KB Output is correct
9 Correct 15 ms 5752 KB Output is correct
10 Correct 8 ms 4984 KB Output is correct
11 Correct 9 ms 5160 KB Output is correct
12 Correct 8 ms 4984 KB Output is correct
13 Correct 8 ms 4984 KB Output is correct
14 Correct 8 ms 4984 KB Output is correct
15 Correct 32 ms 6648 KB Output is correct
16 Correct 32 ms 6776 KB Output is correct
17 Correct 32 ms 6776 KB Output is correct
18 Correct 14 ms 6264 KB Output is correct
19 Correct 14 ms 5880 KB Output is correct
20 Correct 33 ms 7160 KB Output is correct
21 Correct 32 ms 7032 KB Output is correct
22 Correct 8 ms 5112 KB Output is correct
23 Correct 13 ms 5752 KB Output is correct
24 Correct 14 ms 5752 KB Output is correct
25 Correct 8 ms 4984 KB Output is correct
26 Correct 7 ms 4984 KB Output is correct
27 Correct 14 ms 6264 KB Output is correct
28 Correct 13 ms 5880 KB Output is correct
29 Correct 12 ms 5752 KB Output is correct
30 Correct 13 ms 5752 KB Output is correct
31 Correct 8 ms 5112 KB Output is correct
32 Correct 9 ms 4984 KB Output is correct
33 Correct 8 ms 4988 KB Output is correct
34 Correct 8 ms 4988 KB Output is correct
35 Correct 8 ms 4984 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 24564 KB Output is correct
2 Correct 8 ms 5112 KB Output is correct
3 Correct 106 ms 24312 KB Output is correct
4 Correct 102 ms 23672 KB Output is correct
5 Correct 100 ms 24308 KB Output is correct
6 Correct 115 ms 24560 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 18040 KB Output is correct
2 Correct 106 ms 13912 KB Output is correct
3 Correct 124 ms 13560 KB Output is correct
4 Correct 125 ms 13500 KB Output is correct
5 Correct 118 ms 13560 KB Output is correct
6 Correct 89 ms 18296 KB Output is correct
7 Correct 87 ms 18168 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 18040 KB Output is correct
2 Correct 106 ms 13912 KB Output is correct
3 Correct 124 ms 13560 KB Output is correct
4 Correct 125 ms 13500 KB Output is correct
5 Correct 118 ms 13560 KB Output is correct
6 Correct 89 ms 18296 KB Output is correct
7 Correct 87 ms 18168 KB Output is correct
8 Correct 93 ms 18936 KB Output is correct
9 Correct 98 ms 19064 KB Output is correct
10 Correct 108 ms 24180 KB Output is correct
11 Correct 98 ms 24180 KB Output is correct
12 Correct 86 ms 14200 KB Output is correct
13 Correct 87 ms 14200 KB Output is correct
14 Correct 121 ms 13176 KB Output is correct
15 Correct 115 ms 13176 KB Output is correct
16 Correct 114 ms 13688 KB Output is correct
17 Correct 113 ms 13560 KB Output is correct
18 Correct 113 ms 13708 KB Output is correct
19 Correct 105 ms 13944 KB Output is correct
20 Correct 93 ms 18552 KB Output is correct
21 Correct 90 ms 18556 KB Output is correct
22 Correct 98 ms 18424 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 4984 KB Output is correct
2 Correct 14 ms 5752 KB Output is correct
3 Correct 13 ms 5752 KB Output is correct
4 Correct 8 ms 4856 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 14 ms 6264 KB Output is correct
7 Correct 13 ms 5880 KB Output is correct
8 Correct 12 ms 5624 KB Output is correct
9 Correct 15 ms 5752 KB Output is correct
10 Correct 8 ms 4984 KB Output is correct
11 Correct 9 ms 5160 KB Output is correct
12 Correct 8 ms 4984 KB Output is correct
13 Correct 8 ms 4984 KB Output is correct
14 Correct 8 ms 4984 KB Output is correct
15 Correct 32 ms 6648 KB Output is correct
16 Correct 32 ms 6776 KB Output is correct
17 Correct 32 ms 6776 KB Output is correct
18 Correct 14 ms 6264 KB Output is correct
19 Correct 14 ms 5880 KB Output is correct
20 Correct 33 ms 7160 KB Output is correct
21 Correct 32 ms 7032 KB Output is correct
22 Correct 8 ms 5112 KB Output is correct
23 Correct 13 ms 5752 KB Output is correct
24 Correct 14 ms 5752 KB Output is correct
25 Correct 8 ms 4984 KB Output is correct
26 Correct 7 ms 4984 KB Output is correct
27 Correct 14 ms 6264 KB Output is correct
28 Correct 13 ms 5880 KB Output is correct
29 Correct 12 ms 5752 KB Output is correct
30 Correct 13 ms 5752 KB Output is correct
31 Correct 8 ms 5112 KB Output is correct
32 Correct 9 ms 4984 KB Output is correct
33 Correct 8 ms 4988 KB Output is correct
34 Correct 8 ms 4988 KB Output is correct
35 Correct 8 ms 4984 KB Output is correct
36 Correct 113 ms 24564 KB Output is correct
37 Correct 8 ms 5112 KB Output is correct
38 Correct 106 ms 24312 KB Output is correct
39 Correct 102 ms 23672 KB Output is correct
40 Correct 100 ms 24308 KB Output is correct
41 Correct 115 ms 24560 KB Output is correct
42 Correct 99 ms 18040 KB Output is correct
43 Correct 106 ms 13912 KB Output is correct
44 Correct 124 ms 13560 KB Output is correct
45 Correct 125 ms 13500 KB Output is correct
46 Correct 118 ms 13560 KB Output is correct
47 Correct 89 ms 18296 KB Output is correct
48 Correct 87 ms 18168 KB Output is correct
49 Correct 93 ms 18936 KB Output is correct
50 Correct 98 ms 19064 KB Output is correct
51 Correct 108 ms 24180 KB Output is correct
52 Correct 98 ms 24180 KB Output is correct
53 Correct 86 ms 14200 KB Output is correct
54 Correct 87 ms 14200 KB Output is correct
55 Correct 121 ms 13176 KB Output is correct
56 Correct 115 ms 13176 KB Output is correct
57 Correct 114 ms 13688 KB Output is correct
58 Correct 113 ms 13560 KB Output is correct
59 Correct 113 ms 13708 KB Output is correct
60 Correct 105 ms 13944 KB Output is correct
61 Correct 93 ms 18552 KB Output is correct
62 Correct 90 ms 18556 KB Output is correct
63 Correct 98 ms 18424 KB Output is correct
64 Correct 106 ms 19192 KB Output is correct
65 Correct 166 ms 14840 KB Output is correct
66 Correct 155 ms 14588 KB Output is correct
67 Correct 127 ms 14072 KB Output is correct
68 Correct 85 ms 13608 KB Output is correct
69 Correct 83 ms 13560 KB Output is correct
70 Correct 114 ms 19336 KB Output is correct
71 Correct 100 ms 18808 KB Output is correct
72 Correct 8 ms 4984 KB Output is correct
73 Correct 13 ms 5752 KB Output is correct
74 Correct 13 ms 5752 KB Output is correct
75 Correct 8 ms 4988 KB Output is correct
76 Correct 8 ms 4984 KB Output is correct
77 Correct 13 ms 6264 KB Output is correct
78 Correct 13 ms 5880 KB Output is correct
79 Correct 12 ms 5724 KB Output is correct
80 Correct 12 ms 5752 KB Output is correct
81 Correct 7 ms 4984 KB Output is correct
82 Correct 8 ms 4984 KB Output is correct
83 Correct 8 ms 4984 KB Output is correct
84 Correct 7 ms 4984 KB Output is correct
85 Correct 7 ms 5112 KB Output is correct
86 Correct 32 ms 6776 KB Output is correct
87 Correct 31 ms 6776 KB Output is correct
88 Correct 33 ms 6776 KB Output is correct
89 Correct 15 ms 6264 KB Output is correct
90 Correct 13 ms 5880 KB Output is correct
91 Correct 34 ms 7160 KB Output is correct
92 Correct 32 ms 7032 KB Output is correct
93 Correct 9 ms 5112 KB Output is correct
94 Correct 103 ms 24692 KB Output is correct
95 Correct 107 ms 24308 KB Output is correct
96 Correct 94 ms 23672 KB Output is correct
97 Correct 101 ms 24216 KB Output is correct
98 Correct 105 ms 24560 KB Output is correct
99 Correct 128 ms 13688 KB Output is correct
100 Correct 111 ms 13560 KB Output is correct
101 Correct 112 ms 13560 KB Output is correct
102 Correct 101 ms 13952 KB Output is correct
103 Correct 85 ms 18152 KB Output is correct
104 Correct 89 ms 18556 KB Output is correct
105 Correct 90 ms 18168 KB Output is correct
106 Correct 96 ms 19192 KB Output is correct
107 Correct 96 ms 18948 KB Output is correct
108 Correct 104 ms 24180 KB Output is correct
109 Correct 101 ms 24180 KB Output is correct
110 Correct 89 ms 14200 KB Output is correct
111 Correct 87 ms 14236 KB Output is correct
112 Correct 110 ms 13176 KB Output is correct
113 Correct 109 ms 13176 KB Output is correct