oj.uz

답안 #393887

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
393887 2021-04-24T18:53:27 Z JerryLiu06 Railway (BOI17_railway) C++11
100 / 100
 102 ms 23320 KB 
#include <bits/stdc++.h>

using namespace std;

#define pb push_back

int N, M, K, timer = 1; vector<int> adj[100010];

int in[100010], out[100010], lift[100010][20];

int pref[100010], U[100010], V[100010];

void DFS(int X, int P) {
    in[X] = timer++; lift[X][0] = P;

    for (int NXT : adj[X]) if (NXT != P) { DFS(NXT, X); } out[X] = timer - 1;
}
bool isAnc(int A, int B) { return in[A] <= in[B] && out[A] >= out[B]; }

int getLCA(int A, int B) {
    if (isAnc(A, B)) return A; if (isAnc(B, A)) return B;

    for (int i = 19; i >= 0; i--) {
        if (lift[A][i] && !isAnc(lift[A][i], B)) A = lift[A][i];
    }
    return lift[A][0];
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);

    cin >> N >> M >> K;

    for (int i = 1; i < N; i++) { cin >> U[i] >> V[i]; adj[U[i]].pb(V[i]), adj[V[i]].pb(U[i]); }
    
    DFS(1, 0); for (int j = 1; j < 20; j++) for (int i = 1; i <= N; i++) lift[i][j] = lift[lift[i][j - 1]][j - 1];

    for (int i = 0; i < M; i++) {
        int S; cin >> S; int A[S]; for (int i = 0; i < S; i++) cin >> A[i];

        sort(A, A + S, [](int A, int B) { return in[A] < in[B]; });

        for (int i = 0; i < S; i++) {
            int X = A[i]; int Y = A[(i + 1) % S]; if (in[X] > in[Y]) swap(X, Y);
            
            if (isAnc(X, Y)) { pref[in[X]]--, pref[in[Y]]++; continue; }

            int LCA = getLCA(X, Y); pref[in[X]]++; pref[in[Y]]++; pref[in[LCA]] -= 2;
        }
    }
    for (int i = 1; i < timer; i++) pref[i] += pref[i - 1];

    vector<int> ans; for (int i = 1; i < N; i++) {
        int LOW = (isAnc(U[i], V[i])) ? V[i] : U[i];

        if (pref[out[LOW]] - pref[in[LOW] - 1] >= 2 * K) ans.pb(i);
    }
    cout << ans.size() << "\n"; for (int i : ans) cout << i << " ";
}

Compilation message

railway.cpp: In function 'void DFS(int, int)':
railway.cpp:16:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   16 |     for (int NXT : adj[X]) if (NXT != P) { DFS(NXT, X); } out[X] = timer - 1;
      |     ^~~
railway.cpp:16:59: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   16 |     for (int NXT : adj[X]) if (NXT != P) { DFS(NXT, X); } out[X] = timer - 1;
      |                                                           ^~~
railway.cpp: In function 'int getLCA(int, int)':
railway.cpp:21:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   21 |     if (isAnc(A, B)) return A; if (isAnc(B, A)) return B;
      |     ^~
railway.cpp:21:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   21 |     if (isAnc(A, B)) return A; if (isAnc(B, A)) return B;
      |                                ^~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 6 ms 4088 KB Output is correct
