Submission #1439834


Source Code Expand

/*
	  - - 
这次如果Ac我吃土 
*/ 
#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];
ll dp[MAXN]; 

int main(){
	//freopen("C.txt","r",stdin);
	data[0] = -1000000000000000000;
	
	scanf("%lld %lld %lld",&n,&a,&b);
	if(a > b) swap(a,b);
	for(int i = 1;i <= n;i++)
		scanf("%lld",&data[i]);
	
	for(int i = 1;i <= n-2;i++)
		if(data[i+2] - data[i] < a){
			printf("0\n");
			return 0;
		}
	ms(dp);
	dp[0] = 1;
	ll now = 0;
	ll lastpos = 0;
	for(int i = 1;i <= n;i++){
		//在 (0,i] 之间找到最小的lastpos,使data[i]和data[lastpos]不可以被同时放到Y中 
		for(;lastpos < i  &&  data[i] - data[lastpos] >= b;lastpos++){
			now = (now + dp[lastpos]) % MOD;
		}
		dp[i] = now;
		if(data[i] - data[i-1] < a){
			now = 0;
			lastpos = i-1;
		}
	}
	
	for(int i = lastpos;i <= n;i++){
		now = (now + dp[i]) % MOD;
	}
	
	printf("%lld\n",now);
	
	return 0;
}

Submission Info

Submission Time
Task C - Division into Two
User interestingLSY
Language C++14 (GCC 5.4.1)
Score 1100
Code Size 1665 Byte
Status AC
Exec Time 19 ms
Memory 1792 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:44:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %lld %lld",&n,&a,&b);
                                  ^
./Main.cpp:47:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&data[i]);
                         ^

Judge Result

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