oj.uz

Submission #60222

# Submission time Handle Problem Language Result Execution time Memory
60222 2018-07-23T21:29:20 Z reality Towns (IOI15_towns) C++17
25 / 100
 46 ms 2424 KB 
#include "towns.h"
#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;}
template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;}

const int N = 256;

int D[N][N];

int get(int x,int y) {
	if (D[x][y] != -1)
		return D[x][y];
	return D[x][y] = D[y][x] = getDistance(x,y);
}

int hubDistance(int n, int sub) {
	memset(D,-1,sizeof(D));
	//cerr << x << ' ' << y << ' ' << mx << '\n';
	int x = 0;
	for (int i = 0;i < n;++i)
		D[i][i] = 0;
	for (int i = 0;i < n;++i)
		if (get(0,i) > get(0,x))
			x = i;
	int y = x;
	for (int i = 0;i < n;++i)
		if (get(x,i) > get(x,y))
			y = i;
	vi s;
	pii ans = mp((int)(2e9),0);
	map < int , int > M;
	for (int k = 0;k < n;++k)
		if (k != x && k != y)
			++M[(get(x,y) - (get(x,k) - get(y,k))) / 2];
	int ok = 1;
	for (auto it : M)
		ok &= it.se <= (n / 2),s.pb(it.fi);
	s.pb(D[x][y]);
	sort(all(s));
	s.resize(unique(all(s)) - s.begin());
	for (auto it : s)
		smin(ans,mp(max(D[x][y] - it,it),ok));
	return ans.fi * (1 - 2 * ans.se);
}

Compilation message

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

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 632 KB Output is correct
2 Correct 22 ms 728 KB Output is correct
3 Correct 3 ms 728 KB Output is correct
4 Correct 29 ms 852 KB Output is correct
5 Correct 46 ms 852 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 852 KB Output is correct
2 Correct 24 ms 1256 KB Output is correct
3 Correct 36 ms 1840 KB Output is correct
4 Correct 38 ms 2320 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 28 ms 2396 KB Output isn't correct

Subtask #5
0 / 13.0

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

Subtask #6
0 / 39.0

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