Submission #1165257

---

Source Code Expand

#include <bits/stdc++.h>
#define X first
#define Y second
#define mp make_pair
using namespace std;
typedef long long ll;
const int N=100010;
const ll INF=1e18+10;
const int P=1e9+7;
typedef pair<ll,ll> PLL;
int n;
ll A,B,s[N];
map<ll,int> S[2];
map<ll,int>::iterator it;
inline void add(int &x,int y)
{
	x=(x+y)%P;
}
int main()
{
	scanf("%d",&n);
	scanf("%lld%lld",&A,&B);
	//cin>>A>>B;
	for(int i=1;i<=n;i++)
		scanf("%lld",s+i);
	S[0][-INF]=1;
	S[1][-INF]=1;
	int now;
	for(int i=2;i<=n;i++)
	{
		int t1=0,t2=0;
		if(S[0].begin()->X+B<=s[i])
		{
			add(t1,S[0].begin()->Y);
		}
		if(S[1].begin()->X+A<=s[i])
		{
			add(t2,S[1].begin()->Y);
		}
		if(s[i]-A<s[i-1])
		{
			S[0].clear();
		}
		if(s[i]-B<s[i-1])
		{
			S[1].clear();
		}
		add(S[1][s[i-1]],t1);
		add(S[0][s[i-1]],t2);
		if(i<n)
		{
			while(S[0].size()>1)
			{
				it=S[0].begin();
				it++;
				if(it->X+B<=s[i+1])
				{
					add(it->Y,S[0].begin()->Y);
					S[0].erase(S[0].begin());
				}
				else
					break;
			}
		}
		if(i<n)
		{
			while(S[1].size()>1)
			{
				it=S[1].begin();
				it++;
				if(it->X+A<=s[i+1])
				{
					add(it->Y,S[1].begin()->Y);
					S[1].erase(S[1].begin());
				}
				else
					break;
			}
		}
	}
	int ans=0;
	for(it=S[0].begin();it!=S[0].end();it++)
		add(ans,it->Y);
	for(it=S[1].begin();it!=S[1].end();it++)
		add(ans,it->Y);
	cout<<ans<<endl;
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:21:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:22:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld",&A,&B);
                         ^
./Main.cpp:25:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",s+i);
                    ^

Judge Result