oj.uz

Submission #557569

# Submission time Handle Problem Language Result Execution time Memory
557569 2022-05-05T13:14:59 Z krit3379 Railway (BOI17_railway) C++17
100 / 100
 196 ms 41380 KB 
#include<bits/stdc++.h>
using namespace std;
#define N 100005
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

int t[4*N],cnt[N],dep[N],head[N],heavy[N],p[N],id[N],out[N],last[N],sz;
vector<int> v,temp,ans;
bitset<N> vis;
vector<pair<int,int>> g[N];

void dfs(int s,int f){
    int ma=0;
    cnt[s]=1;
    dep[s]=dep[f]+1;
    heavy[s]=-1;
    p[s]=f;
    for(auto [x,i]:g[s]){
        if(x==f)continue;
        out[x]=i;
        dfs(x,s);
        cnt[s]+=cnt[x];
        if(cnt[x]>ma)ma=cnt[x],heavy[s]=x;
    }
}

void hld(int s,int f,int h){
    head[s]=h;
    id[s]=++sz;
    if(heavy[s]!=-1)hld(heavy[s],s,h);
    for(auto [x,i]:g[s]){
        if(x==f||x==heavy[s])continue;
        hld(x,s,x);
    }
    return ;
}

int lca(int a,int b){
    while(head[a]!=head[b]){
        if(dep[head[a]]>dep[head[b]])a=p[head[a]];
        else b=p[head[b]];
    }
    if(dep[a]<dep[b])return a;
    else return b;
}

void push(int x,int l,int r){
    if(t[x]&&l!=r){
        t[x*2]+=t[x];
        t[x*2+1]+=t[x];
        t[x]=0;
    }
}

void upd(int x,int l,int r,int ll,int rr){
    push(x,l,r);
    if(l>rr||ll>r||ll>rr)return ;
    if(ll<=l&&r<=rr){
        t[x]++;
        push(x,l,r);
        return ;
    }
    int mid=(l+r)/2;
    upd(x*2,l,mid,ll,rr);
    upd(x*2+1,mid+1,r,ll,rr);
}

void update(int a,int l){
    while(head[a]!=head[l]){
        upd(1,1,sz,max(id[head[a]],last[head[a]]+1),id[a]);
        last[head[a]]=max(last[head[a]],id[a]);
        if(!vis[head[a]])vis[head[a]]=true,temp.push_back(head[a]);
        a=p[head[a]];
    }
    if(a!=l){
        upd(1,1,sz,max(id[l]+1,last[head[a]]+1),id[a]);
        last[head[a]]=max(last[head[a]],id[a]);
        if(!vis[head[a]])vis[head[a]]=true,temp.push_back(head[a]);
    }
}

int sol(int x,int l,int r,int p){
    push(x,l,r);
    if(l>p||p>r)return 0;
    if(l==r)return t[x];
    int mid=(l+r)/2;
    return sol(x*2,l,mid,p)+sol(x*2+1,mid+1,r,p);
}

int main(){
    int n,m,k,i,a,b,t,x,l;
    scanf("%d %d %d",&n,&m,&k);
    for(i=1;i<n;i++){
        scanf("%d %d",&a,&b);
        g[a].push_back({b,i});
        g[b].push_back({a,i});
    }
    dfs(1,0);
    hld(1,0,1);
    while(m--){
        scanf("%d",&t);
        for(i=1;i<=t;i++)scanf("%d",&x),v.push_back(x);
        l=v[0];
        for(i=1;i<v.size();i++)l=lca(l,v[i]);
        for(auto x:v)update(x,l);
        for(auto x:temp)last[x]=0,vis[x]=false;
        v.clear();
        temp.clear();
    }
    for(i=1;i<=n;i++)if(sol(1,1,n,id[i])>=k)ans.push_back(out[i]);
    sort(ans.begin(),ans.end());
    printf("%d\n",ans.size());
    for(auto x:ans)printf("%d ",x);
    return 0;
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:104:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |         for(i=1;i<v.size();i++)l=lca(l,v[i]);
      |                 ~^~~~~~~~~
railway.cpp:112:14: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wformat=]
  112 |     printf("%d\n",ans.size());
      |             ~^    ~~~~~~~~~~
      |              |            |
      |              int          std::vector<int>::size_type {aka long unsigned int}
      |             %ld
railway.cpp:92:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   92 |     scanf("%d %d %d",&n,&m,&k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~
railway.cpp:94:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |         scanf("%d %d",&a,&b);
      |         ~~~~~^~~~~~~~~~~~~~~
railway.cpp:101:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  101 |         scanf("%d",&t);
      |         ~~~~~^~~~~~~~~
railway.cpp:102:31: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |         for(i=1;i<=t;i++)scanf("%d",&x),v.push_back(x);
      |                          ~~~~~^~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 7 ms 3412 KB Output is correct
3 Correct 7 ms 3500 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 9 ms 4948 KB Output is correct
7 Correct 8 ms 3796 KB Output is correct
8 Correct 7 ms 3412 KB Output is correct
9 Correct 7 ms 3412 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 7 ms 3412 KB Output is correct
3 Correct 7 ms 3500 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 9 ms 4948 KB Output is correct
7 Correct 8 ms 3796 KB Output is correct
8 Correct 7 ms 3412 KB Output is correct
9 Correct 7 ms 3412 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 37 ms 3500 KB Output is correct
16 Correct 37 ms 3460 KB Output is correct
17 Correct 36 ms 3496 KB Output is correct
18 Correct 9 ms 4992 KB Output is correct
19 Correct 9 ms 3796 KB Output is correct
20 Correct 32 ms 3508 KB Output is correct
21 Correct 43 ms 3480 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 8 ms 3500 KB Output is correct
24 Correct 7 ms 3496 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 1 ms 2644 KB Output is correct
27 Correct 9 ms 4948 KB Output is correct
28 Correct 8 ms 3804 KB Output is correct
29 Correct 7 ms 3524 KB Output is correct
30 Correct 7 ms 3412 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 1 ms 2644 KB Output is correct
33 Correct 1 ms 2644 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 40128 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 111 ms 40816 KB Output is correct
4 Correct 101 ms 40256 KB Output is correct
5 Correct 122 ms 41176 KB Output is correct
6 Correct 131 ms 41380 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 24520 KB Output is correct
2 Correct 117 ms 11068 KB Output is correct
3 Correct 137 ms 9792 KB Output is correct
4 Correct 168 ms 10100 KB Output is correct
5 Correct 146 ms 10060 KB Output is correct
6 Correct 99 ms 24592 KB Output is correct
7 Correct 103 ms 24348 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 24520 KB Output is correct
2 Correct 117 ms 11068 KB Output is correct
3 Correct 137 ms 9792 KB Output is correct
4 Correct 168 ms 10100 KB Output is correct
5 Correct 146 ms 10060 KB Output is correct
6 Correct 99 ms 24592 KB Output is correct
7 Correct 103 ms 24348 KB Output is correct
8 Correct 104 ms 25228 KB Output is correct
9 Correct 115 ms 26204 KB Output is correct
10 Correct 111 ms 41328 KB Output is correct
11 Correct 116 ms 41288 KB Output is correct
12 Correct 85 ms 11424 KB Output is correct
13 Correct 83 ms 11456 KB Output is correct
14 Correct 141 ms 11236 KB Output is correct
15 Correct 138 ms 11368 KB Output is correct
16 Correct 170 ms 11264 KB Output is correct
17 Correct 167 ms 11072 KB Output is correct
18 Correct 149 ms 10844 KB Output is correct
19 Correct 120 ms 12008 KB Output is correct
20 Correct 107 ms 26004 KB Output is correct
21 Correct 108 ms 25960 KB Output is correct
22 Correct 106 ms 25984 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 7 ms 3412 KB Output is correct
3 Correct 7 ms 3500 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 9 ms 4948 KB Output is correct
7 Correct 8 ms 3796 KB Output is correct
8 Correct 7 ms 3412 KB Output is correct
9 Correct 7 ms 3412 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 37 ms 3500 KB Output is correct
16 Correct 37 ms 3460 KB Output is correct
17 Correct 36 ms 3496 KB Output is correct
18 Correct 9 ms 4992 KB Output is correct
19 Correct 9 ms 3796 KB Output is correct
20 Correct 32 ms 3508 KB Output is correct
21 Correct 43 ms 3480 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 8 ms 3500 KB Output is correct
24 Correct 7 ms 3496 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 1 ms 2644 KB Output is correct
27 Correct 9 ms 4948 KB Output is correct
28 Correct 8 ms 3804 KB Output is correct
29 Correct 7 ms 3524 KB Output is correct
30 Correct 7 ms 3412 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 1 ms 2644 KB Output is correct
33 Correct 1 ms 2644 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 114 ms 40128 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 111 ms 40816 KB Output is correct
39 Correct 101 ms 40256 KB Output is correct
40 Correct 122 ms 41176 KB Output is correct
41 Correct 131 ms 41380 KB Output is correct
42 Correct 103 ms 24520 KB Output is correct
43 Correct 117 ms 11068 KB Output is correct
44 Correct 137 ms 9792 KB Output is correct
45 Correct 168 ms 10100 KB Output is correct
46 Correct 146 ms 10060 KB Output is correct
47 Correct 99 ms 24592 KB Output is correct
48 Correct 103 ms 24348 KB Output is correct
49 Correct 104 ms 25228 KB Output is correct
50 Correct 115 ms 26204 KB Output is correct
51 Correct 111 ms 41328 KB Output is correct
52 Correct 116 ms 41288 KB Output is correct
53 Correct 85 ms 11424 KB Output is correct
54 Correct 83 ms 11456 KB Output is correct
55 Correct 141 ms 11236 KB Output is correct
56 Correct 138 ms 11368 KB Output is correct
57 Correct 170 ms 11264 KB Output is correct
58 Correct 167 ms 11072 KB Output is correct
59 Correct 149 ms 10844 KB Output is correct
60 Correct 120 ms 12008 KB Output is correct
61 Correct 107 ms 26004 KB Output is correct
62 Correct 108 ms 25960 KB Output is correct
63 Correct 106 ms 25984 KB Output is correct
64 Correct 104 ms 26268 KB Output is correct
65 Correct 196 ms 11536 KB Output is correct
66 Correct 180 ms 11424 KB Output is correct
67 Correct 152 ms 11512 KB Output is correct
68 Correct 80 ms 11640 KB Output is correct
69 Correct 88 ms 11624 KB Output is correct
70 Correct 141 ms 26656 KB Output is correct
71 Correct 108 ms 26068 KB Output is correct
72 Correct 2 ms 2664 KB Output is correct
73 Correct 8 ms 3572 KB Output is correct
74 Correct 7 ms 3540 KB Output is correct
75 Correct 2 ms 2644 KB Output is correct
76 Correct 2 ms 2644 KB Output is correct
77 Correct 8 ms 5076 KB Output is correct
78 Correct 8 ms 3924 KB Output is correct
79 Correct 9 ms 3588 KB Output is correct
80 Correct 8 ms 3540 KB Output is correct
81 Correct 2 ms 2644 KB Output is correct
82 Correct 2 ms 2644 KB Output is correct
83 Correct 2 ms 2644 KB Output is correct
84 Correct 2 ms 2644 KB Output is correct
85 Correct 1 ms 2644 KB Output is correct
86 Correct 37 ms 3872 KB Output is correct
87 Correct 36 ms 3948 KB Output is correct
88 Correct 37 ms 3988 KB Output is correct
89 Correct 9 ms 5076 KB Output is correct
90 Correct 8 ms 3908 KB Output is correct
91 Correct 30 ms 4004 KB Output is correct
92 Correct 34 ms 3992 KB Output is correct
93 Correct 2 ms 2644 KB Output is correct
94 Correct 134 ms 41152 KB Output is correct
95 Correct 107 ms 40784 KB Output is correct
96 Correct 118 ms 40248 KB Output is correct
97 Correct 125 ms 41152 KB Output is correct
98 Correct 147 ms 41364 KB Output is correct
99 Correct 165 ms 11084 KB Output is correct
100 Correct 187 ms 10944 KB Output is correct
101 Correct 179 ms 11088 KB Output is correct
102 Correct 121 ms 11980 KB Output is correct
103 Correct 101 ms 25268 KB Output is correct
104 Correct 109 ms 25980 KB Output is correct
105 Correct 105 ms 25420 KB Output is correct
106 Correct 106 ms 26452 KB Output is correct
107 Correct 106 ms 26224 KB Output is correct
108 Correct 133 ms 41312 KB Output is correct
109 Correct 121 ms 41296 KB Output is correct
110 Correct 82 ms 11468 KB Output is correct
111 Correct 78 ms 11468 KB Output is correct
112 Correct 152 ms 11208 KB Output is correct
113 Correct 135 ms 11232 KB Output is correct