結果
| 問題 | No.960 マンハッタン距離3 |
| ユーザー |
 Pachicobue
|
| 提出日時 | 2019-12-23 03:13:00 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 11,172 bytes |
| コンパイル時間 | 2,238 ms |
| コンパイル使用メモリ | 214,436 KB |
| 最終ジャッジ日時 | 2025-01-08 14:01:26 |
|
ジャッジサーバーID （参考情報） |
judge4 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 RE * 3 |
| other | AC * 91 WA * 37 RE * 30 TLE * 58 |
ソースコード
#include <bits/stdc++.h>
// created [2019/12/23] 00:51:38
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
using uint = unsigned int;
using usize = std::size_t;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<typename T, usize n>
using arr = T (&)[n];
template<typename T, usize n>
using c_arr = const T (&)[n];
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }
template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }
template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }
template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod = 1000000007;
template<typename T> constexpr T inf_v = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};
auto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };
template<typename T>
T in()
{
T v;
return std::cin >> v, v;
}
template<typename T, typename Uint, usize n, usize i>
T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); }
template<typename T, typename Uint, usize n, usize i>
auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs)
{
const usize s = (usize)szs[i];
std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);
for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); }
return ans;
}
template<typename T, typename Uint, usize n>
auto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); }
template<typename... Types>
auto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; }
struct io_init
{
io_init()
{
std::cin.tie(nullptr), std::ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(20);
}
void clear()
{
std::cin.tie(), std::ios::sync_with_stdio(true);
}
} io_setting;
template<typename T>
int out(const T& v) { return std::cout << v, 0; }
template<typename T>
int out(const std::vector<T>& v)
{
for (usize i = 0; i < v.size(); i++) {
if (i > 0) { std::cout << ' '; }
out(v[i]);
}
return std::cout << "\n", 0;
}
template<typename T1, typename T2>
int out(const std::pair<T1, T2>& v) { return out(v.first), std::cout << ' ', out(v.second), 0; }
template<typename T, typename... Args>
int out(const T& v, const Args... args) { return out(v), std::cout << ' ', out(args...), 0; }
template<typename... Args>
int outln(const Args... args) { return out(args...), std::cout << '\n', 0; }
template<typename... Args>
void outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }
# define SHOW(...) static_cast<void>(0)
constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }
template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; }
template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{})
{
const usize s = (usize)szs[i];
return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v));
}
template<typename T, typename Uint, usize n>
auto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); }
int main()
{
auto L1 = [&](const ll x1, const ll y1, const ll x2, const ll y2) { return std::abs(x1 - x2) + std::abs(y1 - y2); };
auto Linf = [&](const ll x1, const ll y1, const ll x2, const ll y2) { return std::max(std::abs(x1 - x2), std::abs(y1 - y2)); };
auto W = in<ll>(), H = in<ll>();
const auto N = in<int>();
std::vector<ll> rxs(N), rys(N);
for (int i = 0; i < N; i++) { rxs[i] = in<ll>(), rys[i] = in<ll>(); }
{
std::set<int> mod;
for (int i = 0; i < N; i++) { mod.insert(L1(rxs[i], rys[i], 0, 0) % 2); }
if (mod.size() == 2) { return outln(0); }
}
if (N <= 12) {
assert(false);
// やる
}
std::vector<ll> xs(N), ys(N);
auto make = [&]() { for (int i = 0; i < N; i++) { xs[i] = rxs[i] + rys[i], ys[i] = rxs[i] - rys[i]; } };
make();
auto flip = [&]() { std::swap(W, H), std::swap(rxs, rys), make(); };
auto xflip = [&]() {
for (int i = 0; i < N; i++) { rxs[i] = W + 1 - rxs[i]; }
make();
};
auto solve = [&]() -> bool {
std::map<ll, std::vector<int>> xis;
for (int i = 0; i < N; i++) { xis[xs[i]].push_back(i); }
ll vx = -1; // 縦に3点乗っている直線
for (int x = 0; x <= W + H; x++) {
if (not xis.count(x)) { continue; }
if (xis[x].size() >= 3) { vx = x; }
}
if (vx == -1) { return false; }
if (xis[vx].size() == N) {
ll rxmin = inf_v<ll>, rxmax = -inf_v<ll>;
ll rymin = inf_v<ll>, rymax = -inf_v<ll>;
for (const int i : xis[vx]) {
chmin(rxmin, rxs[i]), chmax(rxmax, rxs[i]);
chmin(rymin, rys[i]), chmax(rymax, rys[i]);
}
outln(rxmin * rymin + (W - rxmax + 1) * (H - rymax + 1));
return true;
}
ll oi = -1; // 外の点
for (ll x = vx + 1; x <= W; x++) {
if (xis.count(x)) { oi = xis[x][0]; }
}
if (oi == -1) {
xflip();
vx = W + 1 - vx;
xis.clear();
for (int i = 0; i < N; i++) { xis[xs[i]].push_back(i); }
for (ll x = vx + 1; x <= W; x++) {
if (xis.count(x)) { oi = xis[x][0]; }
}
}
ll vymin = inf_v<ll>, vymax = -inf_v<ll>;
for (const int i : xis[vx]) { chmin(vymin, ys[i]), chmax(vymax, rys[i]); }
const ll oy = ys[oi], ox = xs[oi];
if (vymin < oy and oy < vymax) { return false; }
ll cy = 0, cx = 0; // 中心の乗る半直線の開始地点
if (oy >= vymax) {
cy = vymin + oy, cx = vx + oy - vymin;
if (cy % 2 == 1 or cx % 2 == 1) { return false; }
cy /= 2, cx /= 2;
// 半直線は(cx,cy)から(1,-1)方向
const ll y_x = cy - cx;
ll d_above = -1, d_below = -1;
for (int i = 0; i < N; i++) {
bool above = (ys[i] - xs[i]) >= y_x;
const ll d = Linf(xs[i], ys[i], cx, cy);
if (above) {
if (d_above != -1 and d_above != d) { return false; }
d_above = d;
} else {
if (d_below != -1 and d_below != d) { return false; }
d_below = d;
}
}
if (d_above == -1) { return false; }
if (d_below == -1) {
ll p = cx + cy, q = cx - cy;
if (p % 2 == 1 or q % 2 == 1) { return false; }
p /= 2, q /= 2;
if (p < 1 or W < p) { return false; }
if (q < 1 or H < q) { return false; }
outln(H - q + 1);
return true;
} else {
if (d_above > d_below) { return false; }
ll l = d_below - d_above;
if (l % 2 == 1) { return false; }
l /= 2;
const ll x = cx + l, y = cy - l;
ll p = x + y, q = x - y;
if (p % 2 == 1 or q % 2 == 1) { return false; }
if (p < 1 or W < p) { return false; }
if (q < 1 or H < q) { return false; }
outln(1);
return true;
}
} else {
cy = vymax + oy, cx = vx + vymax - oy;
if (cy % 2 == 1 or cx % 2 == 1) { return false; }
cy /= 2, cx /= 2;
// 半直線は(cx,cy)から(1,1)方向
const ll y_x = cy + cx;
ll d_above = -1, d_below = -1;
for (int i = 0; i < N; i++) {
bool above = (ys[i] + xs[i]) <= y_x;
const ll d = Linf(xs[i], ys[i], cx, cy);
if (above) {
if (d_above != -1 and d_above != d) { return false; }
d_above = d;
} else {
if (d_below != -1 and d_below != d) { return false; }
d_below = d;
}
}
if (d_above == -1) { return false; }
if (d_below == -1) {
ll p = cx + cy, q = cx - cy;
if (p % 2 == 1 or q % 2 == 1) { return false; }
p /= 2, q /= 2;
if (p < 1 or W < p) { return false; }
if (q < 1 or H < q) { return false; }
outln(W - p + 1);
return true;
} else {
if (d_above > d_below) { return false; }
ll l = d_below - d_above;
if (l % 2 == 1) { return false; }
l /= 2;
const ll x = cx + l, y = cy + l;
ll p = x + y, q = x - y;
if (p % 2 == 1 or q % 2 == 1) { return false; }
if (p < 1 or W < p) { return false; }
if (q < 1 or H < q) { return false; }
outln(1);
return true;
}
}
};
if (not solve()) {
flip();
if (not solve()) { return outln(0); }
}
return 0;
}