Submission #1776804
Source Code Expand
#include"bits/stdc++.h"
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define iout(x) printf("%d\n",x)
#define lout(x) printf("%lld\n",x)
#define REP(x,l,u) for(ll x = (l);x<=(u);x++)
#define RREP(x,l,u) for(ll x = (l);x>=(u);x--)
#define mst(x,a) memset(x,a,sizeof(x))
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define MP make_pair
#define se second
#define fi first
#define dbg(x) cout<<#x<<" = "<<(x)<<endl;
#define sz(x) ((int)x.size())
#define cl(x) x.clear()
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
using namespace std;
const int maxn = 100010;
const int mod = 1e9+7;
const int MAX = 1000000010;
const double eps = 1e-6;
const double PI = acos(-1);
template<typename T> inline void read(T &x){
x=0;T f=1;char ch;do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');do x=x*10+ch-'0',ch=getchar();while(ch<='9'&&ch>='0');x*=f;
}
template<typename A,typename B> inline void read(A&x,B&y){read(x);read(y);}
template<typename A,typename B,typename C> inline void read(A&x,B&y,C&z){read(x);read(y);read(z);}
template<typename A,typename B,typename C,typename D> inline void read(A&x,B&y,C&z,D&w){read(x);read(y);read(z);read(w);}
template<typename A,typename B> inline A fexp(A x,B p){A ans=1;for(;p;p>>=1,x=1LL*x*x%mod)if(p&1)ans=1LL*ans*x%mod;return ans;}
template<typename A,typename B> inline A fexp(A x,B p,A mo){A ans=1;for(;p;p>>=1,x=1LL*x*x%mo)if(p&1)ans=1LL*ans*x%mo;return ans;}
int n;
ll A,B,S[maxn];
int sm[maxn*42],ls[maxn*42],rs[maxn*42],sz;
int f[maxn],g[maxn];
void update(int x,int& y,int l,int r,int t,int v){
sm[y=++sz]=(sm[x]+v)%mod;ls[y]=ls[x];rs[y]=rs[x];
if(l==r)return;
int M=l+r>>1;
if(t<=M)update(ls[x],ls[y],l,M,t,v);else update(rs[x],rs[y],M+1,r,t,v);
}
int query(int x,int l,int r,int L,int R){
if(!x)return 0;
if(L<=l&&r<=R)return sm[x];
int M=l+r>>1,ans=0;
if(L<=M)ans=query(ls[x],l,M,L,R);
if(r>M)ans=(ans+query(rs[x],M+1,r,L,R))%mod;
return ans;
}
void Work(){
update(f[1],f[1],0,n,0,1);update(g[1],g[1],0,n,0,1);
REP(i,2,n){
if(S[i]-S[i-1]>=A)f[i]=f[i-1];
if(S[i]-S[i-1]>=B)g[i]=g[i-1];
int x;
x=upper_bound(S+1,S+n+1,S[i]-A)-S-1;
update(f[i],f[i],0,n,i-1,query(g[i-1],0,n,0,x));
x=upper_bound(S+1,S+n+1,S[i]-B)-S-1;
update(g[i],g[i],0,n,i-1,query(f[i-1],0,n,0,x));
}
int ans=(query(f[n],0,n,0,n)+query(g[n],0,n,0,n))%mod;
iout(ans);
}
void Init(){
read(n,A,B);
REP(i,1,n)read(S[i]);
}
int main(){
Init();
Work();
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Division into Two |
User |
yanQval |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
2685 Byte |
Status |
TLE |
Exec Time |
2103 ms |
Memory |
50176 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 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 |
88 ms |
50176 KB |
02.txt |
AC |
86 ms |
50176 KB |
03.txt |
AC |
89 ms |
50176 KB |
04.txt |
AC |
89 ms |
50176 KB |
05.txt |
AC |
86 ms |
50176 KB |
06.txt |
AC |
89 ms |
50176 KB |
07.txt |
AC |
89 ms |
50176 KB |
08.txt |
AC |
87 ms |
50176 KB |
09.txt |
AC |
89 ms |
50176 KB |
10.txt |
AC |
89 ms |
50176 KB |
11.txt |
AC |
89 ms |
50176 KB |
12.txt |
AC |
85 ms |
50176 KB |
13.txt |
AC |
88 ms |
50176 KB |
14.txt |
AC |
89 ms |
50176 KB |
15.txt |
AC |
88 ms |
50176 KB |
16.txt |
TLE |
2103 ms |
12672 KB |
17.txt |
TLE |
2103 ms |
12672 KB |
18.txt |
TLE |
2103 ms |
12672 KB |
19.txt |
AC |
686 ms |
50176 KB |
20.txt |
AC |
82 ms |
50176 KB |
21.txt |
AC |
81 ms |
50176 KB |
22.txt |
TLE |
2103 ms |
12672 KB |
23.txt |
AC |
122 ms |
50176 KB |
24.txt |
AC |
83 ms |
50176 KB |
25.txt |
AC |
84 ms |
50176 KB |
26.txt |
AC |
84 ms |
50176 KB |
27.txt |
AC |
84 ms |
50176 KB |
28.txt |
AC |
86 ms |
50176 KB |
29.txt |
AC |
85 ms |
50176 KB |
30.txt |
AC |
85 ms |
50176 KB |
31.txt |
AC |
87 ms |
50176 KB |
32.txt |
AC |
92 ms |
50176 KB |
33.txt |
AC |
147 ms |
50176 KB |
34.txt |
AC |
696 ms |
50176 KB |
35.txt |
TLE |
2103 ms |
18944 KB |
36.txt |
AC |
75 ms |
50176 KB |
37.txt |
AC |
215 ms |
50176 KB |
38.txt |
TLE |
2103 ms |
12672 KB |
39.txt |
AC |
225 ms |
50176 KB |
40.txt |
AC |
79 ms |
50176 KB |
41.txt |
AC |
84 ms |
50176 KB |
42.txt |
AC |
77 ms |
50176 KB |
43.txt |
AC |
85 ms |
50176 KB |
44.txt |
AC |
85 ms |
50176 KB |
45.txt |
AC |
85 ms |
50176 KB |
46.txt |
AC |
86 ms |
50176 KB |
47.txt |
AC |
88 ms |
50176 KB |
48.txt |
AC |
87 ms |
50176 KB |
49.txt |
AC |
2 ms |
4352 KB |
50.txt |
AC |
2 ms |
4352 KB |
51.txt |
AC |
2 ms |
4352 KB |
52.txt |
AC |
2 ms |
4352 KB |
53.txt |
AC |
2 ms |
4352 KB |
54.txt |
AC |
2 ms |
4352 KB |
55.txt |
AC |
2 ms |
4352 KB |
56.txt |
AC |
2 ms |
4352 KB |
57.txt |
AC |
2 ms |
4352 KB |
58.txt |
AC |
2 ms |
4352 KB |
59.txt |
AC |
2 ms |
4352 KB |
60.txt |
AC |
2 ms |
4352 KB |
61.txt |
AC |
2 ms |
4352 KB |
62.txt |
AC |
2 ms |
4352 KB |
63.txt |
AC |
2 ms |
4352 KB |
64.txt |
AC |
2 ms |
4352 KB |
s1.txt |
AC |
2 ms |
4352 KB |
s2.txt |
AC |
2 ms |
4352 KB |
s3.txt |
AC |
2 ms |
4352 KB |
s4.txt |
AC |
2 ms |
4352 KB |