#315372 (C++14) No.789 範囲の合計

• 問題: No.789 範囲の合計
• ユーザー: Shuz*
• 提出日時: 2019-02-08 22:12:01
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 87 ms / 1,000 ms
• コード長: 8,169 bytes
• コンパイル時間: 1,752 ms
• コンパイル使用メモリ: 177,104 KB
• 実行使用メモリ: 7,288 KB
• 最終ジャッジ日時: 2024-07-01 11:33:29
• 合計ジャッジ時間: 3,390 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	3 ms; 5,376 KB
testcase_02	AC	86 ms; 6,956 KB
testcase_03	AC	73 ms; 6,956 KB
testcase_04	AC	83 ms; 7,152 KB
testcase_05	AC	66 ms; 7,036 KB
testcase_06	AC	69 ms; 7,088 KB
testcase_07	AC	58 ms; 6,896 KB
testcase_08	AC	68 ms; 7,288 KB
testcase_09	AC	60 ms; 7,156 KB
testcase_10	AC	87 ms; 6,584 KB
testcase_11	AC	58 ms; 7,188 KB
testcase_12	AC	54 ms; 7,060 KB
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	3 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;

/*
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using cint = cpp_int;
*/

// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
const ll inf = 1 << 30;
// const ll INF = LONG_MAX;
const ll INF = 1LL << 60;
const ull MAX = ULONG_MAX;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define endl '\n'
#define space ' '
#define def inline auto
#define func inline constexpr ll
#define run(a) __attribute__((constructor)) def _##a()
#define all(v) begin(v), end(v)
#define input(a) scanf("%lld", &(a))
#define print(a) printf("%lld\n", (a))
#define fi first
#define se second
#define ok(a, b) (0 <= (a) && (a) < (b))
template <class T> using vvector = vector<vector<T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;

// Debug
#define debug(...)                                                             \
    {                                                                          \
        cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ";                     \
        for (auto &&X : {__VA_ARGS__}) cerr << "[" << X << "] ";               \
        cerr << endl;                                                          \
    }

#define dump(a, h, w)                                                          \
    {                                                                          \
        cerr << __LINE__ << ": " << #a << " = [" << endl;                      \
        rep(__i, h) {                                                          \
            rep(__j, w) cerr << a[__i][__j] << space;                          \
            cerr << endl;                                                      \
        }                                                                      \
        cerr << "]" << endl;                                                   \
    }

#define vdump(a, n)                                                            \
    {                                                                          \
        cerr << __LINE__ << ": " << #a << " = [";                              \
        rep(__i, n) if (__i) cerr << space << a[__i];                          \
        else cerr << a[__i];                                                   \
        cerr << "]" << endl;                                                   \
    }

struct edge {
    ll to, cost;
    edge(ll a, ll b) : to(a), cost(b) {}
};

struct position {
    ll x, y;
    position() {}
    position(ll a, ll b) : x(a), y(b) {}
    position next(ll i) { return {x + dx[i], y + dy[i]}; }
    ll mdist() { return abs(x) + abs(y); }
    double dist() { return sqrt(x * x + y * y); }
    double norm(ll d) {
        if (d == inf) return max(x, y);
        if (d == 1) return mdist();
        if (d == 2) return dist();
        return 0;
    }
    ll num(ll width) { return abs(x) * width + abs(y); }

    bool operator==(position a) { return x == a.x && y == a.y; }
    bool operator!=(position a) { return x != a.x || y != a.y; }
    bool operator<(position a) { return x < a.x && y < a.y; }
    bool operator>(position a) { return x > a.x && y > a.y; }
    bool operator<=(position a) { return x <= a.x && y <= a.y; }
    bool operator>=(position a) { return x >= a.x && y >= a.y; }
    position operator+(position a) { return position(x + a.x, y + a.y); }
    position operator-(position a) { return position(x - a.x, y - a.y); }
    position operator*(position a) { return position(x * a.x, y * a.y); }
    position operator/(position a) { return position(x / a.x, y / a.y); }
    position operator%(position a) { return position(x % a.x, y % a.y); }
    position complex(position a) {
        return position(x * a.x - y * a.y, x * a.y + y * a.x);
    }
    /*
        // for sort:
        bool operator<(position a) { return x ^ a.x ? x < a.x : y < a.y; }
        bool operator>(position a) { return x ^ a.x ? x > a.x : y > a.y; }
        bool operator<=(position a) { return x ^ a.x ? x < a.x : y <= a.y; }
        bool operator>=(position a) { return x ^ a.x ? x > a.x : y >= a.y; }
    */
};
position Origin = position(0, 0);
using pos = position;
using vec = position;

struct Range {
    ll left, right;
    Range() {}
    Range(ll l, ll r) : left(l), right(r) {}
    ll length() { return right - left; }
    bool operator==(Range A) { return left == A.left && right == A.right; }
    bool operator!=(Range A) { return !(Range(left, right) == A); }
    bool operator>(Range A) { return left < A.left && right > A.right; }
    bool operator<(Range A) { return left > A.left && right < A.right; }
    bool operator>=(Range A) { return left <= A.left && right >= A.right; }
    bool operator<=(Range A) { return left >= A.left && right <= A.right; }
};

// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)
#define loop() for (;;)

// Stream
#define fout(n) cout << fixed << setprecision(n)
#define fasten cin.tie(0), ios::sync_with_stdio(0)

// Speed
run(0) { fasten, fout(10); }
#pragma GCC optimize("O3")
#pragma GCC target("avx")

// Math
//#define gcd __gcd
func gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
func lcm(ll a, ll b) { return a * b / gcd(a, b); }
func sign(ll a) { return a ? abs(a) / a : 0; }

template <class T> def in() {
    T A;
    cin >> A;
    return A;
}

template <class T>
def out(vector<vector<T>> A, ll H, ll W, char divc = space, char endc = endl) {
    rep(i, H) {
        rep(j, W) {
            if (j)
                cout << divc << A[i][j];
            else
                cout << A[i][j];
        }
        cout << endc;
    }
}

static const int MAX_SIZE = 1 << 20; // segment tree のサイズ。 2^17 ≒ 1.3 *
                                     // 10^5

typedef long long Int;
Int all[2 * MAX_SIZE - 1], part[2 * MAX_SIZE - 1]; // segment tree

//区間[a, b)に値xを加算する.
void add(int a, int b, int x, int k = 0, int l = 0, int r = MAX_SIZE) {
    if (a <= l && r <= b) { //[l, r)が[a, b)に完全に内包されていれば
        all[k] += x; //[l, r)の全ての区間が持つ値としてxを足す.
    } else if (l < b && a < r) { //[l, r)と[a, b)が交差していれば
        part[k] += (min(b, r) - max(a, l)) *
                   x; //交差している分の値を, 部分的な和を持つノードに加算する.
        add(a, b, x, k * 2 + 1, l, (l + r) / 2); //子でも同じ処理を行う.
        add(a, b, x, k * 2 + 2, (l + r) / 2, r); //〃.
    }
}

Int sum(int a, int b, int k = 0, int l = 0, int r = MAX_SIZE) {
    if (b <= l || r <= a) { //[a, b)と[l, r)が全く交差しない場合
        return (0);
    } else if (a <= l && r <= b) { //完全に内包されていれば
        return (all[k] * (r - l) + part[k]);
    } else { //[l, r)と[a, b)が交差していれば
        ll res;
        res = (min(b, r) - max(a, l)) *
              all[k]; //そのノードの全ての要素が持つ値のうち, [a,
                      // b)に属すものの分だけを加算する.
        res += sum(a, b, k * 2 + 1, l, (l + r) / 2); //子ノードで和を求める.
        res += sum(a, b, k * 2 + 2, (l + r) / 2, r); //〃
        return (res);
    }
}

signed main() {
    ll N;
    cin >> N;
    ll res = 0, A[N], B[N], C[N];
    vector<ll> at;
    rep(i, N) {
        cin >> A[i] >> B[i] >> C[i];
        if (!A[i]) at.pb(B[i]);
    }
    sort(all(at));
    ll S = at.size();
    rep(i, N) {
        if (A[i]) {
            ll l = lower_bound(all(at), B[i]) - at.begin();
            ll r = lower_bound(all(at), C[i] + 1) - at.begin();
            res += sum(l, r);

        } else {
            ll l = lower_bound(all(at), B[i]) - at.begin();
            add(l, l + 1, C[i]);
        }
    }
    cout << res << endl;
}

// for compilation: g++ -Ofast -march=native -o _ _.cpp -std=c++17