結果

問題 No.3214 small square
ユーザー Cafe1942
提出日時 2025-07-23 00:37:53
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 560 ms / 3,000 ms
コード長 7,272 bytes
コンパイル時間 1,812 ms
コンパイル使用メモリ 134,436 KB
実行使用メモリ 35,556 KB
最終ジャッジ日時 2025-07-25 21:18:34
合計ジャッジ時間 17,442 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <iomanip>//小数点出力用
//cout << fixed << setprecision(10) << ans;
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
using ll = long long;
using namespace std;
#define modPHash (ll)((1LL<<61)-1)
#define modP (ll)998244353
bool chkrng0idx(int pos, int sup) { return (0 <= pos && pos < sup); }
int clk4(int num) { return (num - 2) * (num % 2); }
void yn(bool tf) { cout << (tf ? "Yes\n" : "No\n"); }
#define segL (1 << 19)
#define lazyValueEmpty -4611686018427387904
ll segT[segL * 2];
ll lazySeg[segL * 2];

int c2(int X) {
    int res = 0;
    int t = X;
    if (t == 0)t = segL;
    while (1) {
        if (t % 2 == 0) {
            t /= 2;
            res++;
        }
        else {
            break;
        }
    }
    return res;
}

void lazydiv(const int L, const int R, int id, int interL, int interR) {
    if (lazySeg[id] != lazyValueEmpty) {
        if (!(L <= interL && interR <= R)) {
            if (lazySeg[2 * id] == lazyValueEmpty)lazySeg[2 * id] = lazySeg[id];
            else lazySeg[2 * id] += lazySeg[id];
            if (lazySeg[2 * id + 1] == lazyValueEmpty)lazySeg[2 * id + 1] = lazySeg[id];
            else lazySeg[2 * id + 1] += lazySeg[id];
            segT[2 * id] += lazySeg[id];
            segT[2 * id + 1] += lazySeg[id];
            lazySeg[id] = lazyValueEmpty;
        }

    }
    if (!(L <= interL && interR <= R)) {
        if (interR - interL > 1) {
            if (L < (interL + interR) / 2) {
                lazydiv(L, R, 2 * id, interL, (interL + interR) / 2);
            }
            if ((interL + interR) / 2 < R) {
                lazydiv(L, R, 2 * id + 1, (interL + interR) / 2, interR);
            }
        }
    }
}

void upperupdate(const int L, const int R, int id, int interL, int interR) {
    if (!(L <= interL && interR <= R)) {
        if (interR - interL > 1) {
            if (L < (interL + interR) / 2) {
                upperupdate(L, R, 2 * id, interL, (interL + interR) / 2);
            }
            if ((interL + interR) / 2 < R) {
                upperupdate(L, R, 2 * id + 1, (interL + interR) / 2, interR);
            }
        }
        segT[id] = max(segT[2 * id], segT[2 * id + 1]);
    }
}

void addR(int L, int R, ll X) {
    lazydiv(L, R, 1, 0, segL);
    int tL = L;
    while (tL != R) {
        int b = c2(tL);
        for (;b >= 0;b--) {
            if (tL + (1 << b) <= R) {
                int segIdx = (tL + segL) >> b;
                if (lazySeg[segIdx] == lazyValueEmpty)lazySeg[segIdx] = X;
                else lazySeg[segIdx] += X;
                segT[segIdx] += X;
                tL += (1 << b);
                break;
            }
        }
    }
    upperupdate(L, R, 1, 0, segL);
}

ll getM(int L, int R) {
    lazydiv(L, R, 1, 0, segL);
    ll res = 0;
    int tL = L;
    while (tL != R) {
        int b = c2(tL);
        for (;b >= 0;b--) {
            if (tL + (1 << b) <= R) {
                int segIdx = (tL + segL) >> b;
                res = max(res, segT[segIdx]);
                tL += (1 << b);
                break;
            }
        }
    }
    return res;
}


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    for (int i = 0;i < segL * 2;i++) {
        lazySeg[i] = lazyValueEmpty;
    }
    int N;
    ll A;
    cin >> N >> A;
    A *= 2;
    vector<pair<pair<ll, ll>, ll>>V(N);
    vector<ll>posX(N), posY(N);
    for (int i = 0;i < N;i++) {
        cin >> V[i].first.first >> V[i].first.second >> V[i].second;
        V[i].first.first *= 2;
        V[i].first.second *= 2;
        posX[i] = V[i].first.first;
        posY[i] = V[i].first.second;
    }
    sort(posX.begin(), posX.end());
    sort(posY.begin(), posY.end());
    posX.push_back(123456789123456789);
    posY.push_back(123456789123456789);
    ll nowL = -((ll)(2e9)) - A - 2;
    ll nowR = -((ll)(2e9)) - 2;
    vector<pair<ll, ll>>interX;
    interX.push_back({ -((ll)(2e9)) - A - 2, -((ll)(2e9)) - 2 });
    while (1) {
        auto itrL = lower_bound(posX.begin(), posX.end(), nowL);
        auto itrR = upper_bound(posX.begin(), posX.end(), nowR);
        bool flg = 0;
        if (itrL == itrR) {
            if ((*itrR) == 123456789123456789) {
                break;
            }
            ll delta = (*itrR) - nowR;
            nowL += delta;
            nowR += delta;
        }
        else {
            ll deltaR = (*itrR) - nowR;
            ll deltaL = (*itrL) - nowL + 1;
            if (deltaL < deltaR) {
                nowL += deltaL;
                nowR += deltaL;
            }
            else {
                nowL += deltaR;
                nowR += deltaR;
            }
            if (deltaL == deltaR) {
                flg = 1;
            }
        }
        if (flg) {
            interX.push_back({ nowL - 1,nowR - 1});
            interX.push_back({ nowL,nowR });
            interX.push_back({ nowL + 1,nowR + 1});
        }
        else {
            interX.push_back({ nowL,nowR });
        }
    }
    nowL = -((ll)(2e9)) - A - 2;
    nowR = -((ll)(2e9)) - 2;
    vector<pair<ll, ll>>interY;
    interY.push_back({ -((ll)(2e9)) - A - 2, -((ll)(2e9)) - 2 });
    while (1) {
        auto itrL = lower_bound(posY.begin(), posY.end(), nowL);
        auto itrR = upper_bound(posY.begin(), posY.end(), nowR);
        bool flg = 0;
        if (itrL == itrR) {
            if ((*itrR) == 123456789123456789) {
                break;
            }
            ll delta = (*itrR) - nowR;
            nowL += delta;
            nowR += delta;
        }
        else {
            ll deltaR = (*itrR) - nowR;
            ll deltaL = (*itrL) - nowL + 1;
            if (deltaL < deltaR) {
                nowL += deltaL;
                nowR += deltaL;
            }
            else {
                nowL += deltaR;
                nowR += deltaR;
            }
            if (deltaL == deltaR) {
                flg = 1;
            }
        }
        if (flg) {
            interY.push_back({ nowL - 1,nowR - 1 });
            interY.push_back({ nowL,nowR });
            interY.push_back({ nowL + 1,nowR + 1 });
        }
        else {
            interY.push_back({ nowL,nowR });
        }
    }
    unordered_map<ll, pair<ll, ll>>M;
    int Lid = 0;
    int Rid = 0;
    for (int i = 0;i < interY.size();i++) {
        while (Rid != posY.size() && posY[Rid] <= interY[i].second) {
            M[posY[Rid]] = make_pair(i, -1);
            Rid++;
        }
        while (Lid != posY.size() && posY[Lid] < interY[i].first) {
            M[posY[Lid]].second = i;
            Lid++;
        }
    }
    sort(V.begin(), V.end());
    ll ans = 0;
    Lid = 0;
    Rid = 0;
    for (int i = 0;i < interX.size();i++) {
        while (Rid != V.size() && V[Rid].first.first <= interX[i].second) {
            addR(M[V[Rid].first.second].first, M[V[Rid].first.second].second, V[Rid].second);
            Rid++;
        }
        while (Lid != V.size() && V[Lid].first.first < interX[i].first) {
            addR(M[V[Lid].first.second].first, M[V[Lid].first.second].second, -1LL * V[Lid].second);
            Lid++;
        }
        ans = max(ans, getM(0, segL));
    }
    cout << ans;
    return 0;
}
0