oj.uz

Submission #315249

# Submission time Handle Problem Language Result Execution time Memory
315249 2020-10-22T06:29:24 Z shrek12357 Triumphal arch (POI13_luk) C++14
100 / 100
 1329 ms 26088 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
#define ll long long
//cin.tie(0);ios_base::sync_with_stdio(0); 

const int MAXN = 3 * 1e5 + 5;
vector<int> adjList[MAXN];
int par[MAXN];
int n;
int good;

void dfs(int src) {
	for (auto i : adjList[src]) {
		if (i == par[src]) {
			continue;
		}
		par[i] = src;
		dfs(i);
	}
}

int check(int src, int mid) {
	int cur = 0;
	for (auto i : adjList[src]) {
		if (i == par[src]) {
			continue;
		}
		cur += check(i, mid) + 1;
	}
	cur -= mid;
	return max(0, cur);
}

int main() {
	cin >> n;
	par[0] = 0;
	for (int i = 0; i < n - 1; i++) {
		int a, b;
		cin >> a >> b;
		a--;
		b--;
		adjList[a].push_back(b);
		adjList[b].push_back(a);
	}
	dfs(0);
	int lo = 0, hi = n;
	while (lo < hi) {
		int mid = (lo + hi) / 2;
		good = true;
		if (check(0, mid) == 0) {
			hi = mid;
		}
		else {
			lo = mid + 1;
		}
	}
	cout << lo << endl;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7424 KB Output is correct
2 Correct 5 ms 7424 KB Output is correct
3 Correct 5 ms 7296 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 5 ms 7296 KB Output is correct
3 Correct 5 ms 7296 KB Output is correct
4 Correct 5 ms 7456 KB Output is correct
5 Correct 5 ms 7296 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 6 ms 7424 KB Output is correct
3 Correct 6 ms 7424 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7424 KB Output is correct
2 Correct 6 ms 7424 KB Output is correct
3 Correct 8 ms 7424 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 7680 KB Output is correct
2 Correct 19 ms 7952 KB Output is correct
3 Correct 17 ms 7808 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 8444 KB Output is correct
2 Correct 56 ms 9464 KB Output is correct
3 Correct 46 ms 8952 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 297 ms 11260 KB Output is correct
2 Correct 277 ms 12536 KB Output is correct
3 Correct 152 ms 11512 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 772 ms 14840 KB Output is correct
2 Correct 767 ms 20948 KB Output is correct
3 Correct 388 ms 17912 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1329 ms 18552 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1322 ms 18596 KB Output is correct
2 Correct 1277 ms 26088 KB Output is correct
3 Correct 658 ms 23288 KB Output is correct