oj.uz

Submission #668209

# Submission time Handle Problem Language Result Execution time Memory
668209 2022-12-03T10:03:44 Z ktkerem Railway (BOI17_railway) C++17
100 / 100
 256 ms 107340 KB 
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")/**/
#include<bits/stdc++.h>
/**/
//typedef int ll;
typedef long long ll;
typedef unsigned long long ull;
typedef std::string str;
//typedef vector<std::vector<ll>> vv; 
/*typedef __int128 vll;
typedef unsigned __int128 uvll;*/
#define llll std::pair<ll , ll>
#define pb push_back
#define pf push_front
#define halo cout << "hello\n"
#define fi first
#define sec second
#define vv(x) std::vector<std::vector<x>>
#define all(a) a.begin() , a.end()
const ll limit = 1e9+7; 
const ll ous = 3e5 + 7;
const ll dx[4] = {-1 , 0 , 1 , 0} , dy[4] = {0,1,0,-1};
ll n , m , k;std::vector<ll> ar , par , kt , fs(ous , 0) , tb(ous , 0) , lev(ous , 0) , lg2(ous , 0);
std::vector<ll> dspar(ous , 0) , dssz(ous , 0) , dsval(ous , 0) , gk(ous , 0);
std::vector<llll> adj[ous] , scpar;
std::vector<std::vector<ll>> spar(ous , std::vector<ll>(20 , 0));
ll tmr = 0;
ll fnd(ll x){
    if(x == dspar[x]){
        return x;
    }
    return dspar[x] = fnd(dspar[x]);
}
void mrg(ll x , ll y){
    x = fnd(x);y = fnd(y);
    if(x != y){
        if(dssz[y] > dssz[x]){
            std::swap(x , y);
        }
        dssz[x] += dssz[y];
        dspar[y] = x; 
    }
}
void dfs(ll cur , ll prv){
    tmr++;
    lev[cur] = lev[prv] - 1;
    ll k = tmr;
    tb[k] = cur;
    fs[cur] = ar.size();
    spar[ar.size()][0] = k;
    ar.pb(k);
    for(auto j:adj[cur]){
        if(j.fi != prv){
            par[j.fi] = j.sec;
            dfs(j.fi , cur);
        }
        spar[ar.size()][0] = k;
        ar.pb(k);
    }
}
bool cmp(ll x , ll y){
    return fs[x] < fs[y];
}
void sdfs(ll crt , ll prv){
    for(auto j:adj[crt]){
        if(j.fi != prv){
            sdfs(j.fi , crt);
        }
    }
    gk[par[crt]]+= kt[crt];
    kt[prv]+=kt[crt];
}
void solve(){
    std::cin >> n >> m >> k;
    par.resize(n+5);
    kt.resize(n+5);
    lg2[1] = 0;
    for(ll i = 2;ous > i;i++){
        lg2[i] = lg2[i/2] + 1;
    }
    for(ll i = 1;n>i;i++){
        ll x , y;std::cin >> x >> y;
        adj[x].pb({y , i});
        adj[y].pb({x , i});
    }
    dfs(1 , 0);
    for(ll j = 1;20>j;j++){
        for(ll i = 0;ar.size()>i + (1 << j);i++){
            spar[i][j] = std::min(spar[i][j-1] , spar[i + (1 << j-1)][j-1]);
        }
    }
    //std::cout << spar[0][0] << "\n";
    for(ll i = 0;m>i;i++){
        ll x;std::cin >> x;
        std::vector<ll> o;
        for(ll j = 0;x>j;j++){ll y;std::cin >> y;o.pb(y);kt[y]++;}
        std::sort(all(o) , cmp);
        std::set<std::pair<llll , llll>> st;
        for(ll j = 0;x>j;j++){
            dsval[j] = o[j];
            dspar[j] = j;
            dssz[j] = 1;
        }
        ll alc = o[0];
        for(ll j = 1;x > j;j++){
            ll mn = std::min(fs[o[j-1]] , fs[o[j]]) , mx = std::max(fs[o[j-1]] , fs[o[j]]);
            ll tt = lg2[mx - mn + 1];
            ll lc = std::min(spar[mn][tt] , spar[mx - (1ll << tt) + 1][tt]);
            ll pt = tb[lc];
            mn = std::min(fs[alc] , fs[o[j]]) , mx = std::max(fs[alc] , fs[o[j]]);
            tt = lg2[mx - mn + 1];
            lc = std::min(spar[mn][tt] , spar[mx - (1ll << tt) + 1][tt]);
            alc = tb[lc];
            //std::cout << pt << " " << dsval[j] << " " << dsval[j-1] << "\n"; 
            st.insert({{lev[pt] , pt} , {j , j-1}});
        }
        kt[alc]--;
        while(st.size()){
            std::pair<llll , llll> a = *st.begin();
            st.erase(st.begin());
            ll x = fnd(a.sec.fi) , y = fnd(a.sec.sec);
            if(x != a.sec.fi || y != a.sec.sec){
                ll mn = std::min(fs[dsval[x]] , fs[dsval[y]]) , mx = std::max(fs[dsval[x]] , fs[dsval[y]]);
                ll tt = lg2[mx - mn + 1];
                ll lc = std::min(spar[mn][tt] , spar[mx - (1ll << tt) + 1][tt]);
                ll o = tb[lc];
                st.insert({{lev[o] , o} , {x , y}});
            }
            else{
                mrg(a.sec.fi , a.sec.sec);
                dsval[fnd(a.sec.fi)] = a.fi.sec;
                //std::cout << a.fi.fi << " " << a.fi.sec << " " << dsval[a.sec.fi] << " " << dsval[a.sec.sec] << "\n";
                kt[a.fi.sec]--;
            }
        }
    }
    sdfs(1 , 0);
    std::vector<ll> ans;
    for(ll i = 1;n>i;i++){
        if(gk[i] >= k){
            ans.pb(i);
            //std::cout << i << "\n";
        }
    }
    std::cout << ans.size() << "\n";
    for(auto j:ans){
        std::cout << j << " ";
    }
    std::cout <<"\n";
    return;/**/
}
signed main(){
    std::ios_base::sync_with_stdio(false);std::cin.tie(NULL);
    ll t=1;
    //std::cin >> t;
    ll o = 1;
    while(t--){ 
        //cout << "Case " << o++ << ":\n";
        solve();
    }
    return 0;
}/**/

