oj.uz

Submission #835500

# Submission time Handle Problem Language Result Execution time Memory
835500 2023-08-23T15:13:51 Z Valaki2 Towns (IOI15_towns) C++14
13 / 100
 23 ms 980 KB 
#include "towns.h"
#include <bits/stdc++.h>
using namespace std;

const int inf = 1e6 + 42;

int n;
vector<vector<int> > storedist;

int dist(int a, int b) {
	if(storedist[a][b] != -1) {
		return storedist[a][b];
	}
	return storedist[a][b] = storedist[b][a] = getDistance(a - 1, b - 1);
}

void reset() {
	storedist.clear();
	storedist.assign(1 + n, vector<int> (1 + n, -1));
	for(int i = 1; i <= n; i++) {
		storedist[i][i] = 0;
	}
}

int hubDistance(int N, int sub) {
	n = N;
	reset();
	int ans = inf;
	int X = 1;
	for(int i = 2; i <= n; i++) {
		if(dist(1, i) > dist(1, X)) {
			X = i;
		}
	}
	int Y = X;
	for(int i = 1; i <= n; i++) {
		if(dist(X, i) > dist(X, Y)) {
			Y = i;
		}
	}
	int diam = dist(X, Y);
	for(int i = 1; i <= n; i++) {
		int a = dist(i, X);
		int b = dist(i, Y);
		int from = (a + b - diam) / 2;
		ans = min(ans, max(a - from, b - from));
	}
	bool from_X = false, from_Y = false;
	for(int i = 1; i <= n; i++) {
		if(i == X || i == Y) {
			continue;
		}
		int a = dist(i, X);
		int b = dist(i, Y);
		int from = (a + b - diam) / 2;
		if(a - from == ans) {
			from_X = true;
		} else if(b - from == ans) {
			from_Y = true;
		}
	}
	vector<int> Z = {X, Y};
	int idx = 0;
	if(from_Y) {
		idx = 1;
	}
	vector<set<int> > s(2);
	for(int j = 0; j < 2; j++) {
		int less_cnt = 0, more_cnt = 0;
		for(int i = 1; i <= n; i++) {
			int a = dist(i, X);
			int b = dist(i, Y);
			int from = (a + b - diam) / 2;
			vector<int> d = {a - from, b - from};
			if(d[j] == ans) {
				s[j].insert(i);
			}
			if(d[j] < ans) {
				less_cnt++;
			}
			if(d[j] > ans) {
				more_cnt++;
			}
		}
		if(less_cnt > n / 2 || more_cnt > n / 2) {
			if(j == idx || (from_X && from_Y)) {
				return -ans;
			}
		}
	}
	/*if(from_X && from_Y) {
		return ans;
	}*/
	vector<int> di(1 + n, 0);
	for(int k = 0; k < 2; k++) {
		for(int i : s[k]) {
			int a = dist(i, X);
			int b = dist(i, Y);
			int from = (a + b - diam) / 2;
			di[i] = from;
		}
		for(int i : s[k]) {
			int cnt = 0;
			for(int j : s[k]) {
				int dij = dist(i, j);
				if(dij < di[i] + di[j]) {
					cnt++;
				}
			}
			if(cnt > n / 2) {
				return -ans;
			}
		}
	}
	return ans;
}

Compilation message

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:25:28: warning: unused parameter 'sub' [-Wunused-parameter]
   25 | int hubDistance(int N, int sub) {
      |                        ~~~~^~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 980 KB Output is correct
2 Correct 15 ms 768 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 23 ms 872 KB Output is correct
5 Correct 14 ms 928 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 864 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -