Submission #1113248


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;
ll answer, A, B, a[N], S[N][2][2];

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 = 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;
    S[i][1][0] = S[i - 1][0][0];
    if(a[i] - B >= a[i - 2])
      S[i][1][0] = (S[i - 1][0][1] + S[i][1][0]) % M;
    S[i][0][1] = (S[i - 1][1][0] + S[i - 1][1][1]);
  }

  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

Submission Time
Task C - Division into Two
User octopuses
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1061 Byte
Status WA
Exec Time 20 ms
Memory 6400 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:19: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:22:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld", &a[i]);
                         ^

Judge Result

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