Submission #1241071
Source Code Expand
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))
using namespace std;
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
using ll=long long;
using R=long double;
const R EPS=1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r){return(r > EPS)-(r < -EPS);}
inline R sq(R x){return sqrt(max(x,0.0L));}
const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};
#define error(args...) { vector<string> _debug = split(#args, ',');err(begin(_debug), args);}
vector<string> split(const string& s, char c){
vector<string> v;stringstream ss(s);string x;
while (getline(ss, x, c)) v.emplace_back(x);
return move(v);
}
void err(vector<string>::iterator it) {cerr << endl;}
template<typename T, typename... Args> void err(vector<string>::iterator it, T a,Args... args){
cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << " ",err(++it, args...);
}
// Problem Specific Parameter:
ll n,a,b;
const ll inf=1LL<<60;
const int nmax=100010;
ll s[nmax];
const ll mod=1000000007LL;
struct Binary_indexed_tree{
using T=ll;
vector<T> data;
int n;
Binary_indexed_tree(int _n):n(_n){data.assign(n+1,0);}
void update(int i,T x){
for(i++;i<=n;i+=i&-i){
data[i]=(data[i]+x)%mod;
}
}
T query(int i){
T ret=0LL;
for(i++;i>0;i-=i&-i) ret=(ret+data[i])%mod;
return ret;
}
};
int main(void){
cin >> n >> a >> b;
s[0]=-inf;
rep(i,1,n+1) cin >> s[i];
Binary_indexed_tree X(n+2),Y(n+2);
X.update(0,1LL),Y.update(0,1LL);
int zx = 0, zy = 0;
rep(i,2,n+1){
/*
rep(a,n) cerr << (a?" ":"") << X.query(a) - X.query(a-1);
cerr << endl;
rep(a,n) cerr << (a?" ":"") << Y.query(a) - Y.query(a-1);
cerr << endl;
*/
bool rx = (s[i]-s[i-1]-a) < 0;
bool ry = (s[i]-s[i-1]-b) < 0;
{
const int j=upper_bound(s,s+i-1,s[i]-b)-s-1;
const ll add = X.query(j);
//error(i,"Y",j,add);
Y.update(i-1,add);
}
{
const int j=upper_bound(s,s+i-1,s[i]-a)-s-1;
const ll add = Y.query(j);
//error(i,"X",j,add);
X.update(i-1,add);
}
if(rx){
while(zx < i-1){
const ll add = X.query(zx);
X.update(zx,mod-add);
zx++;
}
}
if(ry){
while(zy < i-1){
const ll add = Y.query(zy);
Y.update(zy,mod-add);
zy++;
}
}
}
/*
rep(a,n) cerr << (a?" ":"") << X.query(a) - X.query(a-1);
cerr << endl;
rep(a,n) cerr << (a?" ":"") << Y.query(a) - Y.query(a-1);
cerr << endl;
*/
ll ans = (X.query(n)+Y.query(n))%mod;
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Division into Two |
User |
Hec |
Language |
C++14 (GCC 5.4.1) |
Score |
1100 |
Code Size |
3341 Byte |
Status |
AC |
Exec Time |
99 ms |
Memory |
2560 KB |
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 |
95 ms |
2560 KB |
02.txt |
AC |
90 ms |
2560 KB |
03.txt |
AC |
94 ms |
2560 KB |
04.txt |
AC |
92 ms |
2560 KB |
05.txt |
AC |
84 ms |
2560 KB |
06.txt |
AC |
92 ms |
2560 KB |
07.txt |
AC |
94 ms |
2560 KB |
08.txt |
AC |
92 ms |
2560 KB |
09.txt |
AC |
95 ms |
2560 KB |
10.txt |
AC |
94 ms |
2560 KB |
11.txt |
AC |
99 ms |
2560 KB |
12.txt |
AC |
83 ms |
2560 KB |
13.txt |
AC |
94 ms |
2560 KB |
14.txt |
AC |
92 ms |
2560 KB |
15.txt |
AC |
91 ms |
2560 KB |
16.txt |
AC |
48 ms |
2560 KB |
17.txt |
AC |
58 ms |
2560 KB |
18.txt |
AC |
76 ms |
2560 KB |
19.txt |
AC |
69 ms |
2560 KB |
20.txt |
AC |
70 ms |
2560 KB |
21.txt |
AC |
69 ms |
2560 KB |
22.txt |
AC |
76 ms |
2560 KB |
23.txt |
AC |
59 ms |
2560 KB |
24.txt |
AC |
66 ms |
2560 KB |
25.txt |
AC |
84 ms |
2560 KB |
26.txt |
AC |
80 ms |
2560 KB |
27.txt |
AC |
80 ms |
2560 KB |
28.txt |
AC |
82 ms |
2560 KB |
29.txt |
AC |
75 ms |
2560 KB |
30.txt |
AC |
75 ms |
2560 KB |
31.txt |
AC |
73 ms |
2560 KB |
32.txt |
AC |
78 ms |
2560 KB |
33.txt |
AC |
84 ms |
2560 KB |
34.txt |
AC |
66 ms |
2560 KB |
35.txt |
AC |
85 ms |
2560 KB |
36.txt |
AC |
45 ms |
2560 KB |
37.txt |
AC |
52 ms |
2560 KB |
38.txt |
AC |
52 ms |
2560 KB |
39.txt |
AC |
89 ms |
2560 KB |
40.txt |
AC |
57 ms |
2560 KB |
41.txt |
AC |
62 ms |
2560 KB |
42.txt |
AC |
51 ms |
2560 KB |
43.txt |
AC |
83 ms |
2560 KB |
44.txt |
AC |
84 ms |
2560 KB |
45.txt |
AC |
84 ms |
2560 KB |
46.txt |
AC |
84 ms |
2560 KB |
47.txt |
AC |
94 ms |
2560 KB |
48.txt |
AC |
95 ms |
2560 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 |