#include <iostream>
#include <algorithm>
#include <vector>
#include <unordered_set>
#define avg(a ,b) ((a + b) / 2)
#define ARR_SIZE 300050
using namespace std;
int
num_not_satisfy(char visited_set[], int num_workers, int city, vector<vector<int>> & map_of_cities)
{
int i, child_city, children, rec_res, num_children;
for (i = 0, rec_res = 0, visited_set[city] = 1, children = map_of_cities[city].size(), num_children = 0; i < children; i++) {
child_city = map_of_cities[city][i];
if (visited_set[child_city] != 0) {
goto nextiteration; }
num_children++;
rec_res += num_not_satisfy(visited_set, num_workers, child_city, map_of_cities);
nextiteration: ; }
return ((num_children + rec_res - num_workers <= 0) ? 0 : (num_children + rec_res - num_workers));
}
int
main(int argc, char * argv[])
{
int n, i, res, bsearch_start, bsearch_end, bsearch_mid, road_from, road_to;
cin >> n;
vector<vector<int>> map_of_cities;
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); }
for (bsearch_start = 0, bsearch_end = n; bsearch_start < bsearch_end; ) {
bsearch_mid = avg(bsearch_start, bsearch_end);
char visited_set[n + 5] = { 0 };
res = num_not_satisfy(visited_set, bsearch_mid, 0, map_of_cities);
((res != 0) ? (bsearch_start = bsearch_mid + 1) : (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 |
3 ms |
448 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
464 KB |
Output is correct |
2 |
Correct |
2 ms |
464 KB |
Output is correct |
3 |
Correct |
2 ms |
464 KB |
Output is correct |
4 |
Correct |
2 ms |
484 KB |
Output is correct |
5 |
Correct |
2 ms |
500 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
500 KB |
Output is correct |
2 |
Correct |
2 ms |
500 KB |
Output is correct |
3 |
Correct |
2 ms |
500 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
532 KB |
Output is correct |
2 |
Correct |
3 ms |
532 KB |
Output is correct |
3 |
Correct |
3 ms |
532 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
1040 KB |
Output is correct |
2 |
Correct |
15 ms |
1296 KB |
Output is correct |
3 |
Correct |
12 ms |
1296 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
53 ms |
2312 KB |
Output is correct |
2 |
Correct |
51 ms |
3528 KB |
Output is correct |
3 |
Correct |
34 ms |
3528 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
215 ms |
6328 KB |
Output is correct |
2 |
Correct |
235 ms |
8764 KB |
Output is correct |
3 |
Correct |
121 ms |
8764 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
833 ms |
12172 KB |
Output is correct |
2 |
Correct |
807 ms |
17872 KB |
Output is correct |
3 |
Correct |
261 ms |
17872 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1513 ms |
17872 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1683 ms |
17872 KB |
Output is correct |
2 |
Correct |
1250 ms |
24404 KB |
Output is correct |
3 |
Correct |
601 ms |
24404 KB |
Output is correct |