oj.uz

답안 #896372

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
896372 2024-01-01T10:37:07 Z AlphaMale06 Railway (BOI17_railway) C++14
100 / 100
 79 ms 27004 KB 
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define F first
#define S second

const int N = 1e5+3;

vector<int> adj[N];
int p[N][17];
int tin[N], tout[N];
int timer=-1;
void dfs(int v, int par){
    p[v][0]=par;
    for(int i=1; i<17; i++){
        p[v][i]=p[p[v][i-1]][i-1];
    }
    timer++;
    tin[v]=timer;
    for(int to : adj[v]){
        if(to!=par)dfs(to, v);
    }
    tout[v]=timer;
}

bool anc(int a, int b){
    return (tin[a]<=tin[b] && tout[a]>=tout[b]);
}

int lca(int a, int b){
    if(anc(a, b))return a;
    if(anc(b, a))return b;
    int ret=a;
    for(int i=16; i>=0; i--){
        if(!anc(p[ret][i], b)){
            ret=p[ret][i];
        }
    }
    return p[ret][0];
}

struct minister{
    int n;
    vector<pair<int, int>> nodes;
};

minister a[N/2];
int val[N];

int bring=0;


void dfs2(int v, int par){
    for(int to : adj[v]){
        if(to!=par){
            dfs2(to, v);
            val[v]+=bring;
            bring=0;
        }
    }
    bring+=val[v];
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m, k;
    cin >> n >> m >> k;
    vector<pair<int, int>> edges(n-1);
    for(int i=0; i< n-1; i++){
        cin >> edges[i].F >> edges[i].S;
        adj[edges[i].F].pb(edges[i].S);
        adj[edges[i].S].pb(edges[i].F);
    }
    dfs(1, 0);
    tin[0]=-1;
    tout[0]=1e9;
    for(int i=0; i< n-1; i++){
        if(anc(edges[i].S, edges[i].F))swap(edges[i].F, edges[i].S);
    }
    for(int i = 0; i< m; i++){
        cin >> a[i].n;
        for(int j=0; j< a[i].n; j++){
            int x;
            cin >> x;
            a[i].nodes.pb({tin[x], x});
        }
        sort(a[i].nodes.begin(), a[i].nodes.end());
        int lc=a[i].nodes[0].S;
        for(int j=0; j< a[i].n-1; j++)val[lca(a[i].nodes[j].S, a[i].nodes[j+1].S)]--;
        for(int j=0; j<a[i].n; j++)val[a[i].nodes[j].S]++;
        for(int j=1; j<a[i].n; j++)lc=lca(lc, a[i].nodes[j].S);
        val[lc]--;
    }
    dfs2(1, 0);
    vector<int> ans;
    for(int i=0; i< n-1; i++){
        if(val[edges[i].S]>=k)ans.pb(i+1);
    }
    sort(ans.begin(), ans.end());
    cout << ans.size() << '\n';
    for(int e : ans)cout << e << ' ';
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7772 KB Output is correct
2 Correct 4 ms 8284 KB Output is correct
3 Correct 4 ms 8324 KB Output is correct
4 Correct 2 ms 7772 KB Output is correct
5 Correct 2 ms 7772 KB Output is correct
6 Correct 7 ms 8792 KB Output is correct
7 Correct 6 ms 8428 KB Output is correct
8 Correct 4 ms 8284 KB Output is correct
9 Correct 4 ms 8280 KB Output is correct
10 Correct 1 ms 7772 KB Output is correct
11 Correct 2 ms 7772 KB Output is correct
12 Correct 2 ms 7772 KB Output is correct
13 Correct 2 ms 7848 KB Output is correct
14 Correct 2 ms 7772 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7772 KB Output is correct
2 Correct 4 ms 8284 KB Output is correct
3 Correct 4 ms 8324 KB Output is correct
4 Correct 2 ms 7772 KB Output is correct
5 Correct 2 ms 7772 KB Output is correct
6 Correct 7 ms 8792 KB Output is correct
7 Correct 6 ms 8428 KB Output is correct
8 Correct 4 ms 8284 KB Output is correct
9 Correct 4 ms 8280 KB Output is correct
10 Correct 1 ms 7772 KB Output is correct
11 Correct 2 ms 7772 KB Output is correct
12 Correct 2 ms 7772 KB Output is correct
13 Correct 2 ms 7848 KB Output is correct
14 Correct 2 ms 7772 KB Output is correct
15 Correct 17 ms 9820 KB Output is correct
16 Correct 17 ms 9820 KB Output is correct
17 Correct 17 ms 9884 KB Output is correct
18 Correct 6 ms 8796 KB Output is correct
19 Correct 6 ms 8536 KB Output is correct
20 Correct 23 ms 9972 KB Output is correct
21 Correct 20 ms 9820 KB Output is correct
22 Correct 2 ms 7772 KB Output is correct
23 Correct 5 ms 8420 KB Output is correct
24 Correct 4 ms 8280 KB Output is correct
25 Correct 2 ms 7772 KB Output is correct
26 Correct 2 ms 7772 KB Output is correct
27 Correct 5 ms 8796 KB Output is correct
28 Correct 5 ms 8540 KB Output is correct
29 Correct 4 ms 8520 KB Output is correct
30 Correct 4 ms 8284 KB Output is correct
31 Correct 2 ms 7772 KB Output is correct
32 Correct 2 ms 7772 KB Output is correct
33 Correct 2 ms 7920 KB Output is correct
34 Correct 2 ms 7768 KB Output is correct
35 Correct 2 ms 7768 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 26580 KB Output is correct
2 Correct 2 ms 7768 KB Output is correct
3 Correct 49 ms 26316 KB Output is correct
4 Correct 43 ms 25508 KB Output is correct
5 Correct 50 ms 26312 KB Output is correct
6 Correct 48 ms 27004 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 22628 KB Output is correct
2 Correct 61 ms 19700 KB Output is correct
3 Correct 78 ms 19400 KB Output is correct
4 Correct 76 ms 19624 KB Output is correct
5 Correct 59 ms 19540 KB Output is correct
6 Correct 49 ms 22612 KB Output is correct
7 Correct 47 ms 22612 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 22628 KB Output is correct
2 Correct 61 ms 19700 KB Output is correct
3 Correct 78 ms 19400 KB Output is correct
4 Correct 76 ms 19624 KB Output is correct
5 Correct 59 ms 19540 KB Output is correct
6 Correct 49 ms 22612 KB Output is correct
7 Correct 47 ms 22612 KB Output is correct
8 Correct 50 ms 22356 KB Output is correct
9 Correct 51 ms 22356 KB Output is correct
10 Correct 48 ms 25884 KB Output is correct
11 Correct 43 ms 26056 KB Output is correct
12 Correct 52 ms 18768 KB Output is correct
13 Correct 50 ms 18516 KB Output is correct
14 Correct 53 ms 19028 KB Output is correct
15 Correct 56 ms 19112 KB Output is correct
16 Correct 79 ms 19536 KB Output is correct
17 Correct 60 ms 19412 KB Output is correct
18 Correct 55 ms 19540 KB Output is correct
19 Correct 52 ms 20048 KB Output is correct
20 Correct 50 ms 22864 KB Output is correct
21 Correct 53 ms 23052 KB Output is correct
22 Correct 50 ms 22944 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7772 KB Output is correct
2 Correct 4 ms 8284 KB Output is correct
3 Correct 4 ms 8324 KB Output is correct
4 Correct 2 ms 7772 KB Output is correct
5 Correct 2 ms 7772 KB Output is correct
6 Correct 7 ms 8792 KB Output is correct
7 Correct 6 ms 8428 KB Output is correct
8 Correct 4 ms 8284 KB Output is correct
9 Correct 4 ms 8280 KB Output is correct
10 Correct 1 ms 7772 KB Output is correct
11 Correct 2 ms 7772 KB Output is correct
12 Correct 2 ms 7772 KB Output is correct
13 Correct 2 ms 7848 KB Output is correct
14 Correct 2 ms 7772 KB Output is correct
15 Correct 17 ms 9820 KB Output is correct
16 Correct 17 ms 9820 KB Output is correct
17 Correct 17 ms 9884 KB Output is correct
18 Correct 6 ms 8796 KB Output is correct
19 Correct 6 ms 8536 KB Output is correct
20 Correct 23 ms 9972 KB Output is correct
21 Correct 20 ms 9820 KB Output is correct
22 Correct 2 ms 7772 KB Output is correct
23 Correct 5 ms 8420 KB Output is correct
24 Correct 4 ms 8280 KB Output is correct
25 Correct 2 ms 7772 KB Output is correct
26 Correct 2 ms 7772 KB Output is correct
27 Correct 5 ms 8796 KB Output is correct
28 Correct 5 ms 8540 KB Output is correct
29 Correct 4 ms 8520 KB Output is correct
30 Correct 4 ms 8284 KB Output is correct
31 Correct 2 ms 7772 KB Output is correct
32 Correct 2 ms 7772 KB Output is correct
33 Correct 2 ms 7920 KB Output is correct
34 Correct 2 ms 7768 KB Output is correct
35 Correct 2 ms 7768 KB Output is correct
36 Correct 48 ms 26580 KB Output is correct
37 Correct 2 ms 7768 KB Output is correct
38 Correct 49 ms 26316 KB Output is correct
39 Correct 43 ms 25508 KB Output is correct
40 Correct 50 ms 26312 KB Output is correct
41 Correct 48 ms 27004 KB Output is correct
42 Correct 63 ms 22628 KB Output is correct
43 Correct 61 ms 19700 KB Output is correct
44 Correct 78 ms 19400 KB Output is correct
45 Correct 76 ms 19624 KB Output is correct
46 Correct 59 ms 19540 KB Output is correct
47 Correct 49 ms 22612 KB Output is correct
48 Correct 47 ms 22612 KB Output is correct
49 Correct 50 ms 22356 KB Output is correct
50 Correct 51 ms 22356 KB Output is correct
51 Correct 48 ms 25884 KB Output is correct
52 Correct 43 ms 26056 KB Output is correct
53 Correct 52 ms 18768 KB Output is correct
54 Correct 50 ms 18516 KB Output is correct
55 Correct 53 ms 19028 KB Output is correct
56 Correct 56 ms 19112 KB Output is correct
57 Correct 79 ms 19536 KB Output is correct
58 Correct 60 ms 19412 KB Output is correct
59 Correct 55 ms 19540 KB Output is correct
60 Correct 52 ms 20048 KB Output is correct
61 Correct 50 ms 22864 KB Output is correct
62 Correct 53 ms 23052 KB Output is correct
63 Correct 50 ms 22944 KB Output is correct
64 Correct 53 ms 22848 KB Output is correct
65 Correct 69 ms 19540 KB Output is correct
66 Correct 53 ms 19024 KB Output is correct
67 Correct 51 ms 19280 KB Output is correct
68 Correct 36 ms 18264 KB Output is correct
69 Correct 41 ms 18256 KB Output is correct
70 Correct 59 ms 23244 KB Output is correct
71 Correct 75 ms 22224 KB Output is correct
72 Correct 2 ms 7772 KB Output is correct
73 Correct 5 ms 8268 KB Output is correct
74 Correct 5 ms 8296 KB Output is correct
75 Correct 2 ms 7772 KB Output is correct
76 Correct 2 ms 7772 KB Output is correct
77 Correct 5 ms 8796 KB Output is correct
78 Correct 5 ms 8540 KB Output is correct
79 Correct 4 ms 8396 KB Output is correct
80 Correct 5 ms 8444 KB Output is correct
81 Correct 2 ms 7916 KB Output is correct
82 Correct 2 ms 7772 KB Output is correct
83 Correct 2 ms 7772 KB Output is correct
84 Correct 2 ms 7772 KB Output is correct
85 Correct 2 ms 7772 KB Output is correct
86 Correct 17 ms 9724 KB Output is correct
87 Correct 17 ms 9820 KB Output is correct
88 Correct 17 ms 9796 KB Output is correct
89 Correct 5 ms 8792 KB Output is correct
90 Correct 5 ms 8540 KB Output is correct
91 Correct 18 ms 9820 KB Output is correct
92 Correct 20 ms 9724 KB Output is correct
93 Correct 2 ms 7780 KB Output is correct
94 Correct 49 ms 26532 KB Output is correct
95 Correct 53 ms 26316 KB Output is correct
96 Correct 44 ms 25684 KB Output is correct
97 Correct 44 ms 26316 KB Output is correct
98 Correct 49 ms 26832 KB Output is correct
99 Correct 59 ms 19540 KB Output is correct
100 Correct 61 ms 19572 KB Output is correct
101 Correct 62 ms 19532 KB Output is correct
102 Correct 52 ms 19644 KB Output is correct
103 Correct 53 ms 22580 KB Output is correct
104 Correct 52 ms 22988 KB Output is correct
105 Correct 65 ms 22540 KB Output is correct
106 Correct 52 ms 22356 KB Output is correct
107 Correct 48 ms 22364 KB Output is correct
108 Correct 44 ms 26056 KB Output is correct
109 Correct 43 ms 26060 KB Output is correct
110 Correct 42 ms 18640 KB Output is correct
111 Correct 45 ms 18516 KB Output is correct
112 Correct 66 ms 19192 KB Output is correct
113 Correct 50 ms 19020 KB Output is correct