結果

問題 No.1625 三角形の質問
ユーザー yuto1115yuto1115
提出日時 2021-07-23 23:14:51
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,707 ms / 6,000 ms
コード長 9,755 bytes
コンパイル時間 2,943 ms
コンパイル使用メモリ 225,908 KB
実行使用メモリ 95,800 KB
最終ジャッジ日時 2024-07-18 21:05:35
合計ジャッジ時間 25,116 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 46 ms
10,912 KB
testcase_02 AC 547 ms
43,776 KB
testcase_03 AC 246 ms
41,832 KB
testcase_04 AC 309 ms
34,412 KB
testcase_05 AC 640 ms
60,716 KB
testcase_06 AC 1,707 ms
95,796 KB
testcase_07 AC 1,630 ms
95,800 KB
testcase_08 AC 1,686 ms
95,800 KB
testcase_09 AC 1,594 ms
95,676 KB
testcase_10 AC 1,658 ms
95,672 KB
testcase_11 AC 1,627 ms
95,676 KB
testcase_12 AC 1,572 ms
95,800 KB
testcase_13 AC 1,559 ms
95,672 KB
testcase_14 AC 1,577 ms
95,796 KB
testcase_15 AC 1,587 ms
95,796 KB
testcase_16 AC 169 ms
41,424 KB
testcase_17 AC 207 ms
47,828 KB
testcase_18 AC 934 ms
51,256 KB
testcase_19 AC 258 ms
57,912 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(i, n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i, s, n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i, s, n, d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep1(i, n) for (ll i = ll(n)-1; i >= 0; i--)
#define rrep2(i, n, t) for (ll i = ll(n)-1; i >= (ll)t; i--)
#define rrep3(i, n, t, d) for (ll i = ll(n)-1; i >= (ll)t; i-=d)
#define rrep(...) overload4(__VA_ARGS__,rrep3,rrep2,rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define SUM(a) accumulate(all(a),0LL)
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define popcount(x) __builtin_popcountll(x)
#define pb push_back
#define eb emplace_back
#ifdef __LOCAL
#define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; }
#else
#define debug(...) void(0)
#endif
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using LP = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vp = vector<P>;
using vvp = vector<vp>;

template<class S, class T>
istream &operator>>(istream &is, pair<S, T> &p) { return is >> p.first >> p.second; }

template<class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &p) { return os << '{' << p.first << ", " << p.second << '}'; }

template<class S, class T, class U>
istream &operator>>(istream &is, tuple<S, T, U> &t) { return is >> get<0>(t) >> get<1>(t) >> get<2>(t); }

template<class S, class T, class U>
ostream &operator<<(ostream &os, const tuple<S, T, U> &t) {
    return os << '{' << get<0>(t) << ", " << get<1>(t) << ", " << get<2>(t) << '}';
}

template<class T>
istream &operator>>(istream &is, vector<T> &v) {
    for (T &t:v) { is >> t; }
    return is;
}

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '[';
    rep(i, v.size())os << v[i] << (i == int(v.size() - 1) ? "" : ", ");
    return os << ']';
}

template<class T>
void vecout(const vector<T> &v, char div = '\n') {
    rep(i, v.size()) cout << v[i] << (i == int(v.size() - 1) ? '\n' : div);
}

template<class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

void scan() {}

template<class Head, class... Tail>
void scan(Head &head, Tail &... tail) {
    cin >> head;
    scan(tail...);
}

template<class T>
void print(const T &t) { cout << t << '\n'; }

template<class Head, class... Tail>
void print(const Head &head, const Tail &... tail) {
    cout << head << ' ';
    print(tail...);
}

template<class... T>
void fin(const T &... a) {
    print(a...);
    exit(0);
}

struct Init_io {
    Init_io() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        cout.tie(nullptr);
        cout << boolalpha << fixed << setprecision(15);
        cerr << boolalpha << fixed << setprecision(15);
    }
} init_io;

const string yes[] = {"no", "yes"};
const string Yes[] = {"No", "Yes"};
const string YES[] = {"NO", "YES"};
const int inf = 1001001001;
const ll linf = 1001001001001001001;

template<class T, class S>
vector<T> cumsum(const vector<S> &v, bool shift_one = true) {
    int n = v.size();
    vector<T> res;
    if (shift_one) {
        res.resize(n + 1);
        rep(i, n) res[i + 1] = res[i] + v[i];
    } else {
        res.resize(n);
        if (n) {
            res[0] = v[0];
            rep(i, 1, n) res[i] = res[i - 1] + v[i];
        }
    }
    return res;
}

vvi graph(int n, int m, bool directed = false, int origin = 1) {
    vvi G(n);
    rep(_, m) {
        INT(u, v);
        u -= origin, v -= origin;
        G[u].pb(v);
        if (!directed) G[v].pb(u);
    }
    return G;
}

template<class T>
vector<vector<pair<int, T>>> weighted_graph(int n, int m, bool directed = false, int origin = 1) {
    vector<vector<pair<int, T>>> G(n);
    rep(_, m) {
        int u, v;
        T w;
        scan(u, v, w);
        u -= origin, v -= origin;
        G[u].eb(v, w);
        if (!directed) G[v].eb(u, w);
    }
    return G;
}

template<class T>
void resemble(vector<T> &v) {}

template<class T, class... Tail>
void resemble(vector<T> &v, vector<T> &head, Tail &...tail) {
    for (T &e : head) v.pb(e);
    resemble(v, tail...);
}

template<class T>
void renumber(vector<T> &v) {}

template<class T, class... Tail>
void renumber(vector<T> &v, vector<T> &head, Tail &...tail) {
    for (T &e : head) e = lower_bound(all(v), e) - v.begin();
    renumber(v, tail...);
}

template<class T, class... Tail>
vector<T> zip(vector<T> &head, Tail &... tail) {
    vector<T> v;
    resemble(v, head, tail...);
    sort(all(v));
    v.erase(unique(all(v)), v.end());
    renumber(v, head, tail...);
    return v;
}

template<class Monoid>
class segtree {
    using S = typename Monoid::S;
    
    int n;
    vector<S> val;

public:
    constexpr segtree(const vector<S> &init = vector<S>()) {
        int _n = init.size();
        n = 1;
        while (n < _n) n *= 2;
        val.assign(n * 2, Monoid::identity);
        rep(i, _n) val[i + n] = init[i];
        rrep(i, n) val[i] = Monoid::operate(val[i * 2], val[i * 2 + 1]);
    }
    
    constexpr segtree(int _n) : segtree(vector<S>(_n, Monoid::identity)) {}
    
    // segment [l,r)
    S prod(int l, int r) {
        l += n, r += n;
        S prod_l = Monoid::identity;
        S prod_r = Monoid::identity;
        while (l < r) {
            if (l & 1) prod_l = Monoid::operate(prod_l, val[l++]);
            if (r & 1) prod_r = Monoid::operate(val[--r], prod_r);
            l >>= 1, r >>= 1;
        }
        return Monoid::operate(prod_l, prod_r);
    }
    
    template<class F>
    void update(int i, const F &f) {
        i += n;
        val[i] = f(val[i]);
        while (i > 1) {
            i >>= 1;
            val[i] = Monoid::operate(val[i * 2], val[i * 2 + 1]);
        }
    }
    
    S get(int i) {
        assert(i >= 0 and i < n);
        return val[i + n];
    }
};

class M {
public:
    using S = ll;
    
    static constexpr S identity = -1;
    
    static constexpr S operate(const S &l, const S &r) {
        return max(l, r);
    }
};

int main() {
    INT(n, q);
    vi l(n), r(n);
    vl s(n);
    rep(i, n) {
        INT(a, b, c, d, e, f);
        l[i] = min({a, c, e});
        r[i] = max({a, c, e});
        s[i] = abs(ll(c - a) * (f - b) - ll(e - a) * (d - b));
    }
    vi t(q), al(q), ar(q), ql(q), qr(q);
    vl as(q);
    rep(i, q) {
        scan(t[i]);
        if (t[i] == 1) {
            INT(a, b, c, d, e, f);
            al[i] = min({a, c, e});
            ar[i] = max({a, c, e});
            as[i] = abs(ll(c - a) * (f - b) - ll(e - a) * (d - b));
        } else {
            scan(ql[i], qr[i]);
        }
    }
    int sz = zip(l, r, al, ar, ql, qr).size();
    int d = sqrt(sz) + 1;
    int m = (sz + d - 1) / d;
    vvi rs(sz), ls(sz);
    rep(i, n) {
        rs[l[i]].pb(r[i]);
        ls[r[i]].pb(l[i]);
    }
    rep(i, q) {
        if (t[i] == 1) {
            rs[al[i]].pb(ar[i]);
            ls[ar[i]].pb(al[i]);
        }
    }
    rep(i, sz) {
        sort(all(rs[i]));
        sort(all(ls[i]));
    }
    vector<segtree<M>> b_to_b(m);
    rep(i, m) b_to_b[i] = segtree<M>(m);
    vector<segtree<M>> l_to_r(sz);
    rep(i, sz) l_to_r[i] = segtree<M>(rs[i].size());
    vector<segtree<M>> r_to_l(sz);
    rep(i, sz) r_to_l[i] = segtree<M>(ls[i].size());
    rep(i, n) {
        b_to_b[l[i] / d].update(r[i] / d, [&](ll pre) { return max(pre, s[i]); });
        l_to_r[l[i]].update(lower_bound(all(rs[l[i]]), r[i]) - rs[l[i]].begin(),
                            [&](ll pre) { return max(pre, s[i]); });
        r_to_l[r[i]].update(lower_bound(all(ls[r[i]]), l[i]) - ls[r[i]].begin(),
                            [&](ll pre) { return max(pre, s[i]); });
    }
    rep(i, q) {
        if (t[i] == 1) {
            b_to_b[al[i] / d].update(ar[i] / d, [&](ll pre) { return max(pre, as[i]); });
            l_to_r[al[i]].update(lower_bound(all(rs[al[i]]), ar[i]) - rs[al[i]].begin(),
                                 [&](ll pre) { return max(pre, as[i]); });
            r_to_l[ar[i]].update(lower_bound(all(ls[ar[i]]), al[i]) - ls[ar[i]].begin(),
                                 [&](ll pre) { return max(pre, as[i]); });
        } else {
            ll ans = -1;
            int lb = ql[i] / d, rb = qr[i] / d;
            if (lb < rb) {
                rep(j, lb + 1, rb) chmax(ans, b_to_b[j].prod(j, rb));
                rep(j, ql[i], (lb + 1) * d) {
                    chmax(ans, l_to_r[j].prod(0, upper_bound(all(rs[j]), qr[i]) - rs[j].begin()));
                }
                rep(j, rb * d, qr[i] + 1) {
                    chmax(ans, r_to_l[j].prod(lower_bound(all(ls[j]), ql[i]) - ls[j].begin(), ls[j].size()));
                }
            } else {
                rep(j, ql[i], qr[i] + 1) {
                    chmax(ans, l_to_r[j].prod(0, upper_bound(all(rs[j]), qr[i]) - rs[j].begin()));
                }
            }
            print(ans);
        }
    }
}
0