#807659 (C++17) No.2101 [Cherry Alpha N] ずっとこの数列だったらいいのに

• 問題: No.2101 [Cherry Alpha N] ずっとこの数列だったらいいのに
• ユーザー: wanui
• 提出日時: 2022-10-15 02:22:13
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 1,374 ms / 6,000 ms
• コード長: 2,838 bytes
• コンパイル時間: 2,412 ms
• コンパイル使用メモリ: 212,932 KB
• 最終ジャッジ日時: 2025-02-08 05:59:54
• ジャッジサーバーID （参考情報）: judge3 / judge5

ファイルパターン	結果
other	AC * 42

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int SQ = 500;
using tii = tuple<int, int, int>;
int main() {
    // 場所ごとに「減り始めるイベント」「減らなくなるイベント」が1回ずつある
    // 地獄のような平方分割
    int N;
    cin >> N;
    vector<int> A(N);
    vector<int> T(N);
    for (int i = 0; i < N; i++) {
        cin >> A[i] >> T[i];
    }
    int Q;
    cin >> Q;
    vector<tii> queries;
    for (int i = 0; i < Q; i++) {
        int d, l, r;
        cin >> d >> l >> r;
        l--;
        r--;
        queries.push_back({d, l, r});
    }
    vector<tii> evt;
    for (int i = 0; i < N; i++) {
        int t = T[i];
        evt.push_back({t, -1, i});
        int t2 = A[i] + T[i] - 1;
        evt.push_back({t2, 1, i});
    }
    for (int i = 0; i < Q; i++) {
        int d, l, r;
        tie(d, l, r) = queries[i];
        evt.push_back({d, 9, i});
    }
    vector<int> i2b(N);
    for (int i = 0; i < N; i++) {
        i2b[i] = (i / SQ);
    }
    int BK = i2b[N - 1] + 1;
    vector<vector<int>> b2i(BK);
    for (int i = 0; i < N; i++) {
        int b = i2b[i];
        b2i[b].push_back(i);
    }
    vector<int> bleft(BK);
    vector<int> bright(BK);
    vector<ll> sum(BK);
    vector<int> diff(BK, 0);
    for (int b = 0; b < BK; b++) {
        ll s = 0;
        for (auto i : b2i[b]) {
            s += A[i];
        }
        sum[b] = s;
        bleft[b] = b2i[b][0];
        bright[b] = b2i[b].back();
    }
    vector<ll> ans(Q);
    int pre_time = 0;
    sort(evt.begin(), evt.end());
    for (auto e : evt) {
        int time, kind, ind;
        tie(time, kind, ind) = e;
        for (int b = 0; b < BK; b++) {
            sum[b] += 1ll * diff[b] * (time - pre_time);
        }
        if (kind == 9) {
            int _d, l, r;
            tie(_d, l, r) = queries[ind];
            ll s = 0;
            for (int b = 0; b < BK; b++) {
                if (l <= bleft[b] && bright[b] <= r) {
                    s += sum[b];
                    continue;
                }
                if (r < bleft[b]) continue;
                if (bright[b] < l) continue;
                for (auto i : b2i[b]) {
                    if (l <= i && i <= r) {
                        ll now = A[i];
                        if (time >= T[i]) {
                            now -= time - T[i] + 1;
                            if (now < 0) now = 0;
                        }
                        s += now;
                    }
                }
            }
            ans[ind] = s;
        } else {
            int d = kind;
            int b = i2b[ind];
            if (d < 0) sum[b]--;
            diff[b] += d;
        }
        pre_time = time;
    }
    for (int q = 0; q < Q; q++) {
        cout << ans[q] << "\n";
    }
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX