提出 #48393042

---

ソースコード 拡げる

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=2e5+5;
struct node{
	int l,r,dat,lazy1=1,lazy2;
}t[N<<2];
int n,m,mod;
int ksm(int x,int y)
{
	int ret=1,bace=x;
	while(y)
	{
		if(y&1)ret=ret*bace%mod;
		bace=bace*bace%mod;
		y>>=1;
	}
	return ret;
}
void build(int p,int l,int r)
{
	t[p].l=l,t[p].r=r;
	if(l==r)return;
	int mid=l+r>>1;
	build(p<<1,l,mid);
	build(p<<1|1,mid+1,r);
}
void pushup(int p)
{
	t[p].dat=(t[p<<1].dat+t[p<<1|1].dat)%mod;
}
void pushdown(int p)
{
	
	t[p<<1].dat=(t[p<<1].dat*t[p].lazy1+(t[p<<1].r-t[p<<1].l+1)*t[p].lazy2%mod)%mod;
	t[p<<1|1].dat=(t[p<<1|1].dat*t[p].lazy1+(t[p<<1|1].r-t[p<<1|1].l+1)*t[p].lazy2%mod)%mod;
	t[p<<1].lazy1=(t[p<<1].lazy1*t[p].lazy1)%mod;
	t[p<<1|1].lazy1=(t[p<<1|1].lazy1*t[p].lazy1)%mod;
	t[p<<1].lazy2=((t[p<<1].lazy2*t[p].lazy1)%mod+t[p].lazy2)%mod;
	t[p<<1|1].lazy2=((t[p<<1|1].lazy2*t[p].lazy1)%mod+t[p].lazy2)%mod;
	t[p].lazy1=1;
	t[p].lazy2=0;
}
void change1(int p,int l,int r,int k)
{
	if(l<=t[p].l&&r>=t[p].r)
	{
		t[p].dat=(t[p].dat*k)%mod;
		t[p].lazy1=(t[p].lazy1*k)%mod;
		t[p].lazy2=(t[p].lazy2*k)%mod;
		return;
	}
	pushdown(p);
	int mid=t[p].l+t[p].r>>1;
	if(l<=mid)change1(p<<1,l,r,k);
	if(r>mid)change1(p<<1|1,l,r,k);
	pushup(p);
}
void change2(int p,int l,int r,int k)
{
	if(l<=t[p].l&&r>=t[p].r)
	{
		t[p].dat=(t[p].dat+k*(t[p].r-t[p].l+1)%mod)%mod;
		t[p].lazy2=(t[p].lazy2+k)%mod;
		return;
	}
	pushdown(p);
	int mid=t[p].l+t[p].r>>1;
	if(l<=mid)change2(p<<1,l,r,k);
	if(r>mid)change2(p<<1|1,l,r,k);
	pushup(p);
}
int query(int p,int l,int r)
{
	if(l<=t[p].l&&r>=t[p].r)return t[p].dat;
	pushdown(p);
	int ret=0,mid=t[p].l+t[p].r>>1;
	if(l<=mid)ret=(ret+query(p<<1,l,r))%mod;
	if(r>mid)ret=(ret+query(p<<1|1,l,r))%mod;
	return ret;
}
signed main()
{
	scanf("%lld%lld",&n,&m);
	mod=998244353;
	build(1,1,n);
	for(int i=1;i<=n;i++)
	{
		int x;
		scanf("%lld",&x);
		change2(1,i,i,x);
	}
	while(m--)
	{
		int l,r,x,inv;
		scanf("%lld%lld%lld",&l,&r,&x);
		inv=ksm(r-l+1,mod-2);
		change1(1,l,r,(r-l)*inv%mod),change2(1,l,r,inv*x%mod);
	}
	for(int i=1;i<=n;i++)printf("%lld ",query(1,i,i));
	return 0;
}

提出情報

コンパイルエラー

Main.cpp: In function ‘void build(long long int, long long int, long long int)’:
Main.cpp:24:18: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
   24 |         int mid=l+r>>1;
      |                 ~^~
Main.cpp: In function ‘void change1(long long int, long long int, long long int, long long int)’:
Main.cpp:54:23: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
   54 |         int mid=t[p].l+t[p].r>>1;
      |                 ~~~~~~^~~~~~~
Main.cpp: In function ‘void change2(long long int, long long int, long long int, long long int)’:
Main.cpp:68:23: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
   68 |         int mid=t[p].l+t[p].r>>1;
      |                 ~~~~~~^~~~~~~
Main.cpp: In function ‘long long int query(long long int, long long int, long long int)’:
Main.cpp:77:29: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
   77 |         int ret=0,mid=t[p].l+t[p].r>>1;
      |                       ~~~~~~^~~~~~~
Main.cpp: In function ‘int main()’:
Main.cpp:84:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   84 |         scanf("%lld%lld",&n,&m);
      |         ~~~~~^~~~~~~~~~~~~~~~~~
Main.cpp:90:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   90 |                 scanf("%lld",&x);
      |                 ~~~~~^~~~~~~~~~~
Main.cpp:96:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   96 |                 scanf("%lld%lld%lld",&l,&r,&x);
      |                 ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

ジャッジ結果