oj.uz

Submission #934826

# Submission time Handle Problem Language Result Execution time Memory
934826 2024-02-28T04:55:33 Z irmuun Railway (BOI17_railway) C++17
100 / 100
 82 ms 28112 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
#define ll int
#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: 'int' and 'std::vector<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 4 ms 1884 KB Output is correct
3 Correct 4 ms 1884 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 2396 KB Output is correct
7 Correct 4 ms 1880 KB Output is correct
8 Correct 3 ms 1880 KB Output is correct
9 Correct 3 ms 1884 KB Output is correct
10 Correct 1 ms 428 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 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 0 ms 348 KB Output is correct
2 Correct 4 ms 1884 KB Output is correct
3 Correct 4 ms 1884 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 2396 KB Output is correct
7 Correct 4 ms 1880 KB Output is correct
8 Correct 3 ms 1880 KB Output is correct
9 Correct 3 ms 1884 KB Output is correct
10 Correct 1 ms 428 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 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 21 ms 2652 KB Output is correct
16 Correct 21 ms 2632 KB Output is correct
17 Correct 21 ms 2652 KB Output is correct
18 Correct 5 ms 2396 KB Output is correct
19 Correct 4 ms 1884 KB Output is correct
20 Correct 20 ms 2648 KB Output is correct
21 Correct 23 ms 2652 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 4 ms 1884 KB Output is correct
24 Correct 4 ms 1884 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 4 ms 2396 KB Output is correct
28 Correct 4 ms 1884 KB Output is correct
29 Correct 3 ms 1884 KB Output is correct
30 Correct 4 ms 1884 KB Output is correct
31 Correct 1 ms 504 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 76 ms 28112 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 82 ms 27736 KB Output is correct
4 Correct 70 ms 27472 KB Output is correct
5 Correct 69 ms 26056 KB Output is correct
6 Correct 71 ms 26576 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 22868 KB Output is correct
2 Correct 65 ms 18772 KB Output is correct
3 Correct 68 ms 18256 KB Output is correct
4 Correct 68 ms 18256 KB Output is correct
5 Correct 65 ms 18356 KB Output is correct
6 Correct 66 ms 23044 KB Output is correct
7 Correct 65 ms 23108 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 22868 KB Output is correct
2 Correct 65 ms 18772 KB Output is correct
3 Correct 68 ms 18256 KB Output is correct
4 Correct 68 ms 18256 KB Output is correct
5 Correct 65 ms 18356 KB Output is correct
6 Correct 66 ms 23044 KB Output is correct
7 Correct 65 ms 23108 KB Output is correct
8 Correct 66 ms 22136 KB Output is correct
9 Correct 65 ms 22096 KB Output is correct
10 Correct 65 ms 26016 KB Output is correct
11 Correct 72 ms 26060 KB Output is correct
12 Correct 50 ms 16376 KB Output is correct
13 Correct 50 ms 16296 KB Output is correct
14 Correct 61 ms 16464 KB Output is correct
15 Correct 61 ms 16452 KB Output is correct
16 Correct 70 ms 18468 KB Output is correct
17 Correct 66 ms 18472 KB Output is correct
18 Correct 72 ms 18412 KB Output is correct
19 Correct 74 ms 18728 KB Output is correct
20 Correct 65 ms 23376 KB Output is correct
21 Correct 77 ms 23424 KB Output is correct
22 Correct 65 ms 23380 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 4 ms 1884 KB Output is correct
3 Correct 4 ms 1884 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 2396 KB Output is correct
7 Correct 4 ms 1880 KB Output is correct
8 Correct 3 ms 1880 KB Output is correct
9 Correct 3 ms 1884 KB Output is correct
10 Correct 1 ms 428 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 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 21 ms 2652 KB Output is correct
16 Correct 21 ms 2632 KB Output is correct
17 Correct 21 ms 2652 KB Output is correct
18 Correct 5 ms 2396 KB Output is correct
19 Correct 4 ms 1884 KB Output is correct
20 Correct 20 ms 2648 KB Output is correct
21 Correct 23 ms 2652 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 4 ms 1884 KB Output is correct
24 Correct 4 ms 1884 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 4 ms 2396 KB Output is correct
28 Correct 4 ms 1884 KB Output is correct
29 Correct 3 ms 1884 KB Output is correct
30 Correct 4 ms 1884 KB Output is correct
31 Correct 1 ms 504 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 76 ms 28112 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 82 ms 27736 KB Output is correct
39 Correct 70 ms 27472 KB Output is correct
40 Correct 69 ms 26056 KB Output is correct
41 Correct 71 ms 26576 KB Output is correct
42 Correct 62 ms 22868 KB Output is correct
43 Correct 65 ms 18772 KB Output is correct
44 Correct 68 ms 18256 KB Output is correct
45 Correct 68 ms 18256 KB Output is correct
46 Correct 65 ms 18356 KB Output is correct
47 Correct 66 ms 23044 KB Output is correct
48 Correct 65 ms 23108 KB Output is correct
49 Correct 66 ms 22136 KB Output is correct
50 Correct 65 ms 22096 KB Output is correct
51 Correct 65 ms 26016 KB Output is correct
52 Correct 72 ms 26060 KB Output is correct
53 Correct 50 ms 16376 KB Output is correct
54 Correct 50 ms 16296 KB Output is correct
55 Correct 61 ms 16464 KB Output is correct
56 Correct 61 ms 16452 KB Output is correct
57 Correct 70 ms 18468 KB Output is correct
58 Correct 66 ms 18472 KB Output is correct
59 Correct 72 ms 18412 KB Output is correct
60 Correct 74 ms 18728 KB Output is correct
61 Correct 65 ms 23376 KB Output is correct
62 Correct 77 ms 23424 KB Output is correct
63 Correct 65 ms 23380 KB Output is correct
64 Correct 69 ms 23128 KB Output is correct
65 Correct 69 ms 18256 KB Output is correct
66 Correct 75 ms 16384 KB Output is correct
67 Correct 65 ms 16464 KB Output is correct
68 Correct 43 ms 16132 KB Output is correct
69 Correct 48 ms 16216 KB Output is correct
70 Correct 68 ms 23512 KB Output is correct
71 Correct 65 ms 21844 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 4 ms 1884 KB Output is correct
74 Correct 4 ms 1884 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 1 ms 348 KB Output is correct
77 Correct 4 ms 2396 KB Output is correct
78 Correct 4 ms 1884 KB Output is correct
79 Correct 3 ms 1884 KB Output is correct
80 Correct 3 ms 1884 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 1 ms 512 KB Output is correct
84 Correct 1 ms 348 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 20 ms 2396 KB Output is correct
87 Correct 20 ms 2648 KB Output is correct
88 Correct 21 ms 2652 KB Output is correct
89 Correct 4 ms 2392 KB Output is correct
90 Correct 4 ms 2136 KB Output is correct
91 Correct 21 ms 2824 KB Output is correct
92 Correct 23 ms 2652 KB Output is correct
93 Correct 0 ms 344 KB Output is correct
94 Correct 72 ms 28108 KB Output is correct
95 Correct 69 ms 27596 KB Output is correct
96 Correct 67 ms 27220 KB Output is correct
97 Correct 67 ms 26056 KB Output is correct
98 Correct 82 ms 26408 KB Output is correct
99 Correct 71 ms 18472 KB Output is correct
100 Correct 65 ms 18256 KB Output is correct
101 Correct 66 ms 18324 KB Output is correct
102 Correct 66 ms 18772 KB Output is correct
103 Correct 69 ms 23120 KB Output is correct
104 Correct 66 ms 23384 KB Output is correct
105 Correct 64 ms 23084 KB Output is correct
106 Correct 66 ms 22100 KB Output is correct
107 Correct 66 ms 22100 KB Output is correct
108 Correct 76 ms 25976 KB Output is correct
109 Correct 63 ms 26056 KB Output is correct
110 Correct 51 ms 16468 KB Output is correct
111 Correct 50 ms 16464 KB Output is correct
112 Correct 62 ms 16488 KB Output is correct
113 Correct 61 ms 16784 KB Output is correct