Submission #1985278

---

Source Code Expand

#include <cstdio>
#include <algorithm>

using namespace std;
typedef long long LL;

const int N=2e5+10,Inf=1e9+10,Mod=1e9+7;

struct Node
{
	int x,v,l,r;
	bool operator < ( const Node &A ) const { return r<A.r || (r==A.r && l<A.l); }
}P[N];
int n,f[N],sum[N];

bool cmpv(const Node &A,const Node &B) { return A.v<B.v; }
bool cmpx(const Node &A,const Node &B) { return A.x<B.x; }

void Init()
{
	scanf("%d",&n);
	for (int i=1;i<=n;++i) scanf("%d%d",&P[i].x,&P[i].v);
	sort(P+1,P+n+1,cmpv);
	for (int i=1;i<=n;++i) P[i].v=i;
	sort(P+1,P+n+1,cmpx);
	for (int i=1;i<=n;++i) P[i].x=i;
}

void Solve()
{
	int Mn=Inf;
	for (int i=n;i>=1;--i) 
	{
		Mn=min(Mn,P[i].v);
		P[i].l=Mn;
	}
	int Mx=-Inf;
	for (int i=1;i<=n;++i)
	{
		Mx=max(Mx,P[i].v);
		P[i].r=Mx;
	}
	sort(P+1,P+n+1);int p=1;
	f[0]=1;sum[0]=1;
	for (int i=1;i<=n;++i)
	{
		for (;P[p].r==i && p<=n;++p)
			f[i]=(0ll+f[i]+f[i]+sum[i-1]-sum[P[p].l-1]+f[P[p].l-1]+Mod)%Mod;
		sum[i]=(sum[i-1]+f[i])%Mod;
	}
	printf("%d\n",f[n]);
}

int main()
{
	Init();
	Solve();
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘void Init()’:
./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:54: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (int i=1;i<=n;++i) scanf("%d%d",&P[i].x,&P[i].v);
                                                      ^

Judge Result