#include <iostream>
#include <algorithm>
#include <vector>
#include <unordered_set>
#define avg(a ,b) ((a + b) / 2)
using namespace std;
vector<vector<int>> map_of_cities;
int num_not_satisfy(unordered_set<int> & visited_set, int num_workers, int city)
{
int i, child_city, children = map_of_cities[city].size(), rec_res, num_children = 0;
visited_set.insert(city);
for (i = 0, rec_res = 0; i < children; i++) {
child_city = map_of_cities[city][i];
if (visited_set.find(child_city) == visited_set.end()) {
num_children++;
rec_res += num_not_satisfy(visited_set, num_workers, child_city);
}
}
if (num_children + rec_res < num_workers) {
return 0;
} else {
return num_children + rec_res - num_workers;
}
}
int main()
{
int n, i, res, bsearch_start, bsearch_end, bsearch_mid, road_from, road_to;
cin >> n;
for (i = 0; i < n; i++) {
vector<int> temp;
map_of_cities.push_back(temp);
}
for (i = 1; i < n; i++) {
cin >> road_from >> road_to;
map_of_cities[road_from - 1].push_back(road_to - 1);
map_of_cities[road_to - 1].push_back(road_from - 1);
}
bsearch_start = 0, bsearch_end = n;
for (; bsearch_start < bsearch_end; ) {
bsearch_mid = avg(bsearch_start, bsearch_end);
unordered_set<int> visited_set;
res = num_not_satisfy(visited_set, bsearch_mid, 0);
if (res != 0) {
bsearch_start = bsearch_mid + 1;
} else {
bsearch_end = bsearch_mid;
}
}
res = bsearch_start;
cout << res << endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
372 KB |
Output is correct |
3 |
Correct |
2 ms |
408 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
408 KB |
Output is correct |
2 |
Correct |
2 ms |
408 KB |
Output is correct |
3 |
Correct |
2 ms |
408 KB |
Output is correct |
4 |
Correct |
2 ms |
456 KB |
Output is correct |
5 |
Correct |
2 ms |
508 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
512 KB |
Output is correct |
2 |
Correct |
2 ms |
512 KB |
Output is correct |
3 |
Correct |
2 ms |
512 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
564 KB |
Output is correct |
2 |
Correct |
4 ms |
564 KB |
Output is correct |
3 |
Correct |
5 ms |
696 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
39 ms |
1556 KB |
Output is correct |
2 |
Correct |
38 ms |
1828 KB |
Output is correct |
3 |
Correct |
36 ms |
1828 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
163 ms |
3856 KB |
Output is correct |
2 |
Correct |
197 ms |
4836 KB |
Output is correct |
3 |
Correct |
130 ms |
4836 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
880 ms |
10240 KB |
Output is correct |
2 |
Correct |
888 ms |
12832 KB |
Output is correct |
3 |
Correct |
565 ms |
12832 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1945 ms |
19988 KB |
Output is correct |
2 |
Correct |
1838 ms |
28352 KB |
Output is correct |
3 |
Correct |
1379 ms |
28352 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2036 ms |
35484 KB |
Time limit exceeded |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2009 ms |
35484 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |