oj.uz

Submission #432954

# Submission time Handle Problem Language Result Execution time Memory
432954 2021-06-18T15:37:34 Z Antekb Towns (IOI15_towns) C++14
100 / 100
 24 ms 360 KB 
#include "towns.h"
#include<bits/stdc++.h>
using namespace std;
#define st first
#define nd second
int hubDistance(int N, int sub) {
	//int R = getDistance(0,1);
	int d1[N], d2[N];
	d1[0]=0;
	for(int i=1; i<N; i++)d1[i]=getDistance(0, i);
	int e=0;
	for(int i=0; i<N; i++)if(d1[i]>d1[e])e=i;
	for(int i=1; i<N; i++)if(e!=i)d2[i]=getDistance(e, i);
	d2[e]=0;
	d2[0]=d1[e];
	int diam=0;
	for(int i=0; i<N; i++)diam=max(diam, d2[i]);
	int R=diam;
	for(int i=0; i<N; i++){
		if(i==0 || i==e)continue;
		int d=(d2[i]+d2[0]-d1[i])/2;
		R=min(R, max(d, diam-d));
	}
	int a=0, b=0;
	vector<int> A, B;
	for(int i=0; i<N; i++){
		int d=(d2[i]+d2[0]-d1[i])/2;
		if(d>diam-d){
			if(R<d)a++;
			else A.push_back(i);
		}
		else{
			if(diam-d==R)B.push_back(i);
			else b++;
		}
	}
	/*cerr<<a<<" "<<A.size()<<" "<<B.size()<<" "<<b<<"\n";
	for(int i:A)cerr<<i<<" ";
	cerr<<"\n";*/
	//if(A.size()>N/2 || B.size()>N/2 || a>N/2 || b>N/2)return -R;
	//return R;
	if(a>N/2)return -R;
	if(b>N/2)return -R;
	if(a+A.size()<=N/2 && B.size()<=N/2)return R;
	if(b+B.size()<=N/2 && A.size()<=N/2)return R;
	if(A.size()<B.size())swap(A, B);
	int dist[N];
	for(int i=0; i<N; i++){
		dist[i]=(d2[i]-d2[0]+d1[i])/2;
	}
	stack<int> S, S2;
	for(int i:A){
		if(S2.size()!=0 && dist[i]+dist[S2.top()]!=getDistance(i, S2.top())){
			S.push(i);
		}
		else{
			S2.push(i);
			if(S.size()){
				S2.push(S.top());
				S.pop();
			}
		}
	}
	S.push(S2.top());
	S2.pop();
	int cnt=S.size();
	while(S.size() && S2.size()){
		if(dist[S.top()]+dist[S2.top()]!=getDistance(S.top(), S2.top())){
			cnt++;
			S2.pop();
			if(S2.size())S2.pop();
		}
		else{
			S.pop();
			S2.pop();
		}
	}
	if(cnt>N/2)return -R;
	else return R;
	/*for(int i:A){
		if(!S.size() || dist[i]+dist[S.top()]!=getDistance(i, S.top()))S.push(i);
		else S.pop();
	}
	if(!S.size())return R;
	int cnt=0;
	for(int i:A){
		if(dist[i]+dist[S.top()]!=getDistance(i, S.top()))cnt++;
	}
	if(cnt>N/2)return -R;
	return R;*/
}

Compilation message

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:44:15: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   44 |  if(a+A.size()<=N/2 && B.size()<=N/2)return R;
      |     ~~~~~~~~~~^~~~~
towns.cpp:44:32: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   44 |  if(a+A.size()<=N/2 && B.size()<=N/2)return R;
      |                        ~~~~~~~~^~~~~
towns.cpp:45:15: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   45 |  if(b+B.size()<=N/2 && A.size()<=N/2)return R;
      |     ~~~~~~~~~~^~~~~
towns.cpp:45:32: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   45 |  if(b+B.size()<=N/2 && A.size()<=N/2)return R;
      |                        ~~~~~~~~^~~~~
towns.cpp:66:16: warning: conversion from 'std::stack<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   66 |  int cnt=S.size();
      |          ~~~~~~^~
towns.cpp:6:28: warning: unused parameter 'sub' [-Wunused-parameter]
    6 | int hubDistance(int N, int sub) {
      |                        ~~~~^~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 332 KB Output is correct
2 Correct 13 ms 344 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 18 ms 336 KB Output is correct
5 Correct 20 ms 344 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 344 KB Output is correct
2 Correct 13 ms 340 KB Output is correct
3 Correct 18 ms 332 KB Output is correct
4 Correct 18 ms 332 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 332 KB Output is correct
2 Correct 24 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 22 ms 340 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 332 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 332 KB Output is correct
2 Correct 22 ms 332 KB Output is correct
3 Correct 18 ms 340 KB Output is correct

Subtask #6
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 344 KB Output is correct
2 Correct 19 ms 348 KB Output is correct
3 Correct 19 ms 360 KB Output is correct