Submission #1583226


Source Code Expand

#include <bits/stdc++.h>
#define mod 1000000007
#define N 400010
using namespace std;
typedef long long ll;
inline int read()
{
	int x=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1; ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0'; ch=getchar();}
	return x*f;
}
inline void pls(int &x,int y)
{
	x+=y; if(x>=mod) x-=mod;
	if(x<0) x+=mod; 
}
int n,L[N],R[N],tree[N<<1];
inline void deal(int x,int y,int tp)
{
	if(tp==0) pls(tree[x],y);
	if(tp==1) tree[x]=(tree[x]==0)? y:min(tree[x],y);
	if(tp==2) tree[x]=(tree[x]==0)? y:max(tree[x],y);
}
inline void qury(int &x,int y,int tp)
{
	if(tp==0) pls(x,y);
	if(tp==1) x=(x==0)? y:min(x,y);
	if(tp==2) x=(x==0)? y:max(x,y);
}
inline void add(int x,int y,int tp)
{
	for(;x<=n;x+=(x&-x))
		deal(x,y,tp);
}
inline int ask(int x,int tp)
{
	int ret=0; for(;x;x-=(x&-x))
		qury(ret,x,tp); return ret;
}
pair <int,int> Ps[N]; map <int,int> M;
int V[N],Fs[N];
int main()
{
	n=read(); for(int i=1;i<=n;i++)
		Ps[i].second=read(), Ps[i].first=read(),V[++V[0]]=Ps[i].second;
	sort(V+1,V+1+V[0]);
	for(int i=1;i<=V[0];i++) M[V[i]]=i;
	for(int i=1;i<=V[0];i++) Ps[i].second=M[Ps[i].second];
	sort(Ps+1,Ps+1+n);
	for(int i=1;i<=n;i++)
		L[i]=ask(n-Ps[i].second+1,1),add(n-Ps[i].second+1,i,1);
	for(int i=n;i>=1;i--)
		R[i]=ask(Ps[i].second,2),add(Ps[i].second,i,2);
	int ans=0;
	for(int i=n;i>=1;i--)
	{
		if(R[i]==n) Fs[i]=1;
		else Fs[i]=ask(R[i]+1,0);
		if(L[i]==1) pls(ans,Fs[i]);
		add(L[i],Fs[i],0);
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task E - Mr.Aoki Incubator
User wcz111
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1558 Byte
Status WA
Exec Time 226 ms
Memory 21248 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1200
Status
WA × 2
AC × 3
WA × 33
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 WA 152 ms 21120 KB
02.txt WA 154 ms 21120 KB
03.txt WA 225 ms 21120 KB
04.txt WA 155 ms 21120 KB
05.txt WA 154 ms 21120 KB
06.txt WA 208 ms 21120 KB
07.txt WA 154 ms 21120 KB
08.txt WA 154 ms 21120 KB
09.txt AC 209 ms 21120 KB
10.txt WA 132 ms 21120 KB
11.txt WA 131 ms 21120 KB
12.txt WA 203 ms 21120 KB
13.txt WA 132 ms 21120 KB
14.txt WA 131 ms 21120 KB
15.txt WA 201 ms 21120 KB
16.txt WA 133 ms 21120 KB
17.txt WA 131 ms 21120 KB
18.txt WA 198 ms 21120 KB
19.txt WA 133 ms 21120 KB
20.txt WA 134 ms 21120 KB
21.txt WA 206 ms 21120 KB
22.txt WA 141 ms 21120 KB
23.txt WA 144 ms 21248 KB
24.txt WA 226 ms 21120 KB
25.txt WA 135 ms 21120 KB
26.txt WA 132 ms 21120 KB
27.txt WA 203 ms 21120 KB
28.txt WA 132 ms 21120 KB
29.txt WA 131 ms 21120 KB
30.txt WA 203 ms 21120 KB
31.txt AC 3 ms 8448 KB
32.txt WA 3 ms 8448 KB
33.txt WA 3 ms 8448 KB
34.txt AC 3 ms 8448 KB
s1.txt WA 3 ms 8448 KB
s2.txt WA 3 ms 8448 KB