oj.uz

Submission #890459

# Submission time Handle Problem Language Result Execution time Memory
890459 2023-12-21T09:43:51 Z zeta7532 Railway (BOI17_railway) C++17
100 / 100
 156 ms 38728 KB 
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
const ll mod = 998244353;
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<n;i++)
#define all(x) x.begin(),x.end()
#define faster ios::sync_with_stdio(false);cin.tie(nullptr)

using Graph = vector<vector<ll>>;

struct LCA{
    vector<vector<ll>> par;
    vector<ll> dis;
    LCA(const Graph &G,ll root=0){init (G,root);}
    void init(const Graph &G,ll root=0){
        ll v=G.size();
        ll k=1;
        while((1<<k)<v) k++;
        par.assign(k,vector<ll>(v,-1));
        dis.assign(v,-1);
        dfs(G,root,-1,0);
        for(ll i=0;i+1<k;i++){
            for(ll j=0;j<v;j++){
                if(par[i][j]<0) par[i+1][j]=-1;
                else par[i+1][j]=par[i][par[i][j]];
            }
        }
    }
    void dfs(const Graph &G,ll v,ll p,ll d){
        par[0][v]=p;
        dis[v]=d;
        for(ll nv:G[v]){
            if(nv!=p) dfs(G,nv,v,d+1);
        }
    }
    ll query(ll u,ll v){
        if(dis[u]<dis[v]) swap(u,v);
        ll K=par.size();
        for(ll k=0;k<K;k++){
            if((dis[u]-dis[v])>>k&1){
                u=par[k][u];
            }
        }
        if(u==v) return u;
        for(ll k=K-1;k>=0;k--){
            if(par[k][u]!=par[k][v]){
                u=par[k][u];
                v=par[k][v];
            }
        }
        return par[0][u];
    }
    ll get_dis(ll u,ll v){return dis[u]+dis[v]-2*dis[query(u,v)];}
};

vector<ll> bfs(vector<vector<ll>> G){
    ll N=G.size();
    vector<ll> dis(N,-1);
    dis[0]=0;
    queue<ll> que;
    que.push(0);
    while(!que.empty()){
        ll v=que.front();
        que.pop();
        for(ll nv:G[v]){
            if(dis[nv]!=-1) continue;
            dis[nv]=dis[v]+1;
            que.push(nv);
        }
    }
    return dis;
}

