Submission #1438682


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 10
#define MOD 1000000007

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

int main(){
	cin >> n >> a >> b;
	for(int i = 1;i <= n;i++)
		cin >> data[i];
	
	for(int i = 3;i <= n;i++)
		if(data[i] - data[i-2] < min(a,b)){
			cout << 0 << endl;
			return 0;
		}
}

Submission Info

Submission Time
Task D - Uninity
User interestingLSY
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1002 Byte
Status RE
Exec Time 339 ms
Memory 764 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1400
Status
WA × 2
WA × 12
RE × 62
Set Name Test Cases
Sample s1.txt, s2.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, 65.txt, 66.txt, 67.txt, 68.txt, 69.txt, 70.txt, 71.txt, 72.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt RE 339 ms 764 KB
02.txt RE 98 ms 256 KB
03.txt RE 96 ms 256 KB
04.txt RE 98 ms 256 KB
05.txt RE 97 ms 256 KB
06.txt RE 98 ms 256 KB
07.txt RE 98 ms 256 KB
08.txt RE 97 ms 256 KB
09.txt RE 98 ms 256 KB
10.txt RE 97 ms 256 KB
11.txt RE 99 ms 256 KB
12.txt RE 96 ms 256 KB
13.txt RE 96 ms 256 KB
14.txt RE 96 ms 256 KB
15.txt RE 98 ms 256 KB
16.txt RE 96 ms 256 KB
17.txt RE 96 ms 256 KB
18.txt RE 97 ms 256 KB
19.txt RE 98 ms 256 KB
20.txt RE 98 ms 256 KB
21.txt RE 96 ms 256 KB
22.txt RE 100 ms 256 KB
23.txt RE 97 ms 256 KB
24.txt RE 97 ms 256 KB
25.txt RE 99 ms 256 KB
26.txt RE 97 ms 256 KB
27.txt RE 98 ms 256 KB
28.txt RE 98 ms 256 KB
29.txt RE 97 ms 256 KB
30.txt RE 96 ms 256 KB
31.txt RE 98 ms 256 KB
32.txt RE 96 ms 256 KB
33.txt RE 98 ms 256 KB
34.txt RE 98 ms 256 KB
35.txt RE 97 ms 256 KB
36.txt RE 97 ms 256 KB
37.txt RE 96 ms 256 KB
38.txt RE 98 ms 256 KB
39.txt RE 99 ms 256 KB
40.txt RE 98 ms 256 KB
41.txt RE 98 ms 256 KB
42.txt RE 101 ms 256 KB
43.txt RE 97 ms 256 KB
44.txt RE 96 ms 256 KB
45.txt RE 98 ms 256 KB
46.txt RE 96 ms 256 KB
47.txt RE 97 ms 256 KB
48.txt RE 96 ms 256 KB
49.txt RE 97 ms 256 KB
50.txt RE 100 ms 256 KB
51.txt RE 97 ms 256 KB
52.txt RE 96 ms 256 KB
53.txt RE 97 ms 256 KB
54.txt RE 100 ms 256 KB
55.txt RE 98 ms 256 KB
56.txt RE 97 ms 256 KB
57.txt RE 96 ms 256 KB
58.txt RE 97 ms 256 KB
59.txt RE 103 ms 256 KB
60.txt RE 96 ms 256 KB
61.txt RE 98 ms 256 KB
62.txt RE 96 ms 256 KB
63.txt WA 1 ms 256 KB
64.txt WA 1 ms 256 KB
65.txt WA 1 ms 256 KB
66.txt WA 1 ms 256 KB
67.txt WA 1 ms 256 KB
68.txt WA 1 ms 256 KB
69.txt WA 1 ms 256 KB
70.txt WA 1 ms 256 KB
71.txt WA 1 ms 256 KB
72.txt WA 1 ms 256 KB
s1.txt WA 1 ms 256 KB
s2.txt WA 3 ms 384 KB