oj.uz

Submission #708853

# Submission time Handle Problem Language Result Execution time Memory
708853 2023-03-12T13:24:18 Z LittleCube Towns (IOI15_towns) C++14
100 / 100
 19 ms 864 KB 
#include "towns.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

int hubDistance(int N, int sub)
{
	vector<int> dis0(N, 0), disU(N, 0), disD(N, 0);
	map<pii, int> mp;
	int u = 0, v = 0, mx = 0, uv, u0, v0, luv, R = 1e9;
	for (int i = 1; i < N; i++)
	{
		dis0[i] = getDistance(0, i);
		if (dis0[i] > mx)
			u = i, mx = dis0[i];
	}
	for (int i = 0; i < N; i++)
		disU[i] = getDistance(u, i);
	mx = 0;
	for (int i = 0; i < N; i++)
		if (disU[i] > mx)
			v = i, mx = disU[i];

	uv = disU[v];
	u0 = dis0[u];
	v0 = dis0[v];
	luv = (uv + u0 - v0) / 2;
	for (int i = 0; i < N; i++)
	{
		disD[i] = (disU[i] + dis0[i] - u0) / 2;
		if (disU[i] - disD[i] > luv)
			disD[i] = disU[i] - luv;

		R = min(R, max(disU[i] - disD[i], uv - (disU[i] - disD[i])));
		mp[pii(disU[i] - disD[i], uv - (disU[i] - disD[i]))]++;
	}
	vector<int> c;

	int cnt = 0;
	pii check = pii(0, 0);
	for (auto [p, k] : mp)
	{
		if (p.F == R || p.S == R)
		{
			if (cnt <= N / 2 && k <= N / 2 && (N - cnt - k) <= N / 2)
				return R;
			if (cnt <= N / 2 && (N - cnt - k) <= N / 2)
				check = p;
		}
		cnt += k;
	}
	if (check.F != 0)
	{
		vector<int> v;
		vector<int> power(N);
		for (int i = 0; i < N; i++)
			if (check == pii(disU[i] - disD[i], uv - (disU[i] - disD[i])))
				v.emplace_back(i);
		int cur = 0, health = 0;
		for (auto i : v)
			if (health == 0)
			{
				power[i]++;
				cur = i, health = 1;
			}
			else
			{
				int d = getDistance(cur, i);
				if (d == disD[cur] + disD[i])
				{
					power[i]++;
					health--;
				}
				else
				{
					power[cur]++;
					health++;
				}
			}
		health = 0;
		for (int i = 0; i < N; i++)
			if (power[i] && (i == cur || getDistance(cur, i) < disD[cur] + disD[i]))
				health += power[i];
		if (health <= N / 2)
			return R;
	}

	return -R;
}

Compilation message

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:45:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   45 |  for (auto [p, k] : mp)
      |            ^
towns.cpp:58:15: warning: declaration of 'v' shadows a previous local [-Wshadow]
   58 |   vector<int> v;
      |               ^
towns.cpp:14:13: note: shadowed declaration is here
   14 |  int u = 0, v = 0, mx = 0, uv, u0, v0, luv, R = 1e9;
      |             ^
towns.cpp:10:28: warning: unused parameter 'sub' [-Wunused-parameter]
   10 | int hubDistance(int N, int sub)
      |                        ~~~~^~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 340 KB Output is correct
2 Correct 10 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 14 ms 344 KB Output is correct
5 Correct 18 ms 352 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 348 KB Output is correct
2 Correct 13 ms 376 KB Output is correct
3 Correct 18 ms 380 KB Output is correct
4 Correct 19 ms 400 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 340 KB Output is correct
2 Correct 17 ms 468 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 14 ms 352 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 324 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 352 KB Output is correct
2 Correct 16 ms 352 KB Output is correct
3 Correct 16 ms 348 KB Output is correct

Subtask #6
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 356 KB Output is correct
2 Correct 17 ms 864 KB Output is correct
3 Correct 15 ms 852 KB Output is correct