結果
| 問題 | No.1625 三角形の質問 |
| ユーザー |
 mtsd
|
| 提出日時 | 2021-07-23 23:04:12 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 1,173 ms / 6,000 ms |
| コード長 | 14,667 bytes |
| コンパイル時間 | 2,744 ms |
| コンパイル使用メモリ | 212,352 KB |
| 実行使用メモリ | 202,632 KB |
| 最終ジャッジ日時 | 2024-07-18 20:27:25 |
| 合計ジャッジ時間 | 18,652 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1 ms
5,248 KB |
| testcase_01 | AC | 45 ms
15,360 KB |
| testcase_02 | AC | 392 ms
60,788 KB |
| testcase_03 | AC | 265 ms
83,336 KB |
| testcase_04 | AC | 248 ms
52,876 KB |
| testcase_05 | AC | 563 ms
105,916 KB |
| testcase_06 | AC | 1,056 ms
160,944 KB |
| testcase_07 | AC | 1,109 ms
160,896 KB |
| testcase_08 | AC | 1,061 ms
160,768 KB |
| testcase_09 | AC | 1,096 ms
161,020 KB |
| testcase_10 | AC | 1,085 ms
161,140 KB |
| testcase_11 | AC | 1,165 ms
161,036 KB |
| testcase_12 | AC | 1,145 ms
160,896 KB |
| testcase_13 | AC | 1,030 ms
160,872 KB |
| testcase_14 | AC | 1,049 ms
160,896 KB |
| testcase_15 | AC | 1,173 ms
160,880 KB |
| testcase_16 | AC | 153 ms
60,036 KB |
| testcase_17 | AC | 502 ms
170,204 KB |
| testcase_18 | AC | 66 ms
6,380 KB |
| testcase_19 | AC | 574 ms
202,632 KB |
ソースコード
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define inf 1000000007
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define rrep(i,n) for(int i = (int)n-1; i >= 0; --i)
#define srep(i,a,b) for(int i = (int)a; i < (int)(b); ++i)
#define all(x) (x).begin(),(x).end()
#define SUM(v) accumulate(all(v), 0LL)
#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())
#define SZ(c) (int)(c).size()
template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
os << "{";
for (int i = 0; i<(int)vec.size(); i++) {
os << vec[i] << (i + 1 == (int)vec.size() ? "" : ", ");
}
os << "}";
return os;
}
// pair出力
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U> pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// map出力
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
os << "{";
for(auto itr = map_var.begin(); itr != map_var.end(); itr++){
os << "(" << itr->first << ", " << itr->second << ")";
itr++;
if(itr != map_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
// set 出力
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
os << "{";
for(auto itr = set_var.begin(); itr != set_var.end(); itr++){
os << (*itr);
++itr;
if(itr != set_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
#define overload2(_1, _2, name, ...) name
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
IN(name)
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(w)); \
IN(name)
#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__))))
#define INT(...) \
int __VA_ARGS__; \
IN(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
IN(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
IN(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
IN(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
IN(__VA_ARGS__)
int scan() { return getchar(); }
void scan(int &a) { cin >> a; }
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(string &a) { cin >> a; }
template <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }
template <class T> void scan(vector<T> &);
template <class T> void scan(vector<T> &a) {
for(auto &i : a) scan(i);
}
template <class T> void scan(T &a) { cin >> a; }
void IN() {}
template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {
scan(head);
IN(tail...);
}
const string YESNO[2] = {"NO", "YES"};
const string YesNo[2] = {"No", "Yes"};
const string yesno[2] = {"no", "yes"};
void YES(bool t = 1) { cout << YESNO[t] << endl; }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { cout << YesNo[t] << endl; }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { cout << yesno[t] << endl; }
void no(bool t = 1) { yes(!t); }
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define dbg(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define dbg(...) (void(0))
#define dump(x) (void(0))
#endif
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
template <class T> T ceil(T x, T y) {assert(y >= 1);return (x > 0 ? (x + y - 1) / y : x / y);}
template <class T> T floor(T x, T y) {assert(y >= 1);return (x > 0 ? x / y : (x + y - 1) / y);}
vector<int> iota(int n) {vector<int> a(n);iota(all(a), 0);return a;}
template <class T> T POW(T x, int n) {T res = 1;for(; n; n >>= 1, x *= x){if(n & 1) res *= x;}return res;}
ll pow2(int i) { return 1LL << i; }
int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }
// int allbit(int n) { return (1 << n) - 1; }
ll allbit(ll n) { return (1LL << n) - 1; }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
template <class S> void fold_in(vector<S> &v) {}
template <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {
for(auto e : a) v.emplace_back(e);
fold_in(v, tail...);
}
template <class S> void renumber(vector<S> &v) {}
template <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {
for(auto &&e : a) e = lb(v, e);
renumber(v, tail...);
}
template <class S, class... Args> void zip(vector<S> &head, Args &&...args) {
vector<S> v;
fold_in(v, head, args...);
sort(all(v)), v.erase(unique(all(v)), v.end());
renumber(v, head, args...);
}
template<class T> inline bool chmax(T &a, T b){
if(a<b){
a = b;
return true;
}
return false;
}
template<class T> inline bool chmin(T &a, T b){
if(a>b){
a = b;
return true;
}
return false;
}
template<typename T> class segtree {
private:
int n, sz;
vector<T> node;
public:
void init(const vector<T>& v){
sz = (int)v.size();
n = 1;
while(n < sz){
n *= 2;
}
node.assign(2*n, numeric_limits<T>::min());
for(int i = 0; i < sz; i++){
node[i+n] = v[i];
}
for(int i=n-1; i>=1; i--){
node[i] = max(node[2*i], node[2*i+1]);
}
}
void update(int k, const T a)
{
node[k+=n] = a;
while(k>>=1){
node[k] = max(node[2*k], node[2*k+1]);
}
}
T query(int a, int b)
{
T res1 = numeric_limits<T>::min(), res2 = numeric_limits<T>::min();
a += n, b += n;
while(a != b){
if(a % 2) res1 = max(res1, node[a++]);
if(b % 2) res2 = max(res2, node[--b]);
a >>= 1, b >>= 1;
}
return max(res1, res2);
}
void print(){
for(int i = 0; i < sz; i++){
cout << query(i, i+1) << " ";
}
cout << endl;
}
};
//座標の型, 値の型
template<typename CandidateType, typename ValueType> class RangeTree
{
public:
static_assert(std::is_integral<CandidateType>::value, "Integral required.");
private:
using CT = CandidateType;
using VT = ValueType;
using pcc = pair<CT, CT>;
using pci = pair<CT, int>;
int n, sz;
vector<segtree<VT> > seg;
// y座標, x座標
vector<vector<pcc> > yx;
// y座標, x座標
vector<pcc> sorted;
void update_(int id, const CT x, const CT y, const VT val) {
id += n-1;
const int yid = lower_bound(all(yx[id]), pcc(y, x)) - yx[id].begin();
seg[id].update(yid, val);
while(id > 0){
id = (id - 1) / 2;
const int yid = lower_bound(all(yx[id]), pcc(y, x)) - yx[id].begin();
seg[id].update(yid, val);
}
}
VT query(const int lxid, const int rxid, const CT ly, const CT ry, const int k, const int l, const int r) {
if(r <= lxid || rxid <= l) return numeric_limits<VT>::min();
if(lxid <= l && r <= rxid){
const int lyid = lower_bound(all(yx[k]), pcc(ly, numeric_limits<CT>::min())) - yx[k].begin();
const int ryid = upper_bound(all(yx[k]), pcc(ry, numeric_limits<CT>::min())) - yx[k].begin();
return (lyid >= ryid) ? numeric_limits<VT>::min() : seg[k].query(lyid, ryid);
}else{
return max(query(lxid, rxid, ly, ry, 2*k+1, l, (l+r)/2), query(lxid, rxid, ly, ry, 2*k+2, (l+r)/2, r));
}
}
public:
// 座標, 点の値
RangeTree(const vector<pcc>& cand, const vector<VT>& val) : n(1), sz((int)cand.size()), sorted(sz){
while(n < sz) n *= 2;
for(int i = 0; i < sz; ++i){
sorted[i] = {cand[i].first, i};
}
sort(all(sorted), [&](const pcc& a, const pcc& b){
return (a.first == b.first) ? (cand[a.second].second < cand[b.second].second) : (a.first < b.first);
});
yx.resize(2*n-1), seg.resize(2*n-1);
for(int i = 0; i < sz; ++i){
yx[i+n-1] = {{sorted[i].second, sorted[i].first}};
vector<VT> arg = {val[sorted[i].second]};
seg[i+n-1].init(arg);
sorted[i].second = cand[sorted[i].second].second;
}
for(int i = n-2; i >= 0; --i){
yx[i].resize((int)yx[2*i+1].size() + (int)yx[2*i+2].size());
if(yx[i].empty()) continue;
merge(all(yx[2*i+1]), all(yx[2*i+2]), yx[i].begin(), [&](const pcc& a, const pcc& b){
return (cand[a.first].second == cand[b.first].second)
? (a.second < b.second) : (cand[a.first].second < cand[b.first].second);
});
vector<VT> arg((int)yx[i].size());
for(int j = 0; j < (int)yx[i].size(); ++j){
arg[j] = val[yx[i][j].first];
}
seg[i].init(arg);
}
for(int i = 0; i < 2*n-1; ++i){
for(pcc& e : yx[i]){
e.first = cand[e.first].second;
}
}
}
// 点 (x,y) の更新を行う
void update(const CT x, const CT y, const VT val){
const int id = lower_bound(all(sorted), pcc(x, y)) - sorted.begin();
return update_(id, x, y, val);
}
// [lx,rx) × [ly,ry) の長方形領域のクエリに答える
VT query(const CT lx, const CT ly, const CT rx, const CT ry){
const int lxid = lower_bound(all(sorted), pcc(lx, numeric_limits<CT>::min())) - sorted.begin();
const int rxid = upper_bound(all(sorted), pcc(rx, numeric_limits<CT>::min())) - sorted.begin();
return (lxid >= rxid) ? numeric_limits<VT>::min() : query(lxid, rxid, ly, ry, 0, 0, n);
}
};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
INT(n,q);
map<pair<ll,ll>,ll > mp;
set<pair<ll,ll> > st;
rep(i,n){
LL(a,b,c,d,e,f);
ll X = min({a,c,e});
ll Y = max({a,c,e});
ll S = (c-a)*(f-b) - (e-a)*(d-b);
S = abs(S);
st.insert(MP(X,Y));
chmax(mp[MP(X,Y)],S);
}
int m = mp.size();
vector<pair<ll,ll> > cand;
vector<ll> val;
for(auto x:mp){
cand.push_back(x.first);
val.push_back(x.second);
}
vector<pair<pair<ll,ll>,ll> > p;
vector<pair<pair<ll,ll>,ll> > upd;
rep(zz,q){
INT(t);
if(t==1){
LL(a,b,c,d,e,f);
ll X = min({a,c,e});
ll Y = max({a,c,e});
ll S = (c-a)*(f-b) - (e-a)*(d-b);
S = abs(S);
if(st.count(MP(X,Y))==0){
cand.push_back(MP(X,Y));
val.push_back(-1);
st.insert(MP(X,Y));
}
upd.push_back(MP(MP(X,Y),S));
p.push_back(MP(MP(X,Y),upd.size()-1));
}else{
LL(X,Y);
p.push_back(MP(MP(X,Y),-1));
}
}
dbg(cand);
dbg(val);
RangeTree<ll,ll> rt(cand,val);
rep(zz,q){
if(p[zz].second==-1){
dbg(p[zz].first);
ll ans = rt.query(p[zz].first.first,-inf,inf,p[zz].first.second+1);
if(ans<=0){
cout << -1 << "\n";
}else{
cout << ans << "\n";
}
}else{
int id = p[zz].second;
if(chmax(mp[upd[id].first],upd[id].second)){
rt.update(upd[id].first.first,upd[id].first.second,upd[id].second);
}
}
}
return 0;
}