Submission #1801318
Source Code Expand
#include"bits/stdc++.h"
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define iout(x) printf("%d\n",x)
#define lout(x) printf("%lld\n",x)
#define REP(x,l,u) for(int x = (l);x<=(u);x++)
#define RREP(x,l,u) for(int x = (l);x>=(u);x--)
#define mst(x,a) memset(x,a,sizeof(x))
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define MP make_pair
#define se second
#define fi first
#define dbg(x) cout<<#x<<" = "<<(x)<<endl;
#define sz(x) ((int)x.size())
#define cl(x) x.clear()
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
using namespace std;
const int maxn = 200010;
const int mod = 1e9+7;
const int MAX = 1000000010;
const double eps = 1e-6;
const double PI = acos(-1);
template<typename T> inline void read(T &x){
x=0;T f=1;char ch;do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');do x=x*10+ch-'0',ch=getchar();while(ch<='9'&&ch>='0');x*=f;
}
template<typename A,typename B> inline void read(A&x,B&y){read(x);read(y);}
template<typename A,typename B,typename C> inline void read(A&x,B&y,C&z){read(x);read(y);read(z);}
template<typename A,typename B,typename C,typename D> inline void read(A&x,B&y,C&z,D&w){read(x);read(y);read(z);read(w);}
template<typename A,typename B> inline A fexp(A x,B p){A ans=1;for(;p;p>>=1,x=1LL*x*x%mod)if(p&1)ans=1LL*ans*x%mod;return ans;}
template<typename A,typename B> inline A fexp(A x,B p,A mo){A ans=1;for(;p;p>>=1,x=1LL*x*x%mo)if(p&1)ans=1LL*ans*x%mo;return ans;}
int n;
PII A[maxn];
int id[maxn],l[maxn],r[maxn];
struct Node{
int l,r,sm;
}T[maxn<<2];
void build(int i,int l,int r){
T[i].l=l;T[i].r=r;T[i].sm=(l==0);
if(l==r)return;
int M=l+r>>1;
build(i<<1,l,M);build(i<<1|1,M+1,r);
}
int query(int i,int l,int r){
if(l<=T[i].l&&T[i].r<=r)return T[i].sm;
int M=T[i].l+T[i].r>>1,ans=0;
if(l<=M)ans=(ans+query(i<<1,l,r))%mod;
if(r>M)ans=(ans+query(i<<1|1,l,r))%mod;
return ans;
}
void update(int i,int x,int y){
T[i].sm=(T[i].sm+y)%mod;
if(T[i].l==T[i].r)return;
int M=T[i].l+T[i].r>>1;
if(x<=M)update(i<<1,x,y);else update(i<<1|1,x,y);
}
bool cmp(int x,int y){
return A[x].se<A[y].se;
}
void Work(){
sort(A+1,A+n+1);
build(1,0,n);
REP(i,1,n)update(1,A[i].se,query(1,A[i].fi-1,A[i].se));
iout(query(1,n,n));
}
void Init(){
read(n);
REP(i,1,n)read(A[i].se,A[i].fi);
sort(A+1,A+n+1);
REP(i,1,n)id[i]=i;
sort(id+1,id+n+1,cmp);
int mn=n+1;
RREP(i,n,1){
mn=min(mn,id[i]);
l[i]=mn;
}
int mx=0;
REP(i,1,n){
mx=max(mx,id[i]);
r[i]=mx;
}
REP(i,1,n)A[i]=MP(l[i],r[i]);
}
int main(){
Init();
Work();
return 0;
}
Submission Info
Submission Time |
|
Task |
E - Mr.Aoki Incubator |
User |
yanQval |
Language |
C++14 (GCC 5.4.1) |
Score |
1200 |
Code Size |
2780 Byte |
Status |
AC |
Exec Time |
159 ms |
Memory |
13568 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
1200 / 1200 |
Status |
|
|
Set Name |
Test Cases |
Sample |
s1.txt, s2.txt |
All |
01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, s1.txt, s2.txt |
Case Name |
Status |
Exec Time |
Memory |
01.txt |
AC |
137 ms |
13568 KB |
02.txt |
AC |
128 ms |
13568 KB |
03.txt |
AC |
126 ms |
13568 KB |
04.txt |
AC |
159 ms |
13568 KB |
05.txt |
AC |
118 ms |
13568 KB |
06.txt |
AC |
135 ms |
13568 KB |
07.txt |
AC |
136 ms |
13568 KB |
08.txt |
AC |
121 ms |
13568 KB |
09.txt |
AC |
114 ms |
13568 KB |
10.txt |
AC |
81 ms |
13568 KB |
11.txt |
AC |
101 ms |
13568 KB |
12.txt |
AC |
113 ms |
13568 KB |
13.txt |
AC |
102 ms |
13568 KB |
14.txt |
AC |
102 ms |
13568 KB |
15.txt |
AC |
114 ms |
13568 KB |
16.txt |
AC |
102 ms |
13568 KB |
17.txt |
AC |
102 ms |
13568 KB |
18.txt |
AC |
114 ms |
13568 KB |
19.txt |
AC |
101 ms |
13568 KB |
20.txt |
AC |
102 ms |
13568 KB |
21.txt |
AC |
116 ms |
13568 KB |
22.txt |
AC |
106 ms |
13568 KB |
23.txt |
AC |
106 ms |
13568 KB |
24.txt |
AC |
116 ms |
13568 KB |
25.txt |
AC |
126 ms |
13568 KB |
26.txt |
AC |
124 ms |
13568 KB |
27.txt |
AC |
133 ms |
13568 KB |
28.txt |
AC |
129 ms |
13568 KB |
29.txt |
AC |
115 ms |
13568 KB |
30.txt |
AC |
121 ms |
13568 KB |
31.txt |
AC |
2 ms |
4352 KB |
32.txt |
AC |
2 ms |
4352 KB |
33.txt |
AC |
2 ms |
4352 KB |
34.txt |
AC |
2 ms |
4352 KB |
s1.txt |
AC |
2 ms |
4352 KB |
s2.txt |
AC |
2 ms |
4352 KB |