oj.uz

답안 #53796

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
53796 2018-07-01T08:04:11 Z 강한육군장홍준(#2037) Islands (IOI08_islands) C++11
100 / 100
 958 ms 107372 KB 
#include<iostream>
#include<vector>
using namespace std;
vector<int>edge[1212121];
long long RD[1212121], D[1212121], X[1212121], Y[1212121], indeg[1212121], SV[1212121], L[1212121], V[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]);
		X[now] = 0;
	}
	long long ans = 0;
	for (i = 1; i <= n; i++) if (X[i]) {
		long long now = i, S = 0, sz = 0, res = 0, mx1 = -1e18, mx2 = -1e18;
		while (X[now]) {
			L[++sz] = D[now]; V[sz] = Y[now];
			res = max(res, max(RD[now], get_RD(now)));
			S += Y[now];
			long long tmp = now; now = X[now]; X[tmp] = 0;
		}
		for (int i = 1; i <= sz; i++)SV[i] = SV[i - 1] + V[i];
		for (int 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

islands.cpp: In function 'int main()':
islands.cpp:17: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:11:25: 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
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 28792 KB Output is correct
2 Correct 25 ms 28900 KB Output is correct
3 Correct 29 ms 28976 KB Output is correct
4 Correct 25 ms 28976 KB Output is correct
5 Correct 26 ms 29180 KB Output is correct
6 Correct 26 ms 29180 KB Output is correct
7 Correct 25 ms 29180 KB Output is correct
8 Correct 25 ms 29180 KB Output is correct
9 Correct 25 ms 29180 KB Output is correct
10 Correct 26 ms 29180 KB Output is correct
11 Correct 25 ms 29180 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 29180 KB Output is correct
2 Correct 26 ms 29180 KB Output is correct

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 29180 KB Output is correct
2 Correct 26 ms 29420 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 30188 KB Output is correct
2 Correct 42 ms 31656 KB Output is correct
3 Correct 37 ms 31656 KB Output is correct
4 Correct 35 ms 31656 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 32620 KB Output is correct
2 Correct 67 ms 35432 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 121 ms 41828 KB Output is correct
2 Correct 124 ms 44652 KB Output is correct
3 Correct 138 ms 48124 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 175 ms 53564 KB Output is correct
2 Correct 222 ms 63248 KB Output is correct
3 Correct 219 ms 69380 KB Output is correct
4 Correct 292 ms 77472 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 347 ms 77472 KB Output is correct
2 Correct 692 ms 92372 KB Output is correct
3 Correct 357 ms 92372 KB Output is correct
4 Correct 400 ms 96768 KB Output is correct
5 Correct 388 ms 96768 KB Output is correct
6 Correct 958 ms 96768 KB Output is correct
7 Correct 435 ms 104064 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 393 ms 104064 KB Output is correct
2 Correct 390 ms 104064 KB Output is correct
3 Correct 382 ms 107372 KB Output is correct
4 Correct 401 ms 107372 KB Output is correct
5 Correct 478 ms 107372 KB Output is correct
6 Correct 433 ms 107372 KB Output is correct
7 Correct 949 ms 107372 KB Output is correct