oj.uz

Submission #288725

# Submission time Handle Problem Language Result Execution time Memory
288725 2020-09-01T19:34:43 Z Saboon Towns (IOI15_towns) C++17
100 / 100
 32 ms 468 KB 
#include "towns.h"
#include<bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int inf = 2e8 + 10;
int n, d[110][110];
bool in[110];
 
int Dis(int v, int u){
	if (v == u or d[v][u] > 0)
		return d[v][u];
	return d[v][u] = d[u][v] = getDistance(v,u);
}
 
int getDis(int v, int u, int w){
	return (Dis(v,u)+Dis(v,w)-Dis(u,w))/2;
}
 
int hubDistance(int N, int sub){
	memset(d, 0, sizeof d);
	n = N;
	int Q1 = 0, Q2 = 0;
	int r = rng()%N;
	for (int i = 1; i < n; i++)
		if (Dis(r,i) > Dis(r,Q1))
			Q1 = i;
	for (int i = 1; i < n; i++)
		if (Dis(Q1,i) > Dis(Q1,Q2))
			Q2 = i;
	int R = inf;
	vector<int> a;
	int P = getDis(Q1, r, Q2);
	for (int v = 0; v < n; v++){
		if (v == Q1 or v == r or getDis(Q1, r, v) > P)
			continue;
		int A = getDis(Q1, r, v);
		a.push_back(A);
		R = min(R,max(A,Dis(Q1,Q2)-A));
	}
	if (sub <= 2)
		return R;

	sort(a.begin(), a.end());
	a.resize(unique(a.begin(),a.end())-a.begin());
	int m = 1;
	for (auto it : a){
		int now = 0;
		vector<int> b;
		for (int v = 0; v < n; v++){
			if (v == Q1 or v == Q2)
				continue;
			if (getDis(Q1, r, v) == it)
				now ++, b.push_back(v);
		}
		int t = max(it, Dis(Q1,Q2)-it);
		if (t != R or m > n/2 or (n-m-now) > n/2){
			m += now;
			continue;
		}
		if (now <= n/2)
			return R;
		if (sub == 4)
			continue;
		shuffle(b.begin(),b.end(),rng);
		int check = b[0], cnt = 1; 
		in[0] = 1;
		for (int i = 1; i < now; i++){
			if (getDis(Q1,check,b[i]) > it)
				cnt ++, in[i] = 1;
			else
				cnt --, in[i] = 0;
			if (cnt == -1){
				check = b[i], cnt = 1;
				in[i] = 1;
				continue;
			}
		}
		cnt = 0;
		bool reach = 1;
		for (int i = now-1; i >= 0; i--){
			if (cnt > n/2)
				return -R;
			if (cnt+i+1 <= n/2)
				break;
			if (reach)
				cnt += in[i];
			else
				cnt += (getDis(Q1,check,b[i]) > it);
			if (b[i] == check)
				reach = 0;
		}
		if (cnt <= n/2)
			return R;
		m += now;
	}
	return -R;
}

Compilation message

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:23:15: warning: conversion from 'std::mersenne_twister_engine<long unsigned int, 32, 624, 397, 31, 2567483615, 11, 4294967295, 7, 2636928640, 15, 4022730752, 18, 1812433253>::result_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   23 |  int r = rng()%N;
      |          ~~~~~^~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 384 KB Output is correct
2 Correct 18 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 22 ms 384 KB Output is correct
5 Correct 24 ms 384 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 384 KB Output is correct
2 Correct 17 ms 468 KB Output is correct
3 Correct 25 ms 384 KB Output is correct
4 Correct 22 ms 384 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 416 KB Output is correct
2 Correct 22 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 22 ms 384 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 384 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 384 KB Output is correct
2 Correct 32 ms 384 KB Output is correct
3 Correct 23 ms 384 KB Output is correct

Subtask #6
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 384 KB Output is correct
2 Correct 22 ms 384 KB Output is correct
3 Correct 23 ms 384 KB Output is correct