oj.uz

Submission #945809

# Submission time Handle Problem Language Result Execution time Memory
945809 2024-03-14T07:53:45 Z noyancanturk Railway (BOI17_railway) C++17
100 / 100
 36 ms 20736 KB 
#ifndef Local
    #pragma GCC optimize("O3,unroll-loops")
    const int lim=1e5+100;
#else
    const int lim=1e5+3;
#endif

const int lglim=17;
    
#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>;

struct inpout{
    static const int sz=1<<15;
    char inp[sz];
    int curc=0,len=0;
    inline char gc(){
        if(curc==len){
            len=(int)fread(inp,1,sz,stdin);
            curc=0;
            if(!len)return -1;
        }
        return inp[curc++];
    }
    inline void readstr(char*c,int ll){
        for(int i=0;i<ll;i++){
            c[i]=gc();
        }
        gc();
    }
    inline int readuint(){
        int ans=0;
        char c=gc();
        while('0'<=c&&c<='9'){
            ans=10*ans+c-'0';
            c=gc();
        }
        return ans;
    }
    inline int readint(){
        char c=gc();
        bool isneg=(c=='-');
        int ans=0;
        if(!isneg)ans=c-'0';
        c=gc();
        while('0'<=c&&c<='9'){
            ans=10*ans+c-'0';
            c=gc();
        }
        if(isneg)return -ans;
        return ans;
    }
    char out[sz];
    int curind=0;
    inline void flush(){
        fwrite(out,1,curind,stdout);
        curind=0;
    }
    inline void putchar(char c){
        out[curind++]=c;
        if(curind==sz)flush();
    }
    char temp[10];
    inline void putint(int i){
        if(i<0){
            putchar('-');
            i=-i;
        }
        int lll=0;
        while(i){
            temp[lll++]=(i%10)+'0';
            i/=10;
        }
        while(lll){
            putchar(temp[--lll]);
        }
        putchar('\n');
    }
}io;

int n,m,k;
int tin[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;
    for(int i=1;i<lglim;i++){
        if(!(lift[i][node]=lift[i-1][lift[i-1][node]]))break;
    }
    for(auto [j,c]:v[node]){
        if(j^par){
            pare[j]=c;
            tour(j,node);
        }
    }
}

int lgll[lim];

inline int lca(int x,int y){
    if(dep[y]<dep[x])swap(x,y);
    int dif=dep[y]-dep[x];
    while(dif){
        int lll=lgll[dif&-dif];
        dif-=1<<lll;
        x=lift[lll][x];
    }
    if(x==y)return x;
    for(int i=lgll[-dep[x]];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];
bool can[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]){
        can[pare[node]]=1;
    }
    return val[node];
}

inline void solve(){
    lgll[1]=0;
    for(int i=2;i<lim;i++){
        lgll[i]=lgll[i/2]+1;
    }
    n=io.readuint(),m=io.readuint(),k=io.readuint();
    for(int i=1;i<=n-1;i++){
        int x=io.readuint(),y=io.readuint();
        v[x].pb({y,i});
        v[y].pb({x,i});
    }
    tour(1,0);
    int inds[n+1];
    for(int r=0;r<m;r++){
        int s;
        s=io.readuint();
        for(int i=0;i<s;i++){
            inds[i]=io.readuint();
        }
        sort(inds,inds+s,[&](int i,int j) -> bool {
            return tin[i]<tin[j];
        });
        inds[s]=inds[0];
        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);
    int cnt=0;
    for(int i=0;i<n;i++){
        if(can[i])cnt++;
    }
    cout<<cnt<<"\n";
    for(int i=0;i<n;i++)if(can[i])cout<<i<<" ";
}
    
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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 3 ms 7260 KB Output is correct
3 Correct 3 ms 7260 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 3 ms 9560 KB Output is correct
7 Correct 3 ms 9304 KB Output is correct
8 Correct 3 ms 7256 KB Output is correct
9 Correct 2 ms 7256 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6624 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 3 ms 7260 KB Output is correct
3 Correct 3 ms 7260 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 3 ms 9560 KB Output is correct
7 Correct 3 ms 9304 KB Output is correct
8 Correct 3 ms 7256 KB Output is correct
9 Correct 2 ms 7256 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6624 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 8 ms 7768 KB Output is correct
16 Correct 8 ms 7516 KB Output is correct
17 Correct 8 ms 7516 KB Output is correct
18 Correct 3 ms 9564 KB Output is correct
19 Correct 3 ms 9308 KB Output is correct
20 Correct 4 ms 5720 KB Output is correct
21 Correct 6 ms 7772 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 3 ms 7260 KB Output is correct
24 Correct 3 ms 7224 KB Output is correct
25 Correct 1 ms 6584 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 3 ms 9504 KB Output is correct
28 Correct 3 ms 9308 KB Output is correct
29 Correct 2 ms 7256 KB Output is correct
30 Correct 2 ms 7260 KB Output is correct
31 Correct 1 ms 6492 KB Output is correct
32 Correct 1 ms 6488 KB Output is correct
33 Correct 1 ms 6488 KB Output is correct
34 Correct 2 ms 6492 KB Output is correct
35 Correct 2 ms 6492 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 20308 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 28 ms 20048 KB Output is correct
4 Correct 27 ms 19776 KB Output is correct
5 Correct 28 ms 20308 KB Output is correct
6 Correct 28 ms 20736 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 18512 KB Output is correct
2 Correct 35 ms 16260 KB Output is correct
3 Correct 28 ms 13436 KB Output is correct
4 Correct 22 ms 13404 KB Output is correct
5 Correct 23 ms 13396 KB Output is correct
6 Correct 29 ms 18712 KB Output is correct
7 Correct 27 ms 18524 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 18512 KB Output is correct
2 Correct 35 ms 16260 KB Output is correct
3 Correct 28 ms 13436 KB Output is correct
4 Correct 22 ms 13404 KB Output is correct
5 Correct 23 ms 13396 KB Output is correct
6 Correct 29 ms 18712 KB Output is correct
7 Correct 27 ms 18524 KB Output is correct
8 Correct 33 ms 18516 KB Output is correct
9 Correct 28 ms 18612 KB Output is correct
10 Correct 27 ms 20316 KB Output is correct
11 Correct 26 ms 20316 KB Output is correct
12 Correct 16 ms 13148 KB Output is correct
13 Correct 18 ms 13196 KB Output is correct
14 Correct 24 ms 13140 KB Output is correct
15 Correct 28 ms 13148 KB Output is correct
16 Correct 22 ms 13400 KB Output is correct
17 Correct 24 ms 13176 KB Output is correct
18 Correct 26 ms 13436 KB Output is correct
19 Correct 32 ms 16300 KB Output is correct
20 Correct 26 ms 18768 KB Output is correct
21 Correct 31 ms 18984 KB Output is correct
22 Correct 31 ms 18772 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 3 ms 7260 KB Output is correct
3 Correct 3 ms 7260 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 3 ms 9560 KB Output is correct
7 Correct 3 ms 9304 KB Output is correct
8 Correct 3 ms 7256 KB Output is correct
9 Correct 2 ms 7256 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6624 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 8 ms 7768 KB Output is correct
16 Correct 8 ms 7516 KB Output is correct
17 Correct 8 ms 7516 KB Output is correct
18 Correct 3 ms 9564 KB Output is correct
19 Correct 3 ms 9308 KB Output is correct
20 Correct 4 ms 5720 KB Output is correct
21 Correct 6 ms 7772 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 3 ms 7260 KB Output is correct
24 Correct 3 ms 7224 KB Output is correct
25 Correct 1 ms 6584 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 3 ms 9504 KB Output is correct
28 Correct 3 ms 9308 KB Output is correct
29 Correct 2 ms 7256 KB Output is correct
30 Correct 2 ms 7260 KB Output is correct
31 Correct 1 ms 6492 KB Output is correct
32 Correct 1 ms 6488 KB Output is correct
33 Correct 1 ms 6488 KB Output is correct
34 Correct 2 ms 6492 KB Output is correct
35 Correct 2 ms 6492 KB Output is correct
36 Correct 30 ms 20308 KB Output is correct
37 Correct 1 ms 6488 KB Output is correct
38 Correct 28 ms 20048 KB Output is correct
39 Correct 27 ms 19776 KB Output is correct
40 Correct 28 ms 20308 KB Output is correct
41 Correct 28 ms 20736 KB Output is correct
42 Correct 25 ms 18512 KB Output is correct
43 Correct 35 ms 16260 KB Output is correct
44 Correct 28 ms 13436 KB Output is correct
45 Correct 22 ms 13404 KB Output is correct
46 Correct 23 ms 13396 KB Output is correct
47 Correct 29 ms 18712 KB Output is correct
48 Correct 27 ms 18524 KB Output is correct
49 Correct 33 ms 18516 KB Output is correct
50 Correct 28 ms 18612 KB Output is correct
51 Correct 27 ms 20316 KB Output is correct
52 Correct 26 ms 20316 KB Output is correct
53 Correct 16 ms 13148 KB Output is correct
54 Correct 18 ms 13196 KB Output is correct
55 Correct 24 ms 13140 KB Output is correct
56 Correct 28 ms 13148 KB Output is correct
57 Correct 22 ms 13400 KB Output is correct
58 Correct 24 ms 13176 KB Output is correct
59 Correct 26 ms 13436 KB Output is correct
60 Correct 32 ms 16300 KB Output is correct
61 Correct 26 ms 18768 KB Output is correct
62 Correct 31 ms 18984 KB Output is correct
63 Correct 31 ms 18772 KB Output is correct
64 Correct 36 ms 18672 KB Output is correct
65 Correct 31 ms 13392 KB Output is correct
66 Correct 26 ms 13148 KB Output is correct
67 Correct 26 ms 13340 KB Output is correct
68 Correct 18 ms 13400 KB Output is correct
69 Correct 16 ms 13148 KB Output is correct
70 Correct 30 ms 19036 KB Output is correct
71 Correct 31 ms 18612 KB Output is correct
72 Correct 1 ms 6488 KB Output is correct
73 Correct 4 ms 7260 KB Output is correct
74 Correct 3 ms 7260 KB Output is correct
75 Correct 1 ms 6488 KB Output is correct
76 Correct 2 ms 6628 KB Output is correct
77 Correct 3 ms 9564 KB Output is correct
78 Correct 4 ms 9308 KB Output is correct
79 Correct 3 ms 7256 KB Output is correct
80 Correct 2 ms 7260 KB Output is correct
81 Correct 2 ms 6492 KB Output is correct
82 Correct 2 ms 6492 KB Output is correct
83 Correct 2 ms 6628 KB Output is correct
84 Correct 2 ms 6492 KB Output is correct
85 Correct 2 ms 6492 KB Output is correct
86 Correct 8 ms 7456 KB Output is correct
87 Correct 8 ms 7512 KB Output is correct
88 Correct 8 ms 7516 KB Output is correct
89 Correct 3 ms 9500 KB Output is correct
90 Correct 3 ms 9308 KB Output is correct
91 Correct 4 ms 5552 KB Output is correct
92 Correct 6 ms 7768 KB Output is correct
93 Correct 2 ms 6488 KB Output is correct
94 Correct 30 ms 20420 KB Output is correct
95 Correct 29 ms 19992 KB Output is correct
96 Correct 33 ms 19700 KB Output is correct
97 Correct 28 ms 20308 KB Output is correct
98 Correct 27 ms 20572 KB Output is correct
99 Correct 32 ms 13412 KB Output is correct
100 Correct 24 ms 13404 KB Output is correct
101 Correct 22 ms 13396 KB Output is correct
102 Correct 26 ms 16220 KB Output is correct
103 Correct 25 ms 18524 KB Output is correct
104 Correct 26 ms 18804 KB Output is correct
105 Correct 24 ms 18516 KB Output is correct
106 Correct 31 ms 18768 KB Output is correct
107 Correct 29 ms 18516 KB Output is correct
108 Correct 28 ms 20316 KB Output is correct
109 Correct 30 ms 20428 KB Output is correct
110 Correct 19 ms 13148 KB Output is correct
111 Correct 16 ms 13400 KB Output is correct
112 Correct 28 ms 13136 KB Output is correct
113 Correct 26 ms 13148 KB Output is correct