Submission #1098446


Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define rep1(i,n) for(int i = 1; i < n; i++)
#define repv(i,n) for(int i = n-1; i >= 0; i--)
#define fi first
#define sc second
#define pb push_back
using namespace std;
typedef long long ll;

char BUF[3500000];
inline void I(int&a){scanf("%d",&a);}
inline void I(int&a,int&b){scanf("%d%d",&a,&b);}
inline void I(int&a,int&b,int&c){scanf("%d%d%d",&a,&b,&c);}
inline void I(int&a,int&b,int&c,int&d){scanf("%d%d%d%d",&a,&b,&c,&d);}
inline void L(ll&a){scanf("%I64d",&a);}
inline void L(ll&a,ll&b){scanf("%I64d%I64d",&a,&b);}
inline void L(ll&a,ll&b,ll&c){scanf("%I64d%I64d%I64d",&a,&b,&c);}
inline void L(ll&a,ll&b,ll&c,ll&d){scanf("%I64d%I64d%I64d%I64d",&a,&b,&c,&d);}
inline void S(string&str){str.clear();scanf("%s",BUF);int s=strlen(BUF);rep(i,s)str.pb(BUF[i]);}
inline void SV(vector<int>&v){v.clear();scanf("%s",BUF);int s=strlen(BUF);rep(i,s)if('a'<=BUF[i]&&BUF[i]<='z')v.pb(BUF[i]-'a');else v.pb(BUF[i]-'A');}

const auto EPS = 1e-10;
const auto INF = 100000000;
const auto MOD = 1000000007;
typedef pair<ll,ll> P;

int n;
ll a, b;
ll s[100000];
ll dp[100000][2];

int main(){
    I(n);
    L(a,b);
    rep(i,n) L(s[i]);
    if(a > b) swap(a,b);
    for(int i = 2; i < n; i++) if(s[i]-s[i-2] < a){
        cout << 0 << endl;
        return 0;
    }
    dp[0][0] = 1; dp[0][1] = 1;
    ll it = 0, sum = 1;
    bool fl = false;
    for(int i = 1; i < n; i++){
        if(fl){
            fl = false;
            sum = 0;
            it = i-2;
        }
        dp[i][0] = dp[i-1][1];
        if(s[i]-s[i-1] >= a) dp[i][0] = (dp[i][0]+dp[i-1][0])%MOD;
        else fl = true;
        while(s[i]-s[it] >= b) sum = (sum+dp[it++][1])%MOD;
        dp[i][1] = sum;
    }
    cout << (dp[n-1][0]+dp[n-1][1])%MOD << endl;
}






























Submission Info

Submission Time
Task C - Division into Two
User gasin
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1907 Byte
Status WA
Exec Time 97 ms
Memory 2560 KB

Compile Error

./Main.cpp: In function ‘void L(ll&)’:
./Main.cpp:16:37: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘ll* {aka long long int*}’ [-Wformat=]
 inline void L(ll&a){scanf("%I64d",&a);}
                                     ^
./Main.cpp: In function ‘void L(ll&, ll&)’:
./Main.cpp:17:50: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘ll* {aka long long int*}’ [-Wformat=]
 inline void L(ll&a,ll&b){scanf("%I64d%I64d",&a,&b);}
                                                  ^
./Main.cpp:17:50: warning: format ‘%d’ expects argument of type ‘int*’, but argument 3 has type ‘ll* {aka long long int*}’ [-Wformat=]
./Main.cpp: In function ‘void L(ll&, ll&, ll&)’:
./Main.cpp:18:63: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘ll* {aka long long int*}’ [-Wformat=]
 inline void L(ll&a,ll&b,ll&c){scanf("%I64d%I64d%I64d",&a,&b,&c);}
                                                               ^
./Main.cpp:18:63: warning: form...

Judge Result

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