結果

問題 No.1625 三角形の質問
ユーザー n_vip
提出日時 2021-07-23 23:02:37
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 7,122 bytes
コンパイル時間 2,203 ms
コンパイル使用メモリ 147,880 KB
最終ジャッジ日時 2025-01-23 08:40:41
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 2 WA * 15 RE * 2
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#include<random>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (int)(Y);++(X))
#define reps(X,S,Y) for (int (X) = (int)(S);(X) < (int)(Y);++(X))
#define rrep(X,Y) for (int (X) = (int)(Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (int)(Y)-1;(X) >= (int)(S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl
#define NL <<"\n"
#define cauto const auto
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<class T> using vv=vector<vector<T>>;
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#include "benri.h"
#else
#define out(args...)
#endif
void ouT(ll x,int d=3){auto re=to_string(x);if((int)re.size()>d) re=x>0?"oo":"-oo";cout<<string(d-re.size(),' ')<<re<<",";}
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
template<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;}
template<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;}
template<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;}
template<class T=ll> T read(){ T re; cin>>re; return re;}
template<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;}
template<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return re;}
template<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return re;}
vv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return g;}
vv<int> readG(const int &n){ return readG(n,n-1);}
vv<int> readD(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); } return g;}
vv<int> readD(const int &n){ return readD(n,n-1);}
template<class T> vv<pair<int,T>> readG(const int &n,const int &m){ vv<pair<int,T>> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); cauto c=read
    <T>(); g[a].eb(b,c); g[b].eb(a,c);} return g;}
template<class T> vv<pair<int,T>> readG(const int &n){ return readG<T>(n,n-1);}
template<class T> vv<pair<int,T>> readD(const int &n,const int &m){ vv<pair<int,T>> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); cauto c=read
    <T>(); g[a].eb(b,c); } return g;}
template<class T> vv<pair<int,T>> readD(const int &n){ return readD<T>(n,n-1);}
#ifdef __cpp_init_captures
template<typename T> vector<T> readT(int n, T v){ return readV(n,v);}
template <class... Args> auto readT(int n, Args... args){ vector re(1,readT(args...));rep(_,n-1) re.eb(readT(args...)); return re;}
template<typename T, size_t... Is> void addadd(T& t1, const T& t2, integer_sequence<size_t, Is...>){ cauto l = { (get<Is>(t1) += get<Is>(t2), 0)... }
    ; (void)l;}
template <typename...T>tuple<T...>& operator += (tuple<T...>& lhs, const tuple<T...>& rhs){ addadd(lhs, rhs, index_sequence_for<T...>{});   return 
    lhs;}
template <typename...T>tuple<T...> operator +(tuple<T...> lhs, const tuple<T...>& rhs){ return lhs += rhs;}
template<typename T, size_t... Is> void subsub(T& t1, const T& t2, integer_sequence<size_t, Is...>){ cauto l = { (get<Is>(t1) -= get<Is>(t2), 0)... }
    ; (void)l;}
template <typename...T>tuple<T...>& operator -= (tuple<T...>& lhs, const tuple<T...>& rhs){ subsub(lhs, rhs, index_sequence_for<T...>{});   return 
    lhs;}
template <typename...T>tuple<T...> operator - (tuple<T...> lhs, const tuple<T...>& rhs){ return lhs -= rhs;}
template<class Tuple, size_t... Is> void read_tuple_impl(istream &is, Tuple& t, index_sequence<Is...>){((is >> get<Is>(t)), ...);}
template<class... Args> auto& operator>>(istream &is, tuple<Args...>& t){ read_tuple_impl(is, t, index_sequence_for<Args...>{}); return is;}
#endif
#define TT cauto TTT=read();rep(_,TTT)
const ll MOD=1e9+7; //998244353;
const int nn=412345;
ll bit[nn+1];
ll maxf(int i){++i; //�Ķ��
  ll s=-1;
  while(i>0){
    s=max(s,bit[i]);
    i-=i&-i;
  }return s;
}
void upd(int i,ll val){++i; //��꾮�����Τ˹����������Τ�
  while(i<=nn){
    bit[i]=max(bit[i],val);
    i+=i&-i;
  }
  return;
}
ll area(pii a,pii b){
    return abs(1ll*a.X*b.Y-1ll*a.Y*b.X);
}
int main(){
    fill(bit,bit+nn+1,-1);
    ios_base::sync_with_stdio(false); cin.tie(0);
    cout<<fixed<<setprecision(0);
    cauto n=read();
    cauto q=read();
    vector<tuple<int,int,ll>> ints;
    rep(i,n){
        cauto p=read<pii>();
        cauto q=read<pii>();
        cauto r=read<pii>();
        ints.eb(min({p.X,q.X,r.X}),
                        max({p.X,q.X,r.X}),
                        area(p-r,q-r));
    }
    vector<tuple<int,int,ll>> qs;
    rep(i,q){
        if(read()==1){
            cauto p=read<pii>();
            cauto q=read<pii>();
            cauto r=read<pii>();
            qs.eb(min({p.X,q.X,r.X}),
                        max({p.X,q.X,r.X}),
                        area(p-r,q-r));
        }else{
            cauto l=read(0);
            cauto r=read(0);
            qs.eb(l,r,-1);
        }
    }
    int N;
    {
        vector<int> xs;
        for(cauto &tp:ints){
            xs.eb(get<0>(tp));
            xs.eb(get<1>(tp));
        }
        for(cauto &tp:qs){
            xs.eb(get<0>(tp));
            xs.eb(get<1>(tp));
        }
        sort(all(xs)); UNIQUE(xs);
        N=xs.size();
        for(auto &tp:ints){
            get<0>(tp)=lower_bound(all(xs),get<0>(tp))-xs.begin();
            get<1>(tp)=lower_bound(all(xs),get<1>(tp))-xs.begin();
        }
        for(auto &tp:qs){
            get<0>(tp)=lower_bound(all(xs),get<0>(tp))-xs.begin();
            get<1>(tp)=lower_bound(all(xs),get<1>(tp))-xs.begin();
        }
    }
    vector<ll> re(q,-1);
    vv<int> ad(N),ask(N);
    rep(i,ints.size()) ad[get<0>(ints[i])].eb(i);
    rep(i,qs.size()) ask[get<0>(qs[i])].eb(i);
    rrep(i,N){
        for(cauto &j:ad[i]) upd(get<1>(ints[j]),get<2>(ints[j]));
        // out(i,1);
        // rep(j,10) cout<<maxf(j)<<" "; cout NL;
        for(cauto &j:ask[i]) MX(re[j],maxf(get<1>(ints[j])));
    }
    out(re,1);
    {
        vector<tuple<int,int,ll>> ints;
        rep(i,q){
            cauto &[l,r,a]=qs[i];
            if(a>=0){
                ints.eb(l,r,a);
            }else{
                for(cauto &[L,R,A]:ints)if(l<=L && R<=r) MX(re[i],A);
            }
        }
    }
    rep(i,q)if(get<2>(qs[i])<0) cout<<re[i] NL;
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0