oj.uz

Submission #491553

# Submission time Handle Problem Language Result Execution time Memory
491553 2021-12-03T05:15:04 Z mnair797 Hard route (IZhO17_road) C++17
100 / 100
 786 ms 91308 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <iomanip>
#include <unordered_map>
#include <utility>
#include <assert.h>
using namespace std;
void debug() {cout << endl;}
template <class T, class ...U> void debug(T a, U ... b) { cout << a << " "; debug(b...);}
template <class T> void pary(T l, T r) {
	while (l != r) {cout << *l << " ";l++;}
	cout << endl;
}
#define ll long long
#define ld long double
#define maxn 500005
#define mod 1000000007
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
vector<int> adj[maxn];
int f[maxn][3], cnt[maxn][2], deg[maxn], up[maxn], down[maxn], g[maxn][3];
void upd(int x, int n, int y) {
	if (x > f[n][0]) {
		f[n][2] = f[n][1], f[n][1] = f[n][0], f[n][0] = x;
		g[n][2] = g[n][1], g[n][1] = g[n][0], g[n][0] = y;
	} else if (x > f[n][1]){
		f[n][2] = f[n][1], f[n][1] = x;
		g[n][2] = g[n][1], g[n][1] = y;
	} else if (x > f[n][2]){
		f[n][2] = x, g[n][2] = y;
	}
}
void dfs(int n, int par) {
	for (int v:adj[n]) {
		if (v != par) {
			dfs(v, n);
			int x = f[v][0] + 1;
			if (x > f[n][0]) cnt[n][0] = cnt[v][0];
			else if (x == f[n][0]) cnt[n][0] += cnt[v][0];
			upd(x, n, cnt[v][0]);
		}
	}
	down[n] = f[n][0];
	if (deg[n] == 1) cnt[n][0]++;
}
void dfs2(int n, int par, int d) {
	upd(d, n, cnt[n][1]);
	up[n] = d;
	int best = d, bcnt = cnt[n][1], sec = 0, scnt = 0;
	for (int v:adj[n]) {
		if (v != par) {
			int x = f[v][0] + 1;
			if (x > best) sec = best, scnt = bcnt, best = x, bcnt = cnt[v][0];
			else if (x == best) bcnt += cnt[v][0];
			else if (x > sec) sec = x, scnt = cnt[v][0];
			else if (x == sec) scnt += cnt[v][0];
		}
	}
	for (int v:adj[n]) {
		if (v != par) {
			if (f[v][0] + 1 == best) {
				if (bcnt > cnt[v][0]) cnt[v][1] = bcnt - cnt[v][0], dfs2(v, n, best + 1);
				else cnt[v][1] = scnt, dfs2(v, n, sec + 1);
			} else {
				cnt[v][1] = bcnt;
				dfs2(v, n, best + 1);
			}
		}
	}
}
ll ans = 0, num = 0;
void solve(int n, int par) {
	vector<int> arr;
	for (int v:adj[n]) {
		if (v != par) {
			if (down[v] + 1	== f[n][2]) arr.push_back(cnt[v][0]);
		}
	}
	if (par && up[n] == f[n][2]) arr.push_back(cnt[n][1]);
	ll tot = 0, nums = 0;
	for (int i:arr) tot += i;
	//debug(n);
	//pary(arr.begin(), arr.end());
	if (f[n][0] && f[n][1] && f[n][2]) {
		if (f[n][0] == f[n][1] && f[n][1] == f[n][2]) {
			ll p1 = 0;
			for (int i:arr) {
				nums += p1 * i;
				p1 += i;
			}
		} else if (f[n][0] == f[n][1]) {
			nums += tot * (g[n][1] + g[n][0]);
		} else if (f[n][1] == f[n][2]) {
			ll p1 = 0;
			for (int i:arr) nums += p1 * i, p1 += i;
		} else {
			nums += tot * g[n][1];
		}
		tot = (ll)f[n][0] * (f[n][1] + f[n][2]);
		//debug(n, tot, nums);
		if (tot > ans) ans = tot, num = nums;
		else if (ans == tot) num += nums;
	}
	for (int v:adj[n]) {
		if (v != par) solve(v, n);
	}
}
int main() {
	io
	int n;
	cin >> n;
	for (int i = 0;i < n - 1;i++) {
		int u, v;
		cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
		deg[u]++, deg[v]++;
	}
	int root = 0;
	for (int i = 1;i <= n;i++) {
		if (deg[i] > 2) {
			root = i;
			break;
		}
	}
	if (!root) {
		cout << 0 << " " << 1 << endl;
		return 0;
	}
	dfs(root, 0);
	dfs2(root, 0, 0);
	//debug(root);
	//for (int i = 1;i <= n;i++) debug(f[i][0], f[i][1], f[i][2]);
	solve(root, 0);
	cout << ans << " " << num << endl;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 6 ms 12108 KB Output is correct
3 Correct 6 ms 11980 KB Output is correct
4 Correct 9 ms 12064 KB Output is correct
5 Correct 7 ms 11976 KB Output is correct
6 Correct 8 ms 11980 KB Output is correct
7 Correct 7 ms 12108 KB Output is correct
8 Correct 7 ms 12108 KB Output is correct
9 Correct 6 ms 12108 KB Output is correct
10 Correct 6 ms 12108 KB Output is correct
11 Correct 7 ms 12064 KB Output is correct
12 Correct 6 ms 12108 KB Output is correct
13 Correct 7 ms 12108 KB Output is correct
14 Correct 7 ms 12064 KB Output is correct
15 Correct 6 ms 12108 KB Output is correct
16 Correct 7 ms 12108 KB Output is correct
17 Correct 7 ms 11980 KB Output is correct
18 Correct 7 ms 12108 KB Output is correct
19 Correct 6 ms 12060 KB Output is correct
20 Correct 6 ms 11980 KB Output is correct
21 Correct 9 ms 12108 KB Output is correct
22 Correct 6 ms 12108 KB Output is correct
23 Correct 6 ms 12108 KB Output is correct
24 Correct 6 ms 12108 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 6 ms 12108 KB Output is correct
3 Correct 6 ms 11980 KB Output is correct
4 Correct 9 ms 12064 KB Output is correct
5 Correct 7 ms 11976 KB Output is correct
6 Correct 8 ms 11980 KB Output is correct
7 Correct 7 ms 12108 KB Output is correct
8 Correct 7 ms 12108 KB Output is correct
9 Correct 6 ms 12108 KB Output is correct
10 Correct 6 ms 12108 KB Output is correct
11 Correct 7 ms 12064 KB Output is correct
12 Correct 6 ms 12108 KB Output is correct
13 Correct 7 ms 12108 KB Output is correct
14 Correct 7 ms 12064 KB Output is correct
15 Correct 6 ms 12108 KB Output is correct
16 Correct 7 ms 12108 KB Output is correct
17 Correct 7 ms 11980 KB Output is correct
18 Correct 7 ms 12108 KB Output is correct
19 Correct 6 ms 12060 KB Output is correct
20 Correct 6 ms 11980 KB Output is correct
21 Correct 9 ms 12108 KB Output is correct
22 Correct 6 ms 12108 KB Output is correct
23 Correct 6 ms 12108 KB Output is correct
24 Correct 6 ms 12108 KB Output is correct
25 Correct 9 ms 12724 KB Output is correct
26 Correct 8 ms 12748 KB Output is correct
27 Correct 8 ms 12748 KB Output is correct
28 Correct 10 ms 12748 KB Output is correct
29 Correct 9 ms 12748 KB Output is correct
30 Correct 8 ms 12748 KB Output is correct
31 Correct 9 ms 12748 KB Output is correct
32 Correct 8 ms 12748 KB Output is correct
33 Correct 8 ms 12748 KB Output is correct
34 Correct 11 ms 12684 KB Output is correct
35 Correct 8 ms 12748 KB Output is correct
36 Correct 8 ms 12748 KB Output is correct
37 Correct 9 ms 12236 KB Output is correct
38 Correct 8 ms 12236 KB Output is correct
39 Correct 9 ms 12620 KB Output is correct
40 Correct 9 ms 12568 KB Output is correct
41 Correct 8 ms 12492 KB Output is correct
42 Correct 9 ms 12448 KB Output is correct
43 Correct 9 ms 12492 KB Output is correct
44 Correct 9 ms 12460 KB Output is correct
45 Correct 9 ms 12364 KB Output is correct
46 Correct 8 ms 12364 KB Output is correct
47 Correct 9 ms 12492 KB Output is correct
48 Correct 9 ms 12492 KB Output is correct

Subtask #3
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 6 ms 12108 KB Output is correct
3 Correct 6 ms 11980 KB Output is correct
4 Correct 9 ms 12064 KB Output is correct
5 Correct 7 ms 11976 KB Output is correct
6 Correct 8 ms 11980 KB Output is correct
7 Correct 7 ms 12108 KB Output is correct
8 Correct 7 ms 12108 KB Output is correct
9 Correct 6 ms 12108 KB Output is correct
10 Correct 6 ms 12108 KB Output is correct
11 Correct 7 ms 12064 KB Output is correct
12 Correct 6 ms 12108 KB Output is correct
13 Correct 7 ms 12108 KB Output is correct
14 Correct 7 ms 12064 KB Output is correct
15 Correct 6 ms 12108 KB Output is correct
16 Correct 7 ms 12108 KB Output is correct
17 Correct 7 ms 11980 KB Output is correct
18 Correct 7 ms 12108 KB Output is correct
19 Correct 6 ms 12060 KB Output is correct
20 Correct 6 ms 11980 KB Output is correct
21 Correct 9 ms 12108 KB Output is correct
22 Correct 6 ms 12108 KB Output is correct
23 Correct 6 ms 12108 KB Output is correct
24 Correct 6 ms 12108 KB Output is correct
25 Correct 9 ms 12724 KB Output is correct
26 Correct 8 ms 12748 KB Output is correct
27 Correct 8 ms 12748 KB Output is correct
28 Correct 10 ms 12748 KB Output is correct
29 Correct 9 ms 12748 KB Output is correct
30 Correct 8 ms 12748 KB Output is correct
31 Correct 9 ms 12748 KB Output is correct
32 Correct 8 ms 12748 KB Output is correct
33 Correct 8 ms 12748 KB Output is correct
34 Correct 11 ms 12684 KB Output is correct
35 Correct 8 ms 12748 KB Output is correct
36 Correct 8 ms 12748 KB Output is correct
37 Correct 9 ms 12236 KB Output is correct
38 Correct 8 ms 12236 KB Output is correct
39 Correct 9 ms 12620 KB Output is correct
40 Correct 9 ms 12568 KB Output is correct
41 Correct 8 ms 12492 KB Output is correct
42 Correct 9 ms 12448 KB Output is correct
43 Correct 9 ms 12492 KB Output is correct
44 Correct 9 ms 12460 KB Output is correct
45 Correct 9 ms 12364 KB Output is correct
46 Correct 8 ms 12364 KB Output is correct
47 Correct 9 ms 12492 KB Output is correct
48 Correct 9 ms 12492 KB Output is correct
49 Correct 563 ms 83928 KB Output is correct
50 Correct 560 ms 84088 KB Output is correct
51 Correct 548 ms 83964 KB Output is correct
52 Correct 556 ms 83976 KB Output is correct
53 Correct 466 ms 91308 KB Output is correct
54 Correct 480 ms 88644 KB Output is correct
55 Correct 469 ms 80716 KB Output is correct
56 Correct 474 ms 74004 KB Output is correct
57 Correct 504 ms 83892 KB Output is correct
58 Correct 471 ms 83716 KB Output is correct
59 Correct 492 ms 83732 KB Output is correct
60 Correct 501 ms 83684 KB Output is correct
61 Correct 361 ms 36712 KB Output is correct
62 Correct 338 ms 36780 KB Output is correct
63 Correct 786 ms 67192 KB Output is correct
64 Correct 767 ms 61924 KB Output is correct
65 Correct 762 ms 59204 KB Output is correct
66 Correct 733 ms 57540 KB Output is correct
67 Correct 722 ms 56988 KB Output is correct
68 Correct 734 ms 56512 KB Output is correct
69 Correct 750 ms 56528 KB Output is correct
70 Correct 733 ms 56500 KB Output is correct
71 Correct 722 ms 56196 KB Output is correct
72 Correct 725 ms 56400 KB Output is correct
73 Correct 750 ms 56616 KB Output is correct
74 Correct 785 ms 56772 KB Output is correct
75 Correct 701 ms 56952 KB Output is correct
76 Correct 643 ms 57404 KB Output is correct
77 Correct 522 ms 58804 KB Output is correct
78 Correct 336 ms 61484 KB Output is correct