#747753 (C++17) No.255 Splarrraaay ｽﾌﾟﾗｰﾚｪｰｰｲ

• 問題: No.255 Splarrraaay ｽﾌﾟﾗｰﾚｪｰｰｲ
• ユーザー: 沙耶花
• 提出日時: 2022-03-23 17:10:32
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 2,457 bytes
• コンパイル時間: 4,795 ms
• コンパイル使用メモリ: 266,232 KB
• 最終ジャッジ日時: 2025-01-28 11:08:01
• ジャッジサーバーID （参考情報）: judge4 / judge2

ファイルパターン	結果
other	AC * 2 WA * 8

ソースコード

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
#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define Inf 1000000001
struct Data{
    long long cnt[6],sum[6];
    Data(){
        rep(i,6){
            cnt[i] = 0;
            sum[i] = 0;
        }
    }
};
struct D2{
    int color=-1;
    long long num = 0;
    bool f = false;
};
Data op(Data a,Data b){
    rep(i,6){
        a.cnt[i] += b.cnt[i];
        a.sum[i] += b.sum[i];
    }
    return a;
}
Data e(){
    return Data();
}
Data mapping(D2 a,Data b){
    if(a.color==-1)return b;
    if(a.f){
        rep(i,6){
            if(i==a.color)continue;
            b.cnt[a.color] += b.cnt[i];
            b.sum[i] = 0;
            b.cnt[i] = 0;
        }
        b.sum[a.color] = b.cnt[a.color] * a.num;
        
    }
    else{
        //cout<<a.color<<','<<a.num<<endl;
        rep(i,6){
            if(i!=a.color){
                b.cnt[a.color] += b.cnt[i];
                b.cnt[i] = 0;
                b.sum[i] = 0;
            }
        }
        b.sum[a.color] += b.cnt[a.color] * a.num;
    }
    return b;
}
    
D2 composition(D2 a,D2 b){
    
    if(a.color==-1)return b;
    if(b.color==-1)return a;
    if(a.color==b.color){
        a.num += b.num;
        a.f |= b.f;
    }
    else{
        a.f = true;
    }
    return a;
    
}
D2 id(){
    return D2();
}
int main(){
    long long n,q;
    cin>>n>>q;
    
    
    vector<long long> x(q),l(q),r(q);
    vector<long long> t;
    t.push_back(0);
    t.push_back(n);
    rep(i,q){
        cin>>x[i]>>l[i]>>r[i];
        //l[i]--;//,r[i]--;
        r[i]++;
        t.push_back(l[i]);
        t.push_back(r[i]);
    }
    sort(t.begin(),t.end());
    t.erase(unique(t.begin(),t.end()),t.end());
    rep(i,q){
        l[i] = distance(t.begin(),lower_bound(t.begin(),t.end(),l[i]));
        r[i] = distance(t.begin(),lower_bound(t.begin(),t.end(),r[i]));
    }
    lazy_segtree<Data,op,e,D2,mapping,composition,id> seg;
    {
        vector<Data> temp(t.size()-1);
        rep(i,temp.size()){
            Data x;
            x.cnt[0] = t[i+1] - t[i];
            temp[i] = x;
        }
        seg = lazy_segtree<Data,op,e,D2,mapping,composition,id>(temp);
    }
        
    vector<__int128> ans(6,0);
    rep(i,q){
        if(x[i]!=0){
            D2 tt;
            tt.color = x[i];
            tt.num = 1;
            seg.apply(l[i],r[i],tt);
        }
        else{
            auto ret = seg.prod(l[i],r[i]);
            long long m = -1;
            for(int j=1;j<6;j++){
                m = max(m,ret.sum[j]);
            }
            int c = 0;
            for(int j=1;j<6;j++){
                if(m==ret.sum[j])c++;
            }
            if(c==1){
                for(int j=1;j<6;j++){
                    if(m==ret.sum[j]){
                        ans[j] += m;
                    }
                }
            }
        }
    }
    long long MM = 1000000000000000009;
    auto ret = seg.all_prod();
    
    rep(j,6)ans[j] += ret.sum[j];
    for(int i=1;i<6;i++){
        if(i!=1)cout<<' ';
        cout<<((long long)(ans[i]%MM));
    }
    cout<<endl;
    
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX