#875429 (C++17) No.2331 Maximum Quadrilateral

提出ソース
結果

問題	No.2331 Maximum Quadrilateral
ユーザー	👑 seekworser
提出日時	2023-05-28 16:47:26
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	TLE
実行時間	-
コード長	20,050 bytes
コンパイル時間	2,381 ms
コンパイル使用メモリ	213,848 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-06-08 09:47:50
合計ジャッジ時間	49,095 ms
ジャッジサーバーID （参考情報）	judge3 / judge4
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	TLE	-
testcase_01	AC	1,483 ms 6,816 KB
testcase_02	AC	1,802 ms 6,940 KB
testcase_03	AC	1,803 ms 6,944 KB
testcase_04	TLE	-
testcase_05	TLE	-
testcase_06	TLE	-
testcase_07	TLE	-
testcase_08	AC	1,444 ms 6,940 KB
testcase_09	AC	1,323 ms 6,940 KB
testcase_10	AC	1,200 ms 6,940 KB
testcase_11	AC	1,300 ms 6,944 KB
testcase_12	AC	1,188 ms 6,940 KB
testcase_13	AC	1,273 ms 6,940 KB
testcase_14	TLE	-
testcase_15	AC	177 ms 6,944 KB
testcase_16	AC	831 ms 6,940 KB
testcase_17	AC	41 ms 6,940 KB
testcase_18	AC	223 ms 6,940 KB
testcase_19	AC	58 ms 6,940 KB
testcase_20	TLE	-
testcase_21	TLE	-
testcase_22	TLE	-
testcase_23	TLE	-
testcase_24	TLE	-
testcase_25	AC	2 ms 6,940 KB
testcase_26	AC	2 ms 6,940 KB
testcase_27	AC	2 ms 6,944 KB
testcase_28	AC	2 ms 6,940 KB
testcase_29	AC	2 ms 6,944 KB
testcase_30	AC	2 ms 6,940 KB
testcase_31	AC	2 ms 6,940 KB
testcase_32	AC	2 ms 6,944 KB
testcase_33	AC	2 ms 6,944 KB
testcase_34	AC	2 ms 6,940 KB
testcase_35	AC	2 ms 6,944 KB
testcase_36	AC	2 ms 6,940 KB
testcase_37	AC	2 ms 6,944 KB
testcase_38	AC	2 ms 6,940 KB
testcase_39	AC	2 ms 6,940 KB
testcase_40	AC	2 ms 6,940 KB
testcase_41	AC	2 ms 6,940 KB
testcase_42	AC	2 ms 6,940 KB
testcase_43	AC	2 ms 6,944 KB
testcase_44	AC	2 ms 6,940 KB
testcase_45	AC	2 ms 6,940 KB
testcase_46	AC	2 ms 6,944 KB
権限があれば一括ダウンロードができます
ソースコード

