oj.uz

Submission #934817

# Submission time Handle Problem Language Result Execution time Memory
934817 2024-02-28T04:39:17 Z irmuun Railway (BOI17_railway) C++17
100 / 100
 162 ms 43364 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
 
int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n,m,k;
    cin>>n>>m>>k;
    vector<pair<ll,ll>>adj[n];
    for(ll i=1;i<n;i++){
        ll u,v;
        cin>>u>>v;
        u--,v--;
        adj[u].pb({v,i});
        adj[v].pb({u,i});
    }
    ll tin[n],tout[n],timer=0,par[n][18],dep[n],edge[n];
    dep[0]=0;
    function <void(ll,ll)> dfs=[&](ll x,ll p){
        tin[x]=timer++;
        par[x][0]=p;
        for(auto [y,i]:adj[x]){
            if(y!=p){
                edge[y]=i;
                dep[y]=dep[x]+1;
                dfs(y,x);
            }
        }
        tout[x]=timer++;
    };
    dfs(0,0);
    function <bool(ll,ll)> compare=[&](ll a,ll b){
        return tin[a]<tin[b];
    };
    vector<ll>c[m],s(m);
    for(ll i=0;i<m;i++){
        cin>>s[i];
        c[i].resize(s[i]);
        for(auto &x:c[i]){
            cin>>x;
            x--;
        }
        sort(all(c[i]),compare);
        c[i].pb(c[i][0]);
    }
    vector<ll>cnt(n,0);
    for(ll lg=1;lg<=17;lg++){
        for(ll i=0;i<n;i++){
            par[i][lg]=par[par[i][lg-1]][lg-1];
        }
    }
    function <ll(ll,ll)> get=[&](ll x,ll l){
        for(ll lg=17;lg>=0;lg--){
            if(l&(1ll<<lg)){
                x=par[x][lg];
            }
        }
        return x;
    };
    function <ll(ll,ll)> lca=[&](ll a,ll b){
        if(dep[b]>dep[a]) swap(a,b);
        a=get(a,dep[a]-dep[b]);
        for(ll lg=17;lg>=0;lg--){
            if(par[a][lg]!=par[b][lg]){
                a=par[a][lg];
                b=par[b][lg];
            }
        }
        if(a==b) return a;
        return par[a][0];
    };
    for(ll i=0;i<m;i++){
        for(ll j=1;j<c[i].size();j++){
            ll x=c[i][j-1],y=c[i][j];
            ll l=lca(x,y);
            cnt[x]++;
            cnt[y]++;
            cnt[l]-=2;
        }
    }
    function <void(ll,ll)> dfs2=[&](ll x,ll p){
        for(auto [y,i]:adj[x]){
            if(y!=p){
                dfs2(y,x);
                cnt[x]+=cnt[y];
            }
        }
    };
    dfs2(0,-1);
    vector<ll>ans;
    for(ll i=0;i<n;i++){
        if(cnt[i]>=2*k){
            ans.pb(edge[i]);
        }
    }
    sort(all(ans));
    cout<<ans.size()<<"\n";
    for(auto x:ans){
        cout<<x<<' ';
    }
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:80:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |         for(ll j=1;j<c[i].size();j++){
      |                    ~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 5 ms 2908 KB Output is correct
3 Correct 6 ms 3332 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 3796 KB Output is correct
7 Correct 4 ms 3164 KB Output is correct
8 Correct 4 ms 2908 KB Output is correct
9 Correct 4 ms 3164 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 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 0 ms 348 KB Output is correct
2 Correct 5 ms 2908 KB Output is correct
3 Correct 6 ms 3332 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 3796 KB Output is correct
7 Correct 4 ms 3164 KB Output is correct
8 Correct 4 ms 2908 KB Output is correct
9 Correct 4 ms 3164 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 21 ms 4728 KB Output is correct
16 Correct 26 ms 4700 KB Output is correct
17 Correct 27 ms 4696 KB Output is correct
18 Correct 6 ms 3672 KB Output is correct
19 Correct 5 ms 3160 KB Output is correct
20 Correct 21 ms 5080 KB Output is correct
21 Correct 23 ms 4952 KB Output is correct
22 Correct 1 ms 428 KB Output is correct
23 Correct 4 ms 2908 KB Output is correct
24 Correct 4 ms 3028 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 5 ms 3676 KB Output is correct
28 Correct 5 ms 3164 KB Output is correct
29 Correct 4 ms 3032 KB Output is correct
30 Correct 5 ms 3068 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 544 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 103 ms 43304 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 103 ms 42924 KB Output is correct
4 Correct 88 ms 42064 KB Output is correct
5 Correct 90 ms 41248 KB Output is correct
6 Correct 90 ms 42232 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 36892 KB Output is correct
2 Correct 86 ms 32112 KB Output is correct
3 Correct 80 ms 31620 KB Output is correct
4 Correct 79 ms 31572 KB Output is correct
5 Correct 83 ms 31568 KB Output is correct
6 Correct 73 ms 37200 KB Output is correct
7 Correct 78 ms 37288 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 36892 KB Output is correct
2 Correct 86 ms 32112 KB Output is correct
3 Correct 80 ms 31620 KB Output is correct
4 Correct 79 ms 31572 KB Output is correct
5 Correct 83 ms 31568 KB Output is correct
6 Correct 73 ms 37200 KB Output is correct
7 Correct 78 ms 37288 KB Output is correct
8 Correct 82 ms 36180 KB Output is correct
9 Correct 78 ms 35988 KB Output is correct
10 Correct 88 ms 41160 KB Output is correct
11 Correct 90 ms 40964 KB Output is correct
12 Correct 64 ms 28296 KB Output is correct
13 Correct 67 ms 28368 KB Output is correct
14 Correct 75 ms 29272 KB Output is correct
15 Correct 78 ms 29264 KB Output is correct
16 Correct 79 ms 31388 KB Output is correct
17 Correct 79 ms 31768 KB Output is correct
18 Correct 77 ms 31568 KB Output is correct
19 Correct 80 ms 32080 KB Output is correct
20 Correct 76 ms 37456 KB Output is correct
21 Correct 84 ms 37592 KB Output is correct
22 Correct 91 ms 37528 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 5 ms 2908 KB Output is correct
3 Correct 6 ms 3332 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 3796 KB Output is correct
7 Correct 4 ms 3164 KB Output is correct
8 Correct 4 ms 2908 KB Output is correct
9 Correct 4 ms 3164 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 21 ms 4728 KB Output is correct
16 Correct 26 ms 4700 KB Output is correct
17 Correct 27 ms 4696 KB Output is correct
18 Correct 6 ms 3672 KB Output is correct
19 Correct 5 ms 3160 KB Output is correct
20 Correct 21 ms 5080 KB Output is correct
21 Correct 23 ms 4952 KB Output is correct
22 Correct 1 ms 428 KB Output is correct
23 Correct 4 ms 2908 KB Output is correct
24 Correct 4 ms 3028 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 5 ms 3676 KB Output is correct
28 Correct 5 ms 3164 KB Output is correct
29 Correct 4 ms 3032 KB Output is correct
30 Correct 5 ms 3068 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 544 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 103 ms 43304 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 103 ms 42924 KB Output is correct
39 Correct 88 ms 42064 KB Output is correct
40 Correct 90 ms 41248 KB Output is correct
41 Correct 90 ms 42232 KB Output is correct
42 Correct 76 ms 36892 KB Output is correct
43 Correct 86 ms 32112 KB Output is correct
44 Correct 80 ms 31620 KB Output is correct
45 Correct 79 ms 31572 KB Output is correct
46 Correct 83 ms 31568 KB Output is correct
47 Correct 73 ms 37200 KB Output is correct
48 Correct 78 ms 37288 KB Output is correct
49 Correct 82 ms 36180 KB Output is correct
50 Correct 78 ms 35988 KB Output is correct
51 Correct 88 ms 41160 KB Output is correct
52 Correct 90 ms 40964 KB Output is correct
53 Correct 64 ms 28296 KB Output is correct
54 Correct 67 ms 28368 KB Output is correct
55 Correct 75 ms 29272 KB Output is correct
56 Correct 78 ms 29264 KB Output is correct
57 Correct 79 ms 31388 KB Output is correct
58 Correct 79 ms 31768 KB Output is correct
59 Correct 77 ms 31568 KB Output is correct
60 Correct 80 ms 32080 KB Output is correct
61 Correct 76 ms 37456 KB Output is correct
62 Correct 84 ms 37592 KB Output is correct
63 Correct 91 ms 37528 KB Output is correct
64 Correct 83 ms 37400 KB Output is correct
65 Correct 102 ms 31740 KB Output is correct
66 Correct 83 ms 29268 KB Output is correct
67 Correct 77 ms 29520 KB Output is correct
68 Correct 55 ms 27804 KB Output is correct
69 Correct 69 ms 27732 KB Output is correct
70 Correct 97 ms 38044 KB Output is correct
71 Correct 82 ms 35796 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Correct 4 ms 2904 KB Output is correct
74 Correct 4 ms 2908 KB Output is correct
75 Correct 0 ms 344 KB Output is correct
76 Correct 0 ms 344 KB Output is correct
77 Correct 5 ms 3676 KB Output is correct
78 Correct 5 ms 3032 KB Output is correct
79 Correct 4 ms 3160 KB Output is correct
80 Correct 4 ms 3164 KB Output is correct
81 Correct 1 ms 348 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 1 ms 344 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 21 ms 4568 KB Output is correct
87 Correct 21 ms 4700 KB Output is correct
88 Correct 21 ms 4740 KB Output is correct
89 Correct 5 ms 3676 KB Output is correct
90 Correct 5 ms 3160 KB Output is correct
91 Correct 21 ms 5084 KB Output is correct
92 Correct 30 ms 5352 KB Output is correct
93 Correct 0 ms 344 KB Output is correct
94 Correct 103 ms 43364 KB Output is correct
95 Correct 88 ms 42700 KB Output is correct
96 Correct 84 ms 42068 KB Output is correct
97 Correct 107 ms 41416 KB Output is correct
98 Correct 93 ms 42208 KB Output is correct
99 Correct 80 ms 31636 KB Output is correct
100 Correct 79 ms 31572 KB Output is correct
101 Correct 86 ms 31468 KB Output is correct
102 Correct 78 ms 31964 KB Output is correct
103 Correct 77 ms 37204 KB Output is correct
104 Correct 80 ms 37592 KB Output is correct
105 Correct 78 ms 36920 KB Output is correct
106 Correct 94 ms 36232 KB Output is correct
107 Correct 90 ms 35920 KB Output is correct
108 Correct 162 ms 41212 KB Output is correct
109 Correct 93 ms 41156 KB Output is correct
110 Correct 76 ms 28460 KB Output is correct
111 Correct 81 ms 28452 KB Output is correct
112 Correct 97 ms 29192 KB Output is correct
113 Correct 81 ms 29268 KB Output is correct