結果

問題 No.2101 [Cherry Alpha N] ずっとこの数列だったらいいのに
ユーザー noya2noya2
提出日時 2023-10-24 19:09:31
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 521 ms / 6,000 ms
コード長 7,258 bytes
コンパイル時間 3,208 ms
コンパイル使用メモリ 271,136 KB
実行使用メモリ 46,192 KB
最終ジャッジ日時 2024-09-24 12:48:03
合計ジャッジ時間 27,738 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 201 ms
20,272 KB
testcase_04 AC 352 ms
33,140 KB
testcase_05 AC 191 ms
20,896 KB
testcase_06 AC 312 ms
30,340 KB
testcase_07 AC 361 ms
33,216 KB
testcase_08 AC 353 ms
33,108 KB
testcase_09 AC 163 ms
17,208 KB
testcase_10 AC 151 ms
16,748 KB
testcase_11 AC 264 ms
26,688 KB
testcase_12 AC 256 ms
26,280 KB
testcase_13 AC 172 ms
18,756 KB
testcase_14 AC 176 ms
21,856 KB
testcase_15 AC 398 ms
37,432 KB
testcase_16 AC 300 ms
28,660 KB
testcase_17 AC 125 ms
16,228 KB
testcase_18 AC 501 ms
45,752 KB
testcase_19 AC 484 ms
46,020 KB
testcase_20 AC 490 ms
46,192 KB
testcase_21 AC 484 ms
45,336 KB
testcase_22 AC 497 ms
45,056 KB
testcase_23 AC 492 ms
45,148 KB
testcase_24 AC 494 ms
45,596 KB
testcase_25 AC 501 ms
45,540 KB
testcase_26 AC 505 ms
44,952 KB
testcase_27 AC 506 ms
45,020 KB
testcase_28 AC 509 ms
45,084 KB
testcase_29 AC 521 ms
45,124 KB
testcase_30 AC 497 ms
45,836 KB
testcase_31 AC 510 ms
45,564 KB
testcase_32 AC 497 ms
45,824 KB
testcase_33 AC 415 ms
43,252 KB
testcase_34 AC 399 ms
43,516 KB
testcase_35 AC 393 ms
42,844 KB
testcase_36 AC 395 ms
43,816 KB
testcase_37 AC 390 ms
43,328 KB
testcase_38 AC 98 ms
25,372 KB
testcase_39 AC 173 ms
24,628 KB
testcase_40 AC 152 ms
33,512 KB
testcase_41 AC 2 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"
namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(vector<T> &v){
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

#line 2 "/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp"

#line 4 "/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp"

namespace noya2{

template<typename T> struct compress {
    vector<T> raws;
    compress(const vector<T> &raws_ = {}) : raws(raws_){ build(); }
    int id(const T &raw){ return lb(raw); }
    T raw(const int &id){ return raws[id]; }
    void build(){ uniq(raws); }
    void add(const T &raw){ raws.push_back(raw); }
    size_t size(){ return raws.size(); }
    int lb(const T &raw){ return lower_bound(all(raws),raw) - raws.begin(); }
    int ub(const T &raw){ return upper_bound(all(raws),raw) - raws.begin(); }
    bool contains(const T &raw){
        int jd = lb(raw);
        if (jd < (int)size()) return raws[jd] == raw;
        return false;
    }
    int contains_id(const T &raw){
        int jd = lb(raw);
        if (jd < (int)size() && raws[jd] == raw) return jd;
        return -1;
    }
};

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/data_structure/fenwick_tree.hpp"

#line 4 "/Users/noya2/Desktop/Noya2_library/data_structure/fenwick_tree.hpp"

namespace noya2{

template <class T> struct fenwick_tree {
  public:
    fenwick_tree() : _n(0) {}
    explicit fenwick_tree(int n) : _n(n), data(n) {}

    void add(int p, T x) {
        assert(0 <= p && p < _n);
        p++;
        while (p <= _n) {
            data[p - 1] += x;
            p += p & -p;
        }
    }

    T sum(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        return sum(r) - sum(l);
    }

  private:
    int _n;
    vector<T> data;

    T sum(int r) {
        T s = 0;
        while (r > 0) {
            s += data[r - 1];
            r -= r & -r;
        }
        return s;
    }
};

} // namespace noya2
#line 5 "c.cpp"

void solve(){
    int n; in(n);
    vector<ll> a(n), b(n);
    rep(i,n) in(a[i],b[i]);
    int q; in(q);
    vector<vector<ll>> query(q,vector<ll>(3)); in(query);
    compress<ll> cp;
    rep(i,n){
        b[i]--;
        cp.add(b[i]);
        cp.add(b[i]+a[i]);
    }
    cp.add(0);
    rep(i,q) cp.add(query[i][0]);
    cp.build();
    vector<vector<pii>> ask(n+1);
    vector<ll> ans(q,0);
    rep(i,q){
        int t = cp.id(query[i][0]);
        query[i][1]--;
        ask[query[i][1]].emplace_back(t,-1-i);
        ask[query[i][2]].emplace_back(t,i);
    }
    fenwick_tree<ll> as(cp.size()), bs(cp.size());
    auto add = [&](ll l, ll r){
        as.add(cp.id(r),-1);
        bs.add(cp.id(r),r);
        as.add(cp.id(l),1);
        bs.add(cp.id(l),-l);
    };
    rep(i,n+1){
        for (auto [t, id] : ask[i]){
            ll A = as.sum(t+1,cp.size());
            ll B = bs.sum(t+1,cp.size());
            int qid = (id < 0 ? -1-id : id);
            ll val = A * query[qid][0] + B;
            if (id < 0) ans[-1-id] -= val;
            else ans[id] += val;
        }
        if (i == n) break;
        add(b[i],b[i]+a[i]);
    }
    rep(i,q) out(ans[i]);
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0