結果
| 問題 | No.3601 Queen Dist Sum with One Wall |
| コンテスト | |
| ユーザー |
 yamada
|
| 提出日時 | 2026-07-25 03:36:40 |
| 言語 | C++23 (gcc 15.2.0 + boost 1.90.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 25,645 bytes |
| 記録 | |
| コンパイル時間 | 3,740 ms |
| コンパイル使用メモリ | 407,164 KB |
| 実行使用メモリ | 5,888 KB |
| 最終ジャッジ日時 | 2026-07-25 03:37:06 |
| 合計ジャッジ時間 | 8,259 ms |
|
ジャッジサーバーID （参考情報） |
judge3_0 / judge2_0 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 1 TLE * 1 -- * 20 |
ソースコード
// Begin include: "../../template/multitest-template.hpp"
using namespace std;
// intrinstic
#include <immintrin.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// Begin include: "util.hpp"
namespace yamada {
using ll = long long;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
using lld = long double;
template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<vector<T>>;
template <typename T>
using VVV = vector<vector<vector<T>>>;
template <typename T>
using VVVV = vector<vector<vector<vector<T>>>>;
using vl = vector<long long>;
using vd = V<double>;
using vs = V<string>;
using vvl = vector<vector<long long>>;
using vvvl = vector<vector<vector<long long>>>;
using vvvvl = vector<vector<vector<vector<long long>>>>;
template <typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using maxpq = priority_queue<T, vector<T>, less<T>>;
template <typename T, typename U>
struct P : pair<T, U> {
template <typename... Args>
P(Args... args) : pair<T, U>(args...) {}
using pair<T, U>::first;
using pair<T, U>::second;
P &operator+=(const P &r) {
first += r.first;
second += r.second;
return *this;
}
P &operator-=(const P &r) {
first -= r.first;
second -= r.second;
return *this;
}
P &operator*=(const P &r) {
first *= r.first;
second *= r.second;
return *this;
}
template <typename S>
P &operator*=(const S &r) {
first *= r, second *= r;
return *this;
}
P operator+(const P &r) const { return P(*this) += r; }
P operator-(const P &r) const { return P(*this) -= r; }
P operator*(const P &r) const { return P(*this) *= r; }
template <typename S>
P operator*(const S &r) const {
return P(*this) *= r;
}
P operator-() const { return P{-first, -second}; }
};
using pl = P<ll, ll>;
using vp = V<pl>;
using vvp = VV<pl>;
constexpr int inf = 1001001001;
constexpr long long infLL = 4004004004004004004LL;
template <typename T, typename U>
inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template <typename T, typename U>
inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template <typename T>
inline T Max(const vector<T> &v) { return *max_element(begin(v), end(v)); }
template <typename T>
inline T Min(const vector<T> &v) { return *min_element(begin(v), end(v)); }
template <typename T>
inline long long Sum(const vector<T> &v) { return accumulate(begin(v), end(v), T(0)); }
template <typename T>
int lb(const vector<T> &v, const T &a) { return lower_bound(begin(v), end(v), a) - begin(v); }
template <typename T>
int ub(const vector<T> &v, const T &a) { return upper_bound(begin(v), end(v), a) - begin(v); }
constexpr long long TEN(int n) {
long long ret = 1, x = 10;
for (; n; x *= x, n >>= 1) ret *= (n & 1 ? x : 1);
return ret;
}
template <typename T>
vector<T> mkrui(const vector<T> &v, bool rev = false) {
vector<T> ret(v.size() + 1);
if (rev) {
for (int i = int(v.size()) - 1; i >= 0; i--) ret[i] = v[i] + ret[i + 1];
} else {
for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
}
return ret;
};
template <typename T>
vector<T> mkuni(const vector<T> &v) {
vector<T> ret(v);
sort(ret.begin(), ret.end());
ret.erase(unique(ret.begin(), ret.end()), ret.end());
return ret;
}
template <typename F>
vector<int> mkord(int N, F f) {
vector<int> ord(N);
iota(begin(ord), end(ord), 0);
sort(begin(ord), end(ord), f);
return ord;
}
template <typename T>
vector<int> mkinv(vector<T> &v) {
int max_val = *max_element(begin(v), end(v));
vector<int> inv(max_val + 1, -1);
for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;
return inv;
}
vector<int> mkiota(int n) {
vector<int> ret(n);
iota(begin(ret), end(ret), 0);
return ret;
}
// g o f
vector<int> p_mrg(vector<int> f, const vector<int> &g) {
for (int i = 0; i < (int)f.size(); i++) f[i]=g[f[i]];
return f;
}
template <typename T>
vector<T> p_shf(const vector<int>& f, const vector<T>& A, const bool inv = false) {
int n = A.size();
vector<T> ret(n);
if (!inv) for (int i = 0; i < n; i++) ret[f[i]] = A[i];
else for (int i = 0; i < n; i++) ret[i] = A[f[i]];
return ret;
}
template <typename T>
T mkrev(const T &v) {
T w{v};
reverse(begin(w), end(w));
return w;
}
template <typename T>
bool nxp(T &v) { return next_permutation(begin(v), end(v)); }
// 返り値の型は入力の T に依存
// i 要素目 : [0, a[i])
template <typename T>
vector<vector<T>> product(const vector<T> &a) {
vector<vector<T>> ret;
vector<T> v;
auto dfs = [&](auto rc, int i) -> void {
if (i == (int)a.size()) {
ret.push_back(v);
return;
}
for (int j = 0; j < a[i]; j++) v.push_back(j), rc(rc, i + 1), v.pop_back();
};
dfs(dfs, 0);
return ret;
}
template <typename T, typename U>
vector<U> Digit(T a, const U &x, int siz = -1) {
vector<U> ret;
while (a > 0) {
ret.emplace_back(a % x);
a /= x;
}
if (siz >= 0) while ((int)ret.size() < siz) ret.emplace_back(0);
return ret;
}
// F : function(void(T&)), mod を取る操作
// T : 整数型のときはオーバーフローに注意する
template <typename T>
T Power(T a, long long n, const T &I, const function<void(T &)> &f) {
T res = I;
for (; n; f(a = a * a), n >>= 1) {
if (n & 1) f(res = res * a);
}
return res;
}
// T : 整数型のときはオーバーフローに注意する
template <typename T>
T Power(T a, long long n, const T &I = T{1}) {
return Power(a, n, I, function<void(T &)>{[](T &) -> void {}});
}
template <typename T>
T Rev(const T &v) {
T res = v;
reverse(begin(res), end(res));
return res;
}
template <typename T>
vector<T> Transpose(const vector<T> &v) {
using U = typename T::value_type;
if(v.empty()) return {};
int H = v.size(), W = v[0].size();
vector res(W, T(H, U{}));
for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) res[j][i] = v[i][j];
return res;
}
template <typename T>
vector<T> Rotate(const vector<T> &v, int clockwise = true) {
using U = typename T::value_type;
int H = v.size(), W = v[0].size();
vector res(W, T(H, U{}));
for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) {
if (clockwise) res[W - 1 - j][i] = v[i][j];
else res[j][H - 1 - i] = v[i][j];
}
return res;
}
template <typename T, typename F>
T bisect(T ok, T bad, F pred) {
if (ok == bad) return ok;
while (bad - ok > 1) { T mid = ok + (bad - ok) / 2; (pred(mid) ? ok : bad) = mid; }
return bad;
}
template <typename T, typename F>
T bisect_double(T ok, T bad, F pred, int iter = 100) {
if (ok == bad) return ok;
while (iter--) { T mid = ok + (bad - ok) / 2; (pred(mid) ? ok : bad) = mid; }
return bad;
}
template <typename T>
bool inLR(T L, T x, T R){ return (L <= x && x < R); }
bool YESNO(bool b) { std::cout << (b ? "YES\n" : "NO\n"); return b; }
bool YesNo(bool b) { std::cout << (b ? "Yes\n" : "No\n"); return b; }
bool yesno(bool b) { std::cout << (b ? "yes\n" : "no\n"); return b; }
bool is_square(uint64_t n) {
if (n < 2) return true;
uint64_t r = static_cast<uint64_t>(sqrtl(static_cast<long double>(n)));
if (r * r == n) return true;
++r;
return r * r == n;
}
template <typename T>
struct CumulativeSum {
std::vector<T> S;
CumulativeSum(std::vector<T> &A) {
int N = A.size();
S.resize(N + 1);
for (int i = 0; i < N; i++) S[i + 1] = S[i] + A[i];
}
T query(int l, int r) { return (l <= r ? S[r] - S[l] : (T)0); }
T query() { return S.back(); }
inline T operator()(int l, int r) { return query(l, r); }
inline T operator()() { return query(); }
};
long long Floor(long long a, long long b) {
assert(b != 0);
if (b < 0) a = -a, b = -b;
return a / b - (a % b < 0);
}
long long Under(long long a, long long b) {
assert(b != 0);
if (b < 0) a = -a, b = -b;
return a / b - (a % b <= 0);
}
long long Ceil(long long a, long long b) {
assert(b != 0);
if (b < 0) a = -a, b = -b;
return a / b + (a % b > 0);
}
long long Over(long long a, long long b) {
assert(b != 0);
if (b < 0) a = -a, b = -b;
return a / b + (a % b >= 0);
}
long long Modulo(long long a, long long b) {
assert(b > 0);
long long c = a % b;
return c < 0 ? c + b : c;
}
} // namespace yamada
// End include: "util.hpp"
// Begin include: "bitop.hpp"
namespace yamada {
__attribute__((target("popcnt"))) inline int popcnt(const u64 &a) {
return __builtin_popcountll(a);
}
inline int lsb(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }
inline int msb(const u64 &a) { return a ? 63 - __builtin_clzll(a) : -1; }
template <typename T>
inline int gbit(const T &a, int i) { return (a >> i) & 1; }
template <typename T>
inline void sbit(T &a, int i, bool b) { if (gbit(a, i) != b) a ^= T(1) << i; }
constexpr long long PW(int n) { return 1LL << n; }
constexpr long long MSK(int n) { return (1LL << n) - 1; }
} // namespace yamada
// End include: "bitop.hpp"
// Begin include: "inout.hpp"
namespace yamada {
template <typename T, size_t K> ostream &operator<<(ostream &os, const array<T, K> &v);
template <typename T, size_t K> istream &operator>>(istream &is, array<T, K> &v);
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v);
template <typename T> istream &operator>>(istream &is, vector<T> &v);
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p);
template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &p);
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
int s = (int)v.size();
for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v) is >> x;
return is;
}
template <typename T, size_t K>
ostream &operator<<(ostream &os, const array<T, K> &v) {
for (int i = 0; i < K; i++) os << (i ? " " : "") << v[i];
return os;
}
template <typename T, size_t K>
istream &operator>>(istream &is, array<T, K> &v) {
for (auto &x : v) is >> x;
return is;
}
istream &operator>>(istream &is, __int128_t &x) {
string S;
is >> S;
x = 0;
int flag = 0;
for (auto &c : S) {
if (c == '-') {
flag = true;
continue;
}
x *= 10;
x += c - '0';
}
if (flag) x = -x;
return is;
}
istream &operator>>(istream &is, __uint128_t &x) {
string S;
is >> S;
x = 0;
for (auto &c : S) {
x *= 10;
x += c - '0';
}
return is;
}
ostream &operator<<(ostream &os, __int128_t x) {
if (x == 0) return os << 0;
if (x < 0) os << '-', x = -x;
string S;
while (x) S.push_back('0' + x % 10), x /= 10;
reverse(begin(S), end(S));
return os << S;
}
ostream &operator<<(ostream &os, __uint128_t x) {
if (x == 0) return os << 0;
string S;
while (x) S.push_back('0' + x % 10), x /= 10;
reverse(begin(S), end(S));
return os << S;
}
void in() {}
template <typename T, class... U>
void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template <char sep = ' ', typename T, class... U>
void out(const T &t, const U &...u) {
cout << t;
if constexpr (sizeof...(u)) {
cout << sep;
out<sep>(u...);
}
else out();
}
void fout() { cout << endl; }
template <char sep = ' ', typename T, class... U>
void fout(const T &t, const U &...u) {
cout << t;
if constexpr (sizeof...(u)) {
cout << sep;
fout<sep>(u...);
}
else fout();
}
void wout() {}
template <char sep = ' ', typename T, class... U>
void wout(const T &t, const U &...u) {
cout << t;
if constexpr (sizeof...(u)) {
cout << sep;
wout<sep>(u...);
}
else wout();
}
template <size_t iter = 1000, typename mint>
std::string toFraction(const mint &a) {
for (int deno = 1; deno <= iter; deno++) {
mint inv = ((mint)deno).inverse();
for (int nume = 0; nume <= iter; nume++) {
mint val = inv * nume;
if (val == a) {
if (deno == 1) return std::to_string(nume);
return std::to_string(nume) + "/" + std::to_string(deno);
}
else if (-val == a) {
if (deno == 1) return std::to_string(-nume);
return std::to_string(-nume) + "/" + std::to_string(deno);
}
}
}
return "NF";
}
void mout() { cout << endl; }
template <size_t iter = 1000, char sep = ' ', typename mint, class... U>
void mout(const mint &a, const U &...u) {
std::cout << toFraction<iter, mint>(a);
if constexpr (sizeof...(u)) {
cout << sep;
mout<iter, sep>(u...);
}
else mout();
}
template <size_t iter = 1000, typename mint>
void mout(std::vector<mint> &A) {
for (int i = 0; i < (int)A.size(); i++) {
std::cout << toFraction(A[i], iter) << (i == (int)A.size() - 1 ? "\n" : " ");
}
}
struct IoSetupYamada {
IoSetupYamada() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
cerr << fixed << setprecision(7);
}
} iosetupyamada;
} // namespace yamada
// End include: "inout.hpp"
// Begin include: "macro.hpp"
#define each(x, v) for (auto&& x : v)
#define each2(x, y, v) for (auto&& [x, y] : v)
#define each3(x, y, z, v) for (auto&& [x, y, z] : v)
#define all(v) (v).begin(), (v).end()
#define rep1(a) for (long long _ = 0; _ < (long long)(a); ++_)
#define rep2(i, a) for (long long i = 0; i < (long long)(a); ++i)
#define rep3(i, a, b) for (long long i = a; i < (long long)(b); ++i)
#define rep4(i, a, b, c) for (long long i = a; i < (long long)(b); i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rep1r(a) for (long long i = (long long)(a)-1; i >= 0LL; --i)
#define rep2r(i, a) for (long long i = (long long)(a)-1; i >= 0LL; --i)
#define rep3r(i, a, b) for (long long i = (long long)(b)-1; i >= (long long)(a); --i)
#define overload3(a, b, c, d, ...) d
#define repr(...) overload3(__VA_ARGS__, rep3r, rep2r, rep1r)(__VA_ARGS__)
#define eb emplace_back
#define mkp make_pair
#define mkt make_tuple
#define fi first
#define se second
#define vv(type, name, h, ...) \
vector<vector<type> > name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...) \
vector<vector<vector<vector<type>>>> name( \
a, vector<vector<vector<type>>>( \
b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define in2(s, t) \
for (int i = 0; i < (int)s.size(); i++) { \
in(s[i], t[i]); \
}
#define in3(s, t, u) \
for (int i = 0; i < (int)s.size(); i++) { \
in(s[i], t[i], u[i]); \
}
#define in4(s, t, u, v) \
for (int i = 0; i < (int)s.size(); i++) { \
in(s[i], t[i], u[i], v[i]); \
}
#define die(...) \
do { \
yamada::out(__VA_ARGS__);\
return; \
} while (0)
// End include: "macro.hpp"
namespace yamada {
void solve();
}
int main() { int T; cin >> T; while(T--) yamada::solve(); }
// End include: "../../template/multitest-template.hpp"
// Begin include: "../../geometry/line.hpp"
// Begin include: "geometry-base.hpp"
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <iostream>
#include <vector>
using namespace std;
using Real = long double;
constexpr Real EPS = 1e-10;
constexpr Real PI = 3.141592653589793238462643383279L;
bool equals(Real a, Real b) { return fabs(b - a) < EPS; }
int sign(Real a) { return equals(a, 0) ? 0 : a > 0 ? 1 : -1; }
template <typename R>
struct PointBase {
using P = PointBase;
R x, y;
PointBase() : x(0), y(0) {}
PointBase(R _x, R _y) : x(_x), y(_y) {}
template <typename T, typename U>
PointBase(const pair<T, U>& p) : x(p.first), y(p.second) {}
P operator+(const P& r) const { return {x + r.x, y + r.y}; }
P operator-(const P& r) const { return {x - r.x, y - r.y}; }
P operator*(R r) const { return {x * r, y * r}; }
P operator/(R r) const { return {x / r, y / r}; }
P& operator+=(const P& r) { return (*this) = (*this) + r; }
P& operator-=(const P& r) { return (*this) = (*this) - r; }
P& operator*=(R r) { return (*this) = (*this) * r; }
P& operator/=(R r) { return (*this) = (*this) / r; }
bool operator<(const P& r) const { return x != r.x ? x < r.x : y < r.y; }
bool operator==(const P& r) const { return x == r.x and y == r.y; }
bool operator!=(const P& r) const { return !((*this) == r); }
P rotate(R rad) const {
return {x * cos(rad) - y * sin(rad), x * sin(rad) + y * cos(rad)};
}
R real() const { return x; }
R imag() const { return y; }
friend R real(const P& p) { return p.x; }
friend R imag(const P& p) { return p.y; }
friend R dot(const P& l, const P& r) { return l.x * r.x + l.y * r.y; }
friend R cross(const P& l, const P& r) { return l.x * r.y - l.y * r.x; }
friend R abs(const P& p) { return sqrt(p.x * p.x + p.y * p.y); }
friend R norm(const P& p) { return p.x * p.x + p.y * p.y; }
friend R arg(const P& p) { return atan2(p.y, p.x); }
friend istream& operator>>(istream& is, P& p) {
R a, b;
is >> a >> b;
p = P{a, b};
return is;
}
friend ostream& operator<<(ostream& os, const P& p) {
return os << p.x << " " << p.y;
}
};
using Point = PointBase<Real>;
using Points = vector<Point>;
// ccw, 点の進行方向
int ccw(const Point& a, const Point& b, const Point& c) {
Point x = b - a, y = c - a;
if (cross(x, y) > EPS) return +1; // 反時計回り
if (cross(x, y) < -EPS) return -1; // 時計回り
if (min(norm(x), norm(y)) < EPS * EPS) return 0; // c=a または c=b
if (dot(x, y) < EPS) return +2; // c-a-b の順で一直線
if (norm(x) < norm(y)) return -2; // a-b-c の順で一直線
return 0; // a-c-b の順で一直線
}
// End include: "geometry-base.hpp"
// Begin include: "polygon.hpp"
// Begin include: "geometry-base.hpp"
// End include: "geometry-base.hpp"
using Polygon = vector<Point>;
// 多角形の内部に点があるか？
// OUT : 0, ON : 1, IN : 2
int contains_polygon(const Polygon &Q, const Point &p) {
bool in = false;
for (int i = 0; i < (int)Q.size(); i++) {
Point a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;
if (imag(a) > imag(b)) swap(a, b);
if (sign(imag(a)) <= 0 && 0 < sign(imag(b)) && sign(cross(a, b)) < 0)
in = !in;
if (equals(cross(a, b), 0) && sign(dot(a, b)) <= 0) return 1;
}
return in ? 2 : 0;
}
// 多角形の面積
Real area(const Polygon &p) {
Real A = 0;
for (int i = 0; i < (int)p.size(); ++i) {
A += cross(p[i], p[(i + 1) % p.size()]);
}
return A * 0.5;
}
// 頂点集合から凸包を生成
// boundary : 周上の点も列挙する場合 true
template <bool boundary = false>
Polygon convex_hull(vector<Point> ps) {
sort(begin(ps), end(ps));
ps.erase(unique(begin(ps), end(ps)), end(ps));
int n = ps.size(), k = 0;
if (n <= 2) return ps;
vector<Point> ch(2 * n);
// 反時計周り
Real th = boundary ? -EPS : +EPS;
for (int i = 0; i < n; ch[k++] = ps[i++]) {
while (k >= 2 && cross(ch[k - 1] - ch[k - 2], ps[i] - ch[k - 1]) < th) --k;
}
for (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--]) {
while (k >= t && cross(ch[k - 1] - ch[k - 2], ps[i] - ch[k - 1]) < th) --k;
}
ch.resize(k - 1);
return ch;
}
// 凸包の内部に点があるか？
// OUT : 0, ON : 1, IN : 2
int contains_convex(const Polygon &C, const Point &p) {
int N = C.size();
auto b1 = cross(C[1] - C[0], p - C[0]);
auto b2 = cross(C[N - 1] - C[0], p - C[0]);
if (b1 < -EPS or b2 > EPS) return 0;
int L = 1, R = N - 1;
while (L + 1 < R) {
int M = (L + R) / 2;
(cross(p - C[0], C[M] - C[0]) >= 0 ? R : L) = M;
}
auto v = cross(C[L] - p, C[R] - p);
if (equals(v, 0)) {
return 1;
} else if (v > 0) {
return equals(b1, 0) or equals(b2, 0) ? 1 : 2;
} else {
return 0;
}
}
// 凸包が与えられるので最遠点対を返す
// 返り値：頂点番号のペア
pair<int, int> convex_polygon_diameter(const Polygon &p) {
int N = (int)p.size();
int is = 0, js = 0;
for (int i = 1; i < N; i++) {
if (imag(p[i]) > imag(p[is])) is = i;
if (imag(p[i]) < imag(p[js])) js = i;
}
Real maxdis = norm(p[is] - p[js]);
int maxi, maxj, i, j;
i = maxi = is;
j = maxj = js;
do {
if (cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {
j = (j + 1) % N;
} else {
i = (i + 1) % N;
}
if (norm(p[i] - p[j]) > maxdis) {
maxdis = norm(p[i] - p[j]);
maxi = i;
maxj = j;
}
} while (i != is || j != js);
return minmax(maxi, maxj);
}
// End include: "polygon.hpp"
struct Line {
Point a, b;
Line() = default;
Line(const Point &_a, const Point &_b) : a(_a), b(_b) {}
// Ax+By=C
Line(const Real &A, const Real &B, const Real &C) {
if (equals(A, 0)) {
assert(!equals(B, 0));
a = Point(0, C / B);
b = Point(1, C / B);
} else if (equals(B, 0)) {
a = Point(C / A, 0);
b = Point(C / A, 1);
} else if (equals(C, 0)) {
a = Point(0, C / B);
b = Point(1, (C - A) / B);
} else {
a = Point(0, C / B);
b = Point(C / A, 0);
}
}
friend ostream &operator<<(ostream &os, const Line &l) {
return os << l.a << " to " << l.b;
}
friend istream &operator>>(istream &is, Line &l) { return is >> l.a >> l.b; }
};
using Lines = vector<Line>;
bool is_parallel(const Line &a, const Line &b) {
return equals(cross(a.b - a.a, b.b - b.a), 0);
}
bool is_orthogonal(const Line &a, const Line &b) {
return equals(dot(a.a - a.b, b.a - b.b), 0);
}
Point cross_point_ll(const Line &l, const Line &m) {
Real A = cross(l.b - l.a, m.b - m.a);
Real B = cross(l.b - l.a, l.b - m.a);
if (equals(abs(A), 0) && equals(abs(B), 0)) return m.a;
return m.a + (m.b - m.a) * B / A;
}
bool is_intersect_ll(const Line &l, const Line &m) {
Real A = cross(l.b - l.a, m.b - m.a);
Real B = cross(l.b - l.a, l.b - m.a);
if (equals(abs(A), 0) && equals(abs(B), 0)) return true;
return !is_parallel(l, m);
}
// 直線に頂点から垂線を下ろした時の交点
Point projection(const Line &l, const Point &p) {
Real t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);
return l.a + (l.a - l.b) * t;
}
// 凸包を直線で切った時の片方 (直線 a->b の進行方向左側) を返す
Polygon convex_polygon_cut(const Polygon &U, const Line &l) {
Polygon ret;
for (int i = 0; i < (int)U.size(); i++) {
const Point &now = U[i];
const Point &nxt = U[(i + 1) % U.size()];
auto cf = cross(l.a - now, l.b - now);
auto cs = cross(l.a - nxt, l.b - nxt);
if (sign(cf) >= 0) {
ret.emplace_back(now);
}
if (sign(cf) * sign(cs) < 0) {
ret.emplace_back(cross_point_ll(Line(now, nxt), l));
}
}
return ret;
}
// End include: "../../geometry/line.hpp"
void yamada::solve()
{
inl(H,W,sr,sc,kr,kc); --sr; --sc; --kr; --kc;
auto inter=[&](ll a,ll b,ll c,ll A,ll B,ll C)->bool{
ll nume0=b*C-B*c;
ll deno0=a*B-A*b;
ll nume1=A*c-a*C;
ll deno1=a*B-A*b;
assert(deno0);
assert(deno1);
if(nume0%deno0)return 0;
if(nume1%deno1)return 0;
ll ans=nume0/deno0;
ll bns=nume1/deno1;
if(!inLR<ll>(0,ans,H))return 0;
if(!inLR<ll>(0,bns,W))return 0;
return 1;
};
auto dmax=[&](ll di,ll dj,ll i,ll j)->ll{
auto check=[&](ll d)->bool{
ll I=i+di*d;
ll J=j+dj*d;
return inLR<ll>(0,I,H) && inLR<ll>(0,J,W);
};
return bisect<ll>(0,inf,check)-1;
};
auto get_c=[&](ll i,ll j,ll a,ll b)->ll{ return -(i*a+b*j); };
vl DI{-1,-1,-1,0};
vl DJ{-1,0,1,-1};
ll ans=H*W*2-4;
rep(x,4)rep(p,-1,2,2){
ll di=DI[x]*p;
ll dj=DJ[x]*p;
if(get_c(sr,sc,-dj,di)==get_c(kr,kc,-dj,di) && dmax(di,dj,sr,sc)>dmax(di,dj,kr,kc)){
ans-=max(abs(sr-kr),abs(sc-kc))-1;
ll mr=kr+di;
ll mc=kc+dj;
/* out("mr,mc,di,dj:",mr,mc,di,dj); */
if(!inLR<ll>(0LL,mr,H))continue;
if(!inLR<ll>(0LL,mc,W))continue;
auto check=[&](ll d)->bool{
ll gr=mr+di*d;
ll gc=mc+dj*d;
rep(y,4)rep(Y,4){
if((set<ll>{x,y,Y}).size()!=3)continue;
ll a=-DJ[y];
ll b=DI[y];
ll c=get_c(sr,sc,a,b);
ll A=-DJ[Y];
ll B=DI[Y];
ll C=get_c(gr,gc,A,B);
if(inter(a,b,c,A,B,C))return 1;
}
return 0;
};
ll D=dmax(di,dj,mr,mc)+1;
ll d0max=(D+1)/2;
ll d1max=D/2;
ll d0=bisect<ll>(-1,inf,[&](ll d){return check(d*2);}); // 半壊区間
ll d1=bisect<ll>(-1,inf,[&](ll d){return check(d*2+1);});
ans+=max<ll>(d0max-d0,0);
ans+=max<ll>(d1max-d1,0);
}
else ans-=dmax(di,dj,sr,sc);
}
out(ans);
}