提出 #34346244

---

ソースコード 拡げる

#include<bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define db double
#define pb push_back
#define int ll
#define ull unsigned long long
using namespace std;
int n,a[100005],Q;
struct node {
    ll c[3][3],d[3];
    int fa[3];
}t[400005];
void add(int p,int *c) {
    ll c2[3][3],d2[3],fa2[3];for(int i=0;i<3;i++) for(int j=0;j<3;j++) c2[i][j]=0;
    for(int i=0;i<3;i++) d2[i]=0;for(int i=0;i<3;i++) d2[c[i]]+=t[p].d[i];for(int i=0;i<3;i++) t[p].d[i]=d2[i];
    for(int i=0;i<3;i++) {
        for(int j=0;j<3;j++) {
            c2[c[i]][c[j]]+=t[p].c[i][j];
        }
    }for(int i=0;i<3;i++) for(int j=0;j<3;j++) t[p].c[i][j]=c2[i][j];
    for(int i=0;i<3;i++) fa2[i]=c[t[p].fa[i]];for(int i=0;i<3;i++) t[p].fa[i]=fa2[i];
}
void pushdown(int p) {
    add(p<<1,t[p].fa),add(p<<1|1,t[p].fa);
    for(int i=0;i<3;i++) t[p].fa[i]=i;
} 
node merge(node x,node y) {
    node z;for(int i=0;i<3;i++) z.d[i]=x.d[i]+y.d[i],z.fa[i]=i;
    for(int i=0;i<3;i++) for(int j=0;j<3;j++) z.c[i][j]=x.c[i][j]+y.c[i][j]+x.d[i]*y.d[j];
    return z;
}
void build(int p,int l,int r) {
    for(int i=0;i<3;i++) t[p].fa[i]=i;
    if(l==r) {t[p].d[a[l]]++;return;}
    int mid=l+r>>1;build(p<<1,l,mid),build(p<<1|1,mid+1,r);
    t[p]=merge(t[p<<1],t[p<<1|1]);
}
node qry(int p,int l,int r,int ql,int qr) {
    if(ql<=l&&r<=qr) return t[p];
    int mid=l+r>>1;pushdown(p);
    if(qr<=mid) return qry(p<<1,l,mid,ql,qr);
    if(mid<ql) return qry(p<<1|1,mid+1,r,ql,qr);
    return merge(qry(p<<1,l,mid,ql,qr),qry(p<<1|1,mid+1,r,ql,qr));
}
void upd(int p,int l,int r,int ql,int qr,int *c) {
    if(ql<=l&&r<=qr) {add(p,c);return;}
    int mid=l+r>>1;pushdown(p);
    if(ql<=mid) upd(p<<1,l,mid,ql,qr,c);
    if(mid<qr) upd(p<<1|1,mid+1,r,ql,qr,c);
    t[p]=merge(t[p<<1],t[p<<1|1]);
}
signed main() {
    //freopen("fuck.in","r",stdin);
    cin>>n>>Q;
    for(int i=1;i<=n;i++) cin>>a[i];
    build(1,1,n);
    for(int i=0;i<Q;i++) {
        int op,l,r,c[3];
        cin>>op>>l>>r;
        if(op==1) {
            node res=qry(1,1,n,l,r);ll tot=0;
            for(int i=0;i<3;i++) for(int j=0;j<i;j++) tot+=res.c[i][j];
            cout<<tot<<endl;
        }
        else {
            cin>>c[0]>>c[1]>>c[2];
            upd(1,1,n,l,r,c);
        }
    }
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘void add(long long int, long long int*)’:
./Main.cpp:17:5: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
   17 |     for(int i=0;i<3;i++) d2[i]=0;for(int i=0;i<3;i++) d2[c[i]]+=t[p].d[i];for(int i=0;i<3;i++) t[p].d[i]=d2[i];
      |     ^~~
./Main.cpp:17:34: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’
   17 |     for(int i=0;i<3;i++) d2[i]=0;for(int i=0;i<3;i++) d2[c[i]]+=t[p].d[i];for(int i=0;i<3;i++) t[p].d[i]=d2[i];
      |                                  ^~~
./Main.cpp:23:5: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
   23 |     for(int i=0;i<3;i++) fa2[i]=c[t[p].fa[i]];for(int i=0;i<3;i++) t[p].fa[i]=fa2[i];
      |     ^~~
./Main.cpp:23:47: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’
   23 |     for(int i=0;i<3;i++) fa2[i]=c[t[p].fa[i]];for(int i=0;i<3;i++) t[p].fa[i]=fa2[i];
      |                                               ^~~
./Main.cpp: In function ‘void build(long long int, long long int, long long int)’:
./Main.cpp:37:14: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
   37 |     int mid=l+r>>1;build(p<<1,l,mid),build(p<<1|1,mid+1,r);
      |             ~^~
./Main.cpp: In function ‘node qry(long long int, long long int, long long int, long long int, long long int)’:
./Main.cpp:42:14: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
   42 |     int mid=l+r>>1;pushdown(p);
      |             ~^~
./Main.cpp: In function ‘void upd(long long int, long long int, long long int, long long int, long long int, long long int*)’:
./Main.cpp:49:14: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
   49 |     int mid=l+r>>1;pushdown(p);
      |             ~^~

ジャッジ結果