結果

問題 No.1625 三角形の質問
ユーザー t98slidert98slider
提出日時 2021-11-23 17:44:36
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 3,545 ms / 6,000 ms
コード長 8,725 bytes
コンパイル時間 2,635 ms
コンパイル使用メモリ 194,440 KB
実行使用メモリ 229,440 KB
最終ジャッジ日時 2024-06-25 14:27:49
合計ジャッジ時間 51,762 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 113 ms
20,480 KB
testcase_02 AC 1,239 ms
103,944 KB
testcase_03 AC 952 ms
83,452 KB
testcase_04 AC 811 ms
82,128 KB
testcase_05 AC 1,964 ms
161,456 KB
testcase_06 AC 3,416 ms
226,936 KB
testcase_07 AC 3,516 ms
226,492 KB
testcase_08 AC 3,492 ms
228,788 KB
testcase_09 AC 3,545 ms
229,056 KB
testcase_10 AC 3,398 ms
226,036 KB
testcase_11 AC 3,518 ms
226,876 KB
testcase_12 AC 3,326 ms
229,440 KB
testcase_13 AC 3,440 ms
226,616 KB
testcase_14 AC 3,525 ms
227,132 KB
testcase_15 AC 3,521 ms
222,716 KB
testcase_16 AC 740 ms
170,056 KB
testcase_17 AC 767 ms
162,684 KB
testcase_18 AC 1,965 ms
199,420 KB
testcase_19 AC 945 ms
185,216 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)printf("yes\n");else printf("no\n")
#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")
#define popcount(v) __builtin_popcount(v)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
using namespace std;
using ll = long long;
template<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
const int MOD=1000000007;
const int MOD2=998244353;
const int INF=1<<30;
const ll INF2=1LL<<60;
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}
template<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}
template<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
ll updivide(ll a,ll b){return (a+b-1)/b;}
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}

//2次元セグ木
template <class S, S (*op)(S, S), S (*e)(), class C> struct segtree2D_lite {
    int H;
    std::vector<int> logsize, W;
    std::vector<C> Yc, Xc;
    std::vector<std::vector<C>> pos, Xpos;
    std::vector<std::pair<C, C> > preorder;
    std::vector<std::vector<S>> d;
    segtree2D_lite()  {}
    void insert(C y, C x){
        preorder.emplace_back(y, x);
    }
    void build(){
        for(int i = 0; i < int(preorder.size()) ; i++){
            Yc.push_back(preorder[i].first);
            Xc.push_back(preorder[i].second);
        }
        std::sort(Yc.begin(), Yc.end()), std::sort(Xc.begin(), Xc.end());
        Yc.erase(std::unique(Yc.begin(), Yc.end()), Yc.end());
        Xc.erase(std::unique(Xc.begin(), Xc.end()), Xc.end());
        H = 1 << ceil_pow2(Yc.size());
        pos.resize(2*H), d.resize(2*H), Xpos.resize(2*H);
        logsize.resize(2*H), W.resize(2*H);
        for(int i = 0; i < int(preorder.size()) ; i++){
            int y = std::lower_bound(Yc.begin(), Yc.end(), preorder[i].first) - Yc.begin();
            int x = std::lower_bound(Xc.begin(), Xc.end(), preorder[i].second) - Xc.begin();
            y += H;
            while(y){
                pos[y].push_back(x);
                Xpos[y].push_back(preorder[i].second);
                y >>= 1;
            }
        }
        for(int y = 0; y < int(pos.size()) ; y++){
            std::sort(pos[y].begin(), pos[y].end());
            std::sort(Xpos[y].begin(), Xpos[y].end());
            pos[y].erase(std::unique(pos[y].begin(), pos[y].end()), pos[y].end());
            Xpos[y].erase(std::unique(Xpos[y].begin(), Xpos[y].end()), Xpos[y].end());
            logsize[y] = ceil_pow2(pos[y].size());
            W[y] = 1 << logsize[y] ;
            d[y].resize(2 * W[y] , e());
        }
    }
    void set(C py, C px, S v){
        int y = std::lower_bound(Yc.begin(), Yc.end(), py) - Yc.begin();
        int x = std::lower_bound(Xc.begin(), Xc.end(), px) - Xc.begin();
        y += H;
        while(y){
            int x2 = std::lower_bound(pos[y].begin(), pos[y].end(), x) - pos[y].begin();
            x2 += W[y];
            d[y][x2] =  op(v, d[y][x2]);
            x2 >>= 1;
            while(x2){
                updateX(y, x2);
                x2 >>= 1;
            }
            y >>= 1;
        }
    }
    S get(C py, C px){
        int y = std::lower_bound(Yc.begin(), Yc.end(), py) - Yc.begin();
        int x = std::lower_bound(Xc.begin(), Xc.end(), px) - Xc.begin();
        x = std::lower_bound(pos[y].begin(), pos[y].end(), x) - pos[y].begin();
        return d[y + H][x + W[y]];
    }
    S prod(C lpy, C lpx , C rpy , C rpx){
        int ly = std::lower_bound(Yc.begin(), Yc.end(), lpy) - Yc.begin();
        int ry = std::lower_bound(Yc.begin(), Yc.end(), rpy) - Yc.begin();
        //int lx = std::lower_bound(Xc.begin(), Xc.end(), lpx) - Xc.begin();
        //int rx = std::lower_bound(Xc.begin(), Xc.end(), rpx) - Xc.begin();
        S sml = e(), smr = e();
        ly += H, ry += H ;
        while (ly < ry) {
            if (ly & 1) sml = op(sml, yline_prod(lpx, rpx , ly++));
            if (ry & 1) smr = op(yline_prod(lpx, rpx , --ry), smr);
            ly >>= 1;
            ry >>= 1;
        }
        return op(sml, smr);
    }
    S yline_prod(C lpx, C rpx , int y){
        int lx = std::lower_bound(Xpos[y].begin(), Xpos[y].end(), lpx) - Xpos[y].begin();
        int rx = std::lower_bound(Xpos[y].begin(), Xpos[y].end(), rpx) - Xpos[y].begin();
        S sml = e(), smr = e();
        lx += W[y], rx += W[y] ;
        while (lx < rx) {
            if (lx & 1) sml = op(sml, d[y][lx++]);
            if (rx & 1) smr = op(d[y][--rx], smr);
            lx >>= 1;
            rx >>= 1;
        }
        return op(sml, smr);
    }
    private:
    int ceil_pow2(int n) {
        int x = 0;
        while ((1U << x) < (unsigned int)(n)) x++;
        return x;
    }
    void updateX(int yi, int xi) { d[yi][xi] = op(d[yi][2 * xi], d[yi][2 * xi + 1]); }
};


ll op(ll a,ll b){return max(a,b);}
ll e(){return -1;}

int main(){
    INT(n,q);
    segtree2D_lite<ll,op,e,int> seg;
    vector<array<ll,6>> a(n);
    vector2d(ll,qe,q,1);
    rep(i,n){
        in(a[i]);
        seg.insert(min({a[i][0],a[i][2],a[i][4]}),max({a[i][0],a[i][2],a[i][4]}));
    }
    rep(i,q){
        in(qe[i][0]);
        if(qe[i][0]==1){
            qe[i].resize(7);
            rep(j,6)in(qe[i][j+1]);
            seg.insert(min({qe[i][1],qe[i][3],qe[i][5]}),max({qe[i][1],qe[i][3],qe[i][5]}));
        }else{
            qe[i].resize(3);
            in(qe[i][1],qe[i][2]);
            seg.insert(qe[i][1],qe[i][1]);
            seg.insert(qe[i][2],qe[i][2]);
        }
    }
    seg.build();
    auto f=[&](ll x1,ll y1,ll x2,ll y2,ll x3,ll y3){
        ll dx1=x2-x1,dx2=x3-x1,dy1=y2-y1,dy2=y3-y1;
        return abs(dx1*dy2-dx2*dy1);
    };
    rep(i,n){
        int l=min({a[i][0],a[i][2],a[i][4]});
        int r=max({a[i][0],a[i][2],a[i][4]});
        seg.set(l,r,f(a[i][0],a[i][1],a[i][2],a[i][3],a[i][4],a[i][5]));
    }
    rep(i,q){
        if(qe[i][0]==1){
            int l=min({qe[i][1],qe[i][3],qe[i][5]});
            int r=max({qe[i][1],qe[i][3],qe[i][5]});
            seg.set(l,r,f(qe[i][1],qe[i][2],qe[i][3],qe[i][4],qe[i][5],qe[i][6]));
        }else{
            int l=qe[i][1];
            int r=qe[i][2];
            out(seg.prod(l,l,r+1,r+1));
        }
    }
}
0