#298851 (C++11（廃止可能性あり）) No.255 Splarrraaay ｽﾌﾟﾗｰﾚｪｰｰｲ

• 問題: No.255 Splarrraaay ｽﾌﾟﾗｰﾚｪｰｰｲ
• ユーザー: omochanal
• 提出日時: 2018-11-21 02:38:37
• 言語: C++11（廃止可能性あり） (gcc 13.3.0)
• 結果: AC
• 実行時間: 3,002 ms / 10,000 ms
• コード長: 4,688 bytes
• コンパイル時間: 2,564 ms
• コンパイル使用メモリ: 170,880 KB
• 実行使用メモリ: 132,340 KB
• 最終ジャッジ日時: 2024-12-24 15:53:58
• 合計ジャッジ時間: 31,994 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

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

ソースコード

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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
    cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
    out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
    out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 300010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000000000000000ll + 9;
const ll inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////
vector<ll> vx;
struct segtree { // this is piece of shit. use BIT
    int n; vl sum, lazy, mul;
    void init(int mx) {
        n = 1;
        while(n < mx) n *= 2;
        sum = vl(n * 2, 0);
        mul = vl(n * 2, 1);
        lazy = vl(n * 2, 0);
    }
    segtree(int mx = 0) { init(mx); }
    inline void lazy_eval(int k, int l, int r) {
        int m = (l + r) / 2;
        if(mul[k] != 1 || lazy[k]) {
            MUL(sum[k * 2 + 1], mul[k]);//if range_min, erase (m - l)
            ADD(sum[k * 2 + 1], (vx[m] - vx[l]) * lazy[k]);
            MUL(mul[k * 2 + 1], mul[k]);
            MUL(lazy[k * 2 + 1], mul[k]);
            ADD(lazy[k * 2 + 1], lazy[k]);
            MUL(sum[k * 2 + 2], mul[k]);//if range_min, erase (m - l)
            ADD(sum[k * 2 + 2], (vx[r] - vx[m]) * lazy[k]);
            MUL(mul[k * 2 + 2], mul[k]);
            MUL(lazy[k * 2 + 2], mul[k]);
            ADD(lazy[k * 2 + 2], lazy[k]);
            mul[k] = 1;
            lazy[k] = 0;
        }
    }
    void app(int a, int b, ll s, int k, int l, int r) {
        if(b <= l || r <= a) return;
        if(a <= l && r <= b) {
            MUL(sum[k], s);
            MUL(lazy[k], s);
            MUL(mul[k], s);
            ADD(sum[k], (vx[r] - vx[l]) * s); //here too
            ADD(lazy[k], s);
        }
        else {
            lazy_eval(k, l, r);
            app(a, b, s, k * 2 + 1, l, (l + r) / 2);
            app(a, b, s, k * 2 + 2, (l + r) / 2, r);
            sum[k] = (sum[k * 2 + 1] + sum[k * 2 + 2]) % mod;
        }
    }
    ll ga(int a, int b, int k, int l, int r) {
        if(b <= l || r <= a) return ll();
        if(a <= l && r <= b) return sum[k];
        else {
            lazy_eval(k, l, r);
            ll lv = ga(a, b, k * 2 + 1, l, (l + r) / 2);
            ll rv = ga(a, b, k * 2 + 2, (l + r) / 2, r);
            return (lv + rv) % mod;
        }
    }
    void show() {
        vector<ll> tmp;
        rep(i, 0, n) tmp.push_back(get(i, i + 1));
        debug(tmp);
    }
    ll get(int a, int b) { return ga(a, b, 0, 0, n); } //[a, b)
    void update(int a, int b, ll s) { app(a, b, s, 0, 0, n); } //[a, b)
};
int fd(ll a) {
    return lower_bound(all(vx), a) - vx.begin();
}
ll N, Q;
ll X[MAX_N], L[MAX_N], R[MAX_N];
ll ans[MAX_N];
segtree seg[5];
void solve() {
    cin >> N >> Q;
    rep(i, 0, Q) {
        cin >> X[i] >> L[i] >> R[i]; R[i]++;
        vx.pb(L[i]); vx.pb(R[i]);
    }
    sort(all(vx)); vx.erase(unique(all(vx)), vx.end());
    rep(i, 0, 5) seg[i].init(sz(vx));
    // debug(vx);
    rep(i, 0, Q) {
        // rep(j, 0, 2) {
        //  debug(i, j);
        //  seg[j].show();
        //  // debug(seg[j].zero);
        //  // debug(seg[j].sum);
        //  // debug(seg[j].lazy);
        // }
        int l = fd(L[i]), r = fd(R[i]);
        // debug(l, r, L[i], R[i]);
        if(X[i] == 0) {
            vector<ll> vec(5);
            rep(j, 0, 5) vec[j] = seg[j].get(l, r);
            int at = -1; ll mv = -linf;
            rep(j, 0, 5) {
                if(mv < vec[j]) {
                    at = j; mv = vec[j];
                }
                else if(mv == vec[j]) at = -1;
            }
            if(at != -1) ADD(ans[at], vec[at]);
        }
        else {
            rep(j, 0, 5) {
                if(j == X[i] - 1) seg[j].update(l, r, 1);
                else seg[j].update(l, r, 0);
            }
        }
    }
    rep(j, 0, 5) {
        ADD(ans[j], seg[j].get(0, sz(vx)));
        cout << ans[j] << (j == 4 ? '\n' : ' ');
    }
}
int main() {
#ifndef LOCAL
    ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
    cout.precision(20);
    srand((unsigned int)time(NULL));
#ifdef LOCAL
    //freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif  
    solve();
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX