結果
| 問題 | No.1625 三角形の質問 |
| ユーザー |
 first_vil
|
| 提出日時 | 2021-07-24 14:05:36 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,214 bytes |
| コンパイル時間 | 3,122 ms |
| コンパイル使用メモリ | 228,488 KB |
| 最終ジャッジ日時 | 2025-01-23 09:32:09 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 4 WA * 15 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template<class T> using V = vector<T>;
using VI = V<int>;
using VL = V<ll>;
using VS = V<string>;
template<class T> using PQ = priority_queue<T, V<T>, greater<T>>;
using graph = V<VI>;
template<class T> using w_graph = V<V<pair<int, T>>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))
#ifdef _DEBUG
#define line cout << "-----------------------------\n"
#define stop system("pause")
#endif
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 61;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
template<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, V<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline V<T> vec(size_t a) { return V<T>(a); }
template<class T>inline V<T> defvec(T def, size_t a) { return V<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return V<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return V<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T>inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T>inline void print(const V<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T>inline void print(const V<V<T>>& v) { for (auto& a : v)print(a); }
template<class T>inline T sum(const V<T>& a, int l, int r) { return 0 <= l && l <= r && r < a.size() ? a[r] - (l == 0 ? 0 : a[l - 1]) : 0; }
template<class T>inline void END(T s) { print(s); exit(0); }
void END() { exit(0); }
template<class Op> class SegmentTree {
using T = typename Op::T;
int len, n;
vector<T> dat;
public:
SegmentTree(const int _n) : n(_n) {
for (len = 1; len < n; len <<= 1);
dat.resize(len << 1, Op::unit);
}
SegmentTree(const vector<T>& v) : n(v.size()) {
for (len = 1; len < n; len <<= 1);
dat.resize(len << 1, Op::unit);
for (int i = 0; i < n; ++i)dat[i + len] = v[i];
for (int i = len - 1; 0 < i; --i)
dat[i] = Op::merge(dat[i << 1], dat[i << 1 | 1]);
}
inline void update(int idx, const T a) {
idx += len;
dat[idx] = Op::update(dat[idx], a);
for (idx >>= 1; 0 < idx; idx >>= 1)
dat[idx] = Op::merge(dat[idx << 1], dat[idx << 1 | 1]);
}
inline T value(int l, int r) {
T vl = Op::unit, vr = Op::unit;
for (l += len, r += len; l < r; l >>= 1, r >>= 1) {
if (l & 1)vl = Op::merge(vl, dat[l++]);
if (r & 1)vr = Op::merge(dat[--r], vr);
}
return Op::merge(vl, vr);
}
inline T operator[](int idx) { return dat[idx + len]; }
};
template<class Type> struct node {
using T = Type;
inline static T unit = -1;
inline static T merge(T vl, T vr) { return max(vl, vr); }
inline static T update(T vl, T vr) { return max(vl, vr); }
};
template<class T> class compress {
vector<T> xs;
public:
compress() {}
compress(const vector<T>& vs) {
add(vs);
}
inline void add(const vector<T>& vs) {
copy(all(vs), back_inserter(xs));
}
inline void add(const T& x) {
xs.emplace_back(x);
}
inline void build() {
sort(all(xs));
xs.erase(unique(all(xs)), xs.end());
}
inline int idx(const T& x) const {
return lower_bound(all(xs), x) - xs.begin();
}
inline T operator[](int k) const {
return xs[k];
}
inline int size() const {
return xs.size();
}
};
ll area(int a, int b, int c, int d, int e, int f) {
c -= a, d -= b, e -= a, f -= b;
return abs(ll(c) * f - ll(d) * e);
}
int main() {
init();
int n, q; cin >> n >> q;
V<array<int, 7>> tabcdef(n);
V<array<int, 3>> tlr;
for (auto& [t, a, b, c, d, e, f] : tabcdef) {
cin >> a >> b >> c >> d >> e >> f;
t = -1;
}
FOR(i, 0, q) {
int type; cin >> type;
if (type == 1) {
tabcdef.push_back({});
auto& [t, a, b, c, d, e, f] = tabcdef.back();
cin >> a >> b >> c >> d >> e >> f;
t = i;
}
else {
tlr.push_back({});
auto& [t, l, r] = tlr.back();
cin >> l >> r;
t = i;
}
}
compress<int> comp;
for (auto [t, a, b, c, d, e, f] : tabcdef) {
comp.add(min({ a, c, e }));
comp.add(max({ a, c, e }));
}
for (auto [t, l, r] : tlr) {
comp.add(l);
comp.add(r);
}
comp.build();
V<V<tuple<int, int, int, ll>>> query(comp.size());//時間、タイプ、左端(、面積)
for (auto [t, a, b, c, d, e, f] : tabcdef) {
query[comp.idx(max({ a,c,e }))].emplace_back(t, 1, comp.idx(min({ a,c,e })), area(a, b, c, d, e, f));
}
for (auto [t, l, r] : tlr) {
query[comp.idx(r)].emplace_back(t, 2, comp.idx(l), -1);
}
SegmentTree<node<ll>> seg(comp.size());
V<pair<int, ll>> ans;
FOR(r, 0, comp.size()) {
sort(all(query[r]));
for (auto [t, type, l, area] : query[r]) {
if (type == 1)seg.update(l, area);
else ans.emplace_back(t, seg.value(l, r + 1));
}
}
sort(all(ans));
FOR(i, 0, ans.size())print(ans[i].second);
return 0;
}