raw source code
// line 1 "answer.cpp"
#if !__INCLUDE_LEVEL__
#include __FILE__
int main() {
    ll n;
    input(n);
    vl x(n), y(n);
    rep(i, n) input(x[i], y[i]);
    // using P = Point<ll>;
    // vector<P> p;
    // rep(i, n) p.emplace_back(x[i], y[i]);
    ll ans = 0;
    rep(i, n) rep(j, n) {
        if (i == j) continue;
        vl g1;
        vl g2;
        rep(k, n) {
            if (k == i || k == j) continue;
            ll x1 = x[i] - x[j];
            ll y1 = y[i] - y[j];
            ll x2 = x[k] - x[j];
            ll y2 = y[k] - y[j];
            ll crs = x1 * y2 - y1 * x2;
            if (crs < 0) g1.push_back(abs(crs));
            else g2.push_back(abs(crs));
        }
        sort(all(g1));
        sort(all(g2));
        // debug(g1,g2);
        if (sz(g1) != 0 && sz(g2)!= 0) { chmax(ans, g1.back() + g2.back()); }
        if (sz(g1) >= 2) { chmax(ans, g1.back() - g1.front()); }
        if (sz(g2) >= 2) { chmax(ans, g2.back() - g2.front()); }
    }
    print(ans);
}
#else
// line 2 "/Users/seekworser/.cpp_lib/competitive_library/competitive/std/std.hpp"
#include <bits/stdc++.h>
#ifndef LOCAL_TEST
#pragma GCC target ("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif // LOCAL_TEST
using namespace std;
// 型名の短縮
using ll = long long;
using pii = pair<int, int>; using pll = pair<ll, ll>;
using vi = vector<int>;  using vvi = vector<vi>; using vvvi = vector<vvi>;
using vl = vector<ll>;  using vvl = vector<vl>; using vvvl = vector<vvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
using vs = vector<string>; using vvs = vector<vector<string>>; using vvvs = vector<vector<vector<string>>>;
template<typename T> vector<vector<T>> vv(int h, int w, T val = T()) { return vector(h, vector<T>(w, val)); }
template<typename T> vector<vector<vector<T>>> vvv(int h1, int h2, int h3, T val = T()) { return vector(h1, vector(h2, vector<T>(h3, val))); }
template<typename T> vector<vector<vector<vector<T>>>> vvvv(int h1, int h2, int h3, int h4, T val = T()) { return vector(h1, vector(h2, vector(h3, vector<T>(h4, val)))); }
template <class T> using priority_queue_min = priority_queue<T, vector<T>, greater<T>>;
// 定数の定義
constexpr double PI = 3.14159265358979323;
constexpr int INF = 100100111; constexpr ll INFL = 3300300300300300491LL;
float EPS = 1e-8; double EPSL = 1e-16;
template<typename T> bool eq(const T x, const T y) { return x == y; }
template<> bool eq<double>(const double x, const double y) { return abs(x - y) < EPSL; }
template<> bool eq<float>(const float x, const float y) { return abs(x - y) < EPS; }
template<typename T> bool neq(const T x, const T y) { return !(eq<T>(x, y)); }
template<typename T> bool ge(const T x, const T y) { return (eq<T>(x, y) || (x > y)); }
template<typename T> bool le(const T x, const T y) { return (eq<T>(x, y) || (x < y)); }
template<typename T> bool gt(const T x, const T y) { return !(le<T>(x, y)); }
template<typename T> bool lt(const T x, const T y) { return !(ge<T>(x, y)); }
constexpr int MODINT998244353 = 998244353;
constexpr int MODINT1000000007 = 1000000007;
// 入出力高速化
struct Nyan { Nyan() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } nyan;
// 汎用マクロの定義
#define all(a) (a).begin(), (a).end()
#define sz(x) ((ll)(x).size())
#define rep1(n) for(ll dummy_iter = 0LL; dummy_iter < n; ++dummy_iter) // 0 から n-1 まで昇順
#define rep2(i, n) for(ll i = 0LL, i##_counter = 0LL; i##_counter < ll(n); ++(i##_counter), (i) = i##_counter) // 0 から n-1 まで昇順
#define rep3(i, s, t) for(ll i = ll(s), i##_counter = ll(s); i##_counter < ll(t); ++(i##_counter), (i) = (i##_counter)) // s から t まで昇順
#define rep4(i, s, t, step) for(ll i##_counter = step > 0 ? ll(s) : -ll(s), i##_end = step > 0 ? ll(t) : -ll(t), i##_step = abs(step), i = ll(s); i##_counter < i##_end; i##_counter += i##_step, i = step > 0 ? i##_counter : -i##_counter) // s から t まで stepずつ
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define repe(a, v) for(auto& a : (v)) // v の全要素（変更可能）
#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod
#define sdiv(n, m) (((n) - smod(n, m)) / (m)) // 非負div
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去
int Yes(bool b=true) { cout << (b ? "Yes\n" : "No\n"); return 0; };
int YES(bool b=true) { cout << (b ? "YES\n" : "NO\n"); return 0; };
int No(bool b=true) {return Yes(!b);};
int NO(bool b=true) {return YES(!b);};
template<typename T, size_t N> T max(array<T, N>& a) { return *max_element(all(a)); };
template<typename T, size_t N> T min(array<T, N>& a) { return *min_element(all(a)); };
template<typename T> T max(vector<T>& a) { return *max_element(all(a)); };
template<typename T> T min(vector<T>& a) { return *min_element(all(a)); };
template<typename T> vector<T> vec_slice(const vector<T>& a, int l, int r) { vector<T> rev; rep(i, l, r) rev.push_back(a[i]); return rev; };
template<typename T> T sum(vector<T>& a, T zero = T(0)) { T rev = zero; rep(i, sz(a)) rev += a[i]; return rev; };
template<typename T> bool in_range(const T& val, const T& s, const T& t) { return s <= val && val < t; };

template <class T> inline vector<T>& operator--(vector<T>& v) { repe(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repe(x, v) ++x; return v; }

// modでのpow
ll powm(ll a, ll n, ll mod=INFL) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = (res * a) % mod;
        if (n > 1) a = (a * a) % mod;
        n >>= 1;
    }
    return res;
}
// 整数Sqrt
ll sqrtll(ll x) {
    assert(x >= 0);
    ll rev = sqrt(x);
    while(rev * rev > x) --rev;
    while((rev+1) * (rev+1)<=x) ++rev;
    return rev;
}
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）
int digit(ll x, int d=10) { int rev=0; while (x > 0) { rev++; x /= d;}; return rev; } // xのd進数桁数
/**
 * @brief std.hpp
 * @docs docs/std/std.md
 */
// line 3 "/Users/seekworser/.cpp_lib/competitive_library/competitive/geometry/base.hpp"
/**
 * @brief Pointクラス
 * @details
 * Point : 2次元空間上の点・ベクトルを扱うためのクラス
 * absもしくは単位ベクトルを使う場合はdoubleを使い、その他の場合はFracを使う
*/
template<typename T> struct Point {
    T x, y;
    Point(T x, T y) : x(x), y(y) {
    };
    Point() : Point(0, 0) {};

    Point<T> &operator+=(const Point<T>& p) { (*this).x += p.x; (*this).y += p.y; return *this; }
    Point<T> &operator-=(const Point<T>& p) { (*this).x -= p.x; (*this).y -= p.y; return *this; }
    friend Point<T> operator+(const Point<T>& lhs, const Point<T>& rhs) { return Point(lhs) += rhs; }
    friend Point<T> operator-(const Point<T>& lhs, const Point<T>& rhs) { return Point(lhs) -= rhs; }
    Point<T> &operator+() { return *this; }
    Point<T> &operator-() { (*this).x *= -1; (*this).y *= -1; return *this; }

    Point<T> &operator*=(const T &x) { (*this).x *= x; (*this).y *= x; return *this; }
    Point<T> &operator/=(const T &x) { (*this).x /= x; (*this).y /= x; return *this; }
    friend Point<T> operator*(const Point<T>& lhs, const T& rhs) { return Point(lhs) *= rhs; }
    friend Point<T> operator/(const Point<T>& lhs, const T& rhs) { return Point(lhs) /= rhs; }
    friend Point<T> operator*(const T& lhs, const Point<T>& rhs) { return Point(rhs) *= lhs; }
    friend Point<T> operator/(const T& lhs, const Point<T>& rhs) { return Point(rhs) /= lhs; }

    friend bool operator==(const Point<T> &lhs, const Point<T> &rhs) {
        return eq<T>(lhs.x, rhs.x) && eq<T>(lhs.y, rhs.y);
    }
    friend bool operator!=(const Point<T> &lhs, const Point<T> &rhs) {
        return !(lhs == rhs);
    }
    friend bool operator>(const Point<T>& lhs, const Point<T>& rhs) {
        if (eq<T>(lhs.x, rhs.x)) return gt<T>(lhs.y, rhs.y);
        return gt<T>(lhs.x, rhs.x);
    }
    friend bool operator<(const Point<T>& lhs, const Point<T>& rhs) {
        if (eq<T>(lhs.x, rhs.x)) return lt<T>(lhs.y, rhs.y);
        return lt<T>(lhs.x, rhs.x);
    }
    friend bool operator>=(const Point<T>& lhs, const Point<T>& rhs) { return !(lhs < rhs); }
    friend bool operator<=(const Point<T>& lhs, const Point<T>& rhs) { return !(lhs > rhs); }
    T dot(const Point<T> &p) const {return (*this).x * p.x + (*this).y * p.y; };
    T cross(const Point<T> &p) const {return (*this).x * p.y - (*this).y * p.x; };
    T norm() const {return (*this).dot(*this); };
    T abs() const {return sqrt((*this).norm()); };
    T arg() const {return atan((*this).y / (*this).x); };
    Point<T> rotate(const double &theta) {
        (*this).x = cos(theta) * (*this).x - sin(theta) * (*this).y;
        (*this).y = sin(theta) * (*this).x + cos(theta) * (*this).y;
        return (*this);
    };

    T operator*=(const Point<T>& p) const { return (*this).dot(p); }
    friend const T operator*(const Point<T>& lhs, const Point<T>& rhs) { return lhs *= rhs; }
    friend ostream& operator<<(ostream& os, const Point<T> &p) { os << p.x << " " << p.y; return os; }
};

