Submission #1567547


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define pb push_back
#define rep(i,x) for(int i=0;i<x;i++)
ll dpa[100005],dpb[100005],a,b,x[1000005],ruia[100005],ruib[100005];
int n;
int la,ra,lb,rb;
int main(){
	scanf("%d%lld%lld",&n,&a,&b);
	for(int i=1;i<=n;i++){
		scanf("%lld",&x[i]);
	}
	dpa[0] = 1; dpb[0] = 1;
	ruia[0] = 1; ruib[0] = 1;
	for(int i=2;i<=n;i++){
		int id = upper_bound(x+1,x+n+1,x[i]-a)-x;
		//[lb,min(rb,id-1)]
		int R = min(rb,id-1);
		if(lb<=R) dpa[i-1] = (ruib[R]-ruib[lb-1]+mod)%mod;
		ruia[i-1] = (ruia[i-2]+dpa[i-1])%mod;
		id = upper_bound(x+1,x+n+1,x[i]-b)-x;
		//[la,min(ra,id-1)]
		R = min(ra,id-1);
		if(la<=R) dpb[i-1] = (ruia[R]-ruia[la-1]+mod)%mod;
		ruib[i-1] = (ruib[i-2]+dpb[i-1])%mod;
		ra++; rb++;
		if(x[i]-x[i-1]<a){
			la = ra;
		}
		if(x[i]-x[i-1]<b){
			lb = rb;
		}
	}
	ll ans = 0;
	for(int i=la;i<=ra;i++) ans+=dpa[i];
	for(int i=lb;i<=rb;i++) ans+=dpb[i];
	cout<<ans%mod<<endl;
}

Submission Info

Submission Time
Task C - Division into Two
User IH19980412
Language C++14 (GCC 5.4.1)
Score 1100
Code Size 1012 Byte
Status AC
Exec Time 30 ms
Memory 7040 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%lld%lld",&n,&a,&b);
                              ^
./Main.cpp:13:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&x[i]);
                      ^

Judge Result

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