oj.uz

Submission #396278

# Submission time Handle Problem Language Result Execution time Memory
396278 2021-04-29T16:25:44 Z Berted Islands (IOI08_islands) C++14
80 / 100
 1119 ms 131076 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <deque>
#define ll long long
#define pii pair<int, int>
#define fst first
#define snd second

using namespace std;

namespace dq
{
	pair<ll, int> A[2000001]; int L = 0, R = 0;
	inline int size() {return R - L;}
	inline void push_back(const pair<ll, int>& x) {A[R++] = x;}
	inline void pop_back() {R--;}
	inline void pop_front() {L++;}
	inline pair<ll, int> front() {return A[L];}
	inline pair<ll, int> back() {return A[R - 1];}
	inline void clear() {L = 0; R = 0;}
}

int N;
vector<pii> adj[1000001];
int H[1000001]; vector<int> vis;

vector<pii> cyc;
ll DP[1000001];

ll ans = 0;

int DFS1(int u, pii p)
{
	int ret = H[u] + 1;
	vis.push_back(u);

	//cerr << "D1: " << u << " " << H[u] << "\n";
	for (const pii &v : adj[u])
	{
		if (p == v) {p = {-1, -1}; continue;}
		if (H[v.fst] == -1)
		{
			H[v.fst] = H[u] + 1;
			ret = DFS1(v.fst, {u, v.snd});
		}
		else if (H[v.fst] < H[u]) {ret = H[v.fst];}
		if (ret <= H[u])
		{
			cyc.push_back({u, v.snd});
			break;
		}
	}
	return ret;
}

ll DFS2(int u)
{
	ll M[2] = {0, 0}; ll ret = 0;
	for (const pii &v : adj[u])
	{
		if (H[v.fst] == -1)
		{
			H[v.fst] = H[u] + 1;
			ret = max(ret, DFS2(v.fst));
			if (DP[v.fst] + v.snd > M[0]) {M[1] = M[0]; M[0] = DP[v.fst] + v.snd;}
			else if (DP[v.fst] + v.snd > M[1]) {M[1] = DP[v.fst] + v.snd;}
			DP[u] = max(DP[u], DP[v.fst] + v.snd);
		}
	}
	return max(ret, M[0] + M[1]);
}

int main()
{
	ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> N;
	for (int i = 0; i < N; i++)
	{
		int u, c; cin >> u >> c; u--;
		adj[u].push_back({i, c});
		adj[i].push_back({u, c});
		H[i] = -1;
	}

	for (int k = 0; k < N; k++)
	{
		if (H[k] == -1)
		{
			ll rr = 0; H[k] = 0;
			DFS1(k, {-1, -1});
			for (const auto &u : vis) H[u] = -1;
			vis.clear();
			
			for (const auto &u : cyc) H[u.fst] = 0;
			for (const auto &u : cyc) rr = max(rr, DFS2(u.fst));

			//cerr << k << ": " << rr << " " << cyc.size() << "\n";

			ll s = 0, t = 0;
			for (int i = 1; i < cyc.size(); i++)
			{
				//cerr << "id: " << i << " " << cyc[i].fst << " - " << DP[cyc[i].fst] << "\n";
				s += cyc[i].snd;
				while (dq::size() && dq::back().fst <= s + DP[cyc[i].fst]) 
				{
					//cerr << "Popped\n";
					dq::pop_back();
				}
				//cerr << "Pushed: " << s + DP[cyc[i].fst] << ", " << i << "\n";
				dq::push_back({s + DP[cyc[i].fst], i});
			}
			s += cyc[0].snd;

			for (int i = 0; i < cyc.size(); i++)
			{
				if (dq::front().snd == i) dq::pop_front();
				//cerr << i << " " << " " << cyc[i].fst << " " << dq.front().fst << " " << t << " " << DP[cyc[i].fst] << "\n";
				rr = max(rr, dq::front().fst + t + DP[cyc[i].fst]);
				while (dq::size() && dq::back().fst + t <= s + DP[cyc[i].fst]) {dq::pop_back();}
				dq::push_back({s + DP[cyc[i].fst] - t, i});
				t -= cyc[(i + 1) % cyc.size()].snd;
			}

			dq::clear();
			cyc.clear();

			//cerr << k << ": " << rr << "\n";

			ans += rr;
		}
	}
	
	cout << ans << "\n";
	return 0;
}

Compilation message

islands.cpp: In function 'int main()':
islands.cpp:101:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |    for (int i = 1; i < cyc.size(); i++)
      |                    ~~^~~~~~~~~~~~
islands.cpp:115:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |    for (int i = 0; i < cyc.size(); i++)
      |                    ~~^~~~~~~~~~~~

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23884 KB Output is correct
2 Correct 17 ms 23756 KB Output is correct
3 Correct 16 ms 23884 KB Output is correct
4 Correct 15 ms 23716 KB Output is correct
5 Correct 15 ms 23756 KB Output is correct
6 Correct 15 ms 23800 KB Output is correct
7 Correct 15 ms 23816 KB Output is correct
8 Correct 15 ms 23776 KB Output is correct
9 Correct 15 ms 23756 KB Output is correct
10 Correct 16 ms 23724 KB Output is correct
11 Correct 16 ms 23700 KB Output is correct

Subtask #2
3.0 / 3.0

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

Subtask #3
4.0 / 4.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 24824 KB Output is correct
2 Correct 33 ms 27332 KB Output is correct
3 Correct 26 ms 24988 KB Output is correct
4 Correct 20 ms 24312 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 28568 KB Output is correct
2 Correct 50 ms 30352 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 35824 KB Output is correct
2 Correct 112 ms 40760 KB Output is correct
3 Correct 126 ms 52208 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 152 ms 43836 KB Output is correct
2 Correct 207 ms 70916 KB Output is correct
3 Correct 225 ms 73320 KB Output is correct
4 Correct 274 ms 96372 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 351 ms 73492 KB Output is correct
2 Correct 729 ms 122108 KB Output is correct
3 Correct 281 ms 63824 KB Output is correct
4 Correct 387 ms 104652 KB Output is correct
5 Correct 382 ms 105360 KB Output is correct
6 Correct 1119 ms 73112 KB Output is correct
7 Runtime error 393 ms 131076 KB Execution killed with signal 9

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 372 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -