Submission #1798957

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define re(i,a,b) for(int i=(a);i<(b);i++)
#define repd(i,a,b) for(int i=(a);i>=(b);i--)
#define clr(a) memset(a,0,sizeof(a));
#define il inline
#define sz(a) ((int)a.size())
#define run(x) for(int k=head[x];k;k=e[k].ne)
#define all(a) a.begin(),a.end()
#define mp make_pair
#define pb push_back 
#define w1 first
#define w2 second
#define adm(a,b,c) {a=a+b;if(a>=c)a-=c;else if(a<0)a+=c;}
typedef double db;
typedef long long ll;typedef long double ld;typedef unsigned long long ull;
typedef pair<int,int> pa;
const int N=1e6+5,M=1e7+5,INF=1e9,mod=1e9+7;
const ll linf=1e18;const double eps=1e-8,pi=acos(-1);
il int gmin(int &a,int b){if(a>b)a=b;}il ll gmin(ll &a,ll b){if(a>b)a=b;}il int gmax(int &a,int b){if(a<b)a=b;}il ll gmax(ll &a,ll b){if(a<b)a=b;}
il void read(ll&x){ll f=1,t=0;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){t=t*10+ch-'0';ch=getchar();}x=t*f;}il ll read(ll&x,ll&y){read(x);read(y);}
il void read(int&x){int f=1,t=0;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){t=t*10+ch-'0';ch=getchar();}x=t*f;}il int read(int&x,int&y){read(x);read(y);}
il void read(int&a,int&b,int&c){read(a);read(b);read(c);}il void read(ll&a,ll&b,ll&c){read(a);read(b);read(c);}
il int read(){int x;read(x);return x;}
il ll qpow(ll a,ll b,ll p){ll ret=1;for(;b;b>>=1,a=a*a%p)if(b&1)ret=ret*a%p;return ret;}il ll qpow(ll a,ll b){ll ret=1;for(;b;b>>=1,a=a*a%mod)if(b&1)ret=ret*a%mod;return ret;}
il ll qmul(ll a,ll b,ll p){ll ret=0;for(;b;b>>=1,a=(a<<1)%p)if(b&1)adm(ret,a,p);return ret;}il ll qmul(ll a,ll b){ll ret=0;for(;b;b>>=1,a=(a<<1)%mod)if(b&1)adm(ret,a,mod);return ret;}
il void judge(){
	freopen("data.in","r",stdin);
	freopen("data.out","w",stdout);
}int n,x[N],v[N];
int bit[N],a[N],b[N],c[N];
void ad(int&x,int y){(x+=y)%=mod;}
void add(int x,int val){for(;x<=n;x+=x&(-x))ad(bit[x],val);}
int ask(int x){if(x<0)return 0;int res=1;for(;x;x-=x&(-x))ad(res,bit[x]);return res;}
bool o1(int i,int j){return v[i]<v[j];}
bool o2(pa a,pa b){return a.w2<b.w2||(a.w2==b.w2&&a.w1<b.w1);}
int mx[N],mn[N];
pa f[N];
#define mid (l+r>>1)
int main(){
	read(n);rep(i,1,n)read(x[i],v[i]),a[i]=i;
	sort(a+1,a+1+n,o1);
	rep(i,1,n)a[i]=x[a[i]];
	mx[1]=a[1];rep(i,2,n)mx[i]=max(mx[i-1],a[i]);
	mn[n]=a[n];repd(i,n-1,1)mn[i]=min(mn[i+1],a[i]);
	rep(i,1,n){
		int l=1,r=i,res;
		while(l<=r){
			if(mx[mid]>=a[i])res=mid,r=mid-1;else
				l=mid+1;
		}f[i].w1=res;
		l=i,r=n;while(l<=r){
			if(mn[mid]<=a[i])res=mid,l=mid+1;else
			 r=mid-1;
		}f[i].w2=res;
	}sort(f+1,f+1+n,o2);
	rep(i,1,n)
		add(f[i].w2,(ask(f[i].w2)-ask(f[i].w1-2)+mod)%mod);
	ll res=(ask(n)-ask(n-1)+mod)%mod;
	cout<<res<<endl;
}

Submission Info

Judge Result