oj.uz

Submission #256202

# Submission time Handle Problem Language Result Execution time Memory
256202 2020-08-02T11:25:37 Z mode149256 Islands (IOI08_islands) C++14
90 / 100
 1074 ms 131072 KB 
/*input
7
3 8
7 2
4 2
1 4
1 9
3 4
2 3
*/
#include <bits/stdc++.h>
using namespace std;

namespace my_template {
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;

#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"

const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;

template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) {
	return pair<T, T>(a.x + b.x, a.y + b.y);
}
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) {
	return pair<T, T>(a.x - b.x, a.y - b.y);
}
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) {
	return (a.x * b.x + a.y * b.y);
}
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) {
	return (a.x * b.y - a.y * b.x);
}

template<typename T>
void print(vector<T> vec, string name = "") {
	cout << name;

	for (auto u : vec) {
		cout << u << ' ';
	}

	cout << '\n';
}
}
using namespace my_template;

const int MOD = 1000000007;
const ll INF = std::numeric_limits<ll>::max();
const int MX = 1000000;

int N;
pi edges[MX];
vpi edgesVisos[MX];
bitset<MX> been;
vi circleV;

ll ats = 0;
ll proc = 0;
ll maxDis = 0;
int kur;

void fill(int x) {
	been[x] = true;

	for (auto u : edgesVisos[x])
		if (!been[u.x]) {
			fill(u.x);
		}

	auto u = edges[x];

	if (!been[u.x]) {
		fill(u.x);
	}
}

// -1 ner rato
void find_circle(int fir) {

	stack<int> sk;
	sk.push(fir);
	been[fir] = true;

	while (true) {
		int x = sk.top();
		auto u = edges[x];

		if (been[u.x]) {
			while (sk.top() != u.x) {
				circleV.emplace_back(sk.top());
				been[sk.top()] = false;
				sk.pop();
			}

			circleV.emplace_back(sk.top());
			been[sk.top()] = false;
			sk.pop();
			break;
		}

		sk.push(u.x);
		been[u.x] = true;
	}

	while (sk.size()) {
		been[sk.top()] = false;
		sk.pop();
	}
}

void longest(int x, int p, ll dis) {
	if (dis > maxDis) {
		maxDis = dis;
		kur = x;
	}

	for (auto u : edgesVisos[x]) {
		if (u.x == p or been[u.x]) {
			continue;
		}

		longest(u.x, x, dis + u.y);
	}

	auto u = edges[x];

	if (u.x == p or been[u.x]) {
		return;
	}

	longest(u.x, x, dis + u.y);
}

void solve() {
	proc = 0;

	for (auto u : circleV) {
		been[u] = true;
	}

	int C = (int)circleV.size();

	vl D(C, 0);

	for (int i = 0; i < C; ++i)
	{
		int x = circleV[i];

		ll did = 0;
		ll did2 = 0;

		D[i] = 0;

		for (auto u : edgesVisos[x]) {
			if (been[u.x]) {
				continue;
			}

			maxDis = 0;
			longest(u.x, x, u.y);
			proc = max(proc, maxDis);

			if (maxDis >= did) {
				did2 = did;
				did = maxDis;
			}
			else if (maxDis > did2) {
				did2 = maxDis;
			}

			D[i] = max(D[i], maxDis);

			maxDis = 0;
			longest(kur, -1, 0);
			proc = max(proc, maxDis);
		}

		proc = max(proc, did + did2);
	}

	deque<pair<ll, int>> dq;
	ll viso = 0;

	for (int i = 0; i < C; ++i) {
		viso += (ll)edges[circleV[i]].y;
	}

	ll suma = edges[circleV[0]].y;

	{
		for (int i = 1; i < C; ++i)
		{
			// edges[circleV[i]].y += edges[i -.y 1];
			ll newVal = suma + D[i];
			suma += (ll)edges[circleV[i]].y;

			while (dq.size() and dq.back().x <= newVal) {
				dq.pop_back();
			}

			dq.push_back({newVal, i});
		}

		suma = 0;

		for (int i = 0; i < C; ++i)
		{
			while (dq.size() and dq.front().y <= i) {
				dq.pop_front();
			}

			proc = max(proc, dq.front().x + D[i] - suma);

			ll newVal = D[i] + viso + suma;

			while (dq.size() and dq.back().x <= newVal) {
				dq.pop_back();
			}

			dq.push_back({newVal, i + C});
			suma += (ll)edges[circleV[i]].y;
		}
	}

	for (auto u : circleV) {
		been[u] = false;
	}

	ats += proc;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> N;

	for (int i = 0; i < N; ++i)
	{
		int a, w;
		cin >> a >> w;
		a--;

		edges[i] = {a, w};

		// edgesVisos[i].emplace_back(a, w);
		edgesVisos[a].emplace_back(i, w);
	}

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

		circleV.clear();

		find_circle(i);
		// reverse(circle.begin(), circle.end());
		reverse(circleV.begin(), circleV.end());

		solve();
		fill(i);
	}

	printf("%lld\n", ats);
}

/* Look for:
* special cases (n=1?)
* overflow (ll vs int?)
* the exact constraints (multiple sets are too slow for n=10^6 :( )
* array bounds
*/

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 23808 KB Output is correct
2 Correct 15 ms 23808 KB Output is correct
3 Correct 15 ms 23808 KB Output is correct
4 Correct 15 ms 23808 KB Output is correct
5 Correct 14 ms 23808 KB Output is correct
6 Correct 14 ms 23808 KB Output is correct
7 Correct 15 ms 23808 KB Output is correct
8 Correct 18 ms 23808 KB Output is correct
9 Correct 15 ms 23808 KB Output is correct
10 Correct 15 ms 23808 KB Output is correct
11 Correct 20 ms 23936 KB Output is correct

Subtask #2
3.0 / 3.0

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

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23936 KB Output is correct
2 Correct 17 ms 24064 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 24448 KB Output is correct
2 Correct 31 ms 25592 KB Output is correct
3 Correct 26 ms 24440 KB Output is correct
4 Correct 19 ms 24192 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 26368 KB Output is correct
2 Correct 54 ms 27896 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 30468 KB Output is correct
2 Correct 90 ms 37088 KB Output is correct
3 Correct 124 ms 38824 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 36800 KB Output is correct
2 Correct 195 ms 47356 KB Output is correct
3 Correct 204 ms 63208 KB Output is correct
4 Correct 262 ms 62112 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 300 ms 39764 KB Output is correct
2 Correct 663 ms 80040 KB Output is correct
3 Correct 282 ms 46840 KB Output is correct
4 Correct 364 ms 67304 KB Output is correct
5 Correct 381 ms 65384 KB Output is correct
6 Correct 1074 ms 52168 KB Output is correct
7 Correct 400 ms 82316 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 350 ms 131072 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -