Submission #1985299


Source Code Expand

#include <bits/stdc++.h>

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

struct Node{
	int k,x,l,r;
	bool operator < ( const Node &A ) const { return (r<A.r) || ( r==A.r && l<A.l); }
}p[N];

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

int n,f[N],sum[N];

void Init() {
	scanf("%d",&n);
	for (int i=1;i<=n;++i) scanf("%d%d",&p[i].x,&p[i].k);
}

void Solve() {
	std::sort(p+1,p+n+1,cmpk); for (int i=1;i<=n;++i) p[i].k=i;
	std::sort(p+1,p+n+1,cmpx); for (int i=1;i<=n;++i) p[i].x=i;
	int mx=-Inf;
	for (int i=1;i<=n;++i) {
		mx=std::max(mx,p[i].k);
		p[i].r=mx;
	}
	int mn=Inf;
	for (int i=n;i>=1;--i) {
		mn=std::min(mn,p[i].k);
		p[i].l=mn;
	}
	std::sort(p+1,p+n+1);
	f[0]=1; sum[0]=1; int t=1; 
	for (int i=1;i<=n;++i) {
		while (p[t].r==i && t<=n) {
			f[i]=(1ll*f[i]+f[i]+sum[i-1]-sum[p[t].l-1]+f[p[t].l-1])%Mod;
			++t;
		}
		sum[i]=(sum[i-1]+f[i])%Mod;
	}
	printf("%d\n",f[n]);
}

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

Submission Info

Submission Time
Task E - Mr.Aoki Incubator
User Mcallor
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1056 Byte
Status WA
Exec Time 91 ms
Memory 4992 KB

Compile Error

./Main.cpp: In function ‘void Init()’:
./Main.cpp:16:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:17: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].k);
                                                      ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1200
Status
AC × 2
AC × 31
WA × 5
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 90 ms 4224 KB
02.txt AC 90 ms 4224 KB
03.txt AC 91 ms 4224 KB
04.txt AC 90 ms 4224 KB
05.txt AC 90 ms 4224 KB
06.txt AC 90 ms 4224 KB
07.txt AC 90 ms 4224 KB
08.txt AC 91 ms 4224 KB
09.txt AC 80 ms 4864 KB
10.txt AC 67 ms 4096 KB
11.txt AC 68 ms 4992 KB
12.txt AC 80 ms 4992 KB
13.txt AC 67 ms 4864 KB
14.txt WA 70 ms 4864 KB
15.txt WA 80 ms 4864 KB
16.txt AC 67 ms 4992 KB
17.txt AC 69 ms 4992 KB
18.txt AC 81 ms 4864 KB
19.txt AC 67 ms 4992 KB
20.txt AC 69 ms 4864 KB
21.txt WA 82 ms 4992 KB
22.txt WA 72 ms 4864 KB
23.txt WA 72 ms 4992 KB
24.txt AC 81 ms 4992 KB
25.txt AC 72 ms 4224 KB
26.txt AC 69 ms 4224 KB
27.txt AC 80 ms 4352 KB
28.txt AC 71 ms 4224 KB
29.txt AC 69 ms 4608 KB
30.txt AC 80 ms 4736 KB
31.txt AC 1 ms 256 KB
32.txt AC 1 ms 256 KB
33.txt AC 1 ms 256 KB
34.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB