oj.uz

Submission #256177

# Submission time Handle Problem Language Result Execution time Memory
256177 2020-08-02T10:51:44 Z mode149256 Islands (IOI08_islands) C++14
100 / 100
 1254 ms 111052 KB 
/*input
7
3 8
7 2
4 2
1 4
1 9
3 4
2 3
*/
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
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 circle; // lens
vi circleV;
bitset<MX> inCircle;
 
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
int find_circle(int x) {
	been[x] = true;
 
	auto u = edges[x];
	if (been[u.x]) {
		circleV.emplace_back(x);
		circle.emplace_back(u.y);
		been[x] = false;
		return u.x;
	}
 
	int k = find_circle(u.x);
 
	if (k == x) {
		circleV.emplace_back(x);
		circle.emplace_back(u.y);
		been[x] = false;
		return -1;
	}
	else if (k != -1) {
		circleV.emplace_back(x);
		circle.emplace_back(u.y);
		been[x] = false;
		return k;
	}
 
	been[x] = false;
	return -1;
}
 
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 inCircle[u.x]) continue;
		longest(u.x, x, dis + u.y);
	}
	auto u = edges[x];
	if (u.x == p or inCircle[u.x]) return;
	longest(u.x, x, dis + u.y);
}
 
void solve() {
	proc = 0;
	for (auto u : circleV)
		inCircle[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 (inCircle[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)circle[i];
 
	ll suma = circle[0];
 
	{
		for (int i = 1; i < C; ++i)
		{
			// circle[i] += circle[i - 1];
			ll newVal = suma + D[i];
			suma += circle[i];
 
			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 += circle[i];
		}
	}
 
	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;
 
		circle.clear();
		circleV.clear();
 
		find_circle(i);
		fill(i);
		reverse(circle.begin(), circle.end());
		reverse(circleV.begin(), circleV.end());
 
		solve();
	}
 
	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 16 ms 23808 KB Output is correct
2 Correct 16 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 15 ms 23808 KB Output is correct
7 Correct 15 ms 23808 KB Output is correct
8 Correct 15 ms 23808 KB Output is correct
9 Correct 19 ms 23808 KB Output is correct
10 Correct 14 ms 23808 KB Output is correct
11 Correct 15 ms 23808 KB Output is correct

Subtask #2
3.0 / 3.0

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

Subtask #3
4.0 / 4.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 24448 KB Output is correct
2 Correct 31 ms 25464 KB Output is correct
3 Correct 23 ms 24448 KB Output is correct
4 Correct 26 ms 24192 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 26180 KB Output is correct
2 Correct 47 ms 27896 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 30352 KB Output is correct
2 Correct 88 ms 36296 KB Output is correct
3 Correct 116 ms 37732 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 36728 KB Output is correct
2 Correct 195 ms 45968 KB Output is correct
3 Correct 202 ms 59452 KB Output is correct
4 Correct 250 ms 59740 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 289 ms 39908 KB Output is correct
2 Correct 703 ms 76460 KB Output is correct
3 Correct 288 ms 46840 KB Output is correct
4 Correct 367 ms 65116 KB Output is correct
5 Correct 351 ms 62988 KB Output is correct
6 Correct 1139 ms 52216 KB Output is correct
7 Correct 389 ms 78480 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 405 ms 110328 KB Output is correct
2 Correct 394 ms 87416 KB Output is correct
3 Correct 428 ms 111052 KB Output is correct
4 Correct 472 ms 64172 KB Output is correct
5 Correct 390 ms 63712 KB Output is correct
6 Correct 345 ms 60288 KB Output is correct
7 Correct 1254 ms 53112 KB Output is correct