#1152441 (C++23) No.245 貫け！

• 問題: No.245 貫け！
• ユーザー: zeta
• 提出日時: 2026-03-15 02:55:20
• 言語: C++23 (gcc 15.2.0 + boost 1.89.0)
• 結果: WA
• 実行時間: -
• コード長: 14,817 bytes
• コンパイル時間: 1,910 ms
• コンパイル使用メモリ: 265,152 KB
• 実行使用メモリ: 6,272 KB
• 最終ジャッジ日時: 2026-03-15 02:55:23
• 合計ジャッジ時間: 2,876 ms
• ジャッジサーバーID （参考情報）: judge1_1 / judge3_1

ファイルパターン	結果
sample	AC * 4
other	AC * 8 WA * 8

ソースコード

#define YRSD

#include <iostream>
#include <algorithm>
#include <array>
#include <bitset>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <bit>
#include <chrono>
#include <functional>
#include <iomanip>
#include <utility>
#include <type_traits>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstring>
#include <ctime>
#include <limits>
#include <ranges>
#include <concepts>

#define TE template <typename T>
#define TES template <typename T, typename ...S>
#define Z auto
#define ep emplace_back
#define eb emplace
#define fi first
#define se second
#define bg begin
#define ed end
#define all(x) bg(x), ed(x)

#define ov(a, b, c, d, e, ...) e
#define FO1(a) for (int _ = 0; _ < (a); ++_)
#define FO2(i, a) for (int i = 0; i < (a); ++i)
#define FO3(i, a, b) for (int i = (a); i < (b); ++i)
#define FO4(i, a, b, c) for (int i = (a); i < (b); i += (c))
#define FOR(...) ov(__VA_ARGS__, FO4, FO3, FO2, FO1)(__VA_ARGS__)
#define FF1(a) for (int _ = (a) - 1; _ >= 0; --_)
#define FF2(i, a) for (int i = (a) - 1; i >= 0; --i)
#define FF3(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define FF4(i, a, b, c) for (int i = (b) - 1; i >= (a); i -= (c))
#define FOR_R(...) ov(__VA_ARGS__, FF4, FF3, FF2, FF1)(__VA_ARGS__)
#define FOR_subset(t, s) for (int t = (s); t > -1; t = (t == 0 ? -1 : (t - 1) & s))

#define sort ranges::sort

using namespace std;

TE using vc = vector<T>;
TE using vvc = vc<vc<T>>;
TE using T1 = tuple<T>;
TE using T2 = tuple<T, T>;
TE using T3 = tuple<T, T, T>;
TE using T4 = tuple<T, T, T, T>;
TE using max_heap = priority_queue<T>;
TE using min_heap = priority_queue<T, vc<T>, greater<T>>;
using u8 = unsigned char; using uint = unsigned int; using ll = long long;      using ull = unsigned long long;
using ld = long double;   using i128 = __int128;     using u128 = __uint128_t;  using f128 = __float128;
using u16 = uint16_t;
using PII = pair<int, int>;   using PLL = pair<ll, ll>;

#ifdef YRSD
constexpr bool dbg = 1;
#else
constexpr bool dbg = 0;
#endif

istream &operator>>(istream &I, i128 &x) {
  static string s;
  I >> s;
  int f = s[0] == '-';
  x = 0;
  const int N = (int)s.size();
  FOR(i, f, N) x = x * 10 + s[i] - '0';
  if (f) x = -x;
  return I;
}
ostream &operator<<(ostream &O, i128 x) {
  static string s;
  s.clear();
  bool f = x < 0;
  if (f) x = -x;
  while (x) s += '0' + x % 10, x /= 10;
  if (s.empty()) s += '0';
  if (f) s += '-';
  reverse(all(s));
  return O << s;
}
istream &operator>>(istream &I, f128 &x) {
  static string s;
  I >> s, x = stold(s);
  return I;
}
ostream &operator<<(ostream &O, const f128 x) { return O << ld(x); }
template <typename... S>
istream &operator>>(istream &I, tuple<S...> &t) {
  return apply([&I](Z &...s) { ((I >> s), ...); }, t), I;
}
template <typename T, typename U>
istream &operator>>(istream &I, pair<T, U> &x) {
  return I >> x.fi >> x.se;
}
template <typename T, typename U>
ostream &operator<<(ostream &O, const pair<T, U> &x) {
  return O << x.fi << ' ' << x.se;
}
TE requires requires(T &c) { begin(c); end(c); } and 
                          (not is_same_v<decay_t<T>, string>)
