제출 #52069

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
52069		kingpig9	도시들 (IOI15_towns)	C++11	90 / 100	44 ms	748 KiB

towns

//cleaner version of townsNo10.cpp. Version to submit.
#include <bits/stdc++.h>
#include "towns.h"
 
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 115;
const int INF = 1e9;
 
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define fillchar(a, s) memset((a), (s), sizeof(a))
 
#warning There can be more than one test case. Make sure you reset at every level.
 
template<class T>
void setmin (T &a, T b) {
	if (b < a) {
		a = b;
	}
}
 
template<class T>
void setmax (T &a, T b) {
	if (a < b) {
		a = b;
	}
}
 
int N;
int subtask;
int dist[MAXN][MAXN];
 
int getdist (int x, int y) {
	assert(0 <= x);
	assert(x < N);
	assert(0 <= y);
	assert(y < N);
 
	if (x == y) {
		return 0;
	}
 
	if (x > y) {
		swap(x, y);
	}
 
	int &ref = dist[x][y];
	if (ref) {
		return ref;
	}
	return ref = getDistance(x, y);
}
 
array<int, 3> getcent (int a, int b, int c) {
	//get distance to the meeting place of a, b, c
	int dab = getdist(a, b), dac = getdist(a, c), dbc = getdist(b, c);
	return array<int, 3> {(dab + dac - dbc) / 2, (dab - dac + dbc) / 2, (-dab + dac + dbc) / 2};
}
 
int diamx, diamy, diam;
int ans;
map<int, vector<int>> mp;
map<int, int> psum;	//prefix sum, suffix sum
 
void reset() {
	fillchar(dist, 0);
	diamx = diam = ans = 0;
	mp.clear();
	psum.clear();
}
 
bool has_balanced_hub() {
	for (auto it : mp) {
		//check if hub
		int dl = it.fi, dr = diam - dl;
		if (dl == 0 || dr == 0) {
			continue;
		}
 
		if (max(dl, dr) == ans) {
			//this is a hub
			auto pit = prev(psum.find(dl));
			vector<int> leaves = it.se;
			int lsize = pit->se;
			int csize = leaves.size();
			int rsize = N - lsize - csize;
 
			if (lsize > N / 2 || rsize > N / 2) {
				continue;
			}
			if (csize <= N / 2) {
				return true;
			}
			//dumb asserts -- primarily for reassurance
			assert(lsize <= N / 2);
			assert(rsize <= N / 2);
			assert(csize > N / 2);
 
			//otherwise - majority element!
			vector<int> vlist, bucket;
			for (int leaf : leaves) {
				if (vlist.empty() || getcent(diamx, vlist.back(), leaf)[0] == dl) {
					//not equal
					vlist.push_back(leaf);
					if (!bucket.empty()) {
						vlist.push_back(bucket.back());
						bucket.pop_back();
					}
				} else {
					//equal
					bucket.push_back(leaf);
				}
			}
 
			//check now whether it is a majority element
			//More formally: "maj" = potential majority element. Nothing else could be a majority element. Check its count.
			int maj = vlist.back();	//majority element

			while (!vlist.empty()) {
				int leaf = vlist.back();
				if (getcent(diamx, maj, leaf)[0] == dl) {
					//not equal
					if (bucket.empty()) {
						return true;
					}

					bucket.pop_back();
					vlist.pop_back();
				} else {
					//equal
					if (vlist.size() == 1) {
						bucket.push_back(vlist[0]);
						vlist.pop_back();
					} else {
						vlist.pop_back();
						vlist.pop_back();
					}
				}
			}
 
 			if (bucket.empty()) {
				return true;
			}
		}
	}
	return false;
}
 
pii getfar (int x) {
	//farthest away
	pii res(0, x);
	for (int i = 0; i < N; i++) {
		setmax(res, pii(getdist(i, x), i));
	}
	return res;
}

int go() {
	pii far0 = getfar(0);
	pii farx = getfar(far0.se);
	diamx = far0.se;
	diamy = farx.se;	//don't actually use this for querying.
	diam = farx.fi;
	//debug("diameter: %d -> %d, distance %d\n", diamx, diamy, diam);
 
	ans = diam;
	int dxcent = getcent(diamx, 0, diamy)[0];
	//debug("distance from diamx = %d to CENTER is %d\n", diamx, dxcent);
	
	//note that this starts at ONE, not 0.
	for (int i = 0; i < N; i++) {
		if (i == diamx) {
			mp[0].push_back(diamx);
		} else if (i == 0) {
			mp[dxcent].push_back(0);
		} else {
			auto cen = getcent(diamx, 0, i);
			int d = min(cen[0], dxcent);
			mp[d].push_back(i);
			setmin(ans, max(d, diam - d));
		}
	}

	for (auto it = mp.begin(); it != mp.end(); it++) {
		psum[it->fi] = it->se.size();
		if (it != mp.begin()) {
			psum[it->fi] += psum[prev(it)->fi];
		}
	}
 
	return has_balanced_hub() ? ans : -ans;
}
 
int hubDistance (int nnn, int subbbb) {
#warning reset totally global variables
	N = nnn;
	subtask = subbbb;
	reset();
	return go();
}

컴파일 시 표준 에러 (stderr) 메시지

towns.cpp:18:2: warning: #warning There can be more than one test case. Make sure you reset at every level. [-Wcpp]
 #warning There can be more than one test case. Make sure you reset at every level.
  ^~~~~~~
towns.cpp:200:2: warning: #warning reset totally global variables [-Wcpp]
 #warning reset totally global variables
  ^~~~~~~
towns.cpp: In function 'bool has_balanced_hub()':
towns.cpp:90:27: warning: conversion to 'int' from 'std::vector<int>::size_type {aka long unsigned int}' may alter its value [-Wconversion]
    int csize = leaves.size();
                ~~~~~~~~~~~^~
towns.cpp: In function 'int go()':
towns.cpp:190:29: warning: conversion to 'std::map<int, int>::mapped_type {aka int}' from 'std::vector<int>::size_type {aka long unsigned int}' may alter its value [-Wconversion]
   psum[it->fi] = it->se.size();
                  ~~~~~~~~~~~^~

• Subtask 1: 13 / 13
• Subtask 2: 12 / 12
• Subtask 3: 13 / 13
• Subtask 4: 0 / 10
• Subtask 5: 13 / 13
• Subtask 6: 39 / 39