#line 1 "main.cpp" #define PROBLEM "https://yukicoder.me/problems/no/1625" #line 1 "/home/maspy/compro/library/my_template.hpp" #include using namespace std; using ll = long long; using pi = pair; using vi = vector; using u32 = unsigned int; using u64 = unsigned long long; using i128 = __int128; template using vc = vector; template using vvc = vector>; template using vvvc = vector>; template using vvvvc = vector>; template using vvvvvc = vector>; template using pq = priority_queue; template using pqg = priority_queue, greater>; #define vec(type, name, ...) vector name(__VA_ARGS__) #define vv(type, name, h, ...) \ vector> name(h, vector(__VA_ARGS__)) #define vvv(type, name, h, w, ...) \ vector>> name( \ h, vector>(w, vector(__VA_ARGS__))) #define vvvv(type, name, a, b, c, ...) \ vector>>> name( \ a, vector>>( \ b, vector>(c, vector(__VA_ARGS__)))) // https://trap.jp/post/1224/ #define FOR1(a) for (ll _ = 0; _ < ll(a); ++_) #define FOR2(i, a) for (ll i = 0; i < ll(a); ++i) #define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i) #define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c)) #define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i) #define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i) #define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i) #define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c)) #define overload4(a, b, c, d, e, ...) e #define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__) #define FOR_R(...) \ overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__) #define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s)) #define all(x) x.begin(), x.end() #define len(x) ll(x.size()) #define elif else if #define eb emplace_back #define mp make_pair #define mt make_tuple #define fi first #define se second #define stoi stoll template T SUM(vector &A) { T sum = T(0); for (auto &&a: A) sum += a; return sum; } #define MIN(v) *min_element(all(v)) #define MAX(v) *max_element(all(v)) #define LB(c, x) distance((c).begin(), lower_bound(all(c), (x))) #define UB(c, x) distance((c).begin(), upper_bound(all(c), (x))) #define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end()) int popcnt(int x) { return __builtin_popcount(x); } int popcnt(u32 x) { return __builtin_popcount(x); } int popcnt(ll x) { return __builtin_popcountll(x); } int popcnt(u64 x) { return __builtin_popcountll(x); } // (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2) int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); } int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); } int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } // (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2) int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); } int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); } int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } template T ceil(T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); } template T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); } template pair divmod(T x, U y) { T q = floor(x, y); return {q, x - q * y}; } ll binary_search(function check, ll ok, ll ng) { assert(check(ok)); while (abs(ok - ng) > 1) { auto x = (ng + ok) / 2; if (check(x)) ok = x; else ng = x; } return ok; } template inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); } template inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); } vi s_to_vi(const string &S, char first_char) { vi A(S.size()); FOR(i, S.size()) { A[i] = S[i] - first_char; } return A; } template vector cumsum(vector &A, int off = 1) { int N = A.size(); vector B(N + 1); FOR(i, N) { B[i + 1] = B[i] + A[i]; } if (off == 0) B.erase(B.begin()); return B; } template vc bincount(const vc &A, int size) { vc C(size); for (auto &&x: A) { ++C[x]; } return C; } template vector argsort(const vector &A) { // stable vector ids(A.size()); iota(all(ids), 0); sort(all(ids), [&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); }); return ids; } // A[I[0]], A[I[1]], ... template vc rearrange(const vc &A, const vc &I) { int n = len(A); assert(len(I) == n); vc B(n); FOR(i, n) B[i] = A[I[i]]; return B; } #line 1 "/home/maspy/compro/library/other/io.hpp" // based on yosupo's fastio #include namespace detail { template std::true_type check_value(int); template std::false_type check_value(long); } // namespace detail template struct is_modint : decltype(detail::check_value(0)) {}; template using is_modint_t = enable_if_t::value>; template using is_not_modint_t = enable_if_t::value>; struct Scanner { FILE *fp; char line[(1 << 15) + 1]; size_t st = 0, ed = 0; void reread() { memmove(line, line + st, ed - st); ed -= st; st = 0; ed += fread(line + ed, 1, (1 << 15) - ed, fp); line[ed] = '\0'; } bool succ() { while (true) { if (st == ed) { reread(); if (st == ed) return false; } while (st != ed && isspace(line[st])) st++; if (st != ed) break; } if (ed - st <= 50) { bool sep = false; for (size_t i = st; i < ed; i++) { if (isspace(line[i])) { sep = true; break; } } if (!sep) reread(); } return true; } template ::value, int> = 0> bool read_single(T &ref) { if (!succ()) return false; while (true) { size_t sz = 0; while (st + sz < ed && !isspace(line[st + sz])) sz++; ref.append(line + st, sz); st += sz; if (!sz || st != ed) break; reread(); } return true; } template ::value, int> = 0> bool read_single(T &ref) { if (!succ()) return false; bool neg = false; if (line[st] == '-') { neg = true; st++; } ref = T(0); while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); } if (neg) ref = -ref; return true; } template * = nullptr> bool read_single(T &ref) { long long val = 0; bool f = read_single(val); ref = T(val); return f; } bool read_single(double &ref) { string s; if (!read_single(s)) return false; ref = std::stod(s); return true; } bool read_single(char &ref) { string s; if (!read_single(s) || s.size() != 1) return false; ref = s[0]; return true; } template bool read_single(vector &ref) { for (auto &d: ref) { if (!read_single(d)) return false; } return true; } template bool read_single(pair &p) { return (read_single(p.first) && read_single(p.second)); } template bool read_single(tuple &p) { return (read_single(get<0>(p)) && read_single(get<1>(p)) && read_single(get<2>(p))); } template bool read_single(tuple &p) { return (read_single(get<0>(p)) && read_single(get<1>(p)) && read_single(get<2>(p)) && read_single(get<3>(p))); } void read() {} template void read(H &h, T &... t) { bool f = read_single(h); assert(f); read(t...); } Scanner(FILE *fp) : fp(fp) {} }; struct Printer { Printer(FILE *_fp) : fp(_fp) {} ~Printer() { flush(); } static constexpr size_t SIZE = 1 << 15; FILE *fp; char line[SIZE], small[50]; size_t pos = 0; void flush() { fwrite(line, 1, pos, fp); pos = 0; } void write(const char &val) { if (pos == SIZE) flush(); line[pos++] = val; } template ::value, int> = 0> void write(T val) { if (pos > (1 << 15) - 50) flush(); if (val == 0) { write('0'); return; } if (val < 0) { write('-'); val = -val; // todo min } size_t len = 0; while (val) { small[len++] = char(0x30 | (val % 10)); val /= 10; } for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; } pos += len; } void write(const string &s) { for (char c: s) write(c); } void write(const char *s) { size_t len = strlen(s); for (size_t i = 0; i < len; i++) write(s[i]); } void write(const double &x) { ostringstream oss; oss << setprecision(15) << x; string s = oss.str(); write(s); } void write(const long double &x) { ostringstream oss; oss << setprecision(15) << x; string s = oss.str(); write(s); } template * = nullptr> void write(T &ref) { write(ref.val); } template void write(const vector &val) { auto n = val.size(); for (size_t i = 0; i < n; i++) { if (i) write(' '); write(val[i]); } } template void write(const pair &val) { write(val.first); write(' '); write(val.second); } template void write(const tuple &val) { auto &[a, b, c] = val; write(a), write(' '), write(b), write(' '), write(c); } template void write(const tuple &val) { auto &[a, b, c, d] = val; write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d); } template void write(const tuple &val) { auto &[a, b, c, d, e] = val; write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e); } template void write(const tuple &val) { auto &[a, b, c, d, e, f] = val; write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e), write(' '), write(f); } template void write(const array &val) { auto n = val.size(); for (size_t i = 0; i < n; i++) { if (i) write(' '); write(val[i]); } } void write(i128 val) { string s; bool negative = 0; if(val < 0){ negative = 1; val = -val; } while (val) { s += '0' + int(val % 10); val /= 10; } if(negative) s += "-"; reverse(all(s)); if (len(s) == 0) s = "0"; write(s); } }; Scanner scanner = Scanner(stdin); Printer printer = Printer(stdout); void flush() { printer.flush(); } void print() { printer.write('\n'); } template void print(Head &&head, Tail &&... tail) { printer.write(head); if (sizeof...(Tail)) printer.write(' '); print(forward(tail)...); } void read() {} template void read(Head &head, Tail &... tail) { scanner.read(head); read(tail...); } #define INT(...) \ int __VA_ARGS__; \ read(__VA_ARGS__) #define LL(...) \ ll __VA_ARGS__; \ read(__VA_ARGS__) #define STR(...) \ string __VA_ARGS__; \ read(__VA_ARGS__) #define CHAR(...) \ char __VA_ARGS__; \ read(__VA_ARGS__) #define DBL(...) \ double __VA_ARGS__; \ read(__VA_ARGS__) #define VEC(type, name, size) \ vector name(size); \ read(name) #define VV(type, name, h, w) \ vector> name(h, vector(w)); \ read(name) void YES(bool t = 1) { print(t ? "YES" : "NO"); } void NO(bool t = 1) { YES(!t); } void Yes(bool t = 1) { print(t ? "Yes" : "No"); } void No(bool t = 1) { Yes(!t); } void yes(bool t = 1) { print(t ? "yes" : "no"); } void no(bool t = 1) { yes(!t); } #line 1 "/home/maspy/compro/library/ds/segtree2d.hpp" template struct SegTree2D { using S = typename Monoid::value_type; int N; int full_N; vc keyX; int min_X; vc indptr; vc keyY; vc dat; inline int xtoi(int x) { return (SMALL ? clamp(x - min_X, 0, N) : LB(keyX, x)); } SegTree2D(vc& X, vc& Y, vc wt = vc()) { if (len(wt) == 0) wt = vc(len(X), Monoid::unit()); assert(Monoid::commute); // 可換モノイドのみ assert(len(X) == len(Y) && len(X) == len(wt)); if (!SMALL) { keyX = X; UNIQUE(keyX); N = len(keyX); } else { min_X = (len(X) == 0 ? 0 : MIN(X)); N = (len(X) == 0 ? 0 : MAX(X)) - min_X + 1; keyX.resize(N); FOR(i, N) keyX[i] = min_X + i; } vc> keyY_raw(N + N); vc> dat_raw(N + N); auto I = argsort(Y); for (auto&& i: I) { int ix = xtoi(X[i]), y = Y[i]; ix += N; while (ix) { auto& KY = keyY_raw[ix]; if (len(KY) == 0 || KY.back() < y) { KY.eb(y); dat_raw[ix].eb(wt[i]); } else { dat_raw[ix].back() = Monoid::op(dat_raw[ix].back(), wt[i]); } ix >>= 1; } } indptr.assign(N + N + 1, 0); FOR(i, N + N) indptr[i + 1] = indptr[i] + len(keyY_raw[i]); int full_N = indptr.back(); keyY.resize(full_N); dat.assign(2 * full_N, Monoid::unit()); FOR(i, N + N) { int off = 2 * indptr[i], n = indptr[i + 1] - indptr[i]; FOR(j, n) { keyY[indptr[i] + j] = keyY_raw[i][j]; dat[off + n + j] = dat_raw[i][j]; } FOR3_R(j, 1, n) dat[off + j] = Monoid::op(dat[off + 2 * j + 0], dat[off + 2 * j + 1]); } } void multiply_i(int i, XY y, S val) { int LID = indptr[i], n = indptr[i + 1] - indptr[i]; auto it = keyY.begin() + LID; int j = lower_bound(it, it + n, y) - it; assert(keyY[LID + j] == y); int off = 2 * LID; j += n; while (j) { dat[off + j] = Monoid::op(dat[off + j], val); j >>= 1; } } void multiply(XY x, XY y, S val) { int i = xtoi(x); assert(keyX[i] == x); i += N; while (i) { multiply_i(i, y, val); i >>= 1; } } S prod_i(int i, XY ly, XY ry) { int LID = indptr[i], n = indptr[i + 1] - indptr[i]; auto it = keyY.begin() + LID; int L = lower_bound(it, it + n, ly) - it; int R = lower_bound(it, it + n, ry) - it; int off = 2 * LID; L += n; R += n; S val = Monoid::unit(); while (L < R) { if (L & 1) val = Monoid::op(val, dat[off + (L++)]); if (R & 1) val = Monoid::op(dat[off + (--R)], val); L >>= 1; R >>= 1; } return val; } S prod(XY lx, XY ly, XY rx, XY ry) { int L = xtoi(lx); int R = xtoi(rx); L += N; R += N; S val = Monoid::unit(); while (L < R) { if (L & 1) val = Monoid::op(val, prod_i(L++, ly, ry)); if (R & 1) val = Monoid::op(prod_i(--R, ly, ry), val); L >>= 1; R >>= 1; } return val; } void debug() { print("keyX", keyX); print("indptr", indptr); print("keyY", keyY); print("dat", dat); } }; #line 2 "/home/maspy/compro/library/alg/monoid_max.hpp" template struct Monoid_Max { using value_type = X; static constexpr X op(const X &x, const X &y) noexcept { return max(x, y); } static constexpr X unit() { return -numeric_limits::lowest(); } static constexpr bool commute = true; }; #line 2 "/home/maspy/compro/library/alg/lazy_max_max.hpp" template struct Lazy_Max_Max { using MX = Monoid_Max; using MA = Monoid_Max; using X_structure = MX; using A_structure = MA; using X = typename MX::value_type; using A = typename MA::value_type; static constexpr X act(const X &x, const A &a) { return max(x, a); } }; #line 7 "main.cpp" void solve() { LL(N, Q); using QT = tuple; vc query; FOR(N) { LL(a, b, c, d, e, f); ll x = min({a, c, e}); ll y = max({a, c, e}); ll area = abs((c - a) * (f - b) - (e - a) * (d - b)); query.eb(x, y, area); } FOR(Q) { LL(t); if (t == 1) { LL(a, b, c, d, e, f); ll x = min({a, c, e}); ll y = max({a, c, e}); ll area = abs((c - a) * (f - b) - (e - a) * (d - b)); query.eb(x, y, area); } if (t == 2) { LL(l, r); ++r; query.eb(-1, l, r); } } using Mono = Monoid_Max; vi X, Y, V; FOR(i, N) { auto [a, b, c] = query[i]; X.eb(a), Y.eb(b), V.eb(c); } FOR(i, N, N + Q) { auto&& [a, b, c] = query[i]; if (a != -1) X.eb(a), Y.eb(b), V.eb(Mono::unit()); } SegTree2D seg(X, Y, V); // kDTree> KDT(X, Y, V); FOR(q, N, N + Q) { auto&& [a, b, c] = query[q]; if (a != -1) { seg.multiply(a, b, c); } else { ll ANS = seg.prod(b, b, c, c); if (ANS == Mono::unit()) ANS = -1; print(ANS); } } } signed main() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << setprecision(15); ll T = 1; // LL(T); FOR(T) solve(); return 0; }