template<typename T> T dot(const Point<T> &p1, const Point<T> &p2) { return p1.dot(p2); }
template<typename T> T cross(const Point<T> &p1, const Point<T> &p2) { return p1.cross(p2); }
template<typename T> T norm(const Point<T> &p) { return p.norm(); }
double abs(const Point<double> &p) { return p.abs(); }
Point<double> unit_vector(const Point<double> &p) { return p / abs(p); }
template<typename T> Point<T> normal_vector(const Point<double> &p) { return Point(-p.y, p.x); }
Point<double> rotate(const Point<double> &p, const double &theta) { return Point(p).rotate(theta); }

// Line : 直線クラス
template<typename T> struct Line {
    Point<T> s, t;
    Line() = default;
    Line(Point<T> s, Point<T> t) : s(s), t(t) {assert(s != t);};
    // ax+by+c=0;
    Line(T a, T b, T c) {
        assert(neq<T>(a, T(0)) || neq<T>(b, T(0)));
        if(eq<T>(b, T(0))) {
            s = Point(-c / a, T(0)); t = Point(-c / a, T(1));
        } else {
            s = Point(T(0), -c / b); t = Point(T(1), (-a-c)/b);
        }
    };
    Point<T> vec() const { return (*this).t - (*this).s; }
    Point<T> normal() const { return normal_vector((*this).vec()); }
    friend ostream& operator<<(ostream& os, const Line<T> &l) { os << l.s << " " << l.t; return os; }
};

// Segment : 線分を表す構造体
template <typename T> struct Segment : Line<T> {
    Segment() = default;
    Segment(Point<T> s, Point<T> t) : Line<T>(s, t) {}
};

// Circle : 円を表す構造体
// pが中心の位置ベクトル、rは半径
template<typename T> struct Circle {
    Point<T> o;
    T r;
    Circle() = default;
    Circle(Point<T> o, double r) : o(o), r(r) {}
};
/**
 * @brief 幾何ライブラリベースクラス
 * @docs docs/geometry/base.md
 */
// line 4 "/Users/seekworser/.cpp_lib/competitive_library/competitive/geometry/counter_clockwise.hpp"
constexpr int COUNTER_CLOCKWISE = 2;
constexpr int CLOCKWISE = -2;
constexpr int ONSEGMENT = 0;
constexpr int ONLINE_BACK = 1;
constexpr int ONLINE_FRONT = -1;
template<typename T> int ccw(const Line<T> &l, const Point<T> &p, bool strict=false) {
    T crs = cross(l.vec(), p - l.s);
    if (lt<T>(crs, 0)) return CLOCKWISE;
    if (gt<T>(crs, 0)) return COUNTER_CLOCKWISE;
    T d = dot(l.vec(), p - l.s);
    if (strict) {
        if (le<T>(d, 0)) return ONLINE_BACK;
        if (ge<T>(d, norm(l.vec()))) return ONLINE_FRONT;
    } else {
        if (lt<T>(d, 0)) return ONLINE_BACK;
        if (gt<T>(d, norm(l.vec()))) return ONLINE_FRONT;
    }
    return ONSEGMENT;
};
template <typename T> int ccw(const Point<T> &p1, const Point<T> &p2, const Point<T> &p3, bool strict=false) {
    return ccw(Line<T>(p1, p2), p3, strict);
};
template <typename T> bool online(const Line<T> &l, const Point<T> &p) {
    int result = ccw(l, p);
    return -1 <= result && result <= 1;
};
template <typename T> int online(const Point<T> &p1, const Point<T> &p2, const Point<T> &p3) {
    return online(Line<T>(p1, p2), p3);
};
/**
 * @brief counter_clockwise.hpp
 * @docs docs/geometry/counter_clockwise.md
 */
// line 4 "/Users/seekworser/.cpp_lib/competitive_library/competitive/geometry/polygon.hpp"
// Polygon : 多角形
template<typename T> struct Polygon {
    vector<Point<T>> vertex;
    int n;
    Polygon() = default;
    Polygon(const vector<Point<T>>& p) : vertex(p), n(sz(p)) { if ((*this).area() < T(0)) reverse(all((*this).vertex)); }
    T area() const {
        T rev(0);
        rep(i, (*this).n) rev += cross((*this).vertex[i], (*this).vertex[(i + 1) % (*this).n]);
        return rev / T(2);
    }
};
template<typename T> T area(const Polygon<T>& p) { return p.area(); }
template<typename T> bool is_convex(const Polygon<T> &p, bool strict=true) {
    bool rev(true);
    rep(i, p.n) {
        int ccwi = ccw(p.vertex[i], p.vertex[(i + 1) % p.n], p.vertex[(i + 2) % p.n]);
        if (strict && ccwi != COUNTER_CLOCKWISE) rev = false;
        if (!strict && ccwi == CLOCKWISE) rev = false;
    }
    return rev;
}
template<typename T> Polygon<T> convex_full(const vector<Point<T>> &p, bool strict=true) {
    int n = sz(p);
    if (n < 3) return Polygon<T>(p);
    vector<Point<T>> sorted(p);
    sort(all(sorted));
    vector<Point<T>> rev;
    rev.push_back(sorted[0]);
    rev.push_back(sorted[1]);
    rep(i, 2, n) {
        int m = sz(rev);
        if (strict) {
            while (m >= 2 && ccw(rev[m-2], rev[m-1], sorted[i]) != CLOCKWISE) {
                rev.pop_back();
                --m;
            }
        } else {
            while (m >= 2 && ccw(rev[m-2], rev[m-1], sorted[i]) == COUNTER_CLOCKWISE) {
                rev.pop_back();
                --m;
            }
        }
        rev.push_back(sorted[i]);
    }
    int lower_size = sz(rev);
    rep(i, n-2, -1, -1) {
        int m = sz(rev);
        if (strict) {
            while (m > lower_size && ccw(rev[m-2], rev[m-1], sorted[i]) != CLOCKWISE) {
                rev.pop_back();
                --m;
            }
        } else {
            while (m > lower_size && ccw(rev[m-2], rev[m-1], sorted[i]) == COUNTER_CLOCKWISE) {
                rev.pop_back();
                --m;
            }
        }
        rev.push_back(sorted[i]);
    }
    rev.erase(rev.begin());
    return Polygon<T>(rev);
}
/**
 * @brief polygon.hpp
 * @docs docs/geometry/polygon.md
 */
