oj.uz

답안 #239538

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
239538 2020-06-16T08:31:17 Z dsjong Railway (BOI17_railway) C++14
100 / 100
 241 ms 37620 KB 
#include <bits/stdc++.h>
using namespace std;
vector<int>adj[200005];
int ind[200005], tim[200005];
int dep[200005];
int a[200005];  //actual rmq array (corresponding depths of tour vector)
vector<int>tour;
int timer=0;
void dfs(int i,int p){
    tim[i]=timer++;
    if(!dep[i]) dep[i]=dep[p]+1;
    ind[i]=tour.size();
    tour.push_back(i);
    for(int j:adj[i]){
        if(j!=p){
            dfs(j,i);
            tour.push_back(i);
        }
    }
}
int st[200005][20];
void build(int n){
    for(int i=0;i<n;i++){
        st[i][0]=i;
    }
    for(int j=1;(1<<j)<=n;j++){
        for(int i=0;i+(1<<j)<=n;i++){
            if(a[st[i][j-1]]>a[st[i+(1<<(j-1))][j-1]]){
                st[i][j]=st[i+(1<<(j-1))][j-1];
            }
            else{
                st[i][j]=st[i][j-1];
            }
        }
    }
}
int query(int l,int r){
    int j=(int)log2(r-l+1);
    if(a[st[l][j]]<a[st[r-(1<<j)+1][j]]){
        return st[l][j];
    }
    return st[r-(1<<j)+1][j];
}
int lca(int x,int y){
    if(ind[x]>ind[y]) swap(x,y);
    return tour[query(ind[x],ind[y])];
}
bool cmp(int x, int y){
    return tim[x]<tim[y];
}
int cnt[200005];
void go(int x, int p){
    for(int y:adj[x]){
        if(y==p) continue;
        go(y, x);
        cnt[x]+=cnt[y];
    }
}
vector<pair<int, int>>edges;
int main(){
    int n, m, k;
    cin>>n>>m>>k;
    for(int i=1;i<n;i++){
        int x, y;
        cin>>x>>y;
        adj[x].push_back(y);
        adj[y].push_back(x);
        edges.push_back({x, y});
    }
    dfs(1, 0);
    for(int i=0;i<tour.size();i++){
        a[i]=dep[tour[i]];
    }
    build(tour.size());
    for(int i=1;i<=m;i++){
        int s;
        cin>>s;
        vector<int>v;
        for(int j=0;j<s;j++){
            int x;
            cin>>x;
            v.push_back(x);
        }
        sort(v.begin(), v.end(), cmp);
        for(int i=0;i<s;i++){
            int u=v[i], t=v[(i+1)%s];
            //cout<<u<<" "<<t<<" "<<lca(u, t)<<endl;
            cnt[u]++;
            cnt[t]++;
            cnt[lca(u, t)]-=2;
        }
        //cout<<endl;
    }
    go(1, 0);
    vector<int>ans;
    for(int i=0;i<n-1;i++){
        int x=edges[i].first, y=edges[i].second;
        if(dep[x]<dep[y]) swap(x, y);
        //cout<<x<<" "<<y<<" "<<cnt[x]<<endl;
        if(cnt[x]>=2*k) ans.push_back(i+1);
    }
    cout<<ans.size()<<"\n";
    for(int i:ans) cout<<i<<" ";
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:71:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<tour.size();i++){
                 ~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 20 ms 7552 KB Output is correct
3 Correct 19 ms 7552 KB Output is correct
4 Correct 7 ms 5120 KB Output is correct
5 Correct 8 ms 4992 KB Output is correct
6 Correct 20 ms 7936 KB Output is correct
7 Correct 19 ms 7680 KB Output is correct
8 Correct 17 ms 7552 KB Output is correct
9 Correct 18 ms 7680 KB Output is correct
10 Correct 7 ms 4864 KB Output is correct
11 Correct 7 ms 4992 KB Output is correct
12 Correct 7 ms 5120 KB Output is correct
13 Correct 8 ms 5120 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 20 ms 7552 KB Output is correct
3 Correct 19 ms 7552 KB Output is correct
4 Correct 7 ms 5120 KB Output is correct
5 Correct 8 ms 4992 KB Output is correct
6 Correct 20 ms 7936 KB Output is correct
7 Correct 19 ms 7680 KB Output is correct
8 Correct 17 ms 7552 KB Output is correct
9 Correct 18 ms 7680 KB Output is correct
10 Correct 7 ms 4864 KB Output is correct
11 Correct 7 ms 4992 KB Output is correct
12 Correct 7 ms 5120 KB Output is correct
13 Correct 8 ms 5120 KB Output is correct
14 Correct 7 ms 4992 KB Output is correct
15 Correct 58 ms 7900 KB Output is correct
16 Correct 61 ms 7936 KB Output is correct
17 Correct 61 ms 8056 KB Output is correct
18 Correct 22 ms 7936 KB Output is correct
19 Correct 20 ms 7672 KB Output is correct
20 Correct 69 ms 8064 KB Output is correct
21 Correct 74 ms 8184 KB Output is correct
22 Correct 8 ms 5120 KB Output is correct
23 Correct 20 ms 7552 KB Output is correct
24 Correct 19 ms 7552 KB Output is correct
25 Correct 7 ms 4992 KB Output is correct
26 Correct 8 ms 4992 KB Output is correct
27 Correct 20 ms 7936 KB Output is correct
28 Correct 19 ms 7680 KB Output is correct
29 Correct 17 ms 7552 KB Output is correct
30 Correct 18 ms 7680 KB Output is correct
31 Correct 7 ms 4992 KB Output is correct
32 Correct 7 ms 4992 KB Output is correct
33 Correct 7 ms 5120 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 223 ms 36968 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 224 ms 36584 KB Output is correct
4 Correct 213 ms 35944 KB Output is correct
5 Correct 225 ms 37100 KB Output is correct
6 Correct 236 ms 37620 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 209 ms 32748 KB Output is correct
2 Correct 221 ms 30056 KB Output is correct
3 Correct 228 ms 29928 KB Output is correct
4 Correct 217 ms 29800 KB Output is correct
5 Correct 223 ms 29944 KB Output is correct
6 Correct 214 ms 33092 KB Output is correct
7 Correct 206 ms 32868 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 209 ms 32748 KB Output is correct
2 Correct 221 ms 30056 KB Output is correct
3 Correct 228 ms 29928 KB Output is correct
4 Correct 217 ms 29800 KB Output is correct
5 Correct 223 ms 29944 KB Output is correct
6 Correct 214 ms 33092 KB Output is correct
7 Correct 206 ms 32868 KB Output is correct
8 Correct 217 ms 33012 KB Output is correct
9 Correct 214 ms 33012 KB Output is correct
10 Correct 210 ms 37224 KB Output is correct
11 Correct 212 ms 37100 KB Output is correct
12 Correct 194 ms 29804 KB Output is correct
13 Correct 189 ms 29672 KB Output is correct
14 Correct 216 ms 29836 KB Output is correct
15 Correct 210 ms 29800 KB Output is correct
16 Correct 221 ms 29808 KB Output is correct
17 Correct 219 ms 29800 KB Output is correct
18 Correct 216 ms 29924 KB Output is correct
19 Correct 215 ms 30036 KB Output is correct
20 Correct 212 ms 33140 KB Output is correct
21 Correct 217 ms 33372 KB Output is correct
22 Correct 211 ms 33124 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 20 ms 7552 KB Output is correct
3 Correct 19 ms 7552 KB Output is correct
4 Correct 7 ms 5120 KB Output is correct
5 Correct 8 ms 4992 KB Output is correct
6 Correct 20 ms 7936 KB Output is correct
7 Correct 19 ms 7680 KB Output is correct
8 Correct 17 ms 7552 KB Output is correct
9 Correct 18 ms 7680 KB Output is correct
10 Correct 7 ms 4864 KB Output is correct
11 Correct 7 ms 4992 KB Output is correct
12 Correct 7 ms 5120 KB Output is correct
13 Correct 8 ms 5120 KB Output is correct
14 Correct 7 ms 4992 KB Output is correct
15 Correct 58 ms 7900 KB Output is correct
16 Correct 61 ms 7936 KB Output is correct
17 Correct 61 ms 8056 KB Output is correct
18 Correct 22 ms 7936 KB Output is correct
19 Correct 20 ms 7672 KB Output is correct
20 Correct 69 ms 8064 KB Output is correct
21 Correct 74 ms 8184 KB Output is correct
22 Correct 8 ms 5120 KB Output is correct
23 Correct 20 ms 7552 KB Output is correct
24 Correct 19 ms 7552 KB Output is correct
25 Correct 7 ms 4992 KB Output is correct
26 Correct 8 ms 4992 KB Output is correct
27 Correct 20 ms 7936 KB Output is correct
28 Correct 19 ms 7680 KB Output is correct
29 Correct 17 ms 7552 KB Output is correct
30 Correct 18 ms 7680 KB Output is correct
31 Correct 7 ms 4992 KB Output is correct
32 Correct 7 ms 4992 KB Output is correct
33 Correct 7 ms 5120 KB Output is correct
34 Correct 7 ms 4992 KB Output is correct
35 Correct 7 ms 4992 KB Output is correct
36 Correct 223 ms 36968 KB Output is correct
37 Correct 7 ms 5120 KB Output is correct
38 Correct 224 ms 36584 KB Output is correct
39 Correct 213 ms 35944 KB Output is correct
40 Correct 225 ms 37100 KB Output is correct
41 Correct 236 ms 37620 KB Output is correct
42 Correct 209 ms 32748 KB Output is correct
43 Correct 221 ms 30056 KB Output is correct
44 Correct 228 ms 29928 KB Output is correct
45 Correct 217 ms 29800 KB Output is correct
46 Correct 223 ms 29944 KB Output is correct
47 Correct 214 ms 33092 KB Output is correct
48 Correct 206 ms 32868 KB Output is correct
49 Correct 217 ms 33012 KB Output is correct
50 Correct 214 ms 33012 KB Output is correct
51 Correct 210 ms 37224 KB Output is correct
52 Correct 212 ms 37100 KB Output is correct
53 Correct 194 ms 29804 KB Output is correct
54 Correct 189 ms 29672 KB Output is correct
55 Correct 216 ms 29836 KB Output is correct
56 Correct 210 ms 29800 KB Output is correct
57 Correct 221 ms 29808 KB Output is correct
58 Correct 219 ms 29800 KB Output is correct
59 Correct 216 ms 29924 KB Output is correct
60 Correct 215 ms 30036 KB Output is correct
61 Correct 212 ms 33140 KB Output is correct
62 Correct 217 ms 33372 KB Output is correct
63 Correct 211 ms 33124 KB Output is correct
64 Correct 221 ms 33004 KB Output is correct
65 Correct 231 ms 29796 KB Output is correct
66 Correct 219 ms 29672 KB Output is correct
67 Correct 226 ms 29804 KB Output is correct
68 Correct 171 ms 29700 KB Output is correct
69 Correct 165 ms 29544 KB Output is correct
70 Correct 220 ms 33576 KB Output is correct
71 Correct 214 ms 32872 KB Output is correct
72 Correct 7 ms 5120 KB Output is correct
73 Correct 19 ms 7552 KB Output is correct
74 Correct 18 ms 7552 KB Output is correct
75 Correct 7 ms 4992 KB Output is correct
76 Correct 7 ms 4992 KB Output is correct
77 Correct 22 ms 7936 KB Output is correct
78 Correct 18 ms 7680 KB Output is correct
79 Correct 16 ms 7544 KB Output is correct
80 Correct 17 ms 7552 KB Output is correct
81 Correct 7 ms 5120 KB Output is correct
82 Correct 8 ms 4992 KB Output is correct
83 Correct 7 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 56 ms 7936 KB Output is correct
87 Correct 56 ms 7928 KB Output is correct
88 Correct 58 ms 8056 KB Output is correct
89 Correct 20 ms 7936 KB Output is correct
90 Correct 19 ms 7680 KB Output is correct
91 Correct 63 ms 8056 KB Output is correct
92 Correct 76 ms 8056 KB Output is correct
93 Correct 7 ms 4992 KB Output is correct
94 Correct 223 ms 37096 KB Output is correct
95 Correct 218 ms 36584 KB Output is correct
96 Correct 217 ms 35944 KB Output is correct
97 Correct 231 ms 37104 KB Output is correct
98 Correct 236 ms 37604 KB Output is correct
99 Correct 226 ms 29956 KB Output is correct
100 Correct 224 ms 29796 KB Output is correct
101 Correct 241 ms 29824 KB Output is correct
102 Correct 219 ms 30184 KB Output is correct
103 Correct 207 ms 32876 KB Output is correct
104 Correct 217 ms 33252 KB Output is correct
105 Correct 217 ms 33004 KB Output is correct
106 Correct 218 ms 33000 KB Output is correct
107 Correct 217 ms 33012 KB Output is correct
108 Correct 218 ms 37360 KB Output is correct
109 Correct 218 ms 37228 KB Output is correct
110 Correct 195 ms 29676 KB Output is correct
111 Correct 202 ms 29808 KB Output is correct
112 Correct 224 ms 29676 KB Output is correct
113 Correct 226 ms 29800 KB Output is correct