3 Correct 6 ms 4032 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 7 ms 4348 KB Output is correct
7 Correct 7 ms 4136 KB Output is correct
8 Correct 6 ms 4044 KB Output is correct
9 Correct 6 ms 4044 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 2640 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 6 ms 4088 KB Output is correct
3 Correct 6 ms 4032 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 7 ms 4348 KB Output is correct
7 Correct 7 ms 4136 KB Output is correct
8 Correct 6 ms 4044 KB Output is correct
9 Correct 6 ms 4044 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 2640 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 21 ms 4456 KB Output is correct
16 Correct 21 ms 4492 KB Output is correct
17 Correct 21 ms 4440 KB Output is correct
18 Correct 7 ms 4372 KB Output is correct
19 Correct 8 ms 4220 KB Output is correct
20 Correct 24 ms 4640 KB Output is correct
21 Correct 24 ms 4588 KB Output is correct
22 Correct 3 ms 2764 KB Output is correct
23 Correct 6 ms 4096 KB Output is correct
24 Correct 7 ms 4052 KB Output is correct
25 Correct 2 ms 2636 KB Output is correct
26 Correct 2 ms 2636 KB Output is correct
27 Correct 7 ms 4392 KB Output is correct
28 Correct 6 ms 4044 KB Output is correct
29 Correct 6 ms 4096 KB Output is correct
30 Correct 6 ms 4044 KB Output is correct
31 Correct 2 ms 2636 KB Output is correct
32 Correct 2 ms 2636 KB Output is correct
33 Correct 2 ms 2636 KB Output is correct
34 Correct 2 ms 2636 KB Output is correct
35 Correct 2 ms 2636 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 22896 KB Output is correct
2 Correct 3 ms 2668 KB Output is correct
3 Correct 69 ms 22628 KB Output is correct
4 Correct 67 ms 22084 KB Output is correct
5 Correct 80 ms 22872 KB Output is correct
6 Correct 79 ms 23316 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 19652 KB Output is correct
2 Correct 88 ms 17820 KB Output is correct
3 Correct 85 ms 17484 KB Output is correct
4 Correct 82 ms 17352 KB Output is correct
5 Correct 90 ms 17416 KB Output is correct
6 Correct 76 ms 19812 KB Output is correct
7 Correct 79 ms 19876 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 19652 KB Output is correct
2 Correct 88 ms 17820 KB Output is correct
3 Correct 85 ms 17484 KB Output is correct
4 Correct 82 ms 17352 KB Output is correct
5 Correct 90 ms 17416 KB Output is correct
6 Correct 76 ms 19812 KB Output is correct
7 Correct 79 ms 19876 KB Output is correct
8 Correct 86 ms 19864 KB Output is correct
9 Correct 101 ms 19852 KB Output is correct
10 Correct 70 ms 22972 KB Output is correct
11 Correct 71 ms 22944 KB Output is correct
12 Correct 72 ms 17380 KB Output is correct
13 Correct 70 ms 17348 KB Output is correct
14 Correct 88 ms 17376 KB Output is correct
15 Correct 83 ms 17348 KB Output is correct
16 Correct 83 ms 17348 KB Output is correct
17 Correct 86 ms 17344 KB Output is correct
18 Correct 93 ms 17468 KB Output is correct
19 Correct 85 ms 17624 KB Output is correct
20 Correct 79 ms 20164 KB Output is correct
21 Correct 79 ms 20164 KB Output is correct
22 Correct 83 ms 20160 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 6 ms 4088 KB Output is correct
3 Correct 6 ms 4032 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 7 ms 4348 KB Output is correct
7 Correct 7 ms 4136 KB Output is correct
8 Correct 6 ms 4044 KB Output is correct
9 Correct 6 ms 4044 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 2640 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 21 ms 4456 KB Output is correct
16 Correct 21 ms 4492 KB Output is correct
17 Correct 21 ms 4440 KB Output is correct
18 Correct 7 ms 4372 KB Output is correct
19 Correct 8 ms 4220 KB Output is correct
20 Correct 24 ms 4640 KB Output is correct
21 Correct 24 ms 4588 KB Output is correct
22 Correct 3 ms 2764 KB Output is correct
23 Correct 6 ms 4096 KB Output is correct
24 Correct 7 ms 4052 KB Output is correct
25 Correct 2 ms 2636 KB Output is correct
26 Correct 2 ms 2636 KB Output is correct
27 Correct 7 ms 4392 KB Output is correct
28 Correct 6 ms 4044 KB Output is correct
29 Correct 6 ms 4096 KB Output is correct
30 Correct 6 ms 4044 KB Output is correct
31 Correct 2 ms 2636 KB Output is correct
32 Correct 2 ms 2636 KB Output is correct
33 Correct 2 ms 2636 KB Output is correct
34 Correct 2 ms 2636 KB Output is correct
35 Correct 2 ms 2636 KB Output is correct
36 Correct 73 ms 22896 KB Output is correct
37 Correct 3 ms 2668 KB Output is correct
38 Correct 69 ms 22628 KB Output is correct
39 Correct 67 ms 22084 KB Output is correct
40 Correct 80 ms 22872 KB Output is correct
41 Correct 79 ms 23316 KB Output is correct
42 Correct 74 ms 19652 KB Output is correct
43 Correct 88 ms 17820 KB Output is correct
44 Correct 85 ms 17484 KB Output is correct
45 Correct 82 ms 17352 KB Output is correct
46 Correct 90 ms 17416 KB Output is correct
47 Correct 76 ms 19812 KB Output is correct
48 Correct 79 ms 19876 KB Output is correct
49 Correct 86 ms 19864 KB Output is correct
50 Correct 101 ms 19852 KB Output is correct
51 Correct 70 ms 22972 KB Output is correct
52 Correct 71 ms 22944 KB Output is correct
53 Correct 72 ms 17380 KB Output is correct
54 Correct 70 ms 17348 KB Output is correct
55 Correct 88 ms 17376 KB Output is correct
56 Correct 83 ms 17348 KB Output is correct
57 Correct 83 ms 17348 KB Output is correct
58 Correct 86 ms 17344 KB Output is correct
59 Correct 93 ms 17468 KB Output is correct
60 Correct 85 ms 17624 KB Output is correct
61 Correct 79 ms 20164 KB Output is correct
62 Correct 79 ms 20164 KB Output is correct
63 Correct 83 ms 20160 KB Output is correct
64 Correct 83 ms 19956 KB Output is correct
65 Correct 86 ms 17400 KB Output is correct
66 Correct 89 ms 17348 KB Output is correct
67 Correct 91 ms 17352 KB Output is correct
68 Correct 65 ms 17260 KB Output is correct
69 Correct 62 ms 17216 KB Output is correct
70 Correct 88 ms 20348 KB Output is correct
71 Correct 87 ms 19628 KB Output is correct
72 Correct 2 ms 2636 KB Output is correct
73 Correct 8 ms 4024 KB Output is correct
74 Correct 8 ms 4048 KB Output is correct
75 Correct 3 ms 2636 KB Output is correct
76 Correct 2 ms 2668 KB Output is correct
77 Correct 7 ms 4304 KB Output is correct
78 Correct 7 ms 4044 KB Output is correct
79 Correct 6 ms 4068 KB Output is correct
80 Correct 6 ms 4044 KB Output is correct
81 Correct 2 ms 2636 KB Output is correct
82 Correct 2 ms 2636 KB Output is correct
83 Correct 2 ms 2636 KB Output is correct
84 Correct 3 ms 2668 KB Output is correct
85 Correct 2 ms 2636 KB Output is correct
86 Correct 20 ms 4352 KB Output is correct
87 Correct 22 ms 4428 KB Output is correct
88 Correct 22 ms 4556 KB Output is correct
89 Correct 7 ms 4300 KB Output is correct
90 Correct 7 ms 4044 KB Output is correct
91 Correct 20 ms 4556 KB Output is correct
92 Correct 22 ms 4536 KB Output is correct
93 Correct 2 ms 2636 KB Output is correct
94 Correct 72 ms 22920 KB Output is correct
95 Correct 69 ms 22644 KB Output is correct
96 Correct 65 ms 22032 KB Output is correct
97 Correct 71 ms 22920 KB Output is correct
98 Correct 74 ms 23320 KB Output is correct
99 Correct 83 ms 17448 KB Output is correct
100 Correct 86 ms 17452 KB Output is correct
101 Correct 88 ms 17380 KB Output is correct
102 Correct 87 ms 17636 KB Output is correct
103 Correct 77 ms 19784 KB Output is correct
104 Correct 85 ms 20168 KB Output is correct
105 Correct 77 ms 19792 KB Output is correct
106 Correct 102 ms 20012 KB Output is correct
107 Correct 101 ms 19908 KB Output is correct
108 Correct 74 ms 22988 KB Output is correct
109 Correct 78 ms 23056 KB Output is correct
110 Correct 75 ms 17252 KB Output is correct
111 Correct 68 ms 17252 KB Output is correct
112 Correct 97 ms 17376 KB Output is correct
113 Correct 86 ms 17348 KB Output is correct