istream &operator>>(istream &I, T &c) {
  for (Z &e : c) I >> e;
  return I;
}
TE requires requires(const T &c) { begin(c); end(c); } and 
  (not is_same_v<decay_t<T>, const char*>) and 
  (not is_same_v<decay_t<T>, string>) and 
  (not is_array_v<remove_reference_t<T>> or 
   not is_same_v<remove_extent_t<remove_reference_t<T>>, char>)
ostream &operator<<(ostream &O, const T &a) {
  if (a.empty()) return O;
  Z i = a.begin();
  O << *i++;
  for (; i != a.end(); ++i) O << ' ' << *i;
  return O;
}
void IN() {}
TE void IN(T &x, Z &...s) { cin >> x, IN(s...); }
void print() { cout << '\n'; }
TES void print(T &&x, S &&...y) {
  cout << x;
  if constexpr (sizeof...(S)) cout << ' ';
  print(forward<S>(y)...);
}
void put() {}
TES void put(T &&x, S &&...y) {
  cout << x;
  put(forward<S>(y)...);
}

#define INT(...)  int    __VA_ARGS__; IN(__VA_ARGS__)
#define UINT(...) uint   __VA_ARGS__; IN(__VA_ARGS__)
#define LL(...)   ll     __VA_ARGS__; IN(__VA_ARGS__)
#define ULL(...)  ull    __VA_ARGS__; IN(__VA_ARGS__)
#define I128(...) i128   __VA_ARGS__; IN(__VA_ARGS__)
#define STR(...)  string __VA_ARGS__; IN(__VA_ARGS__)
#define CH(...)   char   __VA_ARGS__; IN(__VA_ARGS__)
#define REAL(...) re     __VA_ARGS__; IN(__VA_ARGS__)
#define VEC(T, a, n) vc<T> a(n); IN(a)

void YES(bool o = 1) { print(o ? "YES" : "NO"); }
void Yes(bool o = 1) { print(o ? "Yes" : "No"); }
void yes(bool o = 1) { print(o ? "yes" : "no"); }
void NO(bool o = 1) { YES(not o); }
void No(bool o = 1) { Yes(not o); }
void no(bool o = 1) { yes(not o); }
void ALICE(bool o = 1) { print(o ? "ALICE" : "BOB"); }
void Alice(bool o = 1) { print(o ? "Alice" : "Bob"); }
void alice(bool o = 1) { print(o ? "alice" : "bob"); }
void BOB(bool o = 1) { ALICE(not o); }
void Bob(bool o = 1) { Alice(not o); }
void bob(bool o = 1) { alice(not o); }
void POSSIBLE(bool o = 1) { print(o ? "POSSIBLE" : "IMPOSSIBLE"); }
void Possible(bool o = 1) { print(o ? "Possible" : "Impossible"); }
void possible(bool o = 1) { print(o ? "possible" : "impossible"); }
void IMPOSSIBLE(bool o = 1) { POSSIBLE(not o); }
void Impossible(bool o = 1) { Possible(not o); }
void impossible(bool o = 1) { possible(not o); }
void TAK(bool o = 1) { print(o ? "TAK" : "NIE"); }
void NIE(bool o = 1) { TAK(not o); }

#if (__cplusplus >= 202002L)
#include <numbers>
constexpr ld pi = numbers::pi_v<ld>;
#endif
TE constexpr T inf = numeric_limits<T>::max();
template <> constexpr i128 inf<i128> = i128(inf<ll>) * 2'000'000'000'000'000'000;
template <typename T, typename U>
constexpr pair<T, U> inf<pair<T, U>> = {inf<T>, inf<U>};

TE constexpr static inline int pc(T x) { return popcount(make_unsigned_t<T>(x)); }
constexpr static inline ll len(const Z &a) { return a.size(); }

void reverse(Z &a) { reverse(all(a)); }

void unique(Z &a) {
  sort(a);
  a.erase(unique(all(a)), a.end());
}
TE vc<int> inverse(const vc<T> &a) {
  int N = len(a);
  vc<int> b(N, -1);
  FOR(i, N) if (a[i] != -1) b[a[i]] = i;
  return b;
}

Z QMAX(const Z &a) { return *max_element(all(a)); }
Z QMIN(const Z &a) { return *min_element(all(a)); }
TE Z QMAX(T l, T r) { return *max_element(l, r); }
TE Z QMIN(T l, T r) { return *min_element(l, r); }
constexpr bool chmax(Z &a, const Z &b) { return (a < b ? a = b, 1 : 0); }
constexpr bool chmin(Z &a, const Z &b) { return (a > b ? a = b, 1 : 0); }

vc<int> argsort(const Z &a) {
  vc<int> I(len(a));
  iota(all(I), 0);
  sort(I, [&](int i, int k) { return a[i] < a[k] or (a[i] == a[k] and i < k); });
  return I;
}
TE vc<T> rearrange(const vc<T> &a, const vc<int> &I) {
  int N = len(I);
  vc<T> b(N);
  FOR(i, N) b[i] = a[I[i]];
  return b;
}
template <int of = 1, typename T> 
vc<T> pre_sum(const vc<T> &a) {
  int N = len(a);
  vc<T> c(N + 1);
  FOR(i, N) c[i + 1] = c[i] + a[i];
  if (of == 0) c.erase(c.begin());
  return c;
}

TE constexpr static int topbit(T x) {
  if (x == 0) return - 1;
  if constexpr (sizeof(T) <= 4) return 31 - __builtin_clz(x);
  else return 63 - __builtin_clzll(x);
}
TE constexpr static int lowbit(T x) {
  if (x == 0) return -1;
  if constexpr (sizeof(T) <= 4) return __builtin_ctz(x);
  else return __builtin_ctzll(x);
}

TE constexpr T floor(T x, T y) { return x / y - (x % y and (x ^ y) < 0); }
TE constexpr T ceil(T x, T y) { return floor(x + y - 1, y); }
TE constexpr T bmod(T x, T y) { return x - floor(x, y) * y; }
TE constexpr pair<T, T> divmod(T x, T y) {
  T q = floor(x, y);
  return pair{q, x - q * y};
}
template <typename T = ll>
T SUM(const Z &v) {
  return accumulate(all(v), T(0));
}
int lb(const Z &a, Z x) { return lower_bound(all(a), x) - a.begin(); }
TE int lb(T l, T r, Z x) { return lower_bound(l, r, x) - l; }
int ub(const Z &a, Z x) { return upper_bound(all(a), x) - a.begin(); }
TE int ub(T l, T r, Z x) { return upper_bound(l, r, x) - l; }

template <bool ck = 1>
ll bina(Z f, ll l, ll r) {
  if constexpr (ck) assert(f(l));
  while (abs(l - r) > 1) {
    ll x = (r + l) >> 1;
    (f(x) ? l : r) = x;
  }
  return l;
}
TE T bina_real(Z f, T l, T r, int c = 100) {
  while (c--) {
    T x = (l + r) / 2;
    (f(x) ? l : r) = x;
  }
  return (l + r) / 2;
}

Z pop(Z &s) {
  if constexpr (requires { s.pop_back(); }) {
    Z x = s.back();
    return s.pop_back(), x;
  } else if constexpr (requires { s.top(); }) {
    Z x = s.top();
    return s.pop(), x;
  } else {
    Z x = s.front();
    return s.pop(), x;
  }
}
void setp(int x) { cout << fixed << setprecision(x); }

