oj.uz

Submission #884747

# Submission time Handle Problem Language Result Execution time Memory
884747 2023-12-08T10:31:32 Z Iliya_ Railway (BOI17_railway) C++14
100 / 100
 261 ms 52272 KB 
//IN THE NAME OF GOD
#include<bits/stdc++.h>
#pragma GCC optimize("O2,unroll-loops")
#define endl        '\n'
#define F           first
#define S           second
#define pii         pair<int,int>
#define all(x)      x.begin(),x.end()
#define pb          push_back
#define fast_io     ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define file_io     freopen("input.in" , "r" , stdin) ; freopen("output.out" , "w" , stdout);
using namespace std;
typedef long long ll; 
typedef long double dll;

const int N = 1e5+7, lg = 23; 
int mark[N], h[N], par[lg][N], st[N], en[N], tim, a[N];
set<int> dp[N], rem[N];
vector<pii> g[N], vec; 
vector<int> ans;

void dfs(int v){
     mark[v] = 1; 
     st[v] = ++tim;
     for(int i=1; i<lg; i++) par[i][v] = par[i-1][par[i-1][v]];
     for(pii cur : g[v]){
          int u = cur.F;
          if (mark[u]) continue; 
          h[u] = h[v]+1;
          par[0][u] = v; 
          dfs(u); 
     }
     en[v] = ++tim;
}

int lca(int v, int u){
     if (h[v] < h[u]) swap(v,u);
     int dif = h[v] - h[u];
     for(int i=lg-1; i>=0; i--) if ((dif>>i)&1) v = par[i][v]; 
     if (v == u) return v; 
     for(int i=lg-1; i>=0; i--){
          if (par[i][v] != par[i][u]){
               v = par[i][v]; 
               u = par[i][u]; 
          }
     }
     return par[0][v]; 
}

void dfs2(int v, int k){
     mark[v] = 1; 
     for(pii cur : g[v]){
          int u = cur.F, id = cur.S; 
          if (mark[u]) continue; 
          dfs2(u,k); 
          if (int(dp[u].size()) >= k) ans.pb(id); 
          if (int(dp[u].size()) > int(dp[v].size())) swap(dp[u],dp[v]);
          for(int cur : dp[u]) dp[v].insert(cur);
          for(int cur : rem[v]) dp[v].erase(cur);
     }
}

int32_t main(){
     fast_io;

     int n,m,k; cin >> n >> m >> k; 
     for(int i=1; i<n; i++){
          int v,u; cin >> v >> u; 
          g[v].pb({u,i}); 
          g[u].pb({v,i}); 
     }
     dfs(1); 
     for(int j=1; j<=m; j++){
          int x; cin >> x; 
          for(int i=1; i<=x; i++){
               cin >> a[i];
               vec.pb({st[a[i]],a[i]}); 
          }
          int lc = a[1]; 
          for(int i=2; i<=x; i++) lc = lca(lc,a[i]); 
          rem[lc].insert(j); 
          for(int i=1; i<=x; i++) dp[a[i]].insert(j); 
     }
     fill(mark+1,mark+n+1,0);
     dfs2(1,k); 
     sort(all(ans));
     cout << int(ans.size()) << endl;
     for(int cur : ans) cout << cur << " ";
     cout << endl;

     return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19156 KB Output is correct
2 Correct 7 ms 20096 KB Output is correct
3 Correct 7 ms 20056 KB Output is correct
4 Correct 4 ms 19132 KB Output is correct
5 Correct 3 ms 19036 KB Output is correct
6 Correct 8 ms 20892 KB Output is correct
7 Correct 7 ms 20316 KB Output is correct
8 Correct 21 ms 20060 KB Output is correct
9 Correct 8 ms 20316 KB Output is correct
10 Correct 3 ms 19036 KB Output is correct
11 Correct 5 ms 19036 KB Output is correct
12 Correct 4 ms 19048 KB Output is correct
13 Correct 4 ms 19092 KB Output is correct
14 Correct 3 ms 19036 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19156 KB Output is correct
2 Correct 7 ms 20096 KB Output is correct
3 Correct 7 ms 20056 KB Output is correct
4 Correct 4 ms 19132 KB Output is correct
5 Correct 3 ms 19036 KB Output is correct
6 Correct 8 ms 20892 KB Output is correct
7 Correct 7 ms 20316 KB Output is correct
8 Correct 21 ms 20060 KB Output is correct
9 Correct 8 ms 20316 KB Output is correct
10 Correct 3 ms 19036 KB Output is correct
11 Correct 5 ms 19036 KB Output is correct
12 Correct 4 ms 19048 KB Output is correct
13 Correct 4 ms 19092 KB Output is correct
14 Correct 3 ms 19036 KB Output is correct
15 Correct 34 ms 26432 KB Output is correct
16 Correct 33 ms 26316 KB Output is correct
17 Correct 33 ms 26320 KB Output is correct
18 Correct 9 ms 21084 KB Output is correct
19 Correct 8 ms 20380 KB Output is correct
20 Correct 114 ms 26056 KB Output is correct
21 Correct 63 ms 26052 KB Output is correct
22 Correct 3 ms 19036 KB Output is correct
23 Correct 7 ms 20060 KB Output is correct
24 Correct 9 ms 20040 KB Output is correct
25 Correct 3 ms 19036 KB Output is correct
26 Correct 3 ms 19088 KB Output is correct
27 Correct 10 ms 20828 KB Output is correct
28 Correct 7 ms 20316 KB Output is correct
29 Correct 23 ms 20248 KB Output is correct
30 Correct 8 ms 20348 KB Output is correct
31 Correct 4 ms 19036 KB Output is correct
32 Correct 4 ms 19036 KB Output is correct
33 Correct 3 ms 19036 KB Output is correct
34 Correct 4 ms 19132 KB Output is correct
35 Correct 4 ms 19036 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 52228 KB Output is correct
2 Correct 4 ms 19032 KB Output is correct
3 Correct 117 ms 51580 KB Output is correct
4 Correct 112 ms 51136 KB Output is correct
5 Correct 89 ms 49348 KB Output is correct
6 Correct 125 ms 51988 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 46028 KB Output is correct
2 Correct 156 ms 41156 KB Output is correct
3 Correct 173 ms 44552 KB Output is correct
4 Correct 151 ms 44660 KB Output is correct
5 Correct 168 ms 44740 KB Output is correct
6 Correct 124 ms 46020 KB Output is correct
7 Correct 124 ms 46020 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 46028 KB Output is correct
2 Correct 156 ms 41156 KB Output is correct
3 Correct 173 ms 44552 KB Output is correct
4 Correct 151 ms 44660 KB Output is correct
5 Correct 168 ms 44740 KB Output is correct
6 Correct 124 ms 46020 KB Output is correct
7 Correct 124 ms 46020 KB Output is correct
8 Correct 114 ms 43820 KB Output is correct
9 Correct 114 ms 43704 KB Output is correct
10 Correct 81 ms 48868 KB Output is correct
11 Correct 79 ms 48944 KB Output is correct
12 Correct 70 ms 33868 KB Output is correct
13 Correct 72 ms 33856 KB Output is correct
14 Correct 110 ms 39364 KB Output is correct
15 Correct 117 ms 39708 KB Output is correct
16 Correct 175 ms 45924 KB Output is correct
17 Correct 153 ms 46212 KB Output is correct
18 Correct 147 ms 44116 KB Output is correct
19 Correct 165 ms 41616 KB Output is correct
20 Correct 128 ms 46312 KB Output is correct
21 Correct 131 ms 46536 KB Output is correct
22 Correct 134 ms 46276 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19156 KB Output is correct
2 Correct 7 ms 20096 KB Output is correct
3 Correct 7 ms 20056 KB Output is correct
4 Correct 4 ms 19132 KB Output is correct
5 Correct 3 ms 19036 KB Output is correct
6 Correct 8 ms 20892 KB Output is correct
7 Correct 7 ms 20316 KB Output is correct
8 Correct 21 ms 20060 KB Output is correct
9 Correct 8 ms 20316 KB Output is correct
10 Correct 3 ms 19036 KB Output is correct
11 Correct 5 ms 19036 KB Output is correct
12 Correct 4 ms 19048 KB Output is correct
13 Correct 4 ms 19092 KB Output is correct
14 Correct 3 ms 19036 KB Output is correct
15 Correct 34 ms 26432 KB Output is correct
16 Correct 33 ms 26316 KB Output is correct
17 Correct 33 ms 26320 KB Output is correct
18 Correct 9 ms 21084 KB Output is correct
19 Correct 8 ms 20380 KB Output is correct
20 Correct 114 ms 26056 KB Output is correct
21 Correct 63 ms 26052 KB Output is correct
22 Correct 3 ms 19036 KB Output is correct
23 Correct 7 ms 20060 KB Output is correct
24 Correct 9 ms 20040 KB Output is correct
25 Correct 3 ms 19036 KB Output is correct
26 Correct 3 ms 19088 KB Output is correct
27 Correct 10 ms 20828 KB Output is correct
28 Correct 7 ms 20316 KB Output is correct
29 Correct 23 ms 20248 KB Output is correct
30 Correct 8 ms 20348 KB Output is correct
31 Correct 4 ms 19036 KB Output is correct
32 Correct 4 ms 19036 KB Output is correct
33 Correct 3 ms 19036 KB Output is correct
34 Correct 4 ms 19132 KB Output is correct
35 Correct 4 ms 19036 KB Output is correct
36 Correct 124 ms 52228 KB Output is correct
37 Correct 4 ms 19032 KB Output is correct
38 Correct 117 ms 51580 KB Output is correct
39 Correct 112 ms 51136 KB Output is correct
40 Correct 89 ms 49348 KB Output is correct
41 Correct 125 ms 51988 KB Output is correct
42 Correct 127 ms 46028 KB Output is correct
43 Correct 156 ms 41156 KB Output is correct
44 Correct 173 ms 44552 KB Output is correct
45 Correct 151 ms 44660 KB Output is correct
46 Correct 168 ms 44740 KB Output is correct
47 Correct 124 ms 46020 KB Output is correct
48 Correct 124 ms 46020 KB Output is correct
49 Correct 114 ms 43820 KB Output is correct
50 Correct 114 ms 43704 KB Output is correct
51 Correct 81 ms 48868 KB Output is correct
52 Correct 79 ms 48944 KB Output is correct
53 Correct 70 ms 33868 KB Output is correct
54 Correct 72 ms 33856 KB Output is correct
55 Correct 110 ms 39364 KB Output is correct
56 Correct 117 ms 39708 KB Output is correct
57 Correct 175 ms 45924 KB Output is correct
58 Correct 153 ms 46212 KB Output is correct
59 Correct 147 ms 44116 KB Output is correct
60 Correct 165 ms 41616 KB Output is correct
61 Correct 128 ms 46312 KB Output is correct
62 Correct 131 ms 46536 KB Output is correct
63 Correct 134 ms 46276 KB Output is correct
64 Correct 123 ms 45072 KB Output is correct
65 Correct 261 ms 50964 KB Output is correct
66 Correct 128 ms 46792 KB Output is correct
67 Correct 120 ms 42648 KB Output is correct
68 Correct 63 ms 31916 KB Output is correct
69 Correct 83 ms 31860 KB Output is correct
70 Correct 118 ms 46128 KB Output is correct
71 Correct 108 ms 43696 KB Output is correct
72 Correct 4 ms 19032 KB Output is correct
73 Correct 7 ms 20060 KB Output is correct
74 Correct 8 ms 20060 KB Output is correct
75 Correct 4 ms 19036 KB Output is correct
76 Correct 3 ms 19036 KB Output is correct
77 Correct 9 ms 20960 KB Output is correct
78 Correct 8 ms 20312 KB Output is correct
79 Correct 16 ms 20060 KB Output is correct
80 Correct 8 ms 20316 KB Output is correct
81 Correct 3 ms 19036 KB Output is correct
82 Correct 3 ms 19036 KB Output is correct
83 Correct 3 ms 19036 KB Output is correct
84 Correct 3 ms 19036 KB Output is correct
85 Correct 3 ms 19036 KB Output is correct
86 Correct 35 ms 26496 KB Output is correct
87 Correct 44 ms 26536 KB Output is correct
88 Correct 41 ms 26560 KB Output is correct
89 Correct 8 ms 21084 KB Output is correct
90 Correct 8 ms 20316 KB Output is correct
91 Correct 116 ms 26072 KB Output is correct
92 Correct 64 ms 26076 KB Output is correct
93 Correct 3 ms 19036 KB Output is correct
94 Correct 122 ms 52272 KB Output is correct
95 Correct 117 ms 51732 KB Output is correct
96 Correct 115 ms 51040 KB Output is correct
97 Correct 89 ms 49344 KB Output is correct
98 Correct 116 ms 52080 KB Output is correct
99 Correct 163 ms 48364 KB Output is correct
100 Correct 162 ms 45676 KB Output is correct
101 Correct 170 ms 45936 KB Output is correct
102 Correct 144 ms 41668 KB Output is correct
103 Correct 141 ms 46024 KB Output is correct
104 Correct 126 ms 46540 KB Output is correct
105 Correct 133 ms 45944 KB Output is correct
106 Correct 114 ms 43776 KB Output is correct
107 Correct 100 ms 43752 KB Output is correct
108 Correct 78 ms 49096 KB Output is correct
109 Correct 79 ms 48936 KB Output is correct
110 Correct 74 ms 33868 KB Output is correct
111 Correct 68 ms 33900 KB Output is correct
112 Correct 111 ms 39268 KB Output is correct
113 Correct 130 ms 39728 KB Output is correct