結果

問題 No.1625 三角形の質問
ユーザー haruki_Kharuki_K
提出日時 2021-07-23 22:21:51
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,282 ms / 6,000 ms
コード長 13,688 bytes
コンパイル時間 2,514 ms
コンパイル使用メモリ 233,956 KB
実行使用メモリ 137,708 KB
最終ジャッジ日時 2024-07-18 18:09:34
合計ジャッジ時間 18,796 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 45 ms
11,332 KB
testcase_02 AC 347 ms
44,552 KB
testcase_03 AC 385 ms
54,732 KB
testcase_04 AC 256 ms
37,408 KB
testcase_05 AC 636 ms
74,092 KB
testcase_06 AC 1,087 ms
104,056 KB
testcase_07 AC 1,058 ms
104,436 KB
testcase_08 AC 996 ms
104,308 KB
testcase_09 AC 1,006 ms
104,184 KB
testcase_10 AC 1,015 ms
104,572 KB
testcase_11 AC 996 ms
104,568 KB
testcase_12 AC 1,039 ms
104,056 KB
testcase_13 AC 1,282 ms
104,184 KB
testcase_14 AC 973 ms
104,308 KB
testcase_15 AC 1,043 ms
104,312 KB
testcase_16 AC 169 ms
44,700 KB
testcase_17 AC 394 ms
109,940 KB
testcase_18 AC 72 ms
15,080 KB
testcase_19 AC 485 ms
137,708 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x, l, r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class A, class B> constexpr auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }
template <class... T> constexpr auto mt(T&&... x) { return make_tuple(forward<T>(x)...); }
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T, d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T, d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T, 0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T, d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > (T)y) { x = (T)y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < (T)y) { x = (T)y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr int64_t mod(int64_t x, int64_t m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr int64_t div_floor(int64_t x, int64_t y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr int64_t div_ceil(int64_t x, int64_t y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
template <class T> vector<T> &operator--(vector<T> &v) { for (T &x : v) --x; return v; }
template <class T> vector<T> &operator++(vector<T> &v) { for (T &x : v) ++x; return v; }
// <<<
// >>> segment tree 2d (compressed)
template <class Handler, class Int = int> struct Segtree2D : Handler {
    using Value = typename Handler::Value;
    using Handler::unit; // () -> Value
    using Handler::merge; // (Value, Value) -> Value

    // >>> internal segtree
    struct segtree { // compressed
        vector<Value> v;
        vector<Int> ys;
        size_t n;
        segtree() = default;
        void add(Int y, Value const& val) {
            size_t i = lower_bound(ys.begin(), ys.end(), y) - ys.begin();
            assert(i < n && ys[i] == y);
            for (i += n; i; i >>= 1) v[i] = merge(v[i], val);
        }
        void set(Int y, Value const& val) {
            size_t i = lower_bound(ys.begin(), ys.end(), y) - ys.begin();
            assert(i < n && ys[i] == y);
            v[i + n] = val;
            i += n;
            while (i > 1) i >>= 1, v[i] = merge(v[i << 1], v[i << 1 | 1]);
        }
        Value get(Int y) const { return get(y, y+1); }
        Value get(Int yl, Int yr) const {
            size_t l = lower_bound(ys.begin(), ys.end(), yl) - ys.begin();
            size_t r = lower_bound(ys.begin(), ys.end(), yr) - ys.begin();
            assert(l <= r);
            Value L = unit(), R = unit();
            for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
                if (l & 1) L = merge(L, v[l++]);
                if (r & 1) R = merge(v[--r], R);
            }
            return merge(L, R);
        }
    };
    // <<<
    vector<pair<Int, Int>> pos;
    bool built = false;

    vector<segtree> seg;
    size_t n;

    Segtree2D() = default;
    void add_point(Int x, Int y) {
        pos.emplace_back(x, y);
        built = false;
    }
    void build() {
        sort(pos.begin(), pos.end());
        pos.erase(unique(pos.begin(), pos.end()), pos.end());
        n = pos.size();
        seg.resize(n << 1);
        for (size_t i = 0; i < n; ++i) {
            seg[i + n].ys.push_back(pos[i].second);
            seg[i + n].n = 1;
            seg[i + n].v.resize(2, unit());
        }
        for (size_t i = n - 1; i; --i) {
            auto const& L = seg[i << 1].ys, R = seg[i << 1 | 1].ys;
            auto &P = seg[i].ys;
            P.resize(L.size() + R.size());
            std::merge(L.begin(), L.end(), R.begin(), R.end(), P.begin());
            P.erase(unique(P.begin(), P.end()), P.end());
            seg[i].n = P.size();
            seg[i].v.resize(P.size() << 1, unit());
        }
        built = true;
    }
    size_t x_index(Int x) const {
        auto const minf = numeric_limits<Int>::min();
        return lower_bound(pos.begin(), pos.end(), make_pair(x, minf)) - pos.begin();
    }
    void set(Int x, Int y, Value val) {
        assert(built);
        size_t i = lower_bound(pos.begin(), pos.end(), make_pair(x, y)) - pos.begin();
        assert(i < n && pos[i] == make_pair(x, y));
        seg[i += n].set(y, val);
        while (i > 1) {
            val = merge(val, seg[i ^ 1].get(y));
            seg[i >>= 1].set(y, val);
        }
    }
    void add(Int x, Int y, Value const& val) {
        assert(built);
        size_t i = lower_bound(pos.begin(), pos.end(), make_pair(x, y)) - pos.begin();
        assert(i < n && pos[i] == make_pair(x, y));
        for (i += n; i; i >>= 1) seg[i].add(y, val);
    }
    Value get(Int x, Int y) const { return get(x, x + 1, y, y + 1); }
    Value get(Int xl, Int xr, Int yl, Int yr) const {
        assert(built);
        size_t l = x_index(xl), r = x_index(xr);
        assert(l <= r);
        Value L = unit(), R = unit();
        for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
            if (l & 1) L = merge(L, seg[l++].get(yl, yr));
            if (r & 1) R = merge(seg[--r].get(yl, yr), R);
        }
        return merge(L, R);
    }
    int size() const { return pos.size(); }
    vector<Value> dat() const {
        assert(built);
        vector<Value> ret;
        for (auto [x, y] : pos) ret.push_back(get(x, y));
        return ret;
    }
};
// <<<
struct Max {
    using Value = int;
    constexpr static Value unit() { return -INF; }
    constexpr static Value merge(Value const& x, Value const& y) {
        return max(x, y);
    }
};

// >>> Point
template <class T> constexpr bool equal(T x, T y) { return x == y; }
template <class T> struct Point {
    T x, y;
    constexpr Point() : x(0), y(0) {}
    constexpr Point(T x, T y) : x(x), y(y) {}
    constexpr Point(complex<T> const& z) : x(z.real()), y(z.imag()) {}
    constexpr pair<T, T> to_pair() const { return {x, y}; }
    constexpr Point inv() const { return {x/norm(), -y/norm()}; }
    constexpr Point conj() const { return {x, -y}; }
    constexpr T norm() const { return x*x + y*y; }
    constexpr Point rot90(int n = 1) const {
        n %= 4; if (n < 0) n += 4;
        if (n == 1) return *this * Point(0, 1);
        if (n == 2) return *this * (-1);
        if (n == 3) return *this * Point(0, -1);
        return *this;
    }
    constexpr Point operator+() const { return *this; }
    constexpr Point operator-() const { return {-x, -y}; }
    constexpr Point operator+(Point const& p) const { return {x+p.x, y+p.y}; }
    constexpr Point operator-(Point const& p) const { return {x-p.x, y-p.y}; }
    constexpr Point operator*(Point const& p) const { return {x*p.x-y*p.y, x*p.y+y*p.x}; }
    constexpr Point operator/(Point const& p) const { return *this * p.conj() / p.norm(); }
    constexpr Point operator*(T const& a) const { return {a*x, a*y}; }
    constexpr Point operator/(T const& a) const { return {x/a, y/a}; }
    constexpr Point& operator+=(Point const& p) { return *this = *this + p; }
    constexpr Point& operator-=(Point const& p) { return *this = *this - p; }
    constexpr Point& operator*=(Point const& p) { return *this = *this * p; }
    constexpr Point& operator/=(Point const& p) { return *this = *this / p; }
    constexpr Point& operator*=(T const& a) { return *this = *this * a; }
    constexpr Point& operator/=(T const& a) { return *this = *this / a; }
    constexpr friend Point operator*(T const& a, Point const& p) { return p*a; }
    constexpr friend Point operator/(T const& a, Point const& p) { return Point(a)/p; }
    constexpr T dot(Point const& q) const { return x*q.x + y*q.y; }
    constexpr T cross(Point const& q) const { return x*q.y - y*q.x; }
    constexpr T dot(Point const& p, Point const& q) const { return (p-*this).dot(q-*this); }
    constexpr T cross(Point const& p, Point const& q) const { return (p-*this).cross(q-*this); }
    // constexpr bool operator==(Point const& q) const { return sgn(x-q.x) == 0 && sgn(y-q.y) == 0; }
    constexpr bool operator==(Point const& q) const { return equal(x, q.x) and equal(y, q.y); }
    constexpr bool operator!=(Point const& q) const { return !operator==(q); }

    constexpr friend Point conj(Point const& p) { return p.conj(); }
    constexpr friend T norm(Point const& p) { return p.x*p.x + p.y*p.y; }
    constexpr friend T dot(Point const& p, Point const& q) { return p.dot(q); }
    constexpr friend T cross(Point const& p, Point const& q) { return p.cross(q); }
#ifdef LOCAL
    friend string to_s(Point const& p) { return to_s(p.to_pair()); }
#endif
    friend istream& operator>>(istream& is, Point& p) { return is >> p.x >> p.y; }
    friend ostream& operator<<(ostream& os, Point const& p) { return os << p.x << " " << p.y; }
};

// <<<
using P = Point<int>;
constexpr int sgn(int x) { return x > 0 ? 1 : x < 0 ? -1 : 0; }

int32_t main() {
    int n, q; cin >> n >> q;
    Segtree2D<Max> seg;
    vector<tuple<int, int, int, int>> qs;
    rep (i, n) {
        P a, b, c; cin >> a >> b >> c;
        int l = min({a.x, b.x, c.x});
        int r = max({a.x, b.x, c.x});
        int s = abs(a.cross(b, c));
        qs.eb(1, l, r, s);
        seg.add_point(l, r);
    }
    rep (i, q) {
        int t; cin >> t;
        if (t == 1) {
            P a, b, c; cin >> a >> b >> c;
            int l = min({a.x, b.x, c.x});
            int r = max({a.x, b.x, c.x});
            int s = abs(a.cross(b, c));
            qs.eb(t, l, r, s);
            seg.add_point(l, r);
        } else {
            int l, r; cin >> l >> r;
            qs.eb(t, l, r, 0);
        }
    }

    seg.build();
    for (auto [t, l, r, s] : qs) {
        if (t == 1) {
            seg.add(l, r, s);
        } else {
            int ans = seg.get(l, r+1, l, r+1);
            if (ans == -INF) ans = -1;
            cout << ans << '\n';
        }
    }


}
0