oj.uz

답안 #119765

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
119765 2019-06-22T08:54:27 Z WhipppedCream 도시들 (IOI15_towns) C++17
0 / 100
 18 ms 512 KB 
#include "towns.h"
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;

const int maxn = 120;

int m, n;

int dist0[maxn];
int distu[maxn];
int add[maxn], bran[maxn];

map<int, int> cnt;

int hubDistance(int N, int sub)
{
	memset(add, 0, sizeof add);
	memset(bran, 0, sizeof bran);
	cnt.clear();
	if(sub > 2 && sub != 4) return 0;
	n = N;
	int best = 0, dat = -1;
	for(int i = 1; i< N; i++)
	{
		dist0[i] = getDistance(0, i);
		if(dist0[i]> best)
		{
			best = dist0[i];
			dat = i;
		}
	}
	int U = dat;
	best = 0; dat = -1;
	for(int i = 0; i< N; i++)
	{
		if(i == U || i == 0) continue;
		distu[i] = getDistance(U, i);
		if(distu[i]> best)
		{
			best = distu[i];
			dat = i;
		}
	}
	int V = dat;
	int diam = distu[V];
	// printf("(%d->%d) %d\n", U, V, dist[V]);
	distu[0] = dist0[U];
	for(int i = 0; i< N; i++)
	{
		if(i == U || i == 0) continue;
		int br = dist0[i]+distu[i]-dist0[U];
		br /= 2;
		int pos = dist0[i]-br;
		add[i] = pos;
		bran[i] = br;
		cnt[pos]++;
	}
	int rad = 1e9;
	for(auto kk : cnt)
	{
		int x = kk.X;
		// printf("%d: %d\n", x, cnt[x]);
		if(x< add[V]) continue;
		rad = min(rad, max(dist0[U]-x, diam-(dist0[U]-x)));
	}
	return rad;
}

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 384 KB Output is correct
2 Correct 13 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Incorrect 18 ms 384 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 384 KB Output is correct
2 Correct 13 ms 384 KB Output is correct
3 Incorrect 17 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

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

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 18 ms 384 KB Output isn't correct

Subtask #5
0 / 13.0

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

Subtask #6
0 / 39.0

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