提出 #25988358

---

ソースコード 拡げる

#include<bits/stdc++.h>
using namespace std;
const int M=998244353,N=1000005,iv2=(M+1)/2;
int n,i,q,ch[N*30][2],tree[N*30],tree2[N*30],j,x,y,k=1;
int a[N];
long long ans,s,s2,sum;
void pushup(int i)
{
	tree[i]=(tree[ch[i][0]]+tree[ch[i][1]])%M;
	tree2[i]=tree2[ch[i][0]]+tree2[ch[i][1]];
}
void modify(int i,int l,int r,int x,int y)
{
	if(l==r)
	{
		s2+=tree2[i];
		tree[i]=(tree[i]+l*y)%M;
		tree2[i]+=y;
		if(y==-1)
			--s2;
		ans=(ans+s2*l*y+s*y)%M;
		return;
	}
	int mid=l+r>>1;
	if(mid>=x)
	{
		if(!ch[i][0])
			ch[i][0]=++k;
		s+=tree[ch[i][1]];
		modify(ch[i][0],l,mid,x,y);
	}
	else
	{
		if(!ch[i][1])
			ch[i][1]=++k;
		s2+=tree2[ch[i][0]];
		modify(ch[i][1],mid+1,r,x,y);
	}
	pushup(i);
}
int main(){
	scanf("%d %d",&n,&q);
	for(i=1;i<=n;++i)
	{
		scanf("%d",&a[i]);
		s=s2=0;
		modify(1,1,1000000000,a[i],1);
		sum+=a[i];
		//cout<<ans<<endl;
	}
	while(q--)
	{
		scanf("%d %d",&x,&y);
		s=s2=0;
		modify(1,1,1000000000,a[x],-1);
		sum-=a[x];
		a[x]=y;
		s=s2=0;
		modify(1,1,1000000000,a[x],1);
		sum+=a[x];
		sum%=M;
		printf("%lld\n",((ans-sum*(n-1)%M*iv2)%M+M)%M);
	}
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘void modify(int, int, int, int, int)’:
./Main.cpp:24:11: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
   24 |  int mid=l+r>>1;
      |          ~^~
./Main.cpp: In function ‘int main()’:
./Main.cpp:42:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   42 |  scanf("%d %d",&n,&q);
      |  ~~~~~^~~~~~~~~~~~~~~
./Main.cpp:45:8: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   45 |   scanf("%d",&a[i]);
      |   ~~~~~^~~~~~~~~~~~
./Main.cpp:53:8: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   53 |   scanf("%d %d",&x,&y);
      |   ~~~~~^~~~~~~~~~~~~~~

ジャッジ結果