oj.uz

Submission #786293

# Submission time Handle Problem Language Result Execution time Memory
786293 2023-07-18T06:12:08 Z chanhchuong123 Railway (BOI17_railway) C++14
100 / 100
 175 ms 46100 KB 
#include <bits/stdc++.h>
using namespace std;
#define task ""
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (b), _a = (a); i >= _a; --i)

template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}

const int dx[] = {-1, 0, 0, +1};
const int dy[] = {0, -1, +1, 0};

const int MAX = 100100;
int n, k, m;
int ID[MAX];
vector<int> res;
set<int> add[MAX];
vector<int> del[MAX];
int h[MAX], anc[17][MAX];
vector<pair<int, int>> adj[MAX];

void dfs(int u, int p) {
    for (pair<int, int> &x: adj[u]) if (x.fi != p) {
        int v = x.fi;
        ID[v] = x.se;
        anc[0][v] = u;
        h[v] = h[u] + 1;
        for (int j = 1; j <= 16; ++j) {
            anc[j][v] = anc[j - 1][anc[j - 1][v]];
        }
        dfs(v, u);
    }
}

int lca(int u, int v) {
    if (h[u] < h[v]) swap(u, v);
    int k = h[u] - h[v];
    for (int j = 0; (1 << j) <= k; ++j) {
        if (k >> j & 1) u = anc[j][u];
    }
    if (u == v) return u;
    for (int j = 16; j >= 0; --j) {
        if (anc[j][u] != anc[j][v]) {
            u = anc[j][u];
            v = anc[j][v];
        }
    }
    return anc[0][u];
}

void reDfs(int u, int p) {
    for (pair<int, int> &x: adj[u]) if (x.fi != p) {
        int v = x.fi; reDfs(v, u); if (add[u].size() < add[v].size()) add[u].swap(add[v]);
        for (int x: add[v]) add[u].insert(x);
    }
    for (int &x: del[u]) add[u].erase(x);
    if (add[u].size() >= k && u != 1) {
        res.push_back(ID[u]);
    }
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(nullptr);

	if (fopen(task".inp", "r")) {
		freopen(task".inp", "r", stdin);
		freopen(task".out", "w", stdout);
	}

	cin >> n >> m >> k;
	for (int i = 1; i < n; ++i) {
        int u, v; cin >> u >> v;
        adj[u].push_back({v, i});
        adj[v].push_back({u, i});
	}
	dfs(1, -1);
	for (int i = 1; i <= m; ++i) {
        int s, c, u; cin >> s >> c;
        --s; add[c].insert(i);
        while (s--) {
            cin >> u;
          	c = lca(c, u);
            add[u].insert(i);
        }
        del[c].push_back(i);
	}
	reDfs(1, -1);
	sort(all(res));
	cout << res.size() << '\n';
	for (int &x: res) cout << x << ' ';

	return 0;
}

Compilation message

railway.cpp: In function 'void reDfs(int, int)':
railway.cpp:64:23: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   64 |     if (add[u].size() >= k && u != 1) {
      |         ~~~~~~~~~~~~~~^~~~
railway.cpp: In function 'int main()':
railway.cpp:73:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |   freopen(task".inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
railway.cpp:74:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |   freopen(task".out", "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9812 KB Output is correct
2 Correct 8 ms 11068 KB Output is correct
3 Correct 10 ms 11164 KB Output is correct
4 Correct 4 ms 9812 KB Output is correct
5 Correct 5 ms 9740 KB Output is correct
6 Correct 9 ms 11940 KB Output is correct
7 Correct 9 ms 11292 KB Output is correct
8 Correct 8 ms 11220 KB Output is correct
9 Correct 8 ms 11220 KB Output is correct
10 Correct 4 ms 9740 KB Output is correct
11 Correct 5 ms 9812 KB Output is correct
12 Correct 4 ms 9812 KB Output is correct
13 Correct 4 ms 9812 KB Output is correct
14 Correct 4 ms 9812 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9812 KB Output is correct
2 Correct 8 ms 11068 KB Output is correct
3 Correct 10 ms 11164 KB Output is correct
4 Correct 4 ms 9812 KB Output is correct
5 Correct 5 ms 9740 KB Output is correct
6 Correct 9 ms 11940 KB Output is correct
7 Correct 9 ms 11292 KB Output is correct
8 Correct 8 ms 11220 KB Output is correct
9 Correct 8 ms 11220 KB Output is correct
10 Correct 4 ms 9740 KB Output is correct
11 Correct 5 ms 9812 KB Output is correct
12 Correct 4 ms 9812 KB Output is correct
13 Correct 4 ms 9812 KB Output is correct
14 Correct 4 ms 9812 KB Output is correct
15 Correct 34 ms 16924 KB Output is correct
16 Correct 36 ms 16968 KB Output is correct
17 Correct 36 ms 16972 KB Output is correct
18 Correct 10 ms 12060 KB Output is correct
19 Correct 9 ms 11348 KB Output is correct
20 Correct 33 ms 16236 KB Output is correct
21 Correct 35 ms 16224 KB Output is correct
22 Correct 4 ms 9812 KB Output is correct
23 Correct 9 ms 11176 KB Output is correct
24 Correct 8 ms 11092 KB Output is correct
25 Correct 5 ms 9744 KB Output is correct
26 Correct 4 ms 9748 KB Output is correct
27 Correct 9 ms 11988 KB Output is correct
28 Correct 8 ms 11280 KB Output is correct
29 Correct 7 ms 11220 KB Output is correct
30 Correct 9 ms 11296 KB Output is correct
31 Correct 4 ms 9812 KB Output is correct
32 Correct 4 ms 9812 KB Output is correct
33 Correct 5 ms 9736 KB Output is correct
34 Correct 4 ms 9812 KB Output is correct
35 Correct 5 ms 9744 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 43732 KB Output is correct
2 Correct 5 ms 9812 KB Output is correct
3 Correct 113 ms 45236 KB Output is correct
4 Correct 106 ms 44792 KB Output is correct
5 Correct 94 ms 43660 KB Output is correct
6 Correct 115 ms 46100 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 36132 KB Output is correct
2 Correct 136 ms 32808 KB Output is correct
3 Correct 134 ms 38384 KB Output is correct
4 Correct 141 ms 38268 KB Output is correct
5 Correct 144 ms 38468 KB Output is correct
6 Correct 108 ms 38112 KB Output is correct
7 Correct 111 ms 38108 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 36132 KB Output is correct
2 Correct 136 ms 32808 KB Output is correct
3 Correct 134 ms 38384 KB Output is correct
4 Correct 141 ms 38268 KB Output is correct
5 Correct 144 ms 38468 KB Output is correct
6 Correct 108 ms 38112 KB Output is correct
7 Correct 111 ms 38108 KB Output is correct
8 Correct 101 ms 36744 KB Output is correct
9 Correct 107 ms 36776 KB Output is correct
10 Correct 94 ms 43532 KB Output is correct
11 Correct 87 ms 43380 KB Output is correct
12 Correct 57 ms 27120 KB Output is correct
13 Correct 71 ms 27200 KB Output is correct
14 Correct 105 ms 33200 KB Output is correct
15 Correct 132 ms 33384 KB Output is correct
16 Correct 137 ms 39240 KB Output is correct
17 Correct 138 ms 39716 KB Output is correct
18 Correct 135 ms 37464 KB Output is correct
19 Correct 127 ms 33360 KB Output is correct
20 Correct 118 ms 38432 KB Output is correct
21 Correct 105 ms 38420 KB Output is correct
22 Correct 103 ms 38420 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9812 KB Output is correct
2 Correct 8 ms 11068 KB Output is correct
3 Correct 10 ms 11164 KB Output is correct
4 Correct 4 ms 9812 KB Output is correct
5 Correct 5 ms 9740 KB Output is correct
6 Correct 9 ms 11940 KB Output is correct
7 Correct 9 ms 11292 KB Output is correct
8 Correct 8 ms 11220 KB Output is correct
9 Correct 8 ms 11220 KB Output is correct
10 Correct 4 ms 9740 KB Output is correct
11 Correct 5 ms 9812 KB Output is correct
12 Correct 4 ms 9812 KB Output is correct
13 Correct 4 ms 9812 KB Output is correct
14 Correct 4 ms 9812 KB Output is correct
15 Correct 34 ms 16924 KB Output is correct
16 Correct 36 ms 16968 KB Output is correct
17 Correct 36 ms 16972 KB Output is correct
18 Correct 10 ms 12060 KB Output is correct
19 Correct 9 ms 11348 KB Output is correct
20 Correct 33 ms 16236 KB Output is correct
21 Correct 35 ms 16224 KB Output is correct
22 Correct 4 ms 9812 KB Output is correct
23 Correct 9 ms 11176 KB Output is correct
24 Correct 8 ms 11092 KB Output is correct
25 Correct 5 ms 9744 KB Output is correct
26 Correct 4 ms 9748 KB Output is correct
27 Correct 9 ms 11988 KB Output is correct
28 Correct 8 ms 11280 KB Output is correct
29 Correct 7 ms 11220 KB Output is correct
30 Correct 9 ms 11296 KB Output is correct
31 Correct 4 ms 9812 KB Output is correct
32 Correct 4 ms 9812 KB Output is correct
33 Correct 5 ms 9736 KB Output is correct
34 Correct 4 ms 9812 KB Output is correct
35 Correct 5 ms 9744 KB Output is correct
36 Correct 113 ms 43732 KB Output is correct
37 Correct 5 ms 9812 KB Output is correct
38 Correct 113 ms 45236 KB Output is correct
39 Correct 106 ms 44792 KB Output is correct
40 Correct 94 ms 43660 KB Output is correct
41 Correct 115 ms 46100 KB Output is correct
42 Correct 102 ms 36132 KB Output is correct
43 Correct 136 ms 32808 KB Output is correct
44 Correct 134 ms 38384 KB Output is correct
45 Correct 141 ms 38268 KB Output is correct
46 Correct 144 ms 38468 KB Output is correct
47 Correct 108 ms 38112 KB Output is correct
48 Correct 111 ms 38108 KB Output is correct
49 Correct 101 ms 36744 KB Output is correct
50 Correct 107 ms 36776 KB Output is correct
51 Correct 94 ms 43532 KB Output is correct
52 Correct 87 ms 43380 KB Output is correct
53 Correct 57 ms 27120 KB Output is correct
54 Correct 71 ms 27200 KB Output is correct
55 Correct 105 ms 33200 KB Output is correct
56 Correct 132 ms 33384 KB Output is correct
57 Correct 137 ms 39240 KB Output is correct
58 Correct 138 ms 39716 KB Output is correct
59 Correct 135 ms 37464 KB Output is correct
60 Correct 127 ms 33360 KB Output is correct
61 Correct 118 ms 38432 KB Output is correct
62 Correct 105 ms 38420 KB Output is correct
63 Correct 103 ms 38420 KB Output is correct
64 Correct 134 ms 37276 KB Output is correct
65 Correct 175 ms 44908 KB Output is correct
66 Correct 132 ms 40524 KB Output is correct
67 Correct 134 ms 36264 KB Output is correct
68 Correct 55 ms 25620 KB Output is correct
69 Correct 67 ms 25680 KB Output is correct
70 Correct 107 ms 38452 KB Output is correct
71 Correct 90 ms 36600 KB Output is correct
72 Correct 5 ms 9812 KB Output is correct
73 Correct 8 ms 11064 KB Output is correct
74 Correct 8 ms 11092 KB Output is correct
75 Correct 5 ms 9812 KB Output is correct
76 Correct 4 ms 9740 KB Output is correct
77 Correct 8 ms 11932 KB Output is correct
78 Correct 8 ms 11220 KB Output is correct
79 Correct 8 ms 11152 KB Output is correct
80 Correct 8 ms 11220 KB Output is correct
81 Correct 4 ms 9812 KB Output is correct
82 Correct 6 ms 9812 KB Output is correct
83 Correct 4 ms 9812 KB Output is correct
84 Correct 4 ms 9744 KB Output is correct
85 Correct 5 ms 9812 KB Output is correct
86 Correct 32 ms 16972 KB Output is correct
87 Correct 34 ms 16980 KB Output is correct
88 Correct 34 ms 16932 KB Output is correct
89 Correct 9 ms 12116 KB Output is correct
90 Correct 8 ms 11296 KB Output is correct
91 Correct 37 ms 16284 KB Output is correct
92 Correct 38 ms 16180 KB Output is correct
93 Correct 5 ms 9748 KB Output is correct
94 Correct 129 ms 45500 KB Output is correct
95 Correct 111 ms 45184 KB Output is correct
96 Correct 109 ms 44684 KB Output is correct
97 Correct 101 ms 43572 KB Output is correct
98 Correct 106 ms 46080 KB Output is correct
99 Correct 170 ms 41876 KB Output is correct
100 Correct 139 ms 39064 KB Output is correct
101 Correct 152 ms 39448 KB Output is correct
102 Correct 127 ms 33004 KB Output is correct
103 Correct 115 ms 38092 KB Output is correct
104 Correct 107 ms 38480 KB Output is correct
105 Correct 112 ms 38020 KB Output is correct
106 Correct 107 ms 37012 KB Output is correct
107 Correct 106 ms 36868 KB Output is correct
108 Correct 89 ms 43460 KB Output is correct
109 Correct 82 ms 43460 KB Output is correct
110 Correct 63 ms 27156 KB Output is correct
111 Correct 60 ms 27184 KB Output is correct
112 Correct 105 ms 33024 KB Output is correct
113 Correct 116 ms 33040 KB Output is correct