Submission #1113402


Source Code Expand

#include<cstdio>
#include<algorithm>
#define MN 110001
#define ll long long
using namespace std;

ll read_p,read_ca;
inline ll read(){
	read_p=0;read_ca=getchar();
	while (read_ca<'0'||read_ca>'9') read_ca=getchar();
	while (read_ca>='0'&&read_ca<='9') read_p=read_p*10+read_ca-48,read_ca=getchar();
	return read_p;
}
const int MOD=1e9+7;
int n,a[MN],b[MN],_a=0,_b=0,mla[MN],mlb[MN],da[MN],db[MN];
ll s[MN],A,B;
inline void M(int &x){while(x>=MOD)x-=MOD;while(x<=0)x+=MOD;}
inline int ask(int x,int v[]){int mmh=0;for(;x;x-=-x&x)M(mmh+=v[x]);return mmh;}
inline int cg(int x,int V,int v[]){M(V);for(;x<=n;x+=-x&x)M(v[x]+=V);}
int main(){
	register int i;
	n=read();A=read();B=read();
	for (i=1;i<=n;i++){
		s[i]=read();
		while (s[i]-s[_a+1]>=A) _a++;
		while (s[i]-s[_b+1]>=B) _b++;
		da[i]=_a;db[i]=_b;
	}
	mla[1]=1;mlb[1]=1;
	for (i=2;i<=n;i++)
	mla[i]=s[i]-s[i-1]>=A?mla[i-1]:i,mlb[i]=s[i]-s[i-1]>=B?mlb[i-1]:i;
	cg(1,1,a);
	cg(1,1,b);
	for (i=2;i<=n;i++){
		if (db[i]+1>=mla[i-1]) _b=ask(db[i]+1,a)-ask(mla[i-1]-1,a);
		if (da[i]+1>=mlb[i-1]) cg(i,ask(da[i]+1,b)-ask(mlb[i-1]-1,b),a);
		if (db[i]+1>=mla[i-1]) cg(i,_b,b);
	}
	printf("%d\n",(ask(n,a)-ask(mla[n]-1,a)+ask(n,b)-ask(mlb[n]-1,b))%MOD);
}

Submission Info

Submission Time
Task C - Division into Two
User swm_sxt
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1243 Byte
Status WA
Exec Time 42 ms
Memory 3328 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1100
Status
AC × 4
AC × 51
WA × 17
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt, s4.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, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt, 55.txt, 56.txt, 57.txt, 58.txt, 59.txt, 60.txt, 61.txt, 62.txt, 63.txt, 64.txt, s1.txt, s2.txt, s3.txt, s4.txt
Case Name Status Exec Time Memory
01.txt AC 42 ms 3328 KB
02.txt WA 38 ms 3328 KB
03.txt AC 39 ms 3328 KB
04.txt WA 36 ms 3328 KB
05.txt AC 34 ms 3328 KB
06.txt WA 31 ms 3328 KB
07.txt AC 39 ms 3328 KB
08.txt WA 38 ms 3328 KB
09.txt AC 39 ms 3328 KB
10.txt WA 39 ms 3328 KB
11.txt AC 26 ms 3328 KB
12.txt AC 32 ms 3328 KB
13.txt WA 38 ms 3328 KB
14.txt WA 38 ms 3328 KB
15.txt WA 35 ms 3328 KB
16.txt AC 14 ms 3328 KB
17.txt AC 16 ms 3328 KB
18.txt AC 19 ms 3328 KB
19.txt AC 20 ms 3328 KB
20.txt WA 30 ms 3328 KB
21.txt AC 32 ms 3328 KB
22.txt AC 18 ms 3200 KB
23.txt AC 24 ms 3328 KB
24.txt AC 29 ms 3328 KB
25.txt AC 36 ms 3328 KB
26.txt WA 35 ms 3328 KB
27.txt WA 35 ms 3328 KB
28.txt WA 33 ms 3328 KB
29.txt WA 31 ms 3328 KB
30.txt AC 31 ms 3328 KB
31.txt WA 29 ms 3328 KB
32.txt WA 28 ms 3328 KB
33.txt WA 26 ms 3328 KB
34.txt WA 20 ms 3328 KB
35.txt AC 22 ms 3200 KB
36.txt AC 21 ms 3328 KB
37.txt AC 26 ms 3328 KB
38.txt AC 23 ms 3328 KB
39.txt AC 36 ms 3328 KB
40.txt AC 16 ms 3328 KB
41.txt AC 15 ms 3328 KB
42.txt AC 6 ms 2560 KB
43.txt AC 32 ms 3328 KB
44.txt AC 32 ms 3328 KB
45.txt AC 33 ms 3328 KB
46.txt AC 32 ms 3328 KB
47.txt AC 33 ms 3328 KB
48.txt AC 33 ms 3328 KB
49.txt AC 0 ms 128 KB
50.txt AC 0 ms 128 KB
51.txt AC 0 ms 128 KB
52.txt AC 0 ms 128 KB
53.txt AC 0 ms 128 KB
54.txt AC 0 ms 128 KB
55.txt AC 0 ms 128 KB
56.txt AC 0 ms 128 KB
57.txt AC 0 ms 128 KB
58.txt AC 0 ms 128 KB
59.txt AC 0 ms 128 KB
60.txt AC 1 ms 128 KB
61.txt AC 0 ms 128 KB
62.txt AC 0 ms 128 KB
63.txt AC 0 ms 128 KB
64.txt AC 1 ms 128 KB
s1.txt AC 0 ms 128 KB
s2.txt AC 0 ms 128 KB
s3.txt AC 0 ms 128 KB
s4.txt AC 0 ms 128 KB