Submission #1205949

---

Source Code Expand

#include <cstdio>
#include <algorithm>
#include <vector>
typedef long long int64;
static const int MAXN = 1e5 + 4;
static const int MODULUS = 1e9 + 7;
static const int64 INF = 1LL << 61;
#define _  %  MODULUS
#define __ %= MODULUS

struct fwk {
    int f[MAXN];
    std::vector<int> updated;
    fwk() { std::fill(f, f + MAXN, 0); }
    inline void add(int pos, int inc) {
        updated.push_back(pos);
        for (++pos; pos < MAXN; pos += (pos & -pos)) (f[pos] += inc)__;
    }
    inline void clear() {
        for (int x : updated) for (++x; x < MAXN; x += (x & -x)) f[x] = 0;
        updated.clear();
    }
    inline int sum(int rg) {
        int ret = 0;
        for (++rg; rg; rg -= (rg & -rg)) (ret += f[rg])__;
        return ret;
    }
    inline int sum(int lf, int rg) { return (sum(rg) - sum(lf - 1) + MODULUS)_; }
} fx, fy;

int n;
int64 a, b, s[MAXN];

int main()
{
    scanf("%d%lld%lld", &n, &a, &b);
    for (int i = 1; i <= n; ++i) scanf("%lld", &s[i]);
    s[0] = -INF;

    fx.add(0, 1);
    printf("%d\n", fx.sum(0));
    for (int i = 1; i <= n; ++i) {
        int fx_p = std::upper_bound(s, s + i, s[i] - a) - &s[0] - 1,
            fy_p = std::upper_bound(s, s + i, s[i] - b) - &s[0] - 1;
        int fx_sum = fx.sum(fy_p), fy_sum = fy.sum(fx_p);
        if (s[i] - s[i - 1] < a) fx.clear();
        if (s[i] - s[i - 1] < b) fy.clear();
        fx.add(i - 1, fy_sum);
        fy.add(i - 1, fx_sum);
    }

    printf("%d\n", (fx.sum(n) + fy.sum(n))_);
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:36: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:37:54: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     for (int i = 1; i <= n; ++i) scanf("%lld", &s[i]);
                                                      ^

Judge Result