#882430 (C++23) No.2353 Guardian Dogs in Spring

提出ソース

結果

問題	No.2353 Guardian Dogs in Spring
ユーザー	👑 hitonanode
提出日時	2023-06-17 13:18:04
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	326 ms / 2,000 ms
コード長	12,487 bytes
コンパイル時間	4,944 ms
コンパイル使用メモリ	193,132 KB
実行使用メモリ	4,580 KB
最終ジャッジ日時	2023-09-07 10:02:15
合計ジャッジ時間	12,725 ms
ジャッジサーバーID （参考情報）	judge13 / judge12

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,380 KB
testcase_01	AC	2 ms 4,380 KB
testcase_02	AC	1 ms 4,384 KB
testcase_03	AC	2 ms 4,384 KB
testcase_04	AC	2 ms 4,380 KB
testcase_05	AC	6 ms 4,380 KB
testcase_06	AC	5 ms 4,384 KB
testcase_07	AC	6 ms 4,380 KB
testcase_08	AC	6 ms 4,380 KB
testcase_09	AC	6 ms 4,380 KB
testcase_10	AC	326 ms 4,548 KB
testcase_11	AC	7 ms 4,380 KB
testcase_12	AC	7 ms 4,384 KB
testcase_13	AC	6 ms 4,380 KB
testcase_14	AC	2 ms 4,384 KB
testcase_15	AC	166 ms 4,532 KB
testcase_16	AC	158 ms 4,580 KB
testcase_17	AC	165 ms 4,556 KB
testcase_18	AC	164 ms 4,512 KB
testcase_19	AC	162 ms 4,548 KB
testcase_20	AC	2 ms 4,384 KB
testcase_21	AC	11 ms 4,384 KB
testcase_22	AC	41 ms 4,384 KB
testcase_23	AC	134 ms 4,384 KB
testcase_24	AC	9 ms 4,380 KB
testcase_25	AC	8 ms 4,384 KB
testcase_26	AC	6 ms 4,380 KB
testcase_27	AC	2 ms 4,384 KB
testcase_28	AC	13 ms 4,380 KB
testcase_29	AC	77 ms 4,380 KB
testcase_30	AC	43 ms 4,380 KB
testcase_31	AC	63 ms 4,384 KB
testcase_32	AC	133 ms 4,380 KB
testcase_33	AC	7 ms 4,380 KB
testcase_34	AC	7 ms 4,380 KB
testcase_35	AC	7 ms 4,384 KB
testcase_36	AC	2 ms 4,384 KB
testcase_37	AC	2 ms 4,380 KB
testcase_38	AC	3 ms 4,380 KB
testcase_39	AC	3 ms 4,380 KB
testcase_40	AC	5 ms 4,384 KB
testcase_41	AC	5 ms 4,380 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif

#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>

template <typename T_P> struct Point2d {
    static T_P EPS;
    static void set_eps(T_P e) { EPS = e; }
    T_P x, y;
    Point2d() : x(0), y(0) {}
    Point2d(T_P x, T_P y) : x(x), y(y) {}
    Point2d(const std::pair<T_P, T_P> &p) : x(p.first), y(p.second) {}
    Point2d(const std::complex<T_P> &p) : x(p.real()), y(p.imag()) {}
    std::complex<T_P> to_complex() const noexcept { return {x, y}; }
    Point2d operator+(const Point2d &p) const noexcept { return Point2d(x + p.x, y + p.y); }
    Point2d operator-(const Point2d &p) const noexcept { return Point2d(x - p.x, y - p.y); }
    Point2d operator*(const Point2d &p) const noexcept {
        static_assert(std::is_floating_point<T_P>::value == true);
        return Point2d(x * p.x - y * p.y, x * p.y + y * p.x);
    }
    Point2d operator*(T_P d) const noexcept { return Point2d(x * d, y * d); }
    Point2d operator/(T_P d) const noexcept {
        static_assert(std::is_floating_point<T_P>::value == true);
        return Point2d(x / d, y / d);
    }
    Point2d inv() const {
        static_assert(std::is_floating_point<T_P>::value == true);
        return conj() / norm2();
    }
    Point2d operator/(const Point2d &p) const { return (*this) * p.inv(); }
    bool operator<(const Point2d &r) const noexcept { return x != r.x ? x < r.x : y < r.y; }
    bool operator==(const Point2d &r) const noexcept { return x == r.x and y == r.y; }
    bool operator!=(const Point2d &r) const noexcept { return !((*this) == r); }
    T_P dot(Point2d p) const noexcept { return x * p.x + y * p.y; }
    T_P det(Point2d p) const noexcept { return x * p.y - y * p.x; }
    T_P absdet(Point2d p) const noexcept { return std::abs(det(p)); }
    T_P norm() const noexcept {
        static_assert(std::is_floating_point<T_P>::value == true);
        return std::sqrt(x * x + y * y);
    }
    T_P norm2() const noexcept { return x * x + y * y; }
    T_P arg() const noexcept { return std::atan2(y, x); }
    // rotate point/vector by rad
    Point2d rotate(T_P rad) const noexcept {
        static_assert(std::is_floating_point<T_P>::value == true);
        return Point2d(x * std::cos(rad) - y * std::sin(rad), x * std::sin(rad) + y * std::cos(rad));
    }
    Point2d normalized() const {
        static_assert(std::is_floating_point<T_P>::value == true);
        return (*this) / this->norm();
    }
    Point2d conj() const noexcept { return Point2d(x, -y); }

    template <class IStream> friend IStream &operator>>(IStream &is, Point2d &p) {
        T_P x, y;
        is >> x >> y;
        p = Point2d(x, y);
        return is;
    }
    template <class OStream> friend OStream &operator<<(OStream &os, const Point2d &p) {
        return os << '(' << p.x << ',' << p.y << ')';
    }
};
template <> double Point2d<double>::EPS = 1e-9;
template <> long double Point2d<long double>::EPS = 1e-12;
template <> long long Point2d<long long>::EPS = 0;

template <typename T_P>
int ccw(const Point2d<T_P> &a, const Point2d<T_P> &b, const Point2d<T_P> &c) {
    // a->b->cの曲がり方
    Point2d<T_P> v1 = b - a;
    Point2d<T_P> v2 = c - a;
    if (v1.det(v2) > Point2d<T_P>::EPS) return 1;   // 左折
    if (v1.det(v2) < -Point2d<T_P>::EPS) return -1; // 右折
    if (v1.dot(v2) < -Point2d<T_P>::EPS) return 2;  // c-a-b
    if (v1.norm() < v2.norm()) return -2;           // a-b-c
    return 0;                                       // a-c-b
}

// Convex hull （凸包）
// return: IDs of vertices used for convex hull, counterclockwise
// include_boundary: If true, interior angle pi is allowed
template <typename T_P>
std::vector<int> convex_hull(const std::vector<Point2d<T_P>> &ps, bool include_boundary = false) {
    int n = ps.size();
    if (n <= 1) return std::vector<int>(n, 0);
    std::vector<std::pair<Point2d<T_P>, int>> points(n);
    for (size_t i = 0; i < ps.size(); i++) points[i] = std::make_pair(ps[i], i);
    std::sort(points.begin(), points.end());
    int k = 0;
    std::vector<std::pair<Point2d<T_P>, int>> qs(2 * n);
    auto ccw_check = [&](int c) { return include_boundary ? (c == -1) : (c <= 0); };
    for (int i = 0; i < n; i++) {
        while (k > 1 and ccw_check(ccw(qs[k - 2].first, qs[k - 1].first, points[i].first))) k--;
        qs[k++] = points[i];
    }
    for (int i = n - 2, t = k; i >= 0; i--) {
        while (k > t and ccw_check(ccw(qs[k - 2].first, qs[k - 1].first, points[i].first))) k--;
        qs[k++] = points[i];
    }
    std::vector<int> ret(k - 1);
    for (int i = 0; i < k - 1; i++) ret[i] = qs[i].second;
    return ret;
}


int main() {
    int N;
    cin >> N;
    using Pt = Point2d<double>;
    vector<int> X(N), Y(N);
    REP(i, N) cin >> X.at(i) >> Y.at(i), X.at(i)--, Y.at(i)--;

    vector<int> idx(N);
    REP(i, N) idx.at(i) = i;

    vector<pint> ret;

    while (idx.size() > 1) {
        vector<Pt> ps;
        for (int i : idx) ps.emplace_back(X.at(i), Y.at(i));
        auto ch = convex_hull(ps, true);
        set<int> alive{idx.cbegin(), idx.cend()};
        for (int d = 0; d + 1 < int(ch.size()); d += 2) {
            int i = idx.at(ch.at(d)), j = idx.at(ch.at(d + 1));
            if (alive.count(i) and alive.count(j)) {
                alive.erase(i);
                alive.erase(j);
                ret.emplace_back(i, j);
            }
        }
        idx = vector<int>{alive.cbegin(), alive.cend()};
    }
    cout << ret.size() << '\n';
    for (auto [a, b] : ret) cout << a + 1 << ' ' << b + 1 << '\n';
}

yukicoder

結果

テストケース

ソースコード