// line 3 "/Users/seekworser/.cpp_lib/competitive_library/competitive/std/io.hpp"
// 演算子オーバーロード（プロトタイプ宣言）
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p);
template <class T> inline istream& operator>>(istream& is, vector<T>& v);
template <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p);
template <class T> inline ostream& operator<<(ostream& os, const vector<T>& v);
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp);
template <typename T> ostream &operator<<(ostream &os, const set<T> &st);
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st);
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st);
template <typename T> ostream &operator<<(ostream &os, queue<T> q);
template <typename T> ostream &operator<<(ostream &os, deque<T> q);
template <typename T> ostream &operator<<(ostream &os, stack<T> st);
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq);

// 演算子オーバーロード
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repe(x, v) is >> x; return is; }
template <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p) { os << p.first << " " << p.second; return os; }
template <class T> inline ostream& operator<<(ostream& os, const vector<T>& v) { rep(i, sz(v)) { os << v.at(i); if (i != sz(v) - 1) os << " "; } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp) { for (auto &[key, val] : mp) { os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st) { ll cnt = 0; for (auto &e : st) { os << e << (++cnt != (int)st.size() ? " " : ""); } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q) { while (q.size()) { os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q) { while (q.size()) { os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st) { while (st.size()) { os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq) { while (pq.size()) { os << pq.top() << " "; pq.pop(); } return os; }

template <typename T> int print_sep_end(string sep, string end, const T& val) { (void)sep; cout << val << end; return 0; };
template <typename T1, typename... T2> int print_sep_end(string sep, string end, const T1 &val, const T2 &...remain) {
    cout << val << sep;
    print_sep_end(sep, end, remain...);
    return 0;
};
template <typename... T> int print(const T &...args) { print_sep_end(" ", "\n", args...); return 0; };
template <typename... T> void flush() { cout << flush; };
template <typename... T> int print_and_flush(const T &...args) { print(args...); flush(); return 0; };
#define debug(...) debug_func(0, #__VA_ARGS__, __VA_ARGS__) // debug print
template <typename T> void input(T &a) { cin >> a; };
template <typename T1, typename... T2> void input(T1&a, T2 &...b) { cin >> a; input(b...); };
#ifdef LOCAL_TEST
template <typename T> void debug_func(int i, const T name) { (void)i; (void)name; cerr << endl; }
template <typename T1, typename T2, typename... T3> void debug_func(int i, const T1 &name, const T2 &a, const T3 &...b) {
    int scope = 0;
    for ( ; (scope != 0 || name[i] != ',') && name[i] != '\0'; i++ ) {
        cerr << name[i];
        if (name[i] == '(' || name[i] == '{') scope++;
        if (name[i] == ')' || name[i] == '}') scope--;
    }
    cerr << ":" << a << " ";
    debug_func(i + 1, name, b...);
}
template <typename T1, typename T2, typename... T3> void debug_func(int i, const T1 &name, T2 &a, T3 &...b) {
    int scope = 0;
    for ( ; (scope != 0 || name[i] != ',') && name[i] != '\0'; i++ ) {
        cerr << name[i];
        if (name[i] == '(' || name[i] == '{') scope++;
        if (name[i] == ')' || name[i] == '}') scope--;
    }
    cerr << ":" << a << " ";
    debug_func(i + 1, name, b...);
}
#endif
#ifndef LOCAL_TEST
template <typename... T>
void debug_func(T &...) {}
template <typename... T>
void debug_func(const T &...) {}
#endif
/**
 * @brief io.hpp
 * @docs docs/std/io.md
 */
// line 40 "answer.cpp"
#endif
yukicoder

結果

テストケース

ソースコード
