結果
| 問題 | No.1625 三角形の質問 |
| ユーザー |
 maspy
|
| 提出日時 | 2022-05-20 20:36:48 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 1,256 ms / 6,000 ms |
| コード長 | 17,344 bytes |
| コンパイル時間 | 3,330 ms |
| コンパイル使用メモリ | 233,712 KB |
| 実行使用メモリ | 65,204 KB |
| 最終ジャッジ日時 | 2024-09-20 06:08:51 |
| 合計ジャッジ時間 | 19,502 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
5,248 KB |
| testcase_01 | AC | 41 ms
7,760 KB |
| testcase_02 | AC | 439 ms
23,052 KB |
| testcase_03 | AC | 231 ms
29,456 KB |
| testcase_04 | AC | 223 ms
20,240 KB |
| testcase_05 | AC | 513 ms
36,608 KB |
| testcase_06 | AC | 1,096 ms
54,280 KB |
| testcase_07 | AC | 1,126 ms
54,072 KB |
| testcase_08 | AC | 1,096 ms
54,284 KB |
| testcase_09 | AC | 1,053 ms
54,284 KB |
| testcase_10 | AC | 1,087 ms
54,412 KB |
| testcase_11 | AC | 1,070 ms
54,284 KB |
| testcase_12 | AC | 1,095 ms
53,768 KB |
| testcase_13 | AC | 1,115 ms
54,032 KB |
| testcase_14 | AC | 1,256 ms
54,408 KB |
| testcase_15 | AC | 1,085 ms
53,904 KB |
| testcase_16 | AC | 100 ms
23,948 KB |
| testcase_17 | AC | 275 ms
55,820 KB |
| testcase_18 | AC | 157 ms
37,008 KB |
| testcase_19 | AC | 340 ms
65,204 KB |
ソースコード
#line 1 "main.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/1625"
#line 1 "/home/maspy/compro/library/my_template.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using u32 = unsigned int;
using u64 = unsigned long long;
using i128 = __int128;
template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vc<T>>;
template <class T>
using vvvc = vector<vvc<T>>;
template <class T>
using vvvvc = vector<vvvc<T>>;
template <class T>
using vvvvvc = vector<vvvvc<T>>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...) \
vector<vector<vector<vector<type>>>> name( \
a, vector<vector<vector<type>>>( \
b, vector<vector<type>>(c, vector<type>(__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 <typename T>
T SUM(vector<T> &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 <typename T, typename U>
T ceil(T x, U y) {
return (x > 0 ? (x + y - 1) / y : x / y);
}
template <typename T, typename U>
T floor(T x, U y) {
return (x > 0 ? x / y : (x - y + 1) / y);
}
template <typename T, typename U>
pair<T, T> divmod(T x, U y) {
T q = floor(x, y);
return {q, x - q * y};
}
ll binary_search(function<bool(ll)> 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 <class T, class S>
inline bool chmax(T &a, const S &b) {
return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
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 <typename T>
vector<T> cumsum(vector<T> &A, int off = 1) {
int N = A.size();
vector<T> B(N + 1);
FOR(i, N) { B[i + 1] = B[i] + A[i]; }
if (off == 0) B.erase(B.begin());
return B;
}
template <typename CNT, typename T>
vc<CNT> bincount(const vc<T> &A, int size) {
vc<CNT> C(size);
for (auto &&x: A) { ++C[x]; }
return C;
}
template <typename T>
vector<int> argsort(const vector<T> &A) {
// stable
vector<int> 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 <typename T>
vc<T> rearrange(const vc<T> &A, const vc<int> &I) {
int n = len(A);
assert(len(I) == n);
vc<T> 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 <unistd.h>
namespace detail {
template <typename T, decltype(&T::is_modint) = &T::is_modint>
std::true_type check_value(int);
template <typename T>
std::false_type check_value(long);
} // namespace detail
template <typename T>
struct is_modint : decltype(detail::check_value<T>(0)) {};
template <typename T>
using is_modint_t = enable_if_t<is_modint<T>::value>;
template <typename T>
using is_not_modint_t = enable_if_t<!is_modint<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 <class T, enable_if_t<is_same<T, string>::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 <class T, enable_if_t<is_integral<T>::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 <class T, is_modint_t<T> * = 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 <class T>
bool read_single(vector<T> &ref) {
for (auto &d: ref) {
if (!read_single(d)) return false;
}
return true;
}
template <class T, class U>
bool read_single(pair<T, U> &p) {
return (read_single(p.first) && read_single(p.second));
}
template <class A, class B, class C>
bool read_single(tuple<A, B, C> &p) {
return (read_single(get<0>(p)) && read_single(get<1>(p))
&& read_single(get<2>(p)));
}
template <class A, class B, class C, class D>
bool read_single(tuple<A, B, C, D> &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 <class H, class... T>
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 <class T, enable_if_t<is_integral<T>::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 <class T, is_modint_t<T> * = nullptr>
void write(T &ref) {
write(ref.val);
}
template <class T>
void write(const vector<T> &val) {
auto n = val.size();
for (size_t i = 0; i < n; i++) {
if (i) write(' ');
write(val[i]);
}
}
template <class T, class U>
void write(const pair<T, U> &val) {
write(val.first);
write(' ');
write(val.second);
}
template <class A, class B, class C>
void write(const tuple<A, B, C> &val) {
auto &[a, b, c] = val;
write(a), write(' '), write(b), write(' '), write(c);
}
template <class A, class B, class C, class D>
void write(const tuple<A, B, C, D> &val) {
auto &[a, b, c, d] = val;
write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d);
}
template <class A, class B, class C, class D, class E>
void write(const tuple<A, B, C, D, E> &val) {
auto &[a, b, c, d, e] = val;
write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e);
}
template <class A, class B, class C, class D, class E, class F>
void write(const tuple<A, B, C, D, E, F> &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 <class T, size_t S>
void write(const array<T, S> &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 <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
printer.write(head);
if (sizeof...(Tail)) printer.write(' ');
print(forward<Tail>(tail)...);
}
void read() {}
template <class Head, class... Tail>
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<type> name(size); \
read(name)
#define VV(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(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 2 "/home/maspy/compro/library/alg/monoid_max.hpp"
template <class X>
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<X>::lowest(); }
static constexpr bool commute = true;
};
#line 5 "main.cpp"
// 同じ座標の複数の点は別のノードになる。
// set, multiply はどれかひとつが対象となってしまう
template <class Monoid, int NODES = 1'000'000>
struct KDTree_Monoid {
using X = typename Monoid::value_type;
struct Node {
Node *l, *r;
ll xmin, xmax, ymin, ymax;
int size;
X dat;
};
using np = Node*;
int pid;
np pool;
np root;
KDTree_Monoid(vi xs, vi ys, vc<X> vs) : pid(0) {
assert(Monoid::commute);
pool = new Node[NODES];
root = new_node(xs, ys, vs);
}
void set(ll x, ll y, const X& v) { set_rec(root, x, y, v); }
void multiply(ll x, ll y, const X& v) { multiply_rec(root, x, y, v); }
X prod(ll xl, ll yl, ll xr, ll yr) {
assert(xl <= xr && yl <= yr);
return prod_rec(root, xl, xr, yl, yr);
}
private:
bool isin(np root, ll x, ll y) {
if (x < root->xmin) return false;
if (x > root->xmax) return false;
if (y < root->ymin) return false;
if (y > root->ymax) return false;
return true;
}
np new_node(vi xs, vi ys, vc<X> vs, bool divx = true) {
int n = len(xs);
np c = &(pool[pid++]);
c->l = nullptr;
c->r = nullptr;
c->xmin = numeric_limits<ll>::max();
c->xmax = numeric_limits<ll>::lowest();
c->ymin = numeric_limits<ll>::max();
c->ymax = numeric_limits<ll>::lowest();
c->dat = Monoid::unit();
c->size = n;
FOR(i, n) {
auto x = xs[i], y = ys[i];
chmin(c->xmin, x);
chmax(c->xmax, x);
chmin(c->ymin, y);
chmax(c->ymax, y);
}
if (n <= 1) {
c->dat = vs[0];
return c;
}
int m = n / 2;
vc<int> I(n);
iota(all(I), 0);
if (divx) {
nth_element(I.begin(), I.begin() + m, I.end(),
[xs](int i, int j) { return xs[i] < xs[j]; });
} else {
nth_element(I.begin(), I.begin() + m, I.end(),
[ys](int i, int j) { return ys[i] < ys[j]; });
}
vi lxs, rxs, lys, rys;
vc<X> lvs, rvs;
FOR(k, m) {
int i = I[k];
lxs.eb(xs[i]);
lys.eb(ys[i]);
lvs.eb(vs[i]);
}
FOR(k, m, n) {
int i = I[k];
rxs.eb(xs[i]);
rys.eb(ys[i]);
rvs.eb(vs[i]);
}
c->l = new_node(lxs, lys, lvs, !divx);
c->r = new_node(rxs, rys, rvs, !divx);
c->dat = Monoid::op(c->l->dat, c->r->dat);
return c;
}
bool set_rec(np c, ll x, ll y, const X& v) {
if (!isin(c, x, y)) return false;
if (c->size == 1) {
c->dat = v;
return true;
}
bool ok = (set_rec(c->l, x, y, v) || set_rec(c->r, x, y, v));
c->dat = Monoid::op(c->l->dat, c->r->dat);
return ok;
}
bool multiply_rec(np c, ll x, ll y, const X& v) {
if (!isin(c, x, y)) return false;
if (c->size == 1) {
c->dat = Monoid::op(c->dat, v);
return true;
}
bool ok = (multiply_rec(c->l, x, y, v) || multiply_rec(c->r, x, y, v));
c->dat = Monoid::op(c->l->dat, c->r->dat);
return ok;
}
X prod_rec(np c, ll x1, ll x2, ll y1, ll y2) {
if (x2 <= c->xmin || c->xmax < x1) return Monoid::unit();
if (y2 <= c->ymin || c->ymax < y1) return Monoid::unit();
if (x1 <= c->xmin && c->xmax < x2 && y1 <= c->ymin && c->ymax < y2) {
return c->dat;
}
return Monoid::op(prod_rec(c->l, x1, x2, y1, y2),
prod_rec(c->r, x1, x2, y1, y2));
}
};
void solve() {
LL(N, Q);
using QT = tuple<ll, ll, ll>;
vc<QT> 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<ll>;
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());
}
KDTree_Monoid<Mono> seg(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;
}