oj.uz

Submission #130425

# Submission time Handle Problem Language Result Execution time Memory
130425 2019-07-15T07:49:17 Z win11905 Railway (BOI17_railway) C++11
100 / 100
 172 ms 21872 KB 
#include <bits/stdc++.h>
using namespace std;

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

const int N = 1e5+5;

int n, m, k;
int in[N], out[N], sz[N], pos[N], idx[N];
vector<pii> g[N];
vector<int> node[N];
int szn[N], cnt[N], ans;
int rans[N];

void dfs(int u, int p) {
    static int ptr = 0;
    in[u] = ++ptr, pos[ptr] = u, sz[u] = 1;
    if(p) for(auto it = g[u].begin(); it != g[u].end(); ++it) if(it->x == p) { g[u].erase(it); break; }
    for(auto &v : g[u]) {
        idx[v.x] = v.y;
        dfs(v.x, u);
        sz[u] += sz[v.x];
        if(sz[v.x] > sz[g[u][0].x]) swap(v, g[u][0]);
    } 
    out[u] = ptr;
}

void add(int x) {
    cnt[x]++;
    if(cnt[x] == 1) ans++;
    if(cnt[x] == szn[x]) ans--;
}

void del(int x) {
    cnt[x]--;
    if(cnt[x] == 0) ans--;
    if(cnt[x] == szn[x]-1) ans++;
}

void sack(int u, bool keep) {
    for(auto v : g[u]) if(v != g[u][0]) sack(v.x, false);
    if(g[u].size()) sack(g[u][0].x, true);
    for(int v : node[u]) add(v);
    for(auto v : g[u]) if(v != g[u][0])
        for(int i = in[v.x]; i <= out[v.x]; ++i) for(auto x : node[pos[i]]) add(x);
    rans[idx[u]] = ans;
    if(!keep) for(int i = in[u]; i <= out[u]; ++i) for(auto x : node[pos[i]]) del(x);
}

int main() {
    scanf("%d %d %d", &n, &m, &k);
    for(int i = 1, u, v; i < n; ++i) {
        scanf("%d %d", &u, &v);
        g[u].emplace_back(v, i), g[v].emplace_back(u, i);
    } 
    dfs(1, 0);
    for(int i = 0; i < m; ++i) {
        int q; scanf("%d", &q);
        szn[i] = q;
        while(q--) {
            int v; scanf("%d", &v);
            node[v].emplace_back(i);
        }
    }
    sack(1, false);
    vector<int> A;
    for(int i = 1; i < n; ++i) if(rans[i] >= k) A.emplace_back(i);
    printf("%d\n", A.size());
    for(int v : A) printf("%d ", v);
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:70:28: 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", A.size());
                    ~~~~~~~~^
railway.cpp:53: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:55:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &u, &v);
         ~~~~~^~~~~~~~~~~~~~~~~
railway.cpp:60:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int q; scanf("%d", &q);
                ~~~~~^~~~~~~~~~
railway.cpp:63:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             int v; scanf("%d", &v);
                    ~~~~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 12 ms 5720 KB Output is correct
3 Correct 12 ms 5752 KB Output is correct
4 Correct 6 ms 4984 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 13 ms 6268 KB Output is correct
7 Correct 12 ms 6008 KB Output is correct
8 Correct 11 ms 5880 KB Output is correct
9 Correct 11 ms 5880 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 5084 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 12 ms 5720 KB Output is correct
3 Correct 12 ms 5752 KB Output is correct
4 Correct 6 ms 4984 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 13 ms 6268 KB Output is correct
7 Correct 12 ms 6008 KB Output is correct
8 Correct 11 ms 5880 KB Output is correct
9 Correct 11 ms 5880 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 5084 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 33 ms 6776 KB Output is correct
16 Correct 32 ms 6776 KB Output is correct
17 Correct 38 ms 6904 KB Output is correct
18 Correct 15 ms 6136 KB Output is correct
19 Correct 15 ms 5880 KB Output is correct
20 Correct 33 ms 7160 KB Output is correct
21 Correct 36 ms 7160 KB Output is correct
22 Correct 6 ms 5016 KB Output is correct
23 Correct 12 ms 5752 KB Output is correct
24 Correct 12 ms 5752 KB Output is correct
25 Correct 6 ms 4984 KB Output is correct
26 Correct 8 ms 5112 KB Output is correct
27 Correct 13 ms 6264 KB Output is correct
28 Correct 14 ms 5880 KB Output is correct
29 Correct 11 ms 5880 KB Output is correct
30 Correct 12 ms 5880 KB Output is correct
31 Correct 6 ms 4984 KB Output is correct
32 Correct 8 ms 5116 KB Output is correct
33 Correct 6 ms 5112 KB Output is correct
34 Correct 6 ms 4984 KB Output is correct
35 Correct 6 ms 5112 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 21852 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 108 ms 21468 KB Output is correct
4 Correct 104 ms 20904 KB Output is correct
5 Correct 103 ms 21588 KB Output is correct
6 Correct 102 ms 21872 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 16888 KB Output is correct
2 Correct 100 ms 14200 KB Output is correct
3 Correct 115 ms 13944 KB Output is correct
4 Correct 119 ms 13928 KB Output is correct
5 Correct 151 ms 14148 KB Output is correct
6 Correct 95 ms 17144 KB Output is correct
7 Correct 95 ms 17020 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 16888 KB Output is correct
2 Correct 100 ms 14200 KB Output is correct
3 Correct 115 ms 13944 KB Output is correct
4 Correct 119 ms 13928 KB Output is correct
5 Correct 151 ms 14148 KB Output is correct
6 Correct 95 ms 17144 KB Output is correct
7 Correct 95 ms 17020 KB Output is correct
8 Correct 123 ms 17852 KB Output is correct
9 Correct 109 ms 17884 KB Output is correct
10 Correct 101 ms 21412 KB Output is correct
11 Correct 100 ms 21432 KB Output is correct
12 Correct 89 ms 14600 KB Output is correct
13 Correct 87 ms 14688 KB Output is correct
14 Correct 112 ms 13504 KB Output is correct
15 Correct 108 ms 13688 KB Output is correct
16 Correct 116 ms 14072 KB Output is correct
17 Correct 114 ms 13988 KB Output is correct
18 Correct 119 ms 13952 KB Output is correct
19 Correct 104 ms 14232 KB Output is correct
20 Correct 95 ms 17272 KB Output is correct
21 Correct 98 ms 17420 KB Output is correct
22 Correct 97 ms 17344 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 12 ms 5720 KB Output is correct
3 Correct 12 ms 5752 KB Output is correct
4 Correct 6 ms 4984 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 13 ms 6268 KB Output is correct
7 Correct 12 ms 6008 KB Output is correct
8 Correct 11 ms 5880 KB Output is correct
9 Correct 11 ms 5880 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 5084 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 33 ms 6776 KB Output is correct
16 Correct 32 ms 6776 KB Output is correct
17 Correct 38 ms 6904 KB Output is correct
18 Correct 15 ms 6136 KB Output is correct
19 Correct 15 ms 5880 KB Output is correct
20 Correct 33 ms 7160 KB Output is correct
21 Correct 36 ms 7160 KB Output is correct
22 Correct 6 ms 5016 KB Output is correct
23 Correct 12 ms 5752 KB Output is correct
24 Correct 12 ms 5752 KB Output is correct
25 Correct 6 ms 4984 KB Output is correct
26 Correct 8 ms 5112 KB Output is correct
27 Correct 13 ms 6264 KB Output is correct
28 Correct 14 ms 5880 KB Output is correct
29 Correct 11 ms 5880 KB Output is correct
30 Correct 12 ms 5880 KB Output is correct
31 Correct 6 ms 4984 KB Output is correct
32 Correct 8 ms 5116 KB Output is correct
33 Correct 6 ms 5112 KB Output is correct
34 Correct 6 ms 4984 KB Output is correct
35 Correct 6 ms 5112 KB Output is correct
36 Correct 114 ms 21852 KB Output is correct
37 Correct 6 ms 5112 KB Output is correct
38 Correct 108 ms 21468 KB Output is correct
39 Correct 104 ms 20904 KB Output is correct
40 Correct 103 ms 21588 KB Output is correct
41 Correct 102 ms 21872 KB Output is correct
42 Correct 89 ms 16888 KB Output is correct
43 Correct 100 ms 14200 KB Output is correct
44 Correct 115 ms 13944 KB Output is correct
45 Correct 119 ms 13928 KB Output is correct
46 Correct 151 ms 14148 KB Output is correct
47 Correct 95 ms 17144 KB Output is correct
48 Correct 95 ms 17020 KB Output is correct
49 Correct 123 ms 17852 KB Output is correct
50 Correct 109 ms 17884 KB Output is correct
51 Correct 101 ms 21412 KB Output is correct
52 Correct 100 ms 21432 KB Output is correct
53 Correct 89 ms 14600 KB Output is correct
54 Correct 87 ms 14688 KB Output is correct
55 Correct 112 ms 13504 KB Output is correct
56 Correct 108 ms 13688 KB Output is correct
57 Correct 116 ms 14072 KB Output is correct
58 Correct 114 ms 13988 KB Output is correct
59 Correct 119 ms 13952 KB Output is correct
60 Correct 104 ms 14232 KB Output is correct
61 Correct 95 ms 17272 KB Output is correct
62 Correct 98 ms 17420 KB Output is correct
63 Correct 97 ms 17344 KB Output is correct
64 Correct 105 ms 17916 KB Output is correct
65 Correct 172 ms 15352 KB Output is correct
66 Correct 166 ms 14968 KB Output is correct
67 Correct 139 ms 14760 KB Output is correct
68 Correct 110 ms 14076 KB Output is correct
69 Correct 98 ms 13916 KB Output is correct
70 Correct 113 ms 18184 KB Output is correct
71 Correct 103 ms 17684 KB Output is correct
72 Correct 6 ms 5112 KB Output is correct
73 Correct 12 ms 5856 KB Output is correct
74 Correct 12 ms 5752 KB Output is correct
75 Correct 6 ms 5112 KB Output is correct
76 Correct 6 ms 4984 KB Output is correct
77 Correct 12 ms 6264 KB Output is correct
78 Correct 12 ms 5880 KB Output is correct
79 Correct 13 ms 5880 KB Output is correct
80 Correct 11 ms 5880 KB Output is correct
81 Correct 6 ms 4984 KB Output is correct
82 Correct 6 ms 4984 KB Output is correct
83 Correct 6 ms 4984 KB Output is correct
84 Correct 6 ms 5064 KB Output is correct
85 Correct 7 ms 5112 KB Output is correct
86 Correct 32 ms 6776 KB Output is correct
87 Correct 33 ms 6776 KB Output is correct
88 Correct 33 ms 6776 KB Output is correct
89 Correct 13 ms 6136 KB Output is correct
90 Correct 13 ms 5880 KB Output is correct
91 Correct 33 ms 7196 KB Output is correct
92 Correct 33 ms 7036 KB Output is correct
93 Correct 6 ms 4984 KB Output is correct
94 Correct 111 ms 21848 KB Output is correct
95 Correct 109 ms 21556 KB Output is correct
96 Correct 98 ms 20948 KB Output is correct
97 Correct 104 ms 21488 KB Output is correct
98 Correct 104 ms 21740 KB Output is correct
99 Correct 126 ms 14016 KB Output is correct
100 Correct 116 ms 13964 KB Output is correct
101 Correct 118 ms 13944 KB Output is correct
102 Correct 109 ms 14248 KB Output is correct
103 Correct 91 ms 17016 KB Output is correct
104 Correct 92 ms 17408 KB Output is correct
105 Correct 92 ms 16956 KB Output is correct
106 Correct 105 ms 18048 KB Output is correct
107 Correct 104 ms 17784 KB Output is correct
108 Correct 104 ms 21364 KB Output is correct
109 Correct 99 ms 21364 KB Output is correct
110 Correct 94 ms 14712 KB Output is correct
111 Correct 99 ms 14688 KB Output is correct
112 Correct 110 ms 13560 KB Output is correct
113 Correct 109 ms 13560 KB Output is correct