Submission #1439413


Source Code Expand

/*
	无记忆化爆搜
	专业爆搜三十年
*/ 
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <stack>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#define pb push_back
#define mp make_pair
#define INF 9999999
#define LINF 9999999999999999
#define SINF "%"
#define uint unsigned int
#define msn(a,v) memset(a,v,sizeof(a))
#define ms(a) msn(a,0)
#define NONE -1
#define ll long long
#define ull unsigned ll
#define uchar unsigned char
#define sint short int
#define usint unsigned sint
#define xsize(a) sizeof(a)/1024/1024
#define fr(aaaaa,bbbbb) for(aaaaa = 1;aaaaa <= bbbbb;aaaaa++)
#define frr(aaaaa,bbbbb,ccccc) for(aaaaa = ccccc;aaaaa <= bbbbb;aaaaa++)
using namespace std;
#define MAXN 100100
#define MOD 1000000007

ll n,a,b;
ll data[MAXN];

//		位置   X中最后一个数 
ll dfs(int pos,ll lastx,ll lasty){
	if(pos == n+1) return 1;
	ll ans = 0;
	if(data[pos] - lastx >= a) ans += dfs(pos+1,data[pos],lasty);
	if(data[pos] - lasty >= b) ans += dfs(pos+1,lastx,data[pos]);
	return ans % MOD;
}

int main(){
	//freopen("C.txt","r",stdin);
	
	cin >> n >> a >> b;
	
	for(int i = 1;i <= n;i++)
		cin >> data[i];
	
	cout << dfs(1,-233,-233) << endl;
	
	return 0;
}

Submission Info

Submission Time
Task C - Division into Two
User interestingLSY
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1305 Byte
Status WA
Exec Time 2104 ms
Memory 7808 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1100
Status
AC × 4
AC × 18
WA × 17
TLE × 33
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 TLE 2104 ms 5760 KB
02.txt WA 61 ms 1024 KB
03.txt WA 65 ms 1024 KB
04.txt WA 63 ms 1024 KB
05.txt TLE 2104 ms 5760 KB
06.txt WA 63 ms 1024 KB
07.txt TLE 2104 ms 5760 KB
08.txt TLE 2103 ms 7808 KB
09.txt WA 65 ms 1024 KB
10.txt WA 65 ms 1024 KB
11.txt WA 65 ms 1024 KB
12.txt TLE 2104 ms 5760 KB
13.txt TLE 2104 ms 5760 KB
14.txt WA 63 ms 1024 KB
15.txt WA 63 ms 1024 KB
16.txt WA 31 ms 5760 KB
17.txt WA 41 ms 5760 KB
18.txt WA 51 ms 5760 KB
19.txt TLE 2104 ms 5760 KB
20.txt TLE 2104 ms 5760 KB
21.txt TLE 2104 ms 5760 KB
22.txt TLE 2103 ms 7808 KB
23.txt TLE 2103 ms 5632 KB
24.txt TLE 2104 ms 5632 KB
25.txt TLE 2104 ms 5760 KB
26.txt TLE 2104 ms 5760 KB
27.txt TLE 2103 ms 7808 KB
28.txt TLE 2103 ms 5760 KB
29.txt TLE 2104 ms 5760 KB
30.txt TLE 2103 ms 5760 KB
31.txt TLE 2103 ms 7808 KB
32.txt TLE 2104 ms 5760 KB
33.txt TLE 2104 ms 5760 KB
34.txt TLE 2104 ms 5760 KB
35.txt TLE 2104 ms 5760 KB
36.txt TLE 2103 ms 5760 KB
37.txt TLE 2104 ms 5760 KB
38.txt TLE 2104 ms 5760 KB
39.txt TLE 2104 ms 5760 KB
40.txt AC 32 ms 5760 KB
41.txt AC 36 ms 5760 KB
42.txt AC 28 ms 1024 KB
43.txt TLE 2104 ms 5760 KB
44.txt TLE 2104 ms 5760 KB
45.txt TLE 2104 ms 5760 KB
46.txt TLE 2104 ms 5760 KB
47.txt TLE 2103 ms 1920 KB
48.txt TLE 2103 ms 1024 KB
49.txt WA 1 ms 256 KB
50.txt WA 1 ms 256 KB
51.txt WA 1 ms 256 KB
52.txt AC 1 ms 256 KB
53.txt WA 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 WA 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