oj.uz

Submission #109935

# Submission time Handle Problem Language Result Execution time Memory
109935 2019-05-08T12:07:34 Z MetB Islands (IOI08_islands) C++14
70 / 100
 472 ms 132096 KB 
#include <iostream>
#include <cstdlib>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#include <bitset>
#include <queue>
#include <math.h>
#include <stack>
#include <vector>
#include <string.h>
#include <random>
 
typedef long long ll;
 
const ll MOD = 1e9 + 7, INF = 1e18;
 
using namespace std;

int n, m, is_cycle[1000001], u[1000001], p[1000001], c[1000001], cost[1000001];
ll d[1000001][2];
ll pref[2000001];
deque < pair <ll, ll> > q_max;

vector < pair <int, int> > g_un[1000001], g_t[1000001];

vector < pair <int, int> > cycle[1000001];

void dfs_traverse (ll x)
{
	c[x] = 1;

	for (auto to : g_t[x])
		if (!c[to.first])
			dfs_traverse (to.first);


	for (auto to : g_un[x])
		if (!c[to.first])
			dfs_traverse (to.first);
}
 
bool dfs_cycle (ll x, ll par, ll color)
{
	u[x] = 1;

	for (auto to : g_t[x])
	{
		if (u[to.first] == 1)
		{
			ll v = x;

			while (v != to.first)
			{
				cycle[color].emplace_back (v, cost[v]);
				is_cycle[v] = true;
				v = p[v];
			}
			cycle[color].emplace_back (to.first, to.second);
			is_cycle[to.first] = true;
			return true;
		}
		else if (!u[to.first])
		{
			p[to.first] = x;
			cost[to.first] = to.second;
			if (dfs_cycle (to.first, x, color)) return true;
		}
	}

	u[x] = 2;

	return false;
}

ll find_diameter (ll x, ll p)
{
	ll sum = 0, mx = 0, smx = 0;

	for (auto to : g_un[x])
		if (to.first != p && !is_cycle[to.first])
		{
			sum = max (sum, find_diameter (to.first, x));

			if (mx <= d[to.first][0] + to.second)
			{
				smx = mx;
				mx = d[to.first][0] + to.second;
			}
			else smx = max (smx, d[to.first][0] + to.second);
		}

	d[x][0] = mx;
	d[x][1] = smx;
	return max (sum, mx + smx);
}

ll process (vector < pair <int, int> > & cycle)
{
	ll diameter = 0;
	for (auto x : cycle)
		diameter = max (diameter, find_diameter (x.first, -1));

	ll s = cycle.size ();

	for (ll i = 2 * cycle.size () - 1; i >= 0; i--)
		pref[i] = cycle[i % s].second + (i != 2 * cycle.size () - 1 ? pref[i+1] : 0);

	q_max.clear ();

	for (ll i = 0; i < s - 1; i++)
	{
		while (!q_max.empty () && q_max.back ().first <= pref[i] + d[cycle[i % s].first][0])
			q_max.pop_back ();

		q_max.emplace_back (pref[i] + d[cycle[i % s].first][0], i);
	}

	for (ll i = s - 1; i < 2 * cycle.size (); i++)
	{
		ll k = q_max.front ().first;
		diameter = max (diameter, k - pref[i] + d[cycle[i % s].first][0]);

		while (!q_max.empty () && q_max.back ().first <= pref[i] + d[cycle[i % s].first][0])
			q_max.pop_back ();

		q_max.emplace_back (pref[i] + d[cycle[i % s].first][0], i);

		while (!q_max.empty () && q_max.front ().second <= i - s + 1)
			q_max.pop_front ();
	}
	
	return diameter;
}

int main ()
{
	cin >> n;

	for (ll i = 0; i < n; i++)
	{
		ll x, l;

		scanf ("%lld%lld", &x, &l);

		g_t[i].emplace_back (x - 1, l);
		g_un[x - 1].emplace_back (i, l);
	}

	ll color = 0;

	for (ll i = 0; i < n; i++)
		if (!u[i] && !c[i])
		{
			dfs_cycle (i, -1, ++color);
			dfs_traverse (i);
		}

	ll ans = 0;

	for (ll i = 1; i <= color; i++)
		ans += process (cycle[i]);

	cout << ans;
}

Compilation message

islands.cpp: In function 'll process(std::vector<std::pair<int, int> >&)':
islands.cpp:108:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   pref[i] = cycle[i % s].second + (i != 2 * cycle.size () - 1 ? pref[i+1] : 0);
                                    ~~^~~~~~~~~~~~~~~~~~~~~~~~
islands.cpp:120:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (ll i = s - 1; i < 2 * cycle.size (); i++)
                     ~~^~~~~~~~~~~~~~~~~~~
islands.cpp: In function 'int main()':
islands.cpp:145:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%lld%lld", &x, &l);
   ~~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 70776 KB Output is correct
2 Correct 66 ms 70904 KB Output is correct
3 Correct 65 ms 70904 KB Output is correct
4 Correct 65 ms 70776 KB Output is correct
5 Correct 71 ms 70904 KB Output is correct
6 Correct 67 ms 70780 KB Output is correct
7 Correct 67 ms 70884 KB Output is correct
8 Correct 66 ms 70904 KB Output is correct
9 Correct 66 ms 70904 KB Output is correct
10 Correct 72 ms 70904 KB Output is correct
11 Correct 66 ms 71032 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 70904 KB Output is correct
2 Correct 68 ms 71160 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 71172 KB Output is correct
2 Correct 70 ms 71416 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 72572 KB Output is correct
2 Correct 105 ms 75868 KB Output is correct
3 Correct 88 ms 72696 KB Output is correct
4 Correct 72 ms 71672 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 77940 KB Output is correct
2 Correct 115 ms 82744 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 90936 KB Output is correct
2 Correct 239 ms 103524 KB Output is correct
3 Correct 275 ms 114736 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 318 ms 110152 KB Output is correct
2 Runtime error 382 ms 132096 KB Execution killed with signal 9 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 472 ms 132096 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

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