int main() {
    ll N,Q,K;
    cin >> N >> Q >> K;
    vector<ll> A(N-1),B(N-1);
    Graph G(N);
    rep(i,N-1){
        cin >> A[i] >> B[i];
        A[i]--,B[i]--;
        G[A[i]].push_back(B[i]);
        G[B[i]].push_back(A[i]);
    }
    vector<ll> dis=bfs(G);
    vector<ll> Eid(N,-1);
    rep(i,N-1){
        if(dis[A[i]]>dis[B[i]]) Eid[A[i]]=i;
        if(dis[B[i]]>dis[A[i]]) Eid[B[i]]=i;
    }
    ll cnt=0;
    vector<ll> Vid(N);
    function<void(ll)> dfs=[&](ll v){
        Vid[v]=cnt;
        cnt++;
        for(ll nv:G[v]){
            if(dis[nv]<dis[v]) continue;
            dfs(nv);
        }
    };
    dfs(0);
    vector<ll> imos(N,0);
    LCA ans(G);
    while(Q--){
        ll M;
        cin >> M;
        vector<pair<ll,ll>> P(M);
        rep(i,M){
            ll v;
            cin >> v;
            v--;
            P[i].fi=Vid[v];
            P[i].se=v;
        }
        sort(all(P));
        rep(i,M){
            ll x=P[i].se;
            ll y=P[(i+1)%M].se;
            ll z=ans.query(x,y);
            imos[x]+=1;
            imos[y]+=1;
            imos[z]-=2;
        }
    }
    function<void(ll)> sum=[&](ll v){
        ll par=-1;
        for(ll nv:G[v]){
            if(dis[nv]<dis[v]){
                par=nv;
                continue;
            }
            sum(nv);
        }
        if(par>=0) imos[par]+=imos[v];
    };
    sum(0);
    vector<ll> ANS;
    rep(i,N){
        if(imos[i]>=K*2) ANS.push_back(Eid[i]+1);
    }
    sort(all(ANS));
    cout << ANS.size() << endl;
    rep(i,ANS.size()){
        cout << ANS[i] << " ";
    }
    cout << endl;
    return 0;
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:10:30: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 | #define rep(i,n) for(ll i=0;i<n;i++)
......
  148 |     rep(i,ANS.size()){
      |         ~~~~~~~~~~~~          
railway.cpp:148:5: note: in expansion of macro 'rep'
  148 |     rep(i,ANS.size()){
      |     ^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 7 ms 2672 KB Output is correct
3 Correct 7 ms 2672 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 8 ms 3340 KB Output is correct
7 Correct 7 ms 2980 KB Output is correct
8 Correct 7 ms 2928 KB Output is correct
9 Correct 6 ms 2928 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 7 ms 2672 KB Output is correct
3 Correct 7 ms 2672 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 8 ms 3340 KB Output is correct
7 Correct 7 ms 2980 KB Output is correct
8 Correct 7 ms 2928 KB Output is correct
9 Correct 6 ms 2928 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 26 ms 3204 KB Output is correct
16 Correct 26 ms 3184 KB Output is correct
17 Correct 32 ms 3180 KB Output is correct
18 Correct 8 ms 3264 KB Output is correct
19 Correct 8 ms 2928 KB Output is correct
20 Correct 27 ms 3180 KB Output is correct
21 Correct 28 ms 3328 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 7 ms 2672 KB Output is correct
24 Correct 7 ms 2668 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 10 ms 3184 KB Output is correct
28 Correct 10 ms 2928 KB Output is correct
29 Correct 6 ms 2924 KB Output is correct
30 Correct 6 ms 2924 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 38124 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 122 ms 37208 KB Output is correct
4 Correct 124 ms 36492 KB Output is correct
5 Correct 149 ms 38560 KB Output is correct
6 Correct 119 ms 38540 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 32552 KB Output is correct
2 Correct 114 ms 28520 KB Output is correct
3 Correct 140 ms 27468 KB Output is correct
4 Correct 119 ms 27432 KB Output is correct
5 Correct 122 ms 27328 KB Output is correct
6 Correct 115 ms 33324 KB Output is correct
7 Correct 105 ms 32556 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 32552 KB Output is correct
2 Correct 114 ms 28520 KB Output is correct
3 Correct 140 ms 27468 KB Output is correct
4 Correct 119 ms 27432 KB Output is correct
5 Correct 122 ms 27328 KB Output is correct
6 Correct 115 ms 33324 KB Output is correct
7 Correct 105 ms 32556 KB Output is correct
8 Correct 111 ms 33320 KB Output is correct
9 Correct 111 ms 32632 KB Output is correct
10 Correct 126 ms 38364 KB Output is correct
11 Correct 125 ms 38360 KB Output is correct
12 Correct 107 ms 27968 KB Output is correct
13 Correct 96 ms 27664 KB Output is correct
14 Correct 130 ms 27688 KB Output is correct
15 Correct 114 ms 27176 KB Output is correct
16 Correct 117 ms 27436 KB Output is correct
17 Correct 117 ms 27428 KB Output is correct
18 Correct 145 ms 27496 KB Output is correct
19 Correct 114 ms 28368 KB Output is correct
20 Correct 108 ms 32552 KB Output is correct
21 Correct 109 ms 33060 KB Output is correct
22 Correct 110 ms 33320 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 7 ms 2672 KB Output is correct
3 Correct 7 ms 2672 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 8 ms 3340 KB Output is correct
7 Correct 7 ms 2980 KB Output is correct
8 Correct 7 ms 2928 KB Output is correct
9 Correct 6 ms 2928 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 26 ms 3204 KB Output is correct
16 Correct 26 ms 3184 KB Output is correct
17 Correct 32 ms 3180 KB Output is correct
18 Correct 8 ms 3264 KB Output is correct
19 Correct 8 ms 2928 KB Output is correct
20 Correct 27 ms 3180 KB Output is correct
21 Correct 28 ms 3328 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 7 ms 2672 KB Output is correct
24 Correct 7 ms 2668 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 10 ms 3184 KB Output is correct
28 Correct 10 ms 2928 KB Output is correct
29 Correct 6 ms 2924 KB Output is correct
30 Correct 6 ms 2924 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 130 ms 38124 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 122 ms 37208 KB Output is correct
39 Correct 124 ms 36492 KB Output is correct
40 Correct 149 ms 38560 KB Output is correct
41 Correct 119 ms 38540 KB Output is correct
42 Correct 104 ms 32552 KB Output is correct
43 Correct 114 ms 28520 KB Output is correct
44 Correct 140 ms 27468 KB Output is correct
45 Correct 119 ms 27432 KB Output is correct
46 Correct 122 ms 27328 KB Output is correct
47 Correct 115 ms 33324 KB Output is correct
48 Correct 105 ms 32556 KB Output is correct
49 Correct 111 ms 33320 KB Output is correct
50 Correct 111 ms 32632 KB Output is correct
51 Correct 126 ms 38364 KB Output is correct
52 Correct 125 ms 38360 KB Output is correct
53 Correct 107 ms 27968 KB Output is correct
54 Correct 96 ms 27664 KB Output is correct
55 Correct 130 ms 27688 KB Output is correct
56 Correct 114 ms 27176 KB Output is correct
57 Correct 117 ms 27436 KB Output is correct
58 Correct 117 ms 27428 KB Output is correct
59 Correct 145 ms 27496 KB Output is correct
60 Correct 114 ms 28368 KB Output is correct
61 Correct 108 ms 32552 KB Output is correct
62 Correct 109 ms 33060 KB Output is correct
63 Correct 110 ms 33320 KB Output is correct
64 Correct 114 ms 33320 KB Output is correct
65 Correct 156 ms 27468 KB Output is correct
66 Correct 133 ms 27384 KB Output is correct
67 Correct 131 ms 27184 KB Output is correct
68 Correct 88 ms 27688 KB Output is correct
69 Correct 84 ms 27372 KB Output is correct
70 Correct 116 ms 33580 KB Output is correct
71 Correct 122 ms 33140 KB Output is correct
72 Correct 1 ms 348 KB Output is correct
73 Correct 7 ms 2808 KB Output is correct
74 Correct 7 ms 2672 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 8 ms 3184 KB Output is correct
78 Correct 7 ms 2924 KB Output is correct
79 Correct 6 ms 2668 KB Output is correct
80 Correct 7 ms 3004 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 28 ms 3200 KB Output is correct
87 Correct 27 ms 3184 KB Output is correct
88 Correct 27 ms 3184 KB Output is correct
89 Correct 8 ms 3184 KB Output is correct
90 Correct 7 ms 2672 KB Output is correct
91 Correct 27 ms 3180 KB Output is correct
92 Correct 29 ms 3284 KB Output is correct
93 Correct 1 ms 348 KB Output is correct
94 Correct 138 ms 38316 KB Output is correct
95 Correct 122 ms 37112 KB Output is correct
96 Correct 116 ms 36656 KB Output is correct
97 Correct 136 ms 38184 KB Output is correct
98 Correct 120 ms 38728 KB Output is correct
99 Correct 118 ms 27432 KB Output is correct
100 Correct 120 ms 27332 KB Output is correct
101 Correct 124 ms 27296 KB Output is correct
102 Correct 115 ms 27820 KB Output is correct
103 Correct 107 ms 33320 KB Output is correct
104 Correct 130 ms 32812 KB Output is correct
105 Correct 104 ms 31784 KB Output is correct
106 Correct 110 ms 32648 KB Output is correct
107 Correct 134 ms 33320 KB Output is correct
108 Correct 112 ms 38592 KB Output is correct
109 Correct 117 ms 38188 KB Output is correct
110 Correct 125 ms 27948 KB Output is correct
111 Correct 93 ms 27748 KB Output is correct
112 Correct 114 ms 27292 KB Output is correct
113 Correct 113 ms 27360 KB Output is correct