oj.uz

답안 #125124

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
125124 2019-07-04T16:23:37 Z NMAC427 Islands (IOI08_islands) C++17
90 / 100
 888 ms 131076 KB 
// https://oj.uz/problem/view/IOI08_islands

#include <bits/stdc++.h>
#define ff first
#define ss second

using namespace std;
using ll = long long int;

int N;

vector<pair<int, int>> to;
vector<vector<int>> from;
vector<bool> inCycle;

pair<ll, ll> dfsSolve(int v) {
	ll max1 = 0;
	ll max2 = 0;

	ll maxInternal = 0; // Maximum internal path;

	for (const int child: from[v]) {
		if (inCycle[child]) continue;  // Check here because we want to be able to pass in a node of the cycle

		auto childDFS = dfsSolve(child);
		childDFS.ff += to[child].ss;

		if (childDFS.ff >= max1) {
			max2 = max1;
			max1 = childDFS.ff;
		} else if (childDFS.ff > max2) {
			max2 = childDFS.ff;
		}

		maxInternal = max(maxInternal, childDFS.ss);
	}

	maxInternal = max(maxInternal, max1 + max2);
	return {max1, maxInternal};
}

signed main() {

	#ifndef __APPLE__
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	#endif

	cin >> N;

	to.resize(N);
	from.resize(N);

	for (int i = 0; i < N; i++) {
		cin >> to[i].ff >> to[i].ss;
		to[i].ff -= 1;

		from[to[i].ff].push_back(i);
	}


	// Generate inCycle Vector
	inCycle.assign(N, false);
	vector<bool> visited (N, false);

	for (int i = 0; i < N; i++) {
		if (visited[i]) continue;

		vector<int> cycle;
		int next = i;

		while (true) {
			visited[next] = true;
			cycle.push_back(next);

			if (visited[to[next].ff]) {
				bool __inCycle = false;
				for (int v: cycle)  {
					if (to[next].ff == v) __inCycle = true;
					if (__inCycle) inCycle[v] = true;
				}

				break;
			} else {
				next = to[next].ff;
			}
		}
	}


	// Solve
	ll ans = 0;

	for (int i = 0; i < N; i++) {
		if (!inCycle[i]) continue;

		ll compAns = 0;

		vector<int> cycle;
		vector<ll> dfsV;
		vector<ll> prefixSum = {0};
		int next = i;

		do {
			auto dfs = dfsSolve(next);
			compAns = max(compAns, dfs.ss);  // Internal Path

			cycle.push_back(next);
			dfsV.push_back(dfs.ff);
			prefixSum.push_back(prefixSum.back() + to[next].ss);
			next = to[next].ff;
		} while (next != i);

		for (int v: cycle) {
			inCycle[v] = false;  // Don't visit same component twice
		}


		ll prefixFwd = dfsV[0];
		ll prefixBwd = dfsV[0];

		for(int i = 1; i < cycle.size(); i++) {
		 	compAns = max(compAns, dfsV[i] + prefixSum[i] + prefixFwd);
		 	compAns = max(compAns, dfsV[i] - prefixSum[i] + prefixBwd + prefixSum.back());
		 	
		 	prefixFwd = max(prefixFwd, dfsV[i] - prefixSum[i]);
		 	prefixBwd = max(prefixBwd, dfsV[i] + prefixSum[i]);
		}

		ans += compAns;
	}

	cout << ans << "\n";

	return 0;
}

Compilation message

islands.cpp: In function 'int main()':
islands.cpp:122:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 1; i < cycle.size(); i++) {
                  ~~^~~~~~~~~~~~~~

Subtask #1
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 380 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 380 KB Output is correct
2 Correct 3 ms 376 KB Output is correct

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 4 ms 624 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 1400 KB Output is correct
2 Correct 19 ms 2936 KB Output is correct
3 Correct 14 ms 1728 KB Output is correct
4 Correct 7 ms 1032 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 4004 KB Output is correct
2 Correct 42 ms 7676 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 13384 KB Output is correct
2 Correct 91 ms 19840 KB Output is correct
3 Correct 114 ms 22824 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 168 ms 25720 KB Output is correct
2 Correct 203 ms 32728 KB Output is correct
3 Correct 223 ms 48388 KB Output is correct
4 Correct 271 ms 46432 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 345 ms 41756 KB Output is correct
2 Correct 615 ms 61848 KB Output is correct
3 Correct 323 ms 42244 KB Output is correct
4 Correct 420 ms 63564 KB Output is correct
5 Correct 403 ms 61132 KB Output is correct
6 Correct 888 ms 51484 KB Output is correct
7 Correct 436 ms 76492 KB Output is correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 418 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -