Submission #1574480
Source Code Expand
#include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<cstdlib> #include<algorithm> #define ll long long using namespace std; const int mod=1000000007; const int N=100005; int n,k,l,r,ans; ll x,y; int dp1[N],dp2[N],f[2][N],p1[N],p2[N]; ll a[N]; void add(bool b,int x,int y){ for (;x<=n+5;x+=x&-x){ f[b][x]+=y; (f[b][x]>=mod)?f[b][x]-=mod:0; } } int query(bool b,int x){ int s=0; for (;x;x-=x&-x){ s+=f[b][x]; (s>=mod)?s-=mod:0; } return s; } int ask(bool b,int x,int y){ int s; if (x>y) return 0; s=(query(b,y)-query(b,x-1)+mod)%mod; return s; } int main(){ scanf("%d%lld%lld",&n,&x,&y); if (x>y) swap(x,y); for (int i=1;i<=n;i++) scanf("%lld",&a[i]); l=r=n; for (int i=n;i>=1;i--){ if (a[i+1]-a[i]<x) l=i; if (a[i+1]-a[i]<y) r=i; p1[i]=l; p2[i]=r; } for (int i=n;i>1;i--){ if (p2[i]==n) dp1[i]=1; if (p1[i]==n) dp2[i]=1; l=lower_bound(a+1,a+1+n,a[i-1]+x)-a; l=max(l,i+1); r=p2[i]+1; dp1[i]+=ask(1,l,r); (dp1[i]>=mod)?dp1[i]-=mod:0; l=lower_bound(a+1,a+1+n,a[i-1]+y)-a; l=max(l,i+1); r=p1[i]+1; dp2[i]+=ask(0,l,r); (dp2[i]>=mod)?dp2[i]-=mod:0; add(0,i,dp1[i]); add(1,i,dp2[i]); if (p1[1]>=i-1) ans+=dp1[i]; (ans>=mod)?ans-=mod:0; if (p2[1]>=i-1) ans+=dp2[i]; (ans>=mod)?ans-=mod:0; } if (p1[1]==n) ans++; if (p2[1]==n) ans++; ans%=mod; printf("%d\n",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Division into Two |
User | vjudge3 |
Language | C++14 (GCC 5.4.1) |
Score | 1100 |
Code Size | 1377 Byte |
Status | AC |
Exec Time | 44 ms |
Memory | 3328 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:42:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%lld%lld",&n,&x,&y); ^ ./Main.cpp:44:44: 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("%lld",&a[i]); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1100 / 1100 | ||||
Status |
|
|
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 | 43 ms | 3328 KB |
02.txt | AC | 42 ms | 3328 KB |
03.txt | AC | 42 ms | 3328 KB |
04.txt | AC | 41 ms | 3328 KB |
05.txt | AC | 42 ms | 3328 KB |
06.txt | AC | 39 ms | 3328 KB |
07.txt | AC | 43 ms | 3328 KB |
08.txt | AC | 42 ms | 3328 KB |
09.txt | AC | 42 ms | 3328 KB |
10.txt | AC | 43 ms | 3328 KB |
11.txt | AC | 38 ms | 3328 KB |
12.txt | AC | 42 ms | 3328 KB |
13.txt | AC | 42 ms | 3328 KB |
14.txt | AC | 41 ms | 3328 KB |
15.txt | AC | 41 ms | 3328 KB |
16.txt | AC | 28 ms | 3328 KB |
17.txt | AC | 30 ms | 3328 KB |
18.txt | AC | 32 ms | 3328 KB |
19.txt | AC | 32 ms | 3328 KB |
20.txt | AC | 36 ms | 3328 KB |
21.txt | AC | 37 ms | 3328 KB |
22.txt | AC | 32 ms | 3328 KB |
23.txt | AC | 33 ms | 3328 KB |
24.txt | AC | 34 ms | 3328 KB |
25.txt | AC | 40 ms | 3328 KB |
26.txt | AC | 39 ms | 3328 KB |
27.txt | AC | 39 ms | 3328 KB |
28.txt | AC | 38 ms | 3328 KB |
29.txt | AC | 36 ms | 3328 KB |
30.txt | AC | 36 ms | 3328 KB |
31.txt | AC | 35 ms | 3328 KB |
32.txt | AC | 35 ms | 3328 KB |
33.txt | AC | 35 ms | 3328 KB |
34.txt | AC | 31 ms | 3328 KB |
35.txt | AC | 34 ms | 3328 KB |
36.txt | AC | 35 ms | 3328 KB |
37.txt | AC | 36 ms | 3328 KB |
38.txt | AC | 35 ms | 3328 KB |
39.txt | AC | 44 ms | 3328 KB |
40.txt | AC | 31 ms | 3328 KB |
41.txt | AC | 30 ms | 3328 KB |
42.txt | AC | 21 ms | 3328 KB |
43.txt | AC | 42 ms | 3328 KB |
44.txt | AC | 42 ms | 3328 KB |
45.txt | AC | 42 ms | 3328 KB |
46.txt | AC | 42 ms | 3328 KB |
47.txt | AC | 41 ms | 3328 KB |
48.txt | AC | 38 ms | 3328 KB |
49.txt | AC | 1 ms | 256 KB |
50.txt | AC | 1 ms | 256 KB |
51.txt | AC | 1 ms | 256 KB |
52.txt | AC | 1 ms | 256 KB |
53.txt | AC | 1 ms | 256 KB |
54.txt | AC | 1 ms | 256 KB |
55.txt | AC | 1 ms | 256 KB |
56.txt | AC | 1 ms | 256 KB |
57.txt | AC | 1 ms | 256 KB |
58.txt | AC | 1 ms | 256 KB |
59.txt | AC | 1 ms | 256 KB |
60.txt | AC | 1 ms | 256 KB |
61.txt | AC | 1 ms | 256 KB |
62.txt | AC | 1 ms | 256 KB |
63.txt | AC | 1 ms | 256 KB |
64.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |
s4.txt | AC | 1 ms | 256 KB |