oj.uz

Submission #885685

# Submission time Handle Problem Language Result Execution time Memory
885685 2023-12-10T13:01:24 Z Tob Islands (IOI08_islands) C++14
67 / 100
 250 ms 62668 KB 
#include <bits/stdc++.h>

#define ll long long
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define pb push_back
#define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const ll N = 1e6 + 7, inf = 1e18;

ll n, res;
int a[N], b[N], bio[N], cyc[N], deg[N];
ll dp[N];
pll cur[N];
queue <int> q;

void Merge(pll& x, ll y) {
	if (y >= x.F) x = {y, x.F};
	else x = {x.F, max(x.S, y)};
}

void dfs() {
	int x = q.front();
	q.pop();
	pii y = {a[x], b[x]};
	res = max(res, cur[x].F + cur[x].S);
	dp[x] = cur[x].F;
	Merge(cur[y.F], dp[x] + y.S);
	if (cyc[y.F]) return;
	deg[y.F]--;
	if (!deg[y.F]) q.push(y.F);
}

int main () {
	FIO;
	cin >> n;
	
	for (int i = 1; i <= n; i++) {
		cin >> a[i] >> b[i];
		deg[a[i]]++;
	}
	
	for (int i = 1; i <= n; i++) {
		if (bio[i]) continue;
		int x = a[i], y = i;
		bio[i] = i;
		while (!bio[x]) {
			bio[x] = i;
			y = x;
			x = a[x];
		}
		if (bio[x] == i) {
			cyc[y] = 1;
			while (x != y) {
				cyc[x] = 1;
				x = a[x];
			}
		}
	}
	memset(bio, 0, sizeof bio);
	for (int i = 1; i <= n; i++) if (!deg[i]) q.push(i);
	while (!q.empty()) dfs();
	
	ll sum = 0;
	for (int i = 1; i <= n; i++) {
		if (bio[i]) continue;
		int x = a[i], y = i;
		bio[i] = i;
		while (!bio[x]) {
			bio[x] = i;
			y = x;
			x = a[x];
		}
		if (bio[x] == i) {
			res = 0;
			vector <int> v; v = {0, y};
			while (x != y) {
				v.pb(x);
				x = a[x];
			}
			int siz = v.size();
			vector <ll> dis(siz+1, 0), rdis(siz+1, 0);
			vector <ll> pr(siz+1, -inf), suf(siz+1, -inf), pr2(siz+1, -inf), suf2(siz+1, -inf);
			
			for (int i = siz-1; i; i--) rdis[i] = rdis[i+1] + (i < siz-1)*b[v[i]];
			for (int i = 1; i < siz; i++) {
				dis[i] = dis[i-1] + b[v[i-1]];
				dp[v[i]] = cur[v[i]].F;
				res = max(res, cur[v[i]].F + cur[v[i]].S);
				pr[i] = max(pr[i-1], dp[v[i]] + dis[i]);
				pr2[i] = max(pr2[i-1], dp[v[i]] + rdis[i]);
			}
			
			for (int i = siz-1; i; i--) {
				suf[i] = max(suf[i+1], dp[v[i]] + dis[i]);
				suf2[i] = max(suf2[i+1], dp[v[i]] + rdis[i]);			
			}
			for (int i = 1; i < siz; i++) {
//				cout << i << "i " << v[i] << "x " << dis[i] << "d " << rdis[i] << "rd " << pr[i] << "p " << pr2[i] << "pp " << suf[i] << "s " << suf2[i] << "ss " << dp[v[i]] << "dp\n";
				res = max(res, dp[v[i]] + max(suf[i+1] - dis[i], pr[i-1] + rdis[i] + b[v.back()]));
				res = max(res, dp[v[i]] + max(pr2[i-1] - rdis[i], suf2[i+1] + dis[i] + b[v.back()]));
			}
			sum += res;
		}
	}
	
	cout << sum;

	return 0;
}

Subtask #1
30.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14424 KB Output is correct
2 Incorrect 2 ms 14428 KB Output isn't correct
3 Correct 3 ms 14428 KB Output is correct
4 Correct 2 ms 14428 KB Output is correct
5 Correct 2 ms 14428 KB Output is correct
6 Correct 3 ms 14428 KB Output is correct
7 Correct 3 ms 14428 KB Output is correct
8 Correct 2 ms 14428 KB Output is correct
9 Correct 3 ms 14428 KB Output is correct
10 Correct 2 ms 14428 KB Output is correct
11 Correct 2 ms 14428 KB Output is correct

Subtask #2
3.0 / 3.0

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

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14428 KB Output is correct
2 Correct 4 ms 14428 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16732 KB Output is correct
2 Correct 9 ms 17756 KB Output is correct
3 Correct 6 ms 16728 KB Output is correct
4 Incorrect 4 ms 16476 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 18520 KB Output is correct
2 Correct 18 ms 18660 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 23000 KB Output is correct
2 Correct 37 ms 24068 KB Output is correct
3 Correct 53 ms 30412 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 30420 KB Output is correct
2 Correct 81 ms 43596 KB Output is correct
3 Correct 88 ms 40628 KB Output is correct
4 Correct 114 ms 55880 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 31312 KB Output is correct
2 Correct 192 ms 62668 KB Output is correct
3 Correct 123 ms 40412 KB Output is correct
4 Correct 166 ms 59836 KB Output is correct
5 Correct 161 ms 60616 KB Output is correct
6 Incorrect 250 ms 44536 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 41044 KB Output is correct
2 Incorrect 147 ms 40908 KB Output isn't correct
3 Halted 0 ms 0 KB -