Compilation message

railway.cpp:5:78: warning: "/*" within comment [-Wcomment]
    5 | #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")/**/
      |                                                                               
railway.cpp: In function 'void solve()':
railway.cpp:91:31: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   91 |         for(ll i = 0;ar.size()>i + (1 << j);i++){
      |                      ~~~~~~~~~^~~~~~~~~~~~~
railway.cpp:92:66: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   92 |             spar[i][j] = std::min(spar[i][j-1] , spar[i + (1 << j-1)][j-1]);
      |                                                                 ~^~
railway.cpp: In function 'int main()':
railway.cpp:159:8: warning: unused variable 'o' [-Wunused-variable]
  159 |     ll o = 1;
      |        ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 84820 KB Output is correct
2 Correct 53 ms 85968 KB Output is correct
3 Correct 51 ms 85984 KB Output is correct
4 Correct 49 ms 84856 KB Output is correct
5 Correct 49 ms 84944 KB Output is correct
6 Correct 53 ms 86404 KB Output is correct
7 Correct 53 ms 86048 KB Output is correct
8 Correct 51 ms 85972 KB Output is correct
9 Correct 56 ms 85960 KB Output is correct
10 Correct 48 ms 84760 KB Output is correct
11 Correct 49 ms 84844 KB Output is correct
12 Correct 49 ms 84812 KB Output is correct
13 Correct 47 ms 84860 KB Output is correct
14 Correct 47 ms 84920 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 84820 KB Output is correct
2 Correct 53 ms 85968 KB Output is correct
3 Correct 51 ms 85984 KB Output is correct
4 Correct 49 ms 84856 KB Output is correct
5 Correct 49 ms 84944 KB Output is correct
6 Correct 53 ms 86404 KB Output is correct
7 Correct 53 ms 86048 KB Output is correct
8 Correct 51 ms 85972 KB Output is correct
9 Correct 56 ms 85960 KB Output is correct
10 Correct 48 ms 84760 KB Output is correct
11 Correct 49 ms 84844 KB Output is correct
12 Correct 49 ms 84812 KB Output is correct
13 Correct 47 ms 84860 KB Output is correct
14 Correct 47 ms 84920 KB Output is correct
15 Correct 92 ms 86268 KB Output is correct
16 Correct 84 ms 86352 KB Output is correct
17 Correct 84 ms 86392 KB Output is correct
18 Correct 53 ms 86476 KB Output is correct
19 Correct 54 ms 86104 KB Output is correct
20 Correct 84 ms 86436 KB Output is correct
21 Correct 89 ms 86364 KB Output is correct
22 Correct 47 ms 84784 KB Output is correct
23 Correct 54 ms 85904 KB Output is correct
24 Correct 58 ms 86004 KB Output is correct
25 Correct 47 ms 84856 KB Output is correct
26 Correct 55 ms 84856 KB Output is correct
27 Correct 53 ms 86380 KB Output is correct
28 Correct 53 ms 86104 KB Output is correct
29 Correct 52 ms 85912 KB Output is correct
30 Correct 62 ms 85992 KB Output is correct
31 Correct 49 ms 84832 KB Output is correct
32 Correct 48 ms 84812 KB Output is correct
33 Correct 51 ms 84904 KB Output is correct
34 Correct 48 ms 84736 KB Output is correct
35 Correct 51 ms 84812 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 177 ms 106696 KB Output is correct
2 Correct 46 ms 84744 KB Output is correct
3 Correct 176 ms 106096 KB Output is correct
4 Correct 183 ms 106096 KB Output is correct
5 Correct 201 ms 106896 KB Output is correct
6 Correct 223 ms 107192 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 175 ms 101708 KB Output is correct
2 Correct 192 ms 97480 KB Output is correct
3 Correct 194 ms 97036 KB Output is correct
4 Correct 189 ms 97020 KB Output is correct
5 Correct 175 ms 97032 KB Output is correct
6 Correct 162 ms 101792 KB Output is correct
7 Correct 167 ms 101824 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 175 ms 101708 KB Output is correct
2 Correct 192 ms 97480 KB Output is correct
3 Correct 194 ms 97036 KB Output is correct
4 Correct 189 ms 97020 KB Output is correct
5 Correct 175 ms 97032 KB Output is correct
6 Correct 162 ms 101792 KB Output is correct
7 Correct 167 ms 101824 KB Output is correct
8 Correct 197 ms 101824 KB Output is correct
9 Correct 233 ms 101880 KB Output is correct
10 Correct 213 ms 106908 KB Output is correct
11 Correct 211 ms 106888 KB Output is correct
12 Correct 225 ms 96464 KB Output is correct
13 Correct 238 ms 96444 KB Output is correct
14 Correct 204 ms 96960 KB Output is correct
15 Correct 256 ms 97072 KB Output is correct
16 Correct 187 ms 97064 KB Output is correct
17 Correct 189 ms 96988 KB Output is correct
18 Correct 182 ms 96948 KB Output is correct
19 Correct 178 ms 97460 KB Output is correct
20 Correct 183 ms 101784 KB Output is correct
21 Correct 182 ms 101760 KB Output is correct
22 Correct 200 ms 101800 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 84820 KB Output is correct
2 Correct 53 ms 85968 KB Output is correct
3 Correct 51 ms 85984 KB Output is correct
4 Correct 49 ms 84856 KB Output is correct
5 Correct 49 ms 84944 KB Output is correct
6 Correct 53 ms 86404 KB Output is correct
7 Correct 53 ms 86048 KB Output is correct
8 Correct 51 ms 85972 KB Output is correct
9 Correct 56 ms 85960 KB Output is correct
10 Correct 48 ms 84760 KB Output is correct
11 Correct 49 ms 84844 KB Output is correct
12 Correct 49 ms 84812 KB Output is correct
13 Correct 47 ms 84860 KB Output is correct
14 Correct 47 ms 84920 KB Output is correct
15 Correct 92 ms 86268 KB Output is correct
16 Correct 84 ms 86352 KB Output is correct
17 Correct 84 ms 86392 KB Output is correct
18 Correct 53 ms 86476 KB Output is correct
19 Correct 54 ms 86104 KB Output is correct
20 Correct 84 ms 86436 KB Output is correct
21 Correct 89 ms 86364 KB Output is correct
22 Correct 47 ms 84784 KB Output is correct
23 Correct 54 ms 85904 KB Output is correct
24 Correct 58 ms 86004 KB Output is correct
25 Correct 47 ms 84856 KB Output is correct
26 Correct 55 ms 84856 KB Output is correct
27 Correct 53 ms 86380 KB Output is correct
28 Correct 53 ms 86104 KB Output is correct
29 Correct 52 ms 85912 KB Output is correct
30 Correct 62 ms 85992 KB Output is correct
31 Correct 49 ms 84832 KB Output is correct
32 Correct 48 ms 84812 KB Output is correct
33 Correct 51 ms 84904 KB Output is correct
34 Correct 48 ms 84736 KB Output is correct
35 Correct 51 ms 84812 KB Output is correct
36 Correct 177 ms 106696 KB Output is correct
37 Correct 46 ms 84744 KB Output is correct
38 Correct 176 ms 106096 KB Output is correct
39 Correct 183 ms 106096 KB Output is correct
40 Correct 201 ms 106896 KB Output is correct
41 Correct 223 ms 107192 KB Output is correct
42 Correct 175 ms 101708 KB Output is correct
43 Correct 192 ms 97480 KB Output is correct
44 Correct 194 ms 97036 KB Output is correct
45 Correct 189 ms 97020 KB Output is correct
46 Correct 175 ms 97032 KB Output is correct
47 Correct 162 ms 101792 KB Output is correct
48 Correct 167 ms 101824 KB Output is correct
49 Correct 197 ms 101824 KB Output is correct
50 Correct 233 ms 101880 KB Output is correct
51 Correct 213 ms 106908 KB Output is correct
52 Correct 211 ms 106888 KB Output is correct
53 Correct 225 ms 96464 KB Output is correct
54 Correct 238 ms 96444 KB Output is correct
55 Correct 204 ms 96960 KB Output is correct
56 Correct 256 ms 97072 KB Output is correct
57 Correct 187 ms 97064 KB Output is correct
58 Correct 189 ms 96988 KB Output is correct
59 Correct 182 ms 96948 KB Output is correct
60 Correct 178 ms 97460 KB Output is correct
61 Correct 183 ms 101784 KB Output is correct
62 Correct 182 ms 101760 KB Output is correct
63 Correct 200 ms 101800 KB Output is correct
64 Correct 175 ms 101712 KB Output is correct
65 Correct 206 ms 97004 KB Output is correct
66 Correct 220 ms 97148 KB Output is correct
67 Correct 225 ms 96964 KB Output is correct
68 Correct 188 ms 96440 KB Output is correct
69 Correct 194 ms 96484 KB Output is correct
70 Correct 172 ms 101768 KB Output is correct
71 Correct 193 ms 101720 KB Output is correct
72 Correct 52 ms 84824 KB Output is correct
73 Correct 58 ms 86000 KB Output is correct
74 Correct 56 ms 85968 KB Output is correct
75 Correct 49 ms 84840 KB Output is correct
76 Correct 49 ms 84836 KB Output is correct
77 Correct 56 ms 86408 KB Output is correct
78 Correct 58 ms 86024 KB Output is correct
79 Correct 54 ms 85956 KB Output is correct
80 Correct 54 ms 85964 KB Output is correct
81 Correct 49 ms 84852 KB Output is correct
82 Correct 47 ms 84756 KB Output is correct
83 Correct 48 ms 84760 KB Output is correct
84 Correct 52 ms 84824 KB Output is correct
85 Correct 49 ms 84868 KB Output is correct
86 Correct 95 ms 86352 KB Output is correct
87 Correct 86 ms 86384 KB Output is correct
88 Correct 91 ms 86328 KB Output is correct
89 Correct 55 ms 86480 KB Output is correct
90 Correct 54 ms 86048 KB Output is correct
91 Correct 94 ms 86476 KB Output is correct
92 Correct 114 ms 86412 KB Output is correct
93 Correct 50 ms 84840 KB Output is correct
94 Correct 181 ms 106696 KB Output is correct
95 Correct 193 ms 106032 KB Output is correct
96 Correct 178 ms 106048 KB Output is correct
97 Correct 214 ms 106792 KB Output is correct
98 Correct 204 ms 107340 KB Output is correct
99 Correct 199 ms 97052 KB Output is correct
100 Correct 202 ms 96968 KB Output is correct
101 Correct 202 ms 96952 KB Output is correct
102 Correct 176 ms 97536 KB Output is correct
103 Correct 166 ms 101724 KB Output is correct
104 Correct 169 ms 101800 KB Output is correct
105 Correct 175 ms 101828 KB Output is correct
106 Correct 198 ms 101792 KB Output is correct
107 Correct 213 ms 101744 KB Output is correct
108 Correct 219 ms 107064 KB Output is correct
109 Correct 206 ms 106896 KB Output is correct
110 Correct 219 ms 96380 KB Output is correct
111 Correct 235 ms 96420 KB Output is correct
112 Correct 208 ms 97016 KB Output is correct
113 Correct 194 ms 96968 KB Output is correct