oj.uz

Submission #639851

# Submission time Handle Problem Language Result Execution time Memory
639851 2022-09-12T11:49:22 Z Cookie Railway (BOI17_railway) C++14
100 / 100
 241 ms 45672 KB 
#include<bits/stdc++.h>

using namespace std;
#include<fstream>

#define ll long long
#define vt vector
#define pb push_back
#define fi first
#define se second
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
typedef unsigned long long ull;
#define pii pair<int, int>
#define pll pair<ll, ll>
#include<fstream>
ifstream fin("disrupt.in");
ofstream fout("disrupt.out");
const ll mod = 1e9 + 7;


const int mxn = 1e5, mxm = 5e4, mxlg = 17;
const int inf = 1e9 + 3;
int n, m, k;
vt<pii>adj[mxn + 1];
int cnt[mxn + 1]; 
set<int>val[mxn + 1];
int up[mxn + 1][17], d[mxn + 1];
vt<int>Lca[mxn + 1];
vt<int>res;
void dfs(int s, int pre){
    for(auto i: adj[s]){
        if(i.fi == pre)continue;
        d[i.fi] = d[s] + 1; up[i.fi][0] = s;
        dfs(i.fi, s);
    }
}
int lca(int a, int b){
    if(d[a] < d[b])swap(a, b);
    int k = d[a] - d[b];
    forr(i, 0, mxlg){
        if(k & (1 << i)){
            a = up[a][i];
        }
    }
    if(a == b)return(a);
    dorr(i, mxlg - 1, 0){
        if(up[a][i] != up[b][i]){
            a = up[a][i]; b = up[b][i];
        }
    }
    return(up[a][0]);
}
void dfs2(int s, int pre){
    for(auto i: adj[s]){
    
        int v = i.fi, id = i.se;
        if(v == pre)continue;
        dfs2(v, s);
        if(val[v].size() >= k){
            res.pb(id);
        }
        if(val[s].size() < val[v].size())swap(val[s], val[v]);
        for(auto j: val[v]){
            val[s].insert(j);
        }
    }
    
    for(auto i: Lca[s]){
        val[s].erase(i);
    }
    
}
int main(){
     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m >> k;
    forr(i, 1, n){
        int u, v; cin >> u >> v;
        adj[u].pb({v, i}); adj[v].pb({u, i});
    }
    dfs(1, -1);
    forr(i, 1, mxlg){
        forr(j, 1, n + 1){
            up[j][i] = up[up[j][i - 1]][i - 1];
        }
    }
    forr(i, 0, m){
        int s, v; cin >> s >> v;
        val[v].insert(i);
        forr(j, 1, s){
            int x; cin >> x;
            val[x].insert(i);
            v = lca(v, x);
        }
        Lca[v].pb(i);
        
    }
    dfs2(1, -1);
    cout << res.size() << "\n";
    sort(res.begin(), res.end());
    for(int i = 0 ; i < res.size(); i++)cout << res[i] << ' ';
    
}

Compilation message

railway.cpp: In function 'void dfs2(int, int)':
railway.cpp:60:26: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   60 |         if(val[v].size() >= k){
      |            ~~~~~~~~~~~~~~^~~~
railway.cpp: In function 'int main()':
railway.cpp:101:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |     for(int i = 0 ; i < res.size(); i++)cout << res[i] << ' ';
      |                     ~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9740 KB Output is correct
2 Correct 10 ms 10964 KB Output is correct
3 Correct 12 ms 10964 KB Output is correct
4 Correct 6 ms 9636 KB Output is correct
5 Correct 6 ms 9744 KB Output is correct
6 Correct 14 ms 11880 KB Output is correct
7 Correct 12 ms 11164 KB Output is correct
8 Correct 10 ms 11084 KB Output is correct
9 Correct 10 ms 11164 KB Output is correct
10 Correct 5 ms 9748 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 6 ms 9756 KB Output is correct
13 Correct 7 ms 9740 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9740 KB Output is correct
2 Correct 10 ms 10964 KB Output is correct
3 Correct 12 ms 10964 KB Output is correct
4 Correct 6 ms 9636 KB Output is correct
5 Correct 6 ms 9744 KB Output is correct
6 Correct 14 ms 11880 KB Output is correct
7 Correct 12 ms 11164 KB Output is correct
8 Correct 10 ms 11084 KB Output is correct
9 Correct 10 ms 11164 KB Output is correct
10 Correct 5 ms 9748 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 6 ms 9756 KB Output is correct
13 Correct 7 ms 9740 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 48 ms 16720 KB Output is correct
16 Correct 48 ms 16820 KB Output is correct
17 Correct 46 ms 16888 KB Output is correct
18 Correct 11 ms 11988 KB Output is correct
19 Correct 12 ms 11220 KB Output is correct
20 Correct 44 ms 16180 KB Output is correct
21 Correct 56 ms 16140 KB Output is correct
22 Correct 7 ms 9688 KB Output is correct
23 Correct 13 ms 11048 KB Output is correct
24 Correct 10 ms 10964 KB Output is correct
25 Correct 5 ms 9684 KB Output is correct
26 Correct 5 ms 9684 KB Output is correct
27 Correct 10 ms 11860 KB Output is correct
28 Correct 9 ms 11092 KB Output is correct
29 Correct 10 ms 11036 KB Output is correct
30 Correct 9 ms 11092 KB Output is correct
31 Correct 7 ms 9744 KB Output is correct
32 Correct 5 ms 9712 KB Output is correct
33 Correct 8 ms 9684 KB Output is correct
34 Correct 8 ms 9684 KB Output is correct
35 Correct 7 ms 9684 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 45208 KB Output is correct
2 Correct 5 ms 9732 KB Output is correct
3 Correct 161 ms 44932 KB Output is correct
4 Correct 156 ms 44356 KB Output is correct
5 Correct 146 ms 43308 KB Output is correct
6 Correct 126 ms 45672 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 37556 KB Output is correct
2 Correct 159 ms 32444 KB Output is correct
3 Correct 191 ms 37940 KB Output is correct
4 Correct 220 ms 37808 KB Output is correct
5 Correct 175 ms 37992 KB Output is correct
6 Correct 150 ms 37772 KB Output is correct
7 Correct 130 ms 37708 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 37556 KB Output is correct
2 Correct 159 ms 32444 KB Output is correct
3 Correct 191 ms 37940 KB Output is correct
4 Correct 220 ms 37808 KB Output is correct
5 Correct 175 ms 37992 KB Output is correct
6 Correct 150 ms 37772 KB Output is correct
7 Correct 130 ms 37708 KB Output is correct
8 Correct 122 ms 36456 KB Output is correct
9 Correct 131 ms 36288 KB Output is correct
10 Correct 104 ms 43072 KB Output is correct
11 Correct 107 ms 43028 KB Output is correct
12 Correct 94 ms 26788 KB Output is correct
13 Correct 114 ms 26700 KB Output is correct
14 Correct 152 ms 32844 KB Output is correct
15 Correct 142 ms 33032 KB Output is correct
16 Correct 156 ms 38960 KB Output is correct
17 Correct 192 ms 39264 KB Output is correct
18 Correct 167 ms 37064 KB Output is correct
19 Correct 147 ms 32984 KB Output is correct
20 Correct 139 ms 37988 KB Output is correct
21 Correct 133 ms 38008 KB Output is correct
22 Correct 131 ms 37984 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9740 KB Output is correct
2 Correct 10 ms 10964 KB Output is correct
3 Correct 12 ms 10964 KB Output is correct
4 Correct 6 ms 9636 KB Output is correct
5 Correct 6 ms 9744 KB Output is correct
6 Correct 14 ms 11880 KB Output is correct
7 Correct 12 ms 11164 KB Output is correct
8 Correct 10 ms 11084 KB Output is correct
9 Correct 10 ms 11164 KB Output is correct
10 Correct 5 ms 9748 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 6 ms 9756 KB Output is correct
13 Correct 7 ms 9740 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 48 ms 16720 KB Output is correct
16 Correct 48 ms 16820 KB Output is correct
17 Correct 46 ms 16888 KB Output is correct
18 Correct 11 ms 11988 KB Output is correct
19 Correct 12 ms 11220 KB Output is correct
20 Correct 44 ms 16180 KB Output is correct
21 Correct 56 ms 16140 KB Output is correct
22 Correct 7 ms 9688 KB Output is correct
23 Correct 13 ms 11048 KB Output is correct
24 Correct 10 ms 10964 KB Output is correct
25 Correct 5 ms 9684 KB Output is correct
26 Correct 5 ms 9684 KB Output is correct
27 Correct 10 ms 11860 KB Output is correct
28 Correct 9 ms 11092 KB Output is correct
29 Correct 10 ms 11036 KB Output is correct
30 Correct 9 ms 11092 KB Output is correct
31 Correct 7 ms 9744 KB Output is correct
32 Correct 5 ms 9712 KB Output is correct
33 Correct 8 ms 9684 KB Output is correct
34 Correct 8 ms 9684 KB Output is correct
35 Correct 7 ms 9684 KB Output is correct
36 Correct 172 ms 45208 KB Output is correct
37 Correct 5 ms 9732 KB Output is correct
38 Correct 161 ms 44932 KB Output is correct
39 Correct 156 ms 44356 KB Output is correct
40 Correct 146 ms 43308 KB Output is correct
41 Correct 126 ms 45672 KB Output is correct
42 Correct 135 ms 37556 KB Output is correct
43 Correct 159 ms 32444 KB Output is correct
44 Correct 191 ms 37940 KB Output is correct
45 Correct 220 ms 37808 KB Output is correct
46 Correct 175 ms 37992 KB Output is correct
47 Correct 150 ms 37772 KB Output is correct
48 Correct 130 ms 37708 KB Output is correct
49 Correct 122 ms 36456 KB Output is correct
50 Correct 131 ms 36288 KB Output is correct
51 Correct 104 ms 43072 KB Output is correct
52 Correct 107 ms 43028 KB Output is correct
53 Correct 94 ms 26788 KB Output is correct
54 Correct 114 ms 26700 KB Output is correct
55 Correct 152 ms 32844 KB Output is correct
56 Correct 142 ms 33032 KB Output is correct
57 Correct 156 ms 38960 KB Output is correct
58 Correct 192 ms 39264 KB Output is correct
59 Correct 167 ms 37064 KB Output is correct
60 Correct 147 ms 32984 KB Output is correct
61 Correct 139 ms 37988 KB Output is correct
62 Correct 133 ms 38008 KB Output is correct
63 Correct 131 ms 37984 KB Output is correct
64 Correct 121 ms 36848 KB Output is correct
65 Correct 241 ms 44504 KB Output is correct
66 Correct 186 ms 40208 KB Output is correct
67 Correct 150 ms 35892 KB Output is correct
68 Correct 81 ms 25264 KB Output is correct
69 Correct 92 ms 25236 KB Output is correct
70 Correct 144 ms 38128 KB Output is correct
71 Correct 114 ms 36300 KB Output is correct
72 Correct 5 ms 9744 KB Output is correct
73 Correct 10 ms 11064 KB Output is correct
74 Correct 11 ms 10964 KB Output is correct
75 Correct 7 ms 9740 KB Output is correct
76 Correct 6 ms 9744 KB Output is correct
77 Correct 12 ms 11804 KB Output is correct
78 Correct 13 ms 11180 KB Output is correct
79 Correct 8 ms 11092 KB Output is correct
80 Correct 10 ms 11164 KB Output is correct
81 Correct 6 ms 9684 KB Output is correct
82 Correct 5 ms 9744 KB Output is correct
83 Correct 5 ms 9684 KB Output is correct
84 Correct 6 ms 9684 KB Output is correct
85 Correct 5 ms 9684 KB Output is correct
86 Correct 49 ms 16756 KB Output is correct
87 Correct 60 ms 16888 KB Output is correct
88 Correct 48 ms 16840 KB Output is correct
89 Correct 15 ms 11988 KB Output is correct
90 Correct 9 ms 11220 KB Output is correct
91 Correct 40 ms 16136 KB Output is correct
92 Correct 62 ms 16192 KB Output is correct
93 Correct 8 ms 9744 KB Output is correct
94 Correct 180 ms 45184 KB Output is correct
95 Correct 165 ms 44852 KB Output is correct
96 Correct 146 ms 44388 KB Output is correct
97 Correct 182 ms 43184 KB Output is correct
98 Correct 134 ms 45628 KB Output is correct
99 Correct 186 ms 41420 KB Output is correct
100 Correct 162 ms 38672 KB Output is correct
101 Correct 165 ms 39104 KB Output is correct
102 Correct 149 ms 32708 KB Output is correct
103 Correct 139 ms 37692 KB Output is correct
104 Correct 143 ms 38048 KB Output is correct
105 Correct 118 ms 37532 KB Output is correct
106 Correct 124 ms 36436 KB Output is correct
107 Correct 133 ms 36436 KB Output is correct
108 Correct 108 ms 43040 KB Output is correct
109 Correct 132 ms 42980 KB Output is correct
110 Correct 85 ms 26700 KB Output is correct
111 Correct 94 ms 26700 KB Output is correct
112 Correct 161 ms 32632 KB Output is correct
113 Correct 125 ms 32652 KB Output is correct