Submission #1113266

---

Source Code Expand

//Giorgi Kldiashvili

#include <bits/stdc++.h>

#define M 1000000007ll
#define ll long long
#define MIN(x, y) ((x) < (y) ? (x) : (y))
#define MAX(x, y) ((x) < (y) ? (y) : (x))

using namespace std;

const int N = 300020;

int n, last;
ll answer, A, B, a[N], S[N][2][2];
bool fix[N];
int C[N];

int main()
{
  scanf("%d %lld %lld", &n, &A, &B);
  if(A > B) swap(A, B);
  for(int i = 1; i <= n; ++ i)
    scanf("%lld", &a[i]);
  a[0] = -1e18;
  S[1][0][0] = S[1][1][0] = 1;
  for(int i = 1; i < n; ++ i)
    if(a[i + 1] - a[i] >= A)
      fix[i] = true;
  last = 0;
  for(int i = 1; i <= n; ++ i)
  {
    C[i] = last;
    if(!fix[i - 1])
      last = i - 1;
  }
  for(int i = 2; i <= n; ++ i)
  {
    if(a[i] - A < a[i - 2])
      return printf("0"), 0;
    if(a[i] - A >= a[i - 1])
      S[i][0][0] = (S[i - 1][0][0] + S[i - 1][0][1]) % M;
    if(a[i] - B >= a[i - 1])
      S[i][1][1] = (S[i - 1][1][1] + S[i - 1][1][0]) % M;
    int l, r;
    l = 0; r = i - 1;
    while(l < r)
    {
      int mid = l + r - 1 >> 1;
      if(a[mid] + B <= a[i])
        l = mid + 1;
      else
        r = mid;
    }
    if(l == i)
      l --;
    if(C[i] < l)
      S[i][1][0] = (S[l][0][1] + S[l][0][0]) % M;
    S[i][0][1] = (S[i - 1][1][0] + S[i - 1][1][1]) % M;
  }

  for(int i = 0; i < 2; ++ i)
    for(int j = 0; j < 2; ++ j)
      answer = (answer + S[n][i][j]) % M;

  cout << answer << endl;

}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:21:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %lld %lld", &n, &A, &B);
                                    ^
./Main.cpp:24:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld", &a[i]);
                         ^

Judge Result