oj.uz

답안 #945764

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
945764 2024-03-14T07:27:07 Z noyancanturk Railway (BOI17_railway) C++17
100 / 100
 82 ms 20680 KB 
#ifndef Local
    #pragma GCC optimize("O3,unroll-loops")
    const int lim=1e5+100;
#else
    const int lim=1e3+3;
#endif

const int lglim=18;
    
#include "bits/stdc++.h"
using namespace std;
    
//#define int int64_t
#define pb push_back
    
const int mod=998244353;
//const int mod=(1ll<<61)-1;

using pii=pair<int,int>;

int n,m,k;
int tin[lim],tout[lim],dep[lim],tt=0;
int lift[lglim][lim];
vector<pii>v[lim];
int pare[lim];

inline void tour(int node,int par){
    tin[node]=tt++;
    dep[node]=dep[par]-1;
    lift[0][node]=par;
    int i=1;
    while(i<lglim&&(lift[i][node]=lift[i-1][lift[i-1][node]]))i++;
    for(auto [j,c]:v[node]){
        if(j^par){
            pare[j]=c;
            tour(j,node);
        }
    }
    tout[node]=tt-1;
}

inline int lca(int x,int y){
    if(dep[y]<dep[x])swap(x,y);
    if(dep[x]<dep[y]){
        for(int i=lglim-1;0<=i;i--){
            if(dep[x]+(1<<i)<=dep[y]){
                x=lift[i][x];
            }
            if(dep[x]==dep[y])break;
        }
    }
    if(x==y)return x;
    for(int i=lglim-1;0<=i;i--){
        if(lift[i][x]^lift[i][y]){
            x=lift[i][x];
            y=lift[i][y];
        }
    }
    return lift[0][x];
}

int val[lim];

vector<int>ans;


inline int dfs(int node,int par){
    for(auto [j,c]:v[node]){
        if(j^par){
            val[node]+=dfs(j,node);
        }
    }
    if(2*k<=val[node]){
        ans.pb(pare[node]);
    }
    return val[node];
}

inline void solve(){
    cin>>n>>m>>k;
    for(int i=1;i<=n-1;i++){
        int x,y;
        cin>>x>>y;
        v[x].pb({y,i});
        v[y].pb({x,i});
    }
    tour(1,0);
    for(int r=0;r<m;r++){
        int s;
        cin>>s;
        vector<int>inds;
        for(int i=0;i<s;i++){
            int tem;
            cin>>tem;
            inds.pb(tem);
        }
        sort(inds.begin(),inds.end(),[&](int i,int j) -> bool {
            return tin[i]<tin[j];
        });
        inds.pb(inds.front());
        for(int i=0;i<s;i++){
            val[inds[i]]++;
            val[inds[i+1]]++;
            val[lca(inds[i],inds[i+1])]-=2;
        }
    }
    dfs(1,0);
    sort(ans.begin(),ans.end());
    cout<<ans.size()<<"\n";
    for(int j:ans)cout<<j<<" ";
}
    
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
#ifdef Local  
    freopen(".in","r",stdin);
    freopen(".out","w",stdout);
#else

#endif
    int t=1;
    //cin>>t;
    while (t--)
    {
        solve();
    }
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4572 KB Output is correct
2 Correct 4 ms 7048 KB Output is correct
3 Correct 4 ms 7260 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 6 ms 9560 KB Output is correct
7 Correct 4 ms 9308 KB Output is correct
8 Correct 4 ms 7132 KB Output is correct
9 Correct 4 ms 7260 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4572 KB Output is correct
2 Correct 4 ms 7048 KB Output is correct
3 Correct 4 ms 7260 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 6 ms 9560 KB Output is correct
7 Correct 4 ms 9308 KB Output is correct
8 Correct 4 ms 7132 KB Output is correct
9 Correct 4 ms 7260 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 14 ms 7516 KB Output is correct
16 Correct 15 ms 7516 KB Output is correct
17 Correct 15 ms 7516 KB Output is correct
18 Correct 5 ms 9308 KB Output is correct
19 Correct 5 ms 9360 KB Output is correct
20 Correct 21 ms 5724 KB Output is correct
21 Correct 18 ms 5464 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 5 ms 7260 KB Output is correct
24 Correct 6 ms 7260 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 5 ms 9308 KB Output is correct
28 Correct 4 ms 9560 KB Output is correct
29 Correct 4 ms 7260 KB Output is correct
30 Correct 5 ms 7140 KB Output is correct
31 Correct 2 ms 6488 KB Output is correct
32 Correct 2 ms 6492 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 3 ms 6492 KB Output is correct
35 Correct 2 ms 6492 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 20268 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 63 ms 19940 KB Output is correct
4 Correct 68 ms 19540 KB Output is correct
5 Correct 67 ms 20396 KB Output is correct
6 Correct 51 ms 20680 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 18264 KB Output is correct
2 Correct 47 ms 15888 KB Output is correct
3 Correct 61 ms 13392 KB Output is correct
4 Correct 49 ms 13336 KB Output is correct
5 Correct 59 ms 13452 KB Output is correct
6 Correct 50 ms 18348 KB Output is correct
7 Correct 49 ms 18104 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 18264 KB Output is correct
2 Correct 47 ms 15888 KB Output is correct
3 Correct 61 ms 13392 KB Output is correct
4 Correct 49 ms 13336 KB Output is correct
5 Correct 59 ms 13452 KB Output is correct
6 Correct 50 ms 18348 KB Output is correct
7 Correct 49 ms 18104 KB Output is correct
8 Correct 55 ms 18252 KB Output is correct
9 Correct 56 ms 18260 KB Output is correct
10 Correct 50 ms 20432 KB Output is correct
11 Correct 60 ms 20328 KB Output is correct
12 Correct 31 ms 13148 KB Output is correct
13 Correct 32 ms 13148 KB Output is correct
14 Correct 45 ms 13392 KB Output is correct
15 Correct 55 ms 13408 KB Output is correct
16 Correct 47 ms 13476 KB Output is correct
17 Correct 49 ms 13472 KB Output is correct
18 Correct 48 ms 13416 KB Output is correct
19 Correct 53 ms 15952 KB Output is correct
20 Correct 50 ms 18516 KB Output is correct
21 Correct 49 ms 18632 KB Output is correct
22 Correct 82 ms 18516 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4572 KB Output is correct
2 Correct 4 ms 7048 KB Output is correct
3 Correct 4 ms 7260 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 6 ms 9560 KB Output is correct
7 Correct 4 ms 9308 KB Output is correct
8 Correct 4 ms 7132 KB Output is correct
9 Correct 4 ms 7260 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 14 ms 7516 KB Output is correct
16 Correct 15 ms 7516 KB Output is correct
17 Correct 15 ms 7516 KB Output is correct
18 Correct 5 ms 9308 KB Output is correct
19 Correct 5 ms 9360 KB Output is correct
20 Correct 21 ms 5724 KB Output is correct
21 Correct 18 ms 5464 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 5 ms 7260 KB Output is correct
24 Correct 6 ms 7260 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 5 ms 9308 KB Output is correct
28 Correct 4 ms 9560 KB Output is correct
29 Correct 4 ms 7260 KB Output is correct
30 Correct 5 ms 7140 KB Output is correct
31 Correct 2 ms 6488 KB Output is correct
32 Correct 2 ms 6492 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 3 ms 6492 KB Output is correct
35 Correct 2 ms 6492 KB Output is correct
36 Correct 65 ms 20268 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct
38 Correct 63 ms 19940 KB Output is correct
39 Correct 68 ms 19540 KB Output is correct
40 Correct 67 ms 20396 KB Output is correct
41 Correct 51 ms 20680 KB Output is correct
42 Correct 52 ms 18264 KB Output is correct
43 Correct 47 ms 15888 KB Output is correct
44 Correct 61 ms 13392 KB Output is correct
45 Correct 49 ms 13336 KB Output is correct
46 Correct 59 ms 13452 KB Output is correct
47 Correct 50 ms 18348 KB Output is correct
48 Correct 49 ms 18104 KB Output is correct
49 Correct 55 ms 18252 KB Output is correct
50 Correct 56 ms 18260 KB Output is correct
51 Correct 50 ms 20432 KB Output is correct
52 Correct 60 ms 20328 KB Output is correct
53 Correct 31 ms 13148 KB Output is correct
54 Correct 32 ms 13148 KB Output is correct
55 Correct 45 ms 13392 KB Output is correct
56 Correct 55 ms 13408 KB Output is correct
57 Correct 47 ms 13476 KB Output is correct
58 Correct 49 ms 13472 KB Output is correct
59 Correct 48 ms 13416 KB Output is correct
60 Correct 53 ms 15952 KB Output is correct
61 Correct 50 ms 18516 KB Output is correct
62 Correct 49 ms 18632 KB Output is correct
63 Correct 82 ms 18516 KB Output is correct
64 Correct 72 ms 18392 KB Output is correct
65 Correct 76 ms 13392 KB Output is correct
66 Correct 50 ms 13324 KB Output is correct
67 Correct 46 ms 13392 KB Output is correct
68 Correct 37 ms 12920 KB Output is correct
69 Correct 41 ms 13100 KB Output is correct
70 Correct 63 ms 18880 KB Output is correct
71 Correct 51 ms 18004 KB Output is correct
72 Correct 1 ms 6492 KB Output is correct
73 Correct 4 ms 7260 KB Output is correct
74 Correct 4 ms 7260 KB Output is correct
75 Correct 3 ms 6488 KB Output is correct
76 Correct 1 ms 6492 KB Output is correct
77 Correct 5 ms 9308 KB Output is correct
78 Correct 5 ms 9304 KB Output is correct
79 Correct 3 ms 5212 KB Output is correct
80 Correct 4 ms 7260 KB Output is correct
81 Correct 2 ms 6492 KB Output is correct
82 Correct 1 ms 6492 KB Output is correct
83 Correct 2 ms 6492 KB Output is correct
84 Correct 1 ms 6492 KB Output is correct
85 Correct 2 ms 6492 KB Output is correct
86 Correct 15 ms 7516 KB Output is correct
87 Correct 15 ms 7660 KB Output is correct
88 Correct 16 ms 7512 KB Output is correct
89 Correct 5 ms 9304 KB Output is correct
90 Correct 5 ms 9308 KB Output is correct
91 Correct 12 ms 5724 KB Output is correct
92 Correct 15 ms 5468 KB Output is correct
93 Correct 1 ms 6492 KB Output is correct
94 Correct 66 ms 20424 KB Output is correct
95 Correct 71 ms 19996 KB Output is correct
96 Correct 58 ms 19548 KB Output is correct
97 Correct 79 ms 20288 KB Output is correct
98 Correct 54 ms 20680 KB Output is correct
99 Correct 52 ms 13392 KB Output is correct
100 Correct 66 ms 13400 KB Output is correct
101 Correct 63 ms 13316 KB Output is correct
102 Correct 49 ms 15768 KB Output is correct
103 Correct 55 ms 18196 KB Output is correct
104 Correct 69 ms 18640 KB Output is correct
105 Correct 47 ms 18256 KB Output is correct
106 Correct 49 ms 18516 KB Output is correct
107 Correct 80 ms 18232 KB Output is correct
108 Correct 47 ms 20428 KB Output is correct
109 Correct 49 ms 20428 KB Output is correct
110 Correct 34 ms 13144 KB Output is correct
111 Correct 32 ms 13184 KB Output is correct
112 Correct 51 ms 13228 KB Output is correct
113 Correct 57 ms 13312 KB Output is correct