Submission #1987940

---

Source Code Expand

#include<cstdio>
#include<algorithm>
#include<cstring>
#define mo 1000000007
using namespace std;
typedef long long ll;
ll treef[500010],treeg[500010],a[200010];
int tagf[500010],tagg[500010];
inline void pushdown_f(int t)
{
	if (tagf[t]==-1) return;
	treef[t<<1]=0,treef[t<<1|1]=0;
	tagf[t<<1]=0,tagf[t<<1|1]=0;
	tagf[t]=-1;
} 
inline void pushdown_g(int t)
{
	if (tagg[t]==-1) return;
	treeg[t<<1]=0,treeg[t<<1|1]=0;
	tagg[t<<1]=0,tagg[t<<1|1]=0;
	tagg[t]=-1;
}
inline void update_f(int t)
{
	treef[t]=treef[t<<1]+treef[t<<1|1];
	if (treef[t]>=mo) treef[t]-=mo;
}
inline void update_g(int t)
{
	treeg[t]=treeg[t<<1]+treeg[t<<1|1];
	if (treeg[t]>=mo) treeg[t]-=mo;
}
void modify_f(int l,int r,int pos,int t,ll key)
{
	if (l==r)
	{
		treef[t]=key;
		return;
	}
	pushdown_f(t);
	int mid=(l+r)>>1;
	if (pos<=mid) modify_f(l,mid,pos,t<<1,key);
	else modify_f(mid+1,r,pos,t<<1|1,key);
	update_f(t);
}
void modify_g(int l,int r,int pos,int t,ll key)
{
	if (l==r)
	{
		treeg[t]=key;
		return;
	}
	pushdown_g(t);
	int mid=(l+r)>>1;
	if (pos<=mid) modify_g(l,mid,pos,t<<1,key);
	else modify_g(mid+1,r,pos,t<<1|1,key);
	update_g(t);
}
ll query_f(int l,int r,int x,int y,int t)
{
	if (!treef[t]) return 0;
	if (l==x&&y==r) return treef[t];
	pushdown_f(t);
	int mid=(l+r)>>1;
	if (y<=mid) return query_f(l,mid,x,y,t<<1);
	if (x>mid) return query_f(mid+1,r,x,y,t<<1|1);
	return (query_f(l,mid,x,mid,t<<1)+query_f(mid+1,r,mid+1,y,t<<1|1))%mo; 
}
ll query_g(int l,int r,int x,int y,int t)
{
	if (!treeg[t]) return 0;
	if (l==x&&y==r) return treeg[t];
	pushdown_g(t);
	int mid=(l+r)>>1;
	if (y<=mid) return query_g(l,mid,x,y,t<<1);
	if (x>mid) return query_g(mid+1,r,x,y,t<<1|1);
	return (query_g(l,mid,x,mid,t<<1)+query_g(mid+1,r,mid+1,y,t<<1|1))%mo; 
}
int main()
{
	int n;
	ll A,B;
	scanf("%d",&n);
	scanf("%d%d",&A,&B);
	for (int i=1;i<=n;i++)
		scanf("%lld",&a[i]);
	memset(tagf,-1,sizeof(tagf));
	memset(tagg,-1,sizeof(tagg));
	modify_f(0,n,0,1,1);
	modify_g(0,n,0,1,1); 
	for (int i=2;i<=n;i++)
	{
		int pos;
		if (i<=2||a[i]-a[i-2]>=A) pos=i-2;
		else pos=upper_bound(a+1,a+i-1,a[i]-A)-a-1;
		ll G=query_g(0,n,0,pos,1);
		if (i<=2||a[i]-a[i-2]>=B) pos=i-2;
		else pos=upper_bound(a+1,a+i-1,a[i]-B)-a-1;
		ll F=query_f(0,n,0,pos,1);
		if (a[i]-a[i-1]<A)
		{
			treef[1]=0;
			tagf[1]=0;
		}
		if (a[i]-a[i-1]<B)
		{
			treeg[1]=0;
			tagg[1]=0;
		}
		modify_f(0,n,i-1,1,G);
		modify_g(0,n,i-1,1,F);
	}
	ll ans=query_f(0,n,0,n-1,1)+query_g(0,n,0,n-1,1);
	if (ans>=mo) ans-=mo;
	printf("%lld\n",ans);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:84:20: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘ll* {aka long long int*}’ [-Wformat=]
  scanf("%d%d",&A,&B);
                    ^
./Main.cpp:84:20: warning: format ‘%d’ expects argument of type ‘int*’, but argument 3 has type ‘ll* {aka long long int*}’ [-Wformat=]
./Main.cpp:83:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:84:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&A,&B);
                     ^
./Main.cpp:86:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&a[i]);
                      ^

Judge Result