oj.uz

답안 #990753

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
990753 2024-05-31T07:16:02 Z starchan 도시들 (IOI15_towns) C++17
61 / 100
 10 ms 492 KB 
#include<bits/stdc++.h>
#include "towns.h"
using namespace std;
#define in array<int, 2>
#define pb push_back
#define pob pop_back

int hubDistance(int n, int sub)
{
	in opt = {0, 0};
	for(int i = 1; i < n; i++)
		opt = max(opt, {getDistance(i, 0), i});
	int a = opt[1]; opt = {0, a};
	vector<int> d1(n), d2(n); d1[a] = 0;
	for(int i = 0; i < n; i++)
	{
		if(i == a) continue;
		opt = max(opt, {d1[i] = getDistance(i, a), i});
	}
	auto [D, b] = opt; d2[b] = 0;
	map<int, vector<int>> diam; diam[0].pb(a); diam[D].pb(b);
	for(int i = 0; i < n; i++)
	{
		if(i == a || i == b)
			continue;
		d2[i] = getDistance(i, b);
		diam[(d1[i]-d2[i]+D)/2].pb(i);
	}
	int R = 1e9+1;
	vector<vector<int>> vi;
	vector<int> dist;
	for(auto [X, v]: diam)
	{
		R = min(R, max(X, D-X));
		vi.pb(v); dist.pb(X); 
	}
	if(sub <= 2)
		return R;
	int N = vi.size();
	//0, 1, .., N-1
	//has information for stuff on diameter.
	int pre = 0;
	for(int i = 0; i < N-2; i++)
	{
		pre+=vi[i].size();
		if(R != max(dist[i+1], D-dist[i+1]))
			continue;
		if(2*pre > n)
			break;
		if(2*((int)n-pre-vi[i+1].size()) > n)
			continue;
		if(2*((int)vi[i+1].size()) <= n)
			return R;
		if(sub == 4)
			return -R;
		//Now we need to check if the i+1th thingie, (as we are accessing) is centroid or not.
		//This must be done in <= N/2 queries for AC. <= 2N queries is ok too, if we want good partial score.
		int g = vi[i+1][0]; int rt = d1[g]-dist[i+1]; int cnt = 0;
		for(auto x: vi[i+1])
		{
			if(x == g)
				continue;
			int q_rt = d1[x]-dist[i+1];
			if((rt+q_rt) == getDistance(x, g))
			{
				if(cnt)
					cnt--;
				else
				{
					cnt = 1; rt = q_rt;
					g = x;
				}
			}
			else
				cnt++;
		}
		int SP = 1;
		for(auto x: vi[i+1])
		{
			if(x == g)
				continue;
			int q_rt = d1[x]-dist[i+1];
			if((rt+q_rt) != getDistance(x, g))
				SP++;
		}
		if((2*SP) <= n)
			return R;
	}
	return -R;
}

Compilation message

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:39:17: warning: conversion from 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   39 |  int N = vi.size();
      |          ~~~~~~~^~
towns.cpp:45:19: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   45 |   pre+=vi[i].size();
      |                   ^
towns.cpp:50:36: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   50 |   if(2*((int)n-pre-vi[i+1].size()) > n)
      |      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 348 KB Output is correct
2 Correct 7 ms 492 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 9 ms 348 KB Output is correct
5 Correct 9 ms 484 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 348 KB Output is correct
2 Correct 7 ms 348 KB Output is correct
3 Correct 9 ms 484 KB Output is correct
4 Correct 9 ms 348 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 9 ms 480 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 10 ms 484 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 348 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 348 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 9 ms 348 KB Output is correct

Subtask #6
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -