#1151061 (C++17) No.3464 Max and Sum on Grid

• 問題: No.3464 Max and Sum on Grid
• ユーザー: 👑 potato167
• 提出日時: 2026-03-02 18:38:45
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: TLE
• 実行時間: -
• コード長: 5,403 bytes
• コンパイル時間: 1,769 ms
• コンパイル使用メモリ: 238,624 KB
• 実行使用メモリ: 31,572 KB
• 最終ジャッジ日時: 2026-03-02 18:39:50
• 合計ジャッジ時間: 63,564 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
sample	AC * 1
other	TLE * 10

ソースコード

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using pq_ = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(int)(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

namespace po167{
    struct Mo{
        std::vector<int> left,right,order;
        int width,nl,nr,index,_n;
        Mo(int n):nl(0),nr(0),index(0),_n(0){}

        //[l,r)
        void insert(int l,int r){
            // assert(l<=r);
            left.push_back(l);
            right.push_back(r);
        }

        void bulid(){
            width=(int)((double)_n/std::max((double)1,sqrt(2 * (int)(left.size()))));
            width=max(1,width);
            order.resize((int)left.size());
            std::vector<int> order1((int)left.size());
            std::iota(order1.begin(),order1.end(),0);
            auto order2=order1;
            std::sort(order1.begin(),order1.end(),[&](int a,int b){
                if(left[a]/width!=left[b]/width){
                    return left[a]>left[b];
                }
                else if((left[a]/width)&1){
                    return right[a]<right[b];
                }
                return right[a]>right[b];
            });
            std::sort(order2.begin(),order2.end(),[&](int a,int b){
                if((width/2+left[a])/width!=(width/2+left[b])/width){
                    return left[a]>left[b];
                }
                else if(((width/2+left[a])/width)&1){
                    return right[a]<right[b];
                }
                return right[a]>right[b];
            });
            int score1=0,score2=0;
            for(int i=1;i<(int)(left.size());i++){
                score1+=std::abs(left[order1[i]]-left[order1[i-1]]);
                score1+=std::abs(right[order1[i]]-right[order1[i-1]]);
                score2+=std::abs(left[order2[i]]-left[order2[i-1]]);
                score2+=std::abs(right[order2[i]]-right[order2[i-1]]);
            }
            if(score1<score2) order=order1;
            else order=order2;
        }
    };
}
using po167::Mo;

#include <atcoder/segtree>
struct F{
    ll ans = 0;
    ll sumA = 0;
    ll sumB = 0;
    ll cA = 0;
    ll cB = 0;
};

F op(F l, F r){
    l.ans += r.ans;
    l.ans += l.cA * r.sumB;
    l.ans += l.cB * r.sumA;
    l.cA += r.cA;
    l.cB += r.cB;
    l.sumA += r.sumA;
    l.sumB += r.sumB;
    return l;
}
F e(){
    return F{};
}

void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N, Q;
    cin >> N >> Q;
    vector<int> A(N * 2), order(N * 2), inv(N * 2);
    rep(i, 0, N * 2) cin >> A[i], order[i] = i;
    sort(all(order), [&](int l, int r){
        return A[l] < A[r];
    });
    rep(i, 0, N * 2) inv[order[i]] = i;
    atcoder::segtree<F, op, e> seg(N * 2);
    vector<int> X(4 * Q), Y(4 * Q);
    rep(i, 0, Q){
        cin >> X[i * 4] >> Y[i * 4] >> X[i * 4 + 1] >> Y[i * 4 + 1];
        X[i * 4]--;
        Y[i * 4]--;
        X[i * 4 + 2] = X[i * 4];
        Y[i * 4 + 2] = Y[i * 4 + 1];
        X[i * 4 + 3] = X[i * 4 + 1];
        Y[i * 4 + 3] = Y[i * 4];
    }
    vector<ll> ans(Q * 4);
    po167::Mo M(N);
    rep(i, 0, 4 * Q) M.insert(X[i], Y[i]);
    M.bulid();
    int x = 0, y = 0;
    auto add = [&](int a) -> void {
        if (a < N){
            seg.set(inv[a], {0, A[a], 0, 1, 0});
        }
        else{
            seg.set(inv[a], {0, 0, A[a], 0, 1});
        }
    };
    auto del = [&](int a) -> void {
        seg.set(inv[a], e());
    };
    for (auto id : M.order){
        while (x < X[id]) add(x), x++;
        while (y < Y[id]) add(N + y), y++;
        while (x > X[id]) x--, del(x);
        while (y > Y[id]) y--, del(y + N);
        // ans[id] = seg.all_prod().cA * seg.all_prod().cB;
        ans[id] = seg.all_prod().ans;
    }
    rep(i, 0, Q){
        cout << ans[i * 4] + ans[i * 4 + 1] - ans[i * 4 + 2] - ans[i * 4 + 3] << "\n";
    }
}