提出 #67006318

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define ll long long
#define N 2000010
using namespace std;
ll read(){
	char cc;
	while(1){cc=getchar();if((cc>='0'&&cc<='9')||cc=='-')break;}
	ll sum=0,flag=1;
	cc=='-'?flag=-1:sum=(cc^48);
	while(1){cc=getchar();if(!(cc>='0'&&cc<='9'))break;sum=(sum<<1)+(sum<<3)+(cc^48);}
	return sum*flag;
}
void write(ll x){
	if(!x)putchar('0');
	if(x<0){x=-x;putchar('-');}
	ll cc[25],cntt=0;
	while(x){cc[++cntt]=x%10;x/=10;}
	for(ll i=cntt;i>=1;i--)putchar(cc[i]+'0');
	putchar('\n');
}

const ll mod=998244353;
ll n,cnt=1,t[N][2],f[N],s[N],shu2[N],fa[N],a[N];
char c[N];

int main(){
	shu2[0]=1;
	for(ll i=1;i<=500000;i++)shu2[i]=shu2[i-1]*2%mod;
	n=read();
	for(ll tt=1;tt<=n;tt++){
		scanf("%s",c+1);
		ll p=1;
		ll m=strlen(c+1);
		for(ll i=1;i<=m;i++){
			ll z=(c[i]=='A'?0:1);
			if(!t[p][z]){
				t[p][z]=++cnt;
				fa[cnt]=p;
			}
			p=t[p][z];
		}
		a[p]++;
		while(p){	
			s[p]=s[t[p][0]]+s[t[p][1]]+a[p];
			f[p]=f[t[p][0]]*f[t[p][1]]%mod;
			if(a[p]){
				f[p]=(f[p]+shu2[s[p]-a[p]]*(mod-1+shu2[a[p]])%mod)%mod;
			}
			p=fa[p];
		}	
		write(f[1]);
	}

	return 0;
}

提出情報

コンパイルエラー

Main.cpp: In function ‘int main()’:
Main.cpp:31:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   31 |                 scanf("%s",c+1);
      |                 ~~~~~^~~~~~~~~~

ジャッジ結果