oj.uz

답안 #695257

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
695257 2023-02-04T20:40:51 Z Farhan_HY Railway (BOI17_railway) C++14
100 / 100
 261 ms 147632 KB 
#include <bits/stdc++.h>
#define int long long
#define float double
#define pb push_back
#define F first
#define S second
#define T int t; cin >> t; while(t--)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
using namespace std;
/// Benzema is the best player in the world
const int N = 1e6 + 6;
const int M = 3e4 + 3;
const int mod = 1e9 + 7;
const int inf = 1e18;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int LOG = 28;
int n, m, k, timer, par[N], in[N], depth[N], sp[N][LOG];
vector<pair<int, int>> adj[N];

void getDepth(int node, int pa) {
    par[node] = pa;
    in[node] = ++timer;
    depth[node] = depth[pa] + 1;
    for(auto x: adj[node])
        if (x.F != pa) getDepth(x.F, node);
}

void buildsparce() {
    for(int i = 1; i <= n; i++) sp[i][0] = par[i];
    for(int j = 1; j < 18; j++) {
        for(int i = 1; i <= n; i++)
            sp[i][j] = sp[sp[i][j - 1]][j - 1];
    }
}

int LCA(int u, int v) {
    if (depth[u] < depth[v]) swap(u, v);
    for(int i = 18; i >= 0; i--) {
        if (depth[u] == depth[v]) break;
        if (depth[sp[u][i]] >= depth[v])
            u = sp[u][i];
    }
    if (u == v) return u;
    for(int i = 18; i >= 0; i--) {
        if (sp[u][i] != sp[v][i])
            u = sp[u][i], v = sp[v][i];
    }
    return par[u];
}
set<int> st[N];
vector<int> ans, trees[N];

void dfs(int node, int par) {
    for(auto x: adj[node])   {
        if (x.F == par) continue;
        dfs(x.F, node);
        if (st[x.F].size() >= k)
            ans.push_back(x.S);
        if (st[node].size() < st[x.F].size())
            swap(st[x.F], st[node]);
        for(auto y: st[x.F])
            st[node].insert(y);
    }
    for(auto x: trees[node])
        st[node].erase(st[node].find(x));
}

main() {
    IOS
    cin >> n >> m >> k;
    for(int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back({v, i});
        adj[v].push_back({u, i});
    }
    getDepth(1, 0);
    buildsparce();
    for(int i = 1; i <= m; i++) {
        int s;
        cin >> s;
        int p = 0;
        for(int j = 1; j <= s; j++) {
            int x;
            cin >> x;
            if (p != 0) p = LCA(p, x);
            else p = x;
            st[x].insert(i);
        }
        trees[p].push_back(i);
    }
    dfs(1, 0);
    cout << ans.size() << '\n';
    sort(begin(ans), end(ans));
    for(auto x: ans) cout << x << ' ';
}

Compilation message

railway.cpp: In function 'void dfs(long long int, long long int)':
railway.cpp:59:28: warning: comparison of integer expressions of different signedness: 'std::set<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   59 |         if (st[x.F].size() >= k)
      |             ~~~~~~~~~~~~~~~^~~~
railway.cpp: At global scope:
railway.cpp:70:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | main() {
      | ^~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 94180 KB Output is correct
2 Correct 47 ms 97308 KB Output is correct
3 Correct 54 ms 97300 KB Output is correct
4 Correct 43 ms 94228 KB Output is correct
5 Correct 42 ms 94164 KB Output is correct
6 Correct 46 ms 98192 KB Output is correct
7 Correct 47 ms 97452 KB Output is correct
8 Correct 46 ms 97356 KB Output is correct
9 Correct 47 ms 97356 KB Output is correct
10 Correct 45 ms 94160 KB Output is correct
11 Correct 44 ms 94276 KB Output is correct
12 Correct 41 ms 94372 KB Output is correct
13 Correct 43 ms 94200 KB Output is correct
14 Correct 42 ms 94184 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 94180 KB Output is correct
2 Correct 47 ms 97308 KB Output is correct
3 Correct 54 ms 97300 KB Output is correct
4 Correct 43 ms 94228 KB Output is correct
5 Correct 42 ms 94164 KB Output is correct
6 Correct 46 ms 98192 KB Output is correct
7 Correct 47 ms 97452 KB Output is correct
8 Correct 46 ms 97356 KB Output is correct
9 Correct 47 ms 97356 KB Output is correct
10 Correct 45 ms 94160 KB Output is correct
11 Correct 44 ms 94276 KB Output is correct
12 Correct 41 ms 94372 KB Output is correct
13 Correct 43 ms 94200 KB Output is correct
14 Correct 42 ms 94184 KB Output is correct
15 Correct 88 ms 102732 KB Output is correct
16 Correct 106 ms 102780 KB Output is correct
17 Correct 86 ms 102816 KB Output is correct
18 Correct 48 ms 98440 KB Output is correct
19 Correct 49 ms 97532 KB Output is correct
20 Correct 87 ms 102044 KB Output is correct
21 Correct 88 ms 101836 KB Output is correct
22 Correct 42 ms 94156 KB Output is correct
23 Correct 49 ms 97364 KB Output is correct
24 Correct 46 ms 97332 KB Output is correct
25 Correct 44 ms 94252 KB Output is correct
26 Correct 42 ms 94260 KB Output is correct
27 Correct 47 ms 98132 KB Output is correct
28 Correct 47 ms 97468 KB Output is correct
29 Correct 47 ms 97268 KB Output is correct
30 Correct 47 ms 97356 KB Output is correct
31 Correct 42 ms 94156 KB Output is correct
32 Correct 42 ms 94260 KB Output is correct
33 Correct 43 ms 94248 KB Output is correct
34 Correct 45 ms 94188 KB Output is correct
35 Correct 50 ms 94280 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 223 ms 146944 KB Output is correct
2 Correct 43 ms 94276 KB Output is correct
3 Correct 230 ms 146568 KB Output is correct
4 Correct 216 ms 145932 KB Output is correct
5 Correct 185 ms 145108 KB Output is correct
6 Correct 182 ms 147360 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 176 ms 139196 KB Output is correct
2 Correct 250 ms 134064 KB Output is correct
3 Correct 204 ms 139600 KB Output is correct
4 Correct 233 ms 139540 KB Output is correct
5 Correct 213 ms 139748 KB Output is correct
6 Correct 192 ms 139648 KB Output is correct
7 Correct 175 ms 139616 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 176 ms 139196 KB Output is correct
2 Correct 250 ms 134064 KB Output is correct
3 Correct 204 ms 139600 KB Output is correct
4 Correct 233 ms 139540 KB Output is correct
5 Correct 213 ms 139748 KB Output is correct
6 Correct 192 ms 139648 KB Output is correct
7 Correct 175 ms 139616 KB Output is correct
8 Correct 180 ms 138312 KB Output is correct
9 Correct 177 ms 138148 KB Output is correct
10 Correct 188 ms 145268 KB Output is correct
11 Correct 225 ms 145236 KB Output is correct
12 Correct 162 ms 128268 KB Output is correct
13 Correct 144 ms 128244 KB Output is correct
14 Correct 203 ms 134660 KB Output is correct
15 Correct 197 ms 134840 KB Output is correct
16 Correct 261 ms 140700 KB Output is correct
17 Correct 258 ms 141164 KB Output is correct
18 Correct 214 ms 138968 KB Output is correct
19 Correct 216 ms 135000 KB Output is correct
20 Correct 189 ms 140012 KB Output is correct
21 Correct 191 ms 140120 KB Output is correct
22 Correct 187 ms 140164 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 94180 KB Output is correct
2 Correct 47 ms 97308 KB Output is correct
3 Correct 54 ms 97300 KB Output is correct
4 Correct 43 ms 94228 KB Output is correct
5 Correct 42 ms 94164 KB Output is correct
6 Correct 46 ms 98192 KB Output is correct
7 Correct 47 ms 97452 KB Output is correct
8 Correct 46 ms 97356 KB Output is correct
9 Correct 47 ms 97356 KB Output is correct
10 Correct 45 ms 94160 KB Output is correct
11 Correct 44 ms 94276 KB Output is correct
12 Correct 41 ms 94372 KB Output is correct
13 Correct 43 ms 94200 KB Output is correct
14 Correct 42 ms 94184 KB Output is correct
15 Correct 88 ms 102732 KB Output is correct
16 Correct 106 ms 102780 KB Output is correct
17 Correct 86 ms 102816 KB Output is correct
18 Correct 48 ms 98440 KB Output is correct
19 Correct 49 ms 97532 KB Output is correct
20 Correct 87 ms 102044 KB Output is correct
21 Correct 88 ms 101836 KB Output is correct
22 Correct 42 ms 94156 KB Output is correct
23 Correct 49 ms 97364 KB Output is correct
24 Correct 46 ms 97332 KB Output is correct
25 Correct 44 ms 94252 KB Output is correct
26 Correct 42 ms 94260 KB Output is correct
27 Correct 47 ms 98132 KB Output is correct
28 Correct 47 ms 97468 KB Output is correct
29 Correct 47 ms 97268 KB Output is correct
30 Correct 47 ms 97356 KB Output is correct
31 Correct 42 ms 94156 KB Output is correct
32 Correct 42 ms 94260 KB Output is correct
33 Correct 43 ms 94248 KB Output is correct
34 Correct 45 ms 94188 KB Output is correct
35 Correct 50 ms 94280 KB Output is correct
36 Correct 223 ms 146944 KB Output is correct
37 Correct 43 ms 94276 KB Output is correct
38 Correct 230 ms 146568 KB Output is correct
39 Correct 216 ms 145932 KB Output is correct
40 Correct 185 ms 145108 KB Output is correct
41 Correct 182 ms 147360 KB Output is correct
42 Correct 176 ms 139196 KB Output is correct
43 Correct 250 ms 134064 KB Output is correct
44 Correct 204 ms 139600 KB Output is correct
45 Correct 233 ms 139540 KB Output is correct
46 Correct 213 ms 139748 KB Output is correct
47 Correct 192 ms 139648 KB Output is correct
48 Correct 175 ms 139616 KB Output is correct
49 Correct 180 ms 138312 KB Output is correct
50 Correct 177 ms 138148 KB Output is correct
51 Correct 188 ms 145268 KB Output is correct
52 Correct 225 ms 145236 KB Output is correct
53 Correct 162 ms 128268 KB Output is correct
54 Correct 144 ms 128244 KB Output is correct
55 Correct 203 ms 134660 KB Output is correct
56 Correct 197 ms 134840 KB Output is correct
57 Correct 261 ms 140700 KB Output is correct
58 Correct 258 ms 141164 KB Output is correct
59 Correct 214 ms 138968 KB Output is correct
60 Correct 216 ms 135000 KB Output is correct
61 Correct 189 ms 140012 KB Output is correct
62 Correct 191 ms 140120 KB Output is correct
63 Correct 187 ms 140164 KB Output is correct
64 Correct 188 ms 138692 KB Output is correct
65 Correct 245 ms 146264 KB Output is correct
66 Correct 224 ms 142012 KB Output is correct
67 Correct 215 ms 137548 KB Output is correct
68 Correct 148 ms 126900 KB Output is correct
69 Correct 134 ms 126920 KB Output is correct
70 Correct 186 ms 140076 KB Output is correct
71 Correct 190 ms 138160 KB Output is correct
72 Correct 45 ms 94160 KB Output is correct
73 Correct 51 ms 97400 KB Output is correct
74 Correct 52 ms 97352 KB Output is correct
75 Correct 48 ms 94160 KB Output is correct
76 Correct 47 ms 94240 KB Output is correct
77 Correct 52 ms 98316 KB Output is correct
78 Correct 50 ms 97468 KB Output is correct
79 Correct 59 ms 97424 KB Output is correct
80 Correct 60 ms 97564 KB Output is correct
81 Correct 47 ms 94284 KB Output is correct
82 Correct 44 ms 94284 KB Output is correct
83 Correct 46 ms 94252 KB Output is correct
84 Correct 46 ms 94176 KB Output is correct
85 Correct 46 ms 94272 KB Output is correct
86 Correct 89 ms 103044 KB Output is correct
87 Correct 91 ms 103072 KB Output is correct
88 Correct 89 ms 103136 KB Output is correct
89 Correct 52 ms 98384 KB Output is correct
90 Correct 51 ms 97588 KB Output is correct
91 Correct 94 ms 102324 KB Output is correct
92 Correct 94 ms 102288 KB Output is correct
93 Correct 46 ms 94228 KB Output is correct
94 Correct 223 ms 147240 KB Output is correct
95 Correct 217 ms 146828 KB Output is correct
96 Correct 220 ms 146288 KB Output is correct
97 Correct 190 ms 145388 KB Output is correct
98 Correct 208 ms 147632 KB Output is correct
99 Correct 225 ms 143272 KB Output is correct
100 Correct 216 ms 140544 KB Output is correct
101 Correct 230 ms 140876 KB Output is correct
102 Correct 221 ms 134432 KB Output is correct
103 Correct 176 ms 139616 KB Output is correct
104 Correct 178 ms 140368 KB Output is correct
105 Correct 177 ms 139556 KB Output is correct
106 Correct 178 ms 138492 KB Output is correct
107 Correct 215 ms 138364 KB Output is correct
108 Correct 175 ms 145264 KB Output is correct
109 Correct 165 ms 145216 KB Output is correct
110 Correct 144 ms 128244 KB Output is correct
111 Correct 152 ms 128208 KB Output is correct
112 Correct 207 ms 134404 KB Output is correct
113 Correct 187 ms 134496 KB Output is correct