Submission #53773

#	Time	Username	Problem	Language	Result	Execution time	Memory
53773		ics0503	Islands (IOI08_islands)	C++17	3 / 100	2073 ms	95868 KiB

islands

#include<iostream>
#include<vector>
using namespace std;
vector<int>edge[1212121];
long long RD[1212121], D[1212121], Y[1212121], SV[1212121], L[1212121], V[1212121];
int X[1212121], indeg[1212121], ck[1212121];
long long max(long long a, long long b) { if (a < b)return b; return a; }
long long get_RD(int x) {
	if (edge[x].size() < 2)return 0;
	long long mx1=0, mxw, mx2=0;
	for (int &nxt : edge[x])if (mx1 < D[nxt] + Y[nxt])mx1 = D[nxt] + Y[nxt], mxw = nxt;
	for (int &nxt : edge[x])if (nxt != mxw&&mx2 < D[nxt] + Y[nxt])mx2 = D[nxt] + Y[nxt];
	return mx1 + mx2;
}
int main() {
	ios_base::sync_with_stdio(false);
	vector<long long>Q;
	long long n, i, j; cin >> n;
	for (i = 1; i <= n; i++) cin >> X[i] >> Y[i], indeg[X[i]]++, edge[X[i]].push_back(i);
	for (i = 1; i <= n; i++)if (indeg[i] == 0)Q.push_back(i);
	while (!Q.empty()) {
		long long now = Q.back(); Q.pop_back();
		RD[now] = max(RD[now], get_RD(now));
		RD[X[now]] = max(RD[X[now]], RD[now]);
		D[X[now]] = max(D[X[now]], D[now] + Y[now]);
		if (--indeg[X[now]] == 0)Q.push_back(X[now]);
		ck[now] = 1;
	}
	long long ans = 0;
	for (i = 1; i <= n; i++) if(!ck[i]){
		long long now = i, S = 0, sz = 0, res = 0, mx1 = -1e18,mx2 = -1e18;
		while (!ck[now]) {
			L[++sz] = D[now]; V[sz] = Y[now];
			res = max(res, max(RD[now], get_RD(now)));
			S += Y[now];
			ck[now] = 1;
		}
		for (i = 1; i <= sz; i++)SV[i] = SV[i - 1] + V[i];
		for (i = 1; i <= sz; i++) {
			res = max(res, max(L[i] + SV[i - 1] + mx1, L[i] + S - SV[i - 1] + mx2));
			mx1 = max(mx1, L[i] - SV[i - 1]);
			mx2 = max(mx2, L[i] + SV[i - 1]);
		}
		ans += res;
	}
	cout << ans;
	return 0;
}

Compilation message (stderr)

islands.cpp: In function 'int main()':
islands.cpp:18:18: warning: unused variable 'j' [-Wunused-variable]
  long long n, i, j; cin >> n;
                  ^
islands.cpp: In function 'long long int get_RD(int)':
islands.cpp:12:26: warning: 'mxw' may be used uninitialized in this function [-Wmaybe-uninitialized]
  for (int &nxt : edge[x])if (nxt != mxw&&mx2 < D[nxt] + Y[nxt])mx2 = D[nxt] + Y[nxt];
                          ^~

• Subtask 1: 3 / 33
• Subtask 2: 0 / 3
• Subtask 3: 0 / 4
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10