oj.uz

Submission #757040

# Submission time Handle Problem Language Result Execution time Memory
757040 2023-06-12T12:47:18 Z SanguineChameleon Islands (IOI08_islands) C++17
100 / 100
 1098 ms 116756 KB 
#include <bits/stdc++.h>
using namespace std;

void just_do_it();

int main() {
	#ifdef KAMIRULEZ
		freopen("kamirulez.inp", "r", stdin);
		freopen("kamirulez.out", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	just_do_it();
	return 0;
}

const int maxn = 1e6 + 20;
int to[maxn];
pair<int, int> edges[maxn * 2];
int adj_pt[maxn];
int par[maxn];
int len[maxn];
pair<long long, int> dp[maxn];
bool flag[maxn];
bool is_cycle[maxn];
int cycle[maxn];
bool head[maxn];
int sz;

void dfs1(int u) {
	flag[u] = true;
	for (int pt = adj_pt[u]; edges[pt].first == u; pt++) {
		int id = edges[pt].second;
		if (id == par[u]) {
			continue;
		}
		int v = id ^ to[id] ^ u;
		if (!flag[v]) {
			par[v] = id;
			dfs1(v);
		}
		else {
			int cur = u;
			while (cur != v) {
				if (par[cur] == -1) {
					break;
				}
				cur = par[cur] ^ to[par[cur]] ^ cur;
			}
			if (cur == v) {
				cur = u;
				while (cur != v) {
					cycle[sz] = cur;
					head[sz] = (par[cur] == cur);
					sz++;
					cur = par[cur] ^ to[par[cur]] ^ cur;
				}
				cycle[sz] = v;
				head[sz] = (id == v);
				sz++;
			}
		}
	}
}

void dfs2(int u, int p) {
	dp[u].first = 0;
	dp[u].second = u;
	for (int pt = adj_pt[u]; edges[pt].first == u; pt++) {
		int id = edges[pt].second;
		int v = id ^ to[id] ^ u;
		if (v != p && !is_cycle[v]) {
			dfs2(v, u);
			if (dp[v].first + len[id] > dp[u].first) {
				dp[u].first = dp[v].first + len[id];
				dp[u].second = dp[v].second;
			}
		}
	}
}

long long res;

long long calc_max(int u) {
	is_cycle[u] = false;
	dfs2(u, -1);
	long long max_depth = dp[u].first;
	int v = dp[u].second;
	dfs2(v, -1);
	res = max(res, dp[v].first);
	is_cycle[u] = true;
	return max_depth;
}

long long solve() {
	res = 0;
	long long sum = 0;
	for (int i = 0; i < sz; i++) {
		is_cycle[cycle[i]] = true;
		sum += (head[i] ? len[cycle[i]] : len[cycle[(i + 1) % sz]]);
	}
	long long dist = 0;
	long long mx1 = calc_max(cycle[0]);
	long long mx2 = mx1;
	for (int i = 1; i < sz; i++) {
		dist += (head[i - 1] ? len[cycle[i - 1]] : len[cycle[i]]);
		long long max_depth = calc_max(cycle[i]);
		res = max(res, dist + max_depth + mx1);
		res = max(res, sum - dist + max_depth + mx2);
		mx1 = max(mx1, max_depth - dist);
		mx2 = max(mx2, max_depth + dist);
	}
	return res;
}

void just_do_it() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> to[i] >> len[i];
		edges[i * 2 - 1].first = i;
		edges[i * 2 - 1].second = i;
		edges[i * 2].first = to[i];
		edges[i * 2].second = i;
	}
	sort(edges + 1, edges + n * 2 + 1);
	for (int i = 1; i <= n * 2; i++) {
		if (edges[i].first != edges[i - 1].first) {
			adj_pt[edges[i].first] = i;
		}
	}
	long long res = 0;
	for (int u = 1; u <= n; u++) {
		if (!flag[u]) {
			sz = 0;
			par[u] = -1;
			dfs1(u);
			res += solve();
		}
	}
	cout << res;
}

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 2 ms 596 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1220 KB Output is correct
2 Correct 18 ms 3064 KB Output is correct
3 Correct 10 ms 1364 KB Output is correct
4 Correct 5 ms 852 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 4212 KB Output is correct
2 Correct 26 ms 6420 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 11464 KB Output is correct
2 Correct 98 ms 16532 KB Output is correct
3 Correct 84 ms 22616 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 20860 KB Output is correct
2 Correct 157 ms 38272 KB Output is correct
3 Correct 194 ms 47152 KB Output is correct
4 Correct 204 ms 57736 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 48256 KB Output is correct
2 Correct 537 ms 82440 KB Output is correct
3 Correct 223 ms 40432 KB Output is correct
4 Correct 296 ms 69412 KB Output is correct
5 Correct 302 ms 69576 KB Output is correct
6 Correct 1065 ms 47420 KB Output is correct
7 Correct 294 ms 88956 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 383 ms 110812 KB Output is correct
2 Correct 351 ms 111004 KB Output is correct
3 Correct 475 ms 116756 KB Output is correct
4 Correct 279 ms 49240 KB Output is correct
5 Correct 272 ms 69532 KB Output is correct
6 Correct 295 ms 55732 KB Output is correct
7 Correct 1098 ms 48224 KB Output is correct