Submission #1987953
Source Code Expand
#include<cstdio>
#include<algorithm>
#include<cstring>
#define mo 1000000007
using namespace std;
typedef long long ll;
ll treef[500010],treeg[500010],a[200010];
int tagf[500010],tagg[500010];
inline void pushdown_f(int t)
{
if (tagf[t]==-1) return;
treef[t<<1]=0,treef[t<<1|1]=0;
tagf[t<<1]=0,tagf[t<<1|1]=0;
tagf[t]=-1;
}
inline void pushdown_g(int t)
{
if (tagg[t]==-1) return;
treeg[t<<1]=0,treeg[t<<1|1]=0;
tagg[t<<1]=0,tagg[t<<1|1]=0;
tagg[t]=-1;
}
inline void update_f(int t)
{
treef[t]=treef[t<<1]+treef[t<<1|1];
if (treef[t]>=mo) treef[t]-=mo;
}
inline void update_g(int t)
{
treeg[t]=treeg[t<<1]+treeg[t<<1|1];
if (treeg[t]>=mo) treeg[t]-=mo;
}
void modify_f(int l,int r,int pos,int t,ll key)
{
if (l==r)
{
treef[t]=key;
return;
}
pushdown_f(t);
int mid=(l+r)>>1;
if (pos<=mid) modify_f(l,mid,pos,t<<1,key);
else modify_f(mid+1,r,pos,t<<1|1,key);
update_f(t);
}
void modify_g(int l,int r,int pos,int t,ll key)
{
if (l==r)
{
treeg[t]=key%mo;
return;
}
pushdown_g(t);
int mid=(l+r)>>1;
if (pos<=mid) modify_g(l,mid,pos,t<<1,key);
else modify_g(mid+1,r,pos,t<<1|1,key);
update_g(t);
}
ll query_f(int l,int r,int x,int y,int t)
{
if (!treef[t]) return 0;
if (l==x&&y==r) return treef[t];
pushdown_f(t);
int mid=(l+r)>>1;
if (y<=mid) return query_f(l,mid,x,y,t<<1);
if (x>mid) return query_f(mid+1,r,x,y,t<<1|1);
return (query_f(l,mid,x,mid,t<<1)+query_f(mid+1,r,mid+1,y,t<<1|1))%mo;
}
ll query_g(int l,int r,int x,int y,int t)
{
if (!treeg[t]) return 0;
if (l==x&&y==r) return treeg[t];
pushdown_g(t);
int mid=(l+r)>>1;
if (y<=mid) return query_g(l,mid,x,y,t<<1);
if (x>mid) return query_g(mid+1,r,x,y,t<<1|1);
return (query_g(l,mid,x,mid,t<<1)+query_g(mid+1,r,mid+1,y,t<<1|1))%mo;
}
int main()
{
int n;
ll A,B;
scanf("%d",&n);
scanf("%lld%lld",&A,&B);
for (int i=1;i<=n;i++)
scanf("%lld",&a[i]);
memset(tagf,-1,sizeof(tagf));
memset(tagg,-1,sizeof(tagg));
modify_f(0,n,0,1,1);
modify_g(0,n,0,1,1);
for (int i=2;i<=n;i++)
{
int pos;
if (i<=2||a[i]-a[i-2]>=A) pos=i-2;
else pos=upper_bound(a+1,a+i-1,a[i]-A)-a-1;
ll G=query_g(0,n,0,pos,1);
if (i<=2||a[i]-a[i-2]>=B) pos=i-2;
else pos=upper_bound(a+1,a+i-1,a[i]-B)-a-1;
ll F=query_f(0,n,0,pos,1);
if (a[i]-a[i-1]<A)
{
treef[1]=0;
tagf[1]=0;
}
if (a[i]-a[i-1]<B)
{
treeg[1]=0;
tagg[1]=0;
}
modify_f(0,n,i-1,1,G);
modify_g(0,n,i-1,1,F);
}
ll ans=query_f(0,n,0,n-1,1)+query_g(0,n,0,n-1,1);
if (ans>=mo) ans-=mo;
printf("%lld\n",ans);
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Division into Two |
User |
vjudge2 |
Language |
C++14 (GCC 5.4.1) |
Score |
1100 |
Code Size |
2510 Byte |
Status |
AC |
Exec Time |
67 ms |
Memory |
12416 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:83:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:84:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld%lld",&A,&B);
^
./Main.cpp:86:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
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 |
64 ms |
12416 KB |
02.txt |
AC |
62 ms |
12416 KB |
03.txt |
AC |
63 ms |
12416 KB |
04.txt |
AC |
62 ms |
12416 KB |
05.txt |
AC |
63 ms |
12416 KB |
06.txt |
AC |
62 ms |
12416 KB |
07.txt |
AC |
63 ms |
12416 KB |
08.txt |
AC |
63 ms |
12416 KB |
09.txt |
AC |
64 ms |
12416 KB |
10.txt |
AC |
63 ms |
12416 KB |
11.txt |
AC |
63 ms |
12416 KB |
12.txt |
AC |
66 ms |
12416 KB |
13.txt |
AC |
63 ms |
12416 KB |
14.txt |
AC |
63 ms |
12416 KB |
15.txt |
AC |
62 ms |
12416 KB |
16.txt |
AC |
52 ms |
12416 KB |
17.txt |
AC |
53 ms |
12416 KB |
18.txt |
AC |
55 ms |
12416 KB |
19.txt |
AC |
48 ms |
12416 KB |
20.txt |
AC |
58 ms |
12416 KB |
21.txt |
AC |
59 ms |
12416 KB |
22.txt |
AC |
52 ms |
12416 KB |
23.txt |
AC |
53 ms |
12416 KB |
24.txt |
AC |
57 ms |
12416 KB |
25.txt |
AC |
62 ms |
12416 KB |
26.txt |
AC |
61 ms |
12416 KB |
27.txt |
AC |
61 ms |
12416 KB |
28.txt |
AC |
60 ms |
12416 KB |
29.txt |
AC |
58 ms |
12416 KB |
30.txt |
AC |
59 ms |
12416 KB |
31.txt |
AC |
56 ms |
12416 KB |
32.txt |
AC |
56 ms |
12416 KB |
33.txt |
AC |
53 ms |
12416 KB |
34.txt |
AC |
48 ms |
12416 KB |
35.txt |
AC |
50 ms |
12416 KB |
36.txt |
AC |
59 ms |
12416 KB |
37.txt |
AC |
60 ms |
12416 KB |
38.txt |
AC |
59 ms |
12416 KB |
39.txt |
AC |
67 ms |
12416 KB |
40.txt |
AC |
56 ms |
12416 KB |
41.txt |
AC |
51 ms |
12416 KB |
42.txt |
AC |
40 ms |
12416 KB |
43.txt |
AC |
66 ms |
12416 KB |
44.txt |
AC |
66 ms |
12416 KB |
45.txt |
AC |
66 ms |
12416 KB |
46.txt |
AC |
66 ms |
12416 KB |
47.txt |
AC |
48 ms |
12416 KB |
48.txt |
AC |
44 ms |
12416 KB |
49.txt |
AC |
3 ms |
8320 KB |
50.txt |
AC |
3 ms |
8320 KB |
51.txt |
AC |
3 ms |
8320 KB |
52.txt |
AC |
3 ms |
8320 KB |
53.txt |
AC |
3 ms |
8320 KB |
54.txt |
AC |
3 ms |
8320 KB |
55.txt |
AC |
3 ms |
8320 KB |
56.txt |
AC |
3 ms |
8320 KB |
57.txt |
AC |
3 ms |
8320 KB |
58.txt |
AC |
3 ms |
8320 KB |
59.txt |
AC |
3 ms |
8320 KB |
60.txt |
AC |
3 ms |
8320 KB |
61.txt |
AC |
3 ms |
8320 KB |
62.txt |
AC |
3 ms |
8320 KB |
63.txt |
AC |
3 ms |
8320 KB |
64.txt |
AC |
3 ms |
8320 KB |
s1.txt |
AC |
3 ms |
8320 KB |
s2.txt |
AC |
3 ms |
8320 KB |
s3.txt |
AC |
3 ms |
8320 KB |
s4.txt |
AC |
3 ms |
8320 KB |