結果

問題 No.3292 World Map Distance
ユーザー sgfc
提出日時 2025-10-03 22:41:35
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,356 ms / 3,000 ms
コード長 5,491 bytes
コンパイル時間 9,196 ms
コンパイル使用メモリ 542,544 KB
実行使用メモリ 81,280 KB
最終ジャッジ日時 2025-10-03 22:41:59
合計ジャッジ時間 22,955 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 34
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")

#include "bits/stdc++.h"
#include <stdio.h>
#include "atcoder/all"
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;
const double eps = 1e-9;

#define OVERLOAD3(_1, _2, _3, call,...) call
#define REP0(n) for (ll i = 0; i < ll(n); ++i)
#define REP1(i, n) for (ll i = 0; i < ll(n); ++i)
#define REP2(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)
#define RREP0(n) for (ll i = ll(n) - 1; i >= 0; --i)
#define RREP1(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define RREP2(i, a, b) for (ll i = ll(a) - 1; i >= b; --i)
#define RREP(...) OVERLOAD3(__VA_ARGS__, RREP2, RREP1, RREP0)(__VA_ARGS__)
#define REPE(i, c) for (auto&& i : c)
#define TCASE() ll _ttt; cin >> _ttt; while(_ttt--)

template<class... T> void COMMON_IN(T&... a) { (cin >> ... >> a); }
#define LI(...) ll __VA_ARGS__; COMMON_IN(__VA_ARGS__);
#define SI(...) string __VA_ARGS__; COMMON_IN(__VA_ARGS__);

using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define DLI(a, n) deque<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;
#define VVLI(a, n, m) vector<vector<ll>> a(n, vector<ll>(m)); for(auto& x : a) for(auto& y : x) cin >> y;
using vd = vector<double>; using pl = pair<ll, ll>; using vpl = vector<pl>; using vvpl = vector<vpl>;

struct uv { ll u; ll v; };
struct uvc { ll u; ll v; ll c = 1; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uvc> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].emplace_back(x.v); return ret; }
vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].emplace_back(x.v); ret[x.v].emplace_back(x.u); } return ret; }
vvpl to_edge_d(const ll n, const vector<uvc>& v) { vvpl ret(n); for (auto& x : v) { ret[x.u].emplace_back(x.v, x.c); ret[x.v].emplace_back(x.u, x.c); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;
using vm = vector<mint>; using vvm = vector<vm>;

template <class T> requires std::is_base_of_v<atcoder::internal::modint_base, T> ostream& operator<<(ostream& os, const T& v) { os << v.val(); return os; }
void yn(bool f) { std::cout << (f ? "Yes" : "No") << "\n"; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };
template<class T> void ovn(const T& v) { ov(v); cout << "\n"; };

const ll llhuge = 1LL << 61; //十分でかいが多少足しても溢れない数値
auto gmax(const auto& a, const auto& b) { return a > b ? a : b; };
auto gmin(const auto& a, const auto& b) { return a < b ? a : b; };
bool chmin(auto& a, const auto& b) { const auto olda = a; a = gmin(a, b); return olda != a; }
bool chmax(auto& a, const auto& b) { const auto olda = a; a = gmax(a, b); return olda != a; }
void sort(auto& v) { std::ranges::sort(v); };
void rev(auto& v) { std::ranges::reverse(v); };
template<class T> auto p_sum(const T& v) { T ret(v.size()); std::partial_sum(begin(v), end(v), ret.begin()); return ret; };
template<class T, class K = T::key_type, class V = T::mapped_type> [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end() ? V() : mp.at(key); }
long long ceil(const long long a, const long long b) { return (a + b - 1) / b; }

struct xy{
	ll x;
	ll y;
};;

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	LI(n, x, y);
	map<ll, ll> mpx;
	map<ll, ll> mpy;

	vector<xy> vxy(n);

	ll btx0 = 0;
	ll bty0 = 0;
	REP(i, n) {
		cin >> vxy[i].x >> vxy[i].y;
		vxy[i].x--;
		vxy[i].y--;

		ll tx0 = (vxy[i].x < x / 2) ? -1 : 1;
		if (x % 2 == 0) {
			ll txi = vxy[i].x + x / 2;
			txi %= x;
			if (txi == 0) tx0 = 1;
			mpx[txi] -= 2;
		}
		else {
			ll txi = vxy[i].x + x / 2;
			txi %= x;
			if (txi == 0) tx0 = 1;
			mpx[txi] -= 1;
			txi++;
			txi %= x;
			if (txi == 0) tx0 = 0;
			mpx[txi] -= 1;
		}
		mpx[vxy[i].x] += 2;
		if (vxy[i].x == 0) tx0 = -1;
		btx0 += tx0;

		ll ty0 = (vxy[i].y < y / 2) ? -1 : 1;
		if (y % 2 == 0) {
			ll tyi = vxy[i].y + y / 2;
			tyi %= y;
			if (tyi == 0) ty0 = 1;
			mpy[tyi] -= 2;
		}
		else {
			ll tyi = vxy[i].y + y / 2;
			tyi %= y;
			if (tyi == 0) ty0 = 1;
			mpy[tyi] -= 1;
			tyi++;
			tyi %= y;
			if (tyi == 0) ty0 = 0;
			mpy[tyi] -= 1;
		}
		mpy[vxy[i].y] += 2;
		if (vxy[i].y == 0) ty0 = -1;
		bty0 += ty0;
	}

	auto func = [](map<ll, ll>& mp, ll base) {
		ll maxv = -llhuge;
		ll maxvix = llhuge;
		ll cv = 0;
		ll cvix = 0;
		ll cdv = base;
		for (auto [k, v] : mp) {
			cv += cdv * (k - cvix);
			cvix = k;
			cdv += v;

			if (maxv < cv) {
				maxv = cv;
				maxvix = cvix;
			}
		}
		return maxvix;
	};

	ll xi = func(mpx, btx0);
	ll yi = func(mpy, bty0);

	ll ans = 0;
	REP(i, n) {
		ll xlen = min(abs(vxy[i].x - xi), x - abs(vxy[i].x - xi));
		ll ylen = min(abs(vxy[i].y - yi), y - abs(vxy[i].y - yi));

		ans += xlen + ylen;
	}

	cout << ans << "\n";

}
0