oj.uz

Submission #851027

# Submission time Handle Problem Language Result Execution time Memory
851027 2023-09-18T08:42:32 Z anhphant Railway (BOI17_railway) C++14
100 / 100
 171 ms 47700 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int , int> II;
const int N = 1e5 + 3;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;

int n, m, k, f[N][20], depth[N];
vector<int> g[N], ans, anc[N];
set<int> S[N];
II ed[N];

void dfs(int u, int p){
       depth[u] = depth[p] + 1;
       f[u][0] = p;
       for(int i = 1; i < 20; i ++) f[u][i] = f[f[u][i - 1]][i - 1];
       for(int id : g[u]){
              int v = ed[id].first + ed[id].second - u;
              if(v == p) continue;
              dfs(v, u);
       }
}

int lca(int u, int v){
       if(depth[u] < depth[v]) swap(u, v);
       for(int i = 19; i >= 0; i --){
              if(depth[f[u][i]] >= depth[v]) u = f[u][i];
       }
       if(u == v) return u;
       for(int i = 19; i >= 0; i --){
              if(f[u][i] != f[v][i]) u = f[u][i], v = f[v][i];
       }
       return f[u][0];
}

void process(int u, int id){
       for(int i : g[u]){
              if(i == id) continue;
              int v = ed[i].first + ed[i].second - u;
              process(v , i);
              if(S[v].size() > S[u].size()) swap(S[u], S[v]);
              for(auto x : S[v]) S[u].insert(x);
       }
       for(auto x : anc[u]) S[u].erase(x);
       if(S[u].size() >= k) ans.push_back(id);
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m >> k;
    for(int i = 1; i < n; i ++){
              int u, v;
              cin >> u >> v;
              g[u].push_back(i);
              g[v].push_back(i);
              ed[i] = II(u, v);
    }
    dfs(1, 0);
    for(int i = 1; i <= m; i ++){
              int s, LCA = 0;
              cin >> s >> LCA;
              S[LCA].insert(i);
              for(int j = 2; j <= s; j ++){
                     int k;
                     cin >> k;
                     LCA = lca(LCA, k);
                     S[k].insert(i);
              }
              anc[LCA].push_back(i);
    }
    process(1, 0);
    cout << ans.size() << endl;
    sort(ans.begin(), ans.end());
    for(auto x : ans) cout << x << " ";
    return 0;
}

Compilation message

railway.cpp: In function 'void process(int, int)':
railway.cpp:46:23: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   46 |        if(S[u].size() >= k) ans.push_back(id);
      |           ~~~~~~~~~~~~^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12636 KB Output is correct
