提出 #67003446

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

using ll=long long;

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using P=pair<int,int>;
using vi=vc<int>;
const uint mod=998244353;
struct mint{
	uint v;
	mint(ll vv=0){s(vv%mod+mod);}
	mint& s(uint vv){
		v=vv<mod?vv:vv-mod;
		return *this;
	}
	mint operator-()const{return mint()-*this;}
	mint& operator+=(const mint&r){return s(v+r.v);}
	mint&operator-=(const mint&r){return s(v+mod-r.v);}
	mint&operator*=(const mint&r){v=(unsigned long long)v*r.v%mod;return *this;}
	mint&operator/=(const mint&r){return *this*=r.inv();}
	mint operator+(const mint&r)const{return mint(*this)+=r;}
	mint operator-(const mint&r)const{return mint(*this)-=r;}
	mint operator*(const mint&r)const{return mint(*this)*=r;}
	mint operator/(const mint&r)const{return mint(*this)/=r;}
	mint pow(ll n)const{
		if(n<0)return inv().pow(-n);
		mint res(1),x(*this);
		while(n){
			if(n&1)res*=x;
			x*=x;
			n>>=1;
		}
		return res;
	}
	mint inv()const{return pow(mod-2);}
};
using PM=pair<mint,int>;

vc<mint> tw;
struct node{
    node *l,*r;
    int c,s;
    mint d;
    node():l(NULL), r(NULL), c(0), s(0), d(0){}
    void ref(){
        PM p=PM(0,0), q=PM(0,0);
        if(l!=NULL) p=PM(l->d,l->s);
        if(r!=NULL) q=PM(r->d,r->s);
        s = c+p.b+q.b;
        d = p.a*q.a+(tw[c]-1)*tw[p.b+q.b];
    }
};
node root;

void solve(){
    int n;
    cin>>n;
    tw.resize(n+1);
    tw[0]=1;
    for(int i=1;i<=n;i++) tw[i]=tw[i-1]*2;
    vc<node*> mem(500005);
    for(int i=0;i<n;i++){
        string S;
        cin>>S;
        node *at = &root;
        for(int j=0;j<S.size();j++){
            mem[j]=at;
            if(S[j]=='A'){
                if(at->l==NULL){
                    at->l = new node();
                }
                at = at->l;
            } else{
                if(at->r==NULL){
                    at->r = new node();
                }
                at = at->r;
            }
        }
        at->c++;
        at->ref();
        for(int j=S.size()-1;j>=0;j--){
            mem[j]->ref();
        }
        //cout<<root.d.v<<endl;
        cout<<root.d.v<<endl;
    }
}
int main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	int T=1;
	while(T--) solve();
}

提出情報

コンパイルエラー

./Main.cpp:90:22: warning: comparison of integers of different signs: 'int' and 'size_type' (aka 'unsigned long') [-Wsign-compare]
        for(int j=0;j<S.size();j++){
                    ~^~~~~~~~~
1 warning generated.

ジャッジ結果