제출 #1291176

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1291176		kustov_vadim_533	도시들 (IOI15_towns)	C++20	0 / 100	9 ms	1856 KiB

towns

#include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <set>
#include <queue>
#include <array>
#include <map>
#include <random>
#include <bitset>
#include <stack>
#include <deque>
#include <random>
#include <unordered_set>
#include <unordered_map>
#include <string>
#include <chrono>
#include "towns.h"

using namespace std;

typedef long long ll;
typedef long double ld;

mt19937 gen(chrono::steady_clock::now().time_since_epoch().count());

int hubDistance(int N, int sub) {
	int v = 0;
	int ds = 0, s = 0;
	for (int u = 0; u < N; ++u) {
		int du = getDistance(v, u);
		if (du > ds) {
			ds = du;
			s = u;
		}
	}

	vector<int> d;
	for (int u = 0; u < N; ++u) {
		d.push_back(getDistance(s, u));
	}

	sort(d.begin(), d.end());

	int mx = 0;
	for (int x : d) {
		if (x * 2 < d.back()) {
			mx = max(mx, x);
		}
	}
	return mx;
}

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