oj.uz

답안 #223586

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
223586 2020-04-15T14:14:40 Z DodgeBallMan Railway (BOI17_railway) C++14
100 / 100
 154 ms 21904 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

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 13 ms 5760 KB Output is correct
3 Correct 13 ms 5760 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 7 ms 4992 KB Output is correct
6 Correct 13 ms 6272 KB Output is correct
7 Correct 13 ms 5888 KB Output is correct
8 Correct 11 ms 5888 KB Output is correct
9 Correct 12 ms 5920 KB Output is correct
10 Correct 7 ms 4992 KB Output is correct
11 Correct 7 ms 4992 KB Output is correct
12 Correct 10 ms 4992 KB Output is correct
13 Correct 7 ms 4992 KB Output is correct
14 Correct 7 ms 4992 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 13 ms 5760 KB Output is correct
3 Correct 13 ms 5760 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 7 ms 4992 KB Output is correct
6 Correct 13 ms 6272 KB Output is correct
7 Correct 13 ms 5888 KB Output is correct
8 Correct 11 ms 5888 KB Output is correct
9 Correct 12 ms 5920 KB Output is correct
10 Correct 7 ms 4992 KB Output is correct
11 Correct 7 ms 4992 KB Output is correct
12 Correct 10 ms 4992 KB Output is correct
13 Correct 7 ms 4992 KB Output is correct
14 Correct 7 ms 4992 KB Output is correct
15 Correct 31 ms 6784 KB Output is correct
16 Correct 33 ms 6776 KB Output is correct
17 Correct 36 ms 6816 KB Output is correct
18 Correct 14 ms 6144 KB Output is correct
19 Correct 13 ms 5888 KB Output is correct
20 Correct 33 ms 7160 KB Output is correct
21 Correct 43 ms 7032 KB Output is correct
22 Correct 7 ms 4992 KB Output is correct
23 Correct 12 ms 5760 KB Output is correct
24 Correct 14 ms 5760 KB Output is correct
25 Correct 9 ms 5192 KB Output is correct
26 Correct 7 ms 4992 KB Output is correct
27 Correct 16 ms 6144 KB Output is correct
28 Correct 13 ms 5888 KB Output is correct
29 Correct 12 ms 5888 KB Output is correct
30 Correct 12 ms 5888 KB Output is correct
31 Correct 7 ms 4992 KB Output is correct
32 Correct 7 ms 5120 KB Output is correct
33 Correct 7 ms 4992 KB Output is correct
34 Correct 7 ms 4992 KB Output is correct
35 Correct 7 ms 4992 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 21880 KB Output is correct
2 Correct 7 ms 4992 KB Output is correct
3 Correct 127 ms 21600 KB Output is correct
4 Correct 97 ms 20984 KB Output is correct
5 Correct 106 ms 21612 KB Output is correct
6 Correct 99 ms 21748 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 16916 KB Output is correct
2 Correct 108 ms 14200 KB Output is correct
3 Correct 126 ms 14200 KB Output is correct
4 Correct 109 ms 13944 KB Output is correct
5 Correct 132 ms 14072 KB Output is correct
6 Correct 91 ms 17144 KB Output is correct
7 Correct 90 ms 16924 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 16916 KB Output is correct
2 Correct 108 ms 14200 KB Output is correct
3 Correct 126 ms 14200 KB Output is correct
4 Correct 109 ms 13944 KB Output is correct
5 Correct 132 ms 14072 KB Output is correct
6 Correct 91 ms 17144 KB Output is correct
7 Correct 90 ms 16924 KB Output is correct
8 Correct 102 ms 17912 KB Output is correct
9 Correct 114 ms 17784 KB Output is correct
10 Correct 99 ms 21496 KB Output is correct
11 Correct 100 ms 21364 KB Output is correct
12 Correct 99 ms 14844 KB Output is correct
13 Correct 98 ms 14712 KB Output is correct
14 Correct 131 ms 13576 KB Output is correct
15 Correct 123 ms 13560 KB Output is correct
16 Correct 119 ms 13944 KB Output is correct
17 Correct 117 ms 13944 KB Output is correct
18 Correct 146 ms 13944 KB Output is correct
19 Correct 106 ms 14200 KB Output is correct
20 Correct 91 ms 17272 KB Output is correct
21 Correct 93 ms 17404 KB Output is correct
22 Correct 93 ms 17272 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 13 ms 5760 KB Output is correct
3 Correct 13 ms 5760 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 7 ms 4992 KB Output is correct
6 Correct 13 ms 6272 KB Output is correct
7 Correct 13 ms 5888 KB Output is correct
8 Correct 11 ms 5888 KB Output is correct
9 Correct 12 ms 5920 KB Output is correct
10 Correct 7 ms 4992 KB Output is correct
11 Correct 7 ms 4992 KB Output is correct
12 Correct 10 ms 4992 KB Output is correct
13 Correct 7 ms 4992 KB Output is correct
14 Correct 7 ms 4992 KB Output is correct
15 Correct 31 ms 6784 KB Output is correct
16 Correct 33 ms 6776 KB Output is correct
17 Correct 36 ms 6816 KB Output is correct
18 Correct 14 ms 6144 KB Output is correct
19 Correct 13 ms 5888 KB Output is correct
20 Correct 33 ms 7160 KB Output is correct
21 Correct 43 ms 7032 KB Output is correct
22 Correct 7 ms 4992 KB Output is correct
23 Correct 12 ms 5760 KB Output is correct
24 Correct 14 ms 5760 KB Output is correct
25 Correct 9 ms 5192 KB Output is correct
26 Correct 7 ms 4992 KB Output is correct
27 Correct 16 ms 6144 KB Output is correct
28 Correct 13 ms 5888 KB Output is correct
29 Correct 12 ms 5888 KB Output is correct
30 Correct 12 ms 5888 KB Output is correct
31 Correct 7 ms 4992 KB Output is correct
32 Correct 7 ms 5120 KB Output is correct
33 Correct 7 ms 4992 KB Output is correct
34 Correct 7 ms 4992 KB Output is correct
35 Correct 7 ms 4992 KB Output is correct
36 Correct 108 ms 21880 KB Output is correct
37 Correct 7 ms 4992 KB Output is correct
38 Correct 127 ms 21600 KB Output is correct
39 Correct 97 ms 20984 KB Output is correct
40 Correct 106 ms 21612 KB Output is correct
41 Correct 99 ms 21748 KB Output is correct
42 Correct 86 ms 16916 KB Output is correct
43 Correct 108 ms 14200 KB Output is correct
44 Correct 126 ms 14200 KB Output is correct
45 Correct 109 ms 13944 KB Output is correct
46 Correct 132 ms 14072 KB Output is correct
47 Correct 91 ms 17144 KB Output is correct
48 Correct 90 ms 16924 KB Output is correct
49 Correct 102 ms 17912 KB Output is correct
50 Correct 114 ms 17784 KB Output is correct
51 Correct 99 ms 21496 KB Output is correct
52 Correct 100 ms 21364 KB Output is correct
53 Correct 99 ms 14844 KB Output is correct
54 Correct 98 ms 14712 KB Output is correct
55 Correct 131 ms 13576 KB Output is correct
56 Correct 123 ms 13560 KB Output is correct
57 Correct 119 ms 13944 KB Output is correct
58 Correct 117 ms 13944 KB Output is correct
59 Correct 146 ms 13944 KB Output is correct
60 Correct 106 ms 14200 KB Output is correct
61 Correct 91 ms 17272 KB Output is correct
62 Correct 93 ms 17404 KB Output is correct
63 Correct 93 ms 17272 KB Output is correct
64 Correct 96 ms 17912 KB Output is correct
65 Correct 154 ms 15352 KB Output is correct
66 Correct 150 ms 14840 KB Output is correct
67 Correct 131 ms 14460 KB Output is correct
68 Correct 84 ms 13992 KB Output is correct
69 Correct 82 ms 13948 KB Output is correct
70 Correct 109 ms 18268 KB Output is correct
71 Correct 98 ms 17656 KB Output is correct
72 Correct 7 ms 4992 KB Output is correct
73 Correct 13 ms 5760 KB Output is correct
74 Correct 12 ms 5760 KB Output is correct
75 Correct 7 ms 4992 KB Output is correct
76 Correct 7 ms 4992 KB Output is correct
77 Correct 14 ms 6272 KB Output is correct
78 Correct 13 ms 5888 KB Output is correct
79 Correct 12 ms 5760 KB Output is correct
80 Correct 12 ms 5888 KB Output is correct
81 Correct 7 ms 4992 KB Output is correct
82 Correct 7 ms 4992 KB Output is correct
83 Correct 8 ms 4992 KB Output is correct
84 Correct 7 ms 4992 KB Output is correct
85 Correct 7 ms 4992 KB Output is correct
86 Correct 31 ms 6784 KB Output is correct
87 Correct 34 ms 6784 KB Output is correct
88 Correct 33 ms 6904 KB Output is correct
89 Correct 14 ms 6144 KB Output is correct
90 Correct 13 ms 5888 KB Output is correct
91 Correct 33 ms 7160 KB Output is correct
92 Correct 36 ms 7160 KB Output is correct
93 Correct 8 ms 5120 KB Output is correct
94 Correct 110 ms 21904 KB Output is correct
95 Correct 102 ms 21496 KB Output is correct
96 Correct 101 ms 20984 KB Output is correct
97 Correct 98 ms 21488 KB Output is correct
98 Correct 99 ms 21744 KB Output is correct
99 Correct 119 ms 14072 KB Output is correct
100 Correct 120 ms 13944 KB Output is correct
101 Correct 113 ms 13944 KB Output is correct
102 Correct 105 ms 14200 KB Output is correct
103 Correct 89 ms 17016 KB Output is correct
104 Correct 92 ms 17332 KB Output is correct
105 Correct 87 ms 17020 KB Output is correct
106 Correct 101 ms 18152 KB Output is correct
107 Correct 102 ms 17784 KB Output is correct
108 Correct 100 ms 21364 KB Output is correct
109 Correct 96 ms 21492 KB Output is correct
110 Correct 107 ms 14712 KB Output is correct
111 Correct 90 ms 14712 KB Output is correct
112 Correct 109 ms 13504 KB Output is correct
113 Correct 111 ms 13512 KB Output is correct