TE inline void sh(vc<T> &a, int N, T b = {}) {
  a.resize(N, b);
}
#ifdef YRSD
void DBG() { cerr << "]" << endl; }
TES void DBG(T &&x, S &&...y) {
  cerr << x;
  if constexpr (sizeof...(S)) cerr << ", ";
  DBG(forward<S>(y)...);
}
#define debug(...) cerr << "[" << __LINE__ << "]: [" #__VA_ARGS__ "] = [", DBG(__VA_ARGS__)
void ERR() { cerr << endl; }
TES void ERR(T &&x, S &&...y) {
  cerr << x;
  if constexpr (sizeof...(S)) cerr << ", ";
  ERR(forward<S>(y)...);
}
#define err(...) cerr << "[" << __LINE__ << "]: ", ERR(__VA_ARGS__)
#else
#define debug(...) void(0721)
#define err(...)   void(0721)
#endif

TE struct point {
  using P = point;
  T x, y;
  point(T x = 0, T y = 0) : x(x), y(y) {}

  P &operator+=(P p) { return x += p.x, y += p.y, *this; }
  P &operator-=(P p) { return x -= p.x, y -= p.y, *this; }
  P &operator*=(T w) { return x *= w, y *= w, *this; }
  P &operator/=(T w) { return x /= w, y /= w, *this; }

  P operator+(P p) const { return P(*this) += p; }
  P operator-(P p) const { return P(*this) -= p; }
  P operator*(T p) const { return P(*this) *= p; }
  P operator/(T p) const { return P(*this) /= p; }

  bool operator<(P p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator>(P p) const { return x != p.x ? x > p.x : y > p.y; }
  bool operator==(P p) const { return x == p.x and y == p.y; }
  bool operator!=(P p) const { return x != p.x or y != p.y; }

  P operator-() const { return P{-x, -y}; }

  T dot(P p) const { return x * p.x + y * p.y; }
  T det(P p) const { return x * p.y - y * p.x; }

  
  T sq() const { return x * x + y * y; }

  ld length() const { return sqrtl(sq()); }

  
  ld angle() const {
    ld ang = atan2(y, x);
    return ang < 0 ? ang + pi * 2 : ang;
  }

  static ld angle(P A, P B, P C) { 
    ld ang = atan2((A - B).det(C - B), (A - B).dot(C - B));
    return abs(ang);
  }

  
  P rotate(double ang) const { 
    ld C = cos(ang), S = sin(ang);
    return P{C * x - S * y, S * x + C * y};
  }
  P rol90(bool ccw = true) const { return ccw ? P{-y, x} : P{y, -x}; }

  P nor() const { return (*this) / length(); }

  P div(P p) const {
    T d = p.sq();
    return P{(x * p.x + y * p.y) / d, (y * p.x - x * p.y) / d};
  }
};

TE istream &operator>>(istream &I, point<T> &p) {
  return I >> p.x >> p.y;
}
TE ostream &operator<<(ostream &I, const point<T> &p) {
  return I << p.x << ' ' << p.y;
}

TE int ccw(point<T> a, point<T> b, point<T> c) {
  T x = (b - a).det(c - a);
  return x > 0 ? 1 : x < 0 ? -1 : 0;
}

#ifdef FIO
TE void rd(point<T> &p) {
  T x, y;
  IN(x, y);
  p = {x, y};
}
TE void wt(point<T> x) {
  wt(x.x);
  wt(' ');
  wt(x.y);
}
#endif

TE struct line {
  using P = point<T>;
  T a, b, c;
  line (T K, T B) : a(K), b(-1), c(B) {}
  line(T a, T b, T c) : a(a), b(b), c(c) {}
  line(P A, P B) : a(A.y - B.y), b(B.x - A.x), c(A.x * B.y - A.y * B.x) {}
  
  bool operator==(line p) const { return a == p.a and b == p.b and c == p.c; }

  T eval(T x, T y) const { return a * x + b * y + c; }
  T eval(P p) const { return eval(p.x, p.y); }

  void nor() {
    T g = gcd(gcd(a, b), c);
    a /= g, b /= g, c /= g;
    if ((a < 0) or (a == 0 and b < 0) or (a == 0 and b == 0 and c < 0))
      a = -a, b = -b, c = -c;
  }
  bool is_pa(line L) const { return a * L.b == b * L.a; }
  bool is_or(line L) const { return a * L.a == -(b * L.b); }

  pair<bool, P> cross_point(line L) const {
    if (is_pa(L)) return {false, {}};
    T t = a * L.b - b * L.a;
    T x = -c * L.b + b * L.c;
    T y = -a * L.c + c * L.a;
    return {true, {x / t, y / t}};
  }

  P reflection(P p) const {
    T t = eval(p) / (a * a + b * b);
    return {p.x - 2 * t * a, p.y - 2 * t * b};
  }
  P toei(P p) const {
    T t = eval(p) / (a * a + b * b);
    return {p.x - t * a, p.y - t * b};
  }
};

TE struct segment {
  using P = point<T>;
  P a, b;
  segment(P a, P b) : a(a), b(b) {};

  bool contains(P c) const {
    if ((c - a).det(b - a) != 0) return false;
    return (c - a).dot(b - a) >= 0 and (c - b).dot(a - b) >= 0;
  }

  line<T> to_line() const { return line(a, b); }

  bool is_pa(segment p) const { return to_line().is_pa(p.to_line()); }
  bool is_or(segment p) const { return to_line().is_or(p.to_line()); }

  int cross(segment S, bool END) const { 
    line l1 = to_line(), l2 = S.to_line();
    if (l1.is_pa(l2)) {
      if (l1.eval(S.a) != 0) return 0;
      T a1 = a.x, b1 = b.x;
      T a2 = S.a.x, b2 = S.b.x;
      if (a1 == b1) {
        a1 = a.y, b1 = b.y;
        a2 = S.a.y, b2 = S.b.y;
      }
      if (a1 > b1) swap(a1, b1);
      if (a2 > b2) swap(a2, b2);
      T a = max(a1, a2);
      T b = min(b1, b2);
      if (a != b) return a < b ? 2 : 0;
      return (END ? 1 : 0);
    }
    T a1 = l2.eval(a), b1 = l2.eval(b);
    T a2 = l1.eval(S.a), b2 = l1.eval(S.b);
    if (a1 > b1) swap(a1, b1);
    if (a2 > b2) swap(a2, b2);
    bool F = 0, FF = 0;
    if (END) {
      F = a1 <= 0 and 0 <= b1;
      FF = a2 <= 0 and 0 <= b2;
    } else {
      F = a1 < 0 and 0 < b1;
      FF = a2 < 0 and 0 < b2;
    }
    return (F and FF ? 1 : 0);
  }

  pair<bool, P> cross_point(line<T> L) const {
    line<T> seg = to_line();
    if (L.is_pa(seg)) {
      if (L.eval(a) == 0) return {true, a};
      return {false, {}};
    }
    T det = L.a * seg.b - L.b * seg.a;
    if (det == 0) return {false, {}};
    T x = -L.c * seg.b + L.b * seg.c;
    T y = -L.a * seg.c + L.c * seg.a;
    P p{x, y}, s = a, t = b;
    s *= det, t *= det;
    if (s > t) swap(s, t);
    if (s > p or t < p) return {false, {}};
    return {true, p / det};
  }
};

using P = point<ll>;
void Yorisou() {
  INT(N);
  vc<segment<ll>> a;
  FOR(i, N) {
    P f, t;
    IN(f, t);
    a.ep(f, t);
  }
  int s = 0;
  Z f = [&](line<ll> l) -> int {
    int s = 0;
    FOR(i, N) s += a[i].cross_point(l).fi;
    return s;
  };
  FOR(i, N) FOR(k, i + 1, N) {
    chmax(s, f(line(a[i].a, a[k].a)));
    chmax(s, f(line(a[i].a, a[k].b)));
    chmax(s, f(line(a[i].b, a[k].a)));
    chmax(s, f(line(a[i].b, a[k].b)));
  }
  print(s);
}
constexpr int tests = 0, fl = 0, DB = 10;
int main() {
  cin.tie(0)->sync_with_stdio(0);
  int T = 1;
  if (fl) cerr.tie(0);
  if (tests and not fl) IN(T);
  for (int i = 0; i < T or fl; ++i) {
    Yorisou();
    if (fl and i % DB == 0) cerr << "Case: " << i << '\n';
  }
  return 0;
}