oj.uz

Submission #481080

# Submission time Handle Problem Language Result Execution time Memory
481080 2021-10-19T12:32:21 Z DJeniUp Railway (BOI17_railway) C++17
100 / 100
 254 ms 51788 KB 
#pragma GCC Optimize("O3")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pairll;
typedef pair<ll,pairll>pairlll;
typedef pair<pairll,pairll>pairllll;
typedef long double ld;
typedef pair<ll,string>pairls;

#define INF 1000000000000007
#define MOD 1000000007
#define pb push_back
#define fr first
#define sc second
#define endl '\n'

ll n,m,k,f[100007],t[100007][37],a[100007],b[100007],F,res[100007];

vector<pairll>v[100007];
vector<ll>d[50007];

queue<ll>R;

void S(ll x,ll y){
    F++;
    a[x]=F;
    t[x][0]=y;
    for(int i=1;i<=26;i++){
        t[x][i]=t[t[x][i-1]][i-1];
    }
    for(int i=0;i<v[x].size();i++){
        if(v[x][i].fr!=y)S(v[x][i].fr,x);
    }
    F++;
    b[x]=F;
    return ;
}

ll up(ll x,ll y){
    if(a[x]<a[y] && b[y]<b[x])return x;
    if(a[y]<a[x] && b[x]<b[y])return y;

    for(int i=26;i>=0;i--){
        if((a[t[x][i]]<a[y] && b[y]<b[t[x][i]]) || t[x][i]==0)continue;
        x=t[x][i];
    }
    return t[x][0];
}

bool mcp(ll d1,ll d2){
    return a[d1]<a[d2];
}

ll D(ll x,ll y,ll z){
    res[z]+=f[x];
    for(int i=0;i<v[x].size();i++){
        if(v[x][i].fr!=y)res[z]+=D(v[x][i].fr,x,v[x][i].sc);
    }
    return res[z];
}

int main() {
    
    cin>>n>>m>>k;
    for(int i=1;i<n;i++){
        ll l,r;
        cin>>l>>r;
        v[l].pb({r,i});
        v[r].pb({l,i});
    }
    S(1,0);
    for(int i=1;i<=m;i++){
        ll s;
        cin>>s;
        while(s--){
            ll l;
            cin>>l;
            d[i].pb(l);
        }
        sort(d[i].begin(), d[i].end(),mcp);
        for(int j=0;j<d[i].size();j++){
            f[d[i][j]]++;
            f[up(d[i][j],d[i][(j+1)%d[i].size()])]--;
        }
    }
    D(1,0,0);
    for(int i=1;i<n;i++){
        if(res[i]>=k)R.push(i);
    }
    cout<<R.size()<<endl;
    while(R.size()>0){
        cout<<R.front()<<" ";
        R.pop();
    }
}

Compilation message

railway.cpp:1: warning: ignoring '#pragma GCC Optimize' [-Wunknown-pragmas]
    1 | #pragma GCC Optimize("O3")
      | 
railway.cpp: In function 'void S(ll, ll)':
railway.cpp:35:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for(int i=0;i<v[x].size();i++){
      |                 ~^~~~~~~~~~~~
railway.cpp: In function 'll D(ll, ll, ll)':
railway.cpp:60:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |     for(int i=0;i<v[x].size();i++){
      |                 ~^~~~~~~~~~~~
railway.cpp: In function 'int main()':
railway.cpp:85:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |         for(int j=0;j<d[i].size();j++){
      |                     ~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3788 KB Output is correct
2 Correct 14 ms 7680 KB Output is correct
3 Correct 14 ms 7652 KB Output is correct
4 Correct 3 ms 3788 KB Output is correct
5 Correct 2 ms 3824 KB Output is correct
6 Correct 14 ms 8012 KB Output is correct
7 Correct 14 ms 7756 KB Output is correct
8 Correct 12 ms 7552 KB Output is correct
9 Correct 14 ms 7628 KB Output is correct
10 Correct 3 ms 3788 KB Output is correct
11 Correct 4 ms 3788 KB Output is correct
12 Correct 4 ms 3828 KB Output is correct
13 Correct 3 ms 3788 KB Output is correct
14 Correct 2 ms 3788 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3788 KB Output is correct
2 Correct 14 ms 7680 KB Output is correct
3 Correct 14 ms 7652 KB Output is correct
4 Correct 3 ms 3788 KB Output is correct
5 Correct 2 ms 3824 KB Output is correct
6 Correct 14 ms 8012 KB Output is correct
7 Correct 14 ms 7756 KB Output is correct
8 Correct 12 ms 7552 KB Output is correct
9 Correct 14 ms 7628 KB Output is correct
10 Correct 3 ms 3788 KB Output is correct
11 Correct 4 ms 3788 KB Output is correct
12 Correct 4 ms 3828 KB Output is correct
13 Correct 3 ms 3788 KB Output is correct
14 Correct 2 ms 3788 KB Output is correct
15 Correct 51 ms 9020 KB Output is correct
16 Correct 58 ms 9028 KB Output is correct
17 Correct 47 ms 9052 KB Output is correct
18 Correct 15 ms 8012 KB Output is correct
19 Correct 15 ms 7756 KB Output is correct
20 Correct 72 ms 9108 KB Output is correct
21 Correct 79 ms 9028 KB Output is correct
22 Correct 2 ms 3788 KB Output is correct
23 Correct 14 ms 7668 KB Output is correct
24 Correct 14 ms 7628 KB Output is correct
25 Correct 2 ms 3828 KB Output is correct
26 Correct 2 ms 3788 KB Output is correct
27 Correct 15 ms 8060 KB Output is correct
28 Correct 15 ms 7744 KB Output is correct
29 Correct 13 ms 7628 KB Output is correct
30 Correct 13 ms 7628 KB Output is correct
31 Correct 3 ms 3824 KB Output is correct
32 Correct 3 ms 3788 KB Output is correct
33 Correct 4 ms 3832 KB Output is correct
34 Correct 3 ms 3744 KB Output is correct
35 Correct 3 ms 3788 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 51420 KB Output is correct
2 Correct 2 ms 3788 KB Output is correct
3 Correct 167 ms 50840 KB Output is correct
4 Correct 172 ms 50148 KB Output is correct
5 Correct 170 ms 51088 KB Output is correct
6 Correct 192 ms 51704 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 47108 KB Output is correct
2 Correct 234 ms 44616 KB Output is correct
3 Correct 238 ms 44304 KB Output is correct
4 Correct 206 ms 44320 KB Output is correct
5 Correct 213 ms 44336 KB Output is correct
6 Correct 194 ms 47228 KB Output is correct
7 Correct 209 ms 47128 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 47108 KB Output is correct
2 Correct 234 ms 44616 KB Output is correct
3 Correct 238 ms 44304 KB Output is correct
4 Correct 206 ms 44320 KB Output is correct
5 Correct 213 ms 44336 KB Output is correct
6 Correct 194 ms 47228 KB Output is correct
7 Correct 209 ms 47128 KB Output is correct
8 Correct 210 ms 47180 KB Output is correct
9 Correct 206 ms 47256 KB Output is correct
10 Correct 184 ms 50756 KB Output is correct
11 Correct 180 ms 50752 KB Output is correct
12 Correct 161 ms 42736 KB Output is correct
13 Correct 192 ms 42764 KB Output is correct
14 Correct 199 ms 43944 KB Output is correct
15 Correct 208 ms 44104 KB Output is correct
16 Correct 224 ms 44312 KB Output is correct
17 Correct 206 ms 44388 KB Output is correct
18 Correct 209 ms 44320 KB Output is correct
19 Correct 253 ms 44612 KB Output is correct
20 Correct 191 ms 47428 KB Output is correct
21 Correct 199 ms 47708 KB Output is correct
22 Correct 226 ms 47556 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3788 KB Output is correct
2 Correct 14 ms 7680 KB Output is correct
3 Correct 14 ms 7652 KB Output is correct
4 Correct 3 ms 3788 KB Output is correct
5 Correct 2 ms 3824 KB Output is correct
6 Correct 14 ms 8012 KB Output is correct
7 Correct 14 ms 7756 KB Output is correct
8 Correct 12 ms 7552 KB Output is correct
9 Correct 14 ms 7628 KB Output is correct
10 Correct 3 ms 3788 KB Output is correct
11 Correct 4 ms 3788 KB Output is correct
12 Correct 4 ms 3828 KB Output is correct
13 Correct 3 ms 3788 KB Output is correct
14 Correct 2 ms 3788 KB Output is correct
15 Correct 51 ms 9020 KB Output is correct
16 Correct 58 ms 9028 KB Output is correct
17 Correct 47 ms 9052 KB Output is correct
18 Correct 15 ms 8012 KB Output is correct
19 Correct 15 ms 7756 KB Output is correct
20 Correct 72 ms 9108 KB Output is correct
21 Correct 79 ms 9028 KB Output is correct
22 Correct 2 ms 3788 KB Output is correct
23 Correct 14 ms 7668 KB Output is correct
24 Correct 14 ms 7628 KB Output is correct
25 Correct 2 ms 3828 KB Output is correct
26 Correct 2 ms 3788 KB Output is correct
27 Correct 15 ms 8060 KB Output is correct
28 Correct 15 ms 7744 KB Output is correct
29 Correct 13 ms 7628 KB Output is correct
30 Correct 13 ms 7628 KB Output is correct
31 Correct 3 ms 3824 KB Output is correct
32 Correct 3 ms 3788 KB Output is correct
33 Correct 4 ms 3832 KB Output is correct
34 Correct 3 ms 3744 KB Output is correct
35 Correct 3 ms 3788 KB Output is correct
36 Correct 185 ms 51420 KB Output is correct
37 Correct 2 ms 3788 KB Output is correct
38 Correct 167 ms 50840 KB Output is correct
39 Correct 172 ms 50148 KB Output is correct
40 Correct 170 ms 51088 KB Output is correct
41 Correct 192 ms 51704 KB Output is correct
42 Correct 199 ms 47108 KB Output is correct
43 Correct 234 ms 44616 KB Output is correct
44 Correct 238 ms 44304 KB Output is correct
45 Correct 206 ms 44320 KB Output is correct
46 Correct 213 ms 44336 KB Output is correct
47 Correct 194 ms 47228 KB Output is correct
48 Correct 209 ms 47128 KB Output is correct
49 Correct 210 ms 47180 KB Output is correct
50 Correct 206 ms 47256 KB Output is correct
51 Correct 184 ms 50756 KB Output is correct
52 Correct 180 ms 50752 KB Output is correct
53 Correct 161 ms 42736 KB Output is correct
54 Correct 192 ms 42764 KB Output is correct
55 Correct 199 ms 43944 KB Output is correct
56 Correct 208 ms 44104 KB Output is correct
57 Correct 224 ms 44312 KB Output is correct
58 Correct 206 ms 44388 KB Output is correct
59 Correct 209 ms 44320 KB Output is correct
60 Correct 253 ms 44612 KB Output is correct
61 Correct 191 ms 47428 KB Output is correct
62 Correct 199 ms 47708 KB Output is correct
63 Correct 226 ms 47556 KB Output is correct
64 Correct 206 ms 47652 KB Output is correct
65 Correct 246 ms 44356 KB Output is correct
66 Correct 221 ms 44072 KB Output is correct
67 Correct 206 ms 44080 KB Output is correct
68 Correct 153 ms 42476 KB Output is correct
69 Correct 138 ms 42456 KB Output is correct
70 Correct 231 ms 48088 KB Output is correct
71 Correct 208 ms 47300 KB Output is correct
72 Correct 2 ms 3788 KB Output is correct
73 Correct 13 ms 7628 KB Output is correct
74 Correct 14 ms 7596 KB Output is correct
75 Correct 3 ms 3788 KB Output is correct
76 Correct 3 ms 3788 KB Output is correct
77 Correct 16 ms 7984 KB Output is correct
78 Correct 14 ms 7652 KB Output is correct
79 Correct 12 ms 7588 KB Output is correct
80 Correct 12 ms 7628 KB Output is correct
81 Correct 3 ms 3832 KB Output is correct
82 Correct 2 ms 3788 KB Output is correct
83 Correct 2 ms 3788 KB Output is correct
84 Correct 3 ms 3788 KB Output is correct
85 Correct 3 ms 3860 KB Output is correct
86 Correct 49 ms 8968 KB Output is correct
87 Correct 50 ms 9044 KB Output is correct
88 Correct 48 ms 9124 KB Output is correct
89 Correct 15 ms 8056 KB Output is correct
90 Correct 14 ms 7756 KB Output is correct
91 Correct 61 ms 9112 KB Output is correct
92 Correct 62 ms 9088 KB Output is correct
93 Correct 3 ms 3788 KB Output is correct
94 Correct 178 ms 51332 KB Output is correct
95 Correct 174 ms 50884 KB Output is correct
96 Correct 160 ms 50252 KB Output is correct
97 Correct 204 ms 51080 KB Output is correct
98 Correct 176 ms 51788 KB Output is correct
99 Correct 211 ms 44396 KB Output is correct
100 Correct 254 ms 44276 KB Output is correct
101 Correct 199 ms 44364 KB Output is correct
102 Correct 239 ms 44620 KB Output is correct
103 Correct 193 ms 47160 KB Output is correct
104 Correct 193 ms 47516 KB Output is correct
105 Correct 200 ms 47152 KB Output is correct
106 Correct 211 ms 47272 KB Output is correct
107 Correct 209 ms 47100 KB Output is correct
108 Correct 195 ms 50756 KB Output is correct
109 Correct 156 ms 50808 KB Output is correct
110 Correct 167 ms 42772 KB Output is correct
111 Correct 183 ms 42720 KB Output is correct
112 Correct 198 ms 43992 KB Output is correct
113 Correct 204 ms 43972 KB Output is correct