2 Correct 7 ms 13400 KB Output is correct
3 Correct 8 ms 13400 KB Output is correct
4 Correct 2 ms 12632 KB Output is correct
5 Correct 2 ms 12632 KB Output is correct
6 Correct 7 ms 14168 KB Output is correct
7 Correct 7 ms 13400 KB Output is correct
8 Correct 6 ms 13400 KB Output is correct
9 Correct 6 ms 13400 KB Output is correct
10 Correct 3 ms 12632 KB Output is correct
11 Correct 2 ms 12632 KB Output is correct
12 Correct 2 ms 12632 KB Output is correct
13 Correct 2 ms 12632 KB Output is correct
14 Correct 2 ms 12736 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12636 KB Output is correct
2 Correct 7 ms 13400 KB Output is correct
3 Correct 8 ms 13400 KB Output is correct
4 Correct 2 ms 12632 KB Output is correct
5 Correct 2 ms 12632 KB Output is correct
6 Correct 7 ms 14168 KB Output is correct
7 Correct 7 ms 13400 KB Output is correct
8 Correct 6 ms 13400 KB Output is correct
9 Correct 6 ms 13400 KB Output is correct
10 Correct 3 ms 12632 KB Output is correct
11 Correct 2 ms 12632 KB Output is correct
12 Correct 2 ms 12632 KB Output is correct
13 Correct 2 ms 12632 KB Output is correct
14 Correct 2 ms 12736 KB Output is correct
15 Correct 46 ms 19140 KB Output is correct
16 Correct 39 ms 19012 KB Output is correct
17 Correct 36 ms 19024 KB Output is correct
18 Correct 8 ms 14172 KB Output is correct
19 Correct 6 ms 13400 KB Output is correct
20 Correct 38 ms 18336 KB Output is correct
21 Correct 37 ms 18256 KB Output is correct
22 Correct 3 ms 12636 KB Output is correct
23 Correct 7 ms 13404 KB Output is correct
24 Correct 8 ms 13400 KB Output is correct
25 Correct 2 ms 12632 KB Output is correct
26 Correct 3 ms 12632 KB Output is correct
27 Correct 7 ms 14168 KB Output is correct
28 Correct 7 ms 13404 KB Output is correct
29 Correct 7 ms 13400 KB Output is correct
30 Correct 8 ms 13400 KB Output is correct
31 Correct 2 ms 12632 KB Output is correct
32 Correct 2 ms 12632 KB Output is correct
33 Correct 2 ms 12632 KB Output is correct
34 Correct 2 ms 12632 KB Output is correct
35 Correct 4 ms 12632 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 46288 KB Output is correct
2 Correct 3 ms 12632 KB Output is correct
3 Correct 119 ms 46112 KB Output is correct
4 Correct 117 ms 45684 KB Output is correct
5 Correct 104 ms 44652 KB Output is correct
6 Correct 129 ms 46796 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 38252 KB Output is correct
2 Correct 124 ms 33360 KB Output is correct
3 Correct 166 ms 39060 KB Output is correct
4 Correct 134 ms 38912 KB Output is correct
5 Correct 145 ms 39112 KB Output is correct
6 Correct 113 ms 38480 KB Output is correct
7 Correct 131 ms 38480 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 38252 KB Output is correct
2 Correct 124 ms 33360 KB Output is correct
3 Correct 166 ms 39060 KB Output is correct
4 Correct 134 ms 38912 KB Output is correct
5 Correct 145 ms 39112 KB Output is correct
6 Correct 113 ms 38480 KB Output is correct
7 Correct 131 ms 38480 KB Output is correct
8 Correct 118 ms 37456 KB Output is correct
9 Correct 101 ms 37456 KB Output is correct
10 Correct 98 ms 44740 KB Output is correct
11 Correct 98 ms 44492 KB Output is correct
12 Correct 72 ms 27984 KB Output is correct
13 Correct 76 ms 28064 KB Output is correct
14 Correct 112 ms 33688 KB Output is correct
15 Correct 114 ms 34596 KB Output is correct
16 Correct 139 ms 40520 KB Output is correct
17 Correct 137 ms 40740 KB Output is correct
18 Correct 159 ms 38724 KB Output is correct
19 Correct 134 ms 34384 KB Output is correct
20 Correct 120 ms 39504 KB Output is correct
21 Correct 106 ms 39628 KB Output is correct
22 Correct 108 ms 39504 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12636 KB Output is correct
2 Correct 7 ms 13400 KB Output is correct
3 Correct 8 ms 13400 KB Output is correct
4 Correct 2 ms 12632 KB Output is correct
5 Correct 2 ms 12632 KB Output is correct
6 Correct 7 ms 14168 KB Output is correct
7 Correct 7 ms 13400 KB Output is correct
8 Correct 6 ms 13400 KB Output is correct
9 Correct 6 ms 13400 KB Output is correct
10 Correct 3 ms 12632 KB Output is correct
11 Correct 2 ms 12632 KB Output is correct
12 Correct 2 ms 12632 KB Output is correct
13 Correct 2 ms 12632 KB Output is correct
14 Correct 2 ms 12736 KB Output is correct
15 Correct 46 ms 19140 KB Output is correct
16 Correct 39 ms 19012 KB Output is correct
17 Correct 36 ms 19024 KB Output is correct
18 Correct 8 ms 14172 KB Output is correct
19 Correct 6 ms 13400 KB Output is correct
20 Correct 38 ms 18336 KB Output is correct
21 Correct 37 ms 18256 KB Output is correct
22 Correct 3 ms 12636 KB Output is correct
23 Correct 7 ms 13404 KB Output is correct
24 Correct 8 ms 13400 KB Output is correct
25 Correct 2 ms 12632 KB Output is correct
26 Correct 3 ms 12632 KB Output is correct
27 Correct 7 ms 14168 KB Output is correct
28 Correct 7 ms 13404 KB Output is correct
29 Correct 7 ms 13400 KB Output is correct
30 Correct 8 ms 13400 KB Output is correct
31 Correct 2 ms 12632 KB Output is correct
32 Correct 2 ms 12632 KB Output is correct
33 Correct 2 ms 12632 KB Output is correct
34 Correct 2 ms 12632 KB Output is correct
35 Correct 4 ms 12632 KB Output is correct
36 Correct 149 ms 46288 KB Output is correct
37 Correct 3 ms 12632 KB Output is correct
38 Correct 119 ms 46112 KB Output is correct
39 Correct 117 ms 45684 KB Output is correct
40 Correct 104 ms 44652 KB Output is correct
41 Correct 129 ms 46796 KB Output is correct
42 Correct 123 ms 38252 KB Output is correct
43 Correct 124 ms 33360 KB Output is correct
44 Correct 166 ms 39060 KB Output is correct
45 Correct 134 ms 38912 KB Output is correct
46 Correct 145 ms 39112 KB Output is correct
47 Correct 113 ms 38480 KB Output is correct
48 Correct 131 ms 38480 KB Output is correct
49 Correct 118 ms 37456 KB Output is correct
50 Correct 101 ms 37456 KB Output is correct
51 Correct 98 ms 44740 KB Output is correct
52 Correct 98 ms 44492 KB Output is correct
53 Correct 72 ms 27984 KB Output is correct
54 Correct 76 ms 28064 KB Output is correct
55 Correct 112 ms 33688 KB Output is correct
56 Correct 114 ms 34596 KB Output is correct
57 Correct 139 ms 40520 KB Output is correct
58 Correct 137 ms 40740 KB Output is correct
59 Correct 159 ms 38724 KB Output is correct
60 Correct 134 ms 34384 KB Output is correct
61 Correct 120 ms 39504 KB Output is correct
62 Correct 106 ms 39628 KB Output is correct
63 Correct 108 ms 39504 KB Output is correct
64 Correct 105 ms 38480 KB Output is correct
65 Correct 171 ms 46060 KB Output is correct
66 Correct 161 ms 41544 KB Output is correct
67 Correct 121 ms 37672 KB Output is correct
68 Correct 57 ms 26704 KB Output is correct
69 Correct 69 ms 26836 KB Output is correct
70 Correct 105 ms 39632 KB Output is correct
71 Correct 101 ms 37680 KB Output is correct
72 Correct 3 ms 12868 KB Output is correct
73 Correct 6 ms 13400 KB Output is correct
74 Correct 6 ms 13400 KB Output is correct
75 Correct 2 ms 12632 KB Output is correct
76 Correct 3 ms 12632 KB Output is correct
77 Correct 7 ms 14168 KB Output is correct
78 Correct 6 ms 13400 KB Output is correct
79 Correct 6 ms 13400 KB Output is correct
80 Correct 6 ms 13400 KB Output is correct
81 Correct 3 ms 12632 KB Output is correct
82 Correct 3 ms 12632 KB Output is correct
83 Correct 2 ms 12636 KB Output is correct
84 Correct 2 ms 12636 KB Output is correct
85 Correct 2 ms 12632 KB Output is correct
86 Correct 37 ms 19024 KB Output is correct
87 Correct 36 ms 19020 KB Output is correct
88 Correct 46 ms 19112 KB Output is correct
89 Correct 8 ms 14168 KB Output is correct
90 Correct 7 ms 13404 KB Output is correct
91 Correct 38 ms 18512 KB Output is correct
92 Correct 37 ms 18512 KB Output is correct
93 Correct 3 ms 12764 KB Output is correct
94 Correct 123 ms 47252 KB Output is correct
95 Correct 132 ms 47192 KB Output is correct
96 Correct 120 ms 46448 KB Output is correct
97 Correct 111 ms 45340 KB Output is correct
98 Correct 128 ms 47700 KB Output is correct
99 Correct 168 ms 42956 KB Output is correct
100 Correct 140 ms 40140 KB Output is correct
101 Correct 138 ms 40608 KB Output is correct
102 Correct 120 ms 34128 KB Output is correct
103 Correct 108 ms 39124 KB Output is correct
104 Correct 107 ms 39628 KB Output is correct
105 Correct 107 ms 39248 KB Output is correct
106 Correct 100 ms 37968 KB Output is correct
107 Correct 101 ms 37968 KB Output is correct
108 Correct 89 ms 45172 KB Output is correct
109 Correct 89 ms 45000 KB Output is correct
110 Correct 68 ms 28240 KB Output is correct
111 Correct 81 ms 28496 KB Output is correct
112 Correct 123 ms 34200 KB Output is correct
113 Correct 110 ms 34132 KB Output is correct