結果

問題 No.1117 数列分割
ユーザー Shuz*Shuz*
提出日時 2020-07-18 00:00:45
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
MLE  
実行時間 -
コード長 6,954 bytes
コンパイル時間 2,032 ms
コンパイル使用メモリ 179,048 KB
実行使用メモリ 489,576 KB
最終ジャッジ日時 2023-08-20 05:04:17
合計ジャッジ時間 27,749 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 6 ms
7,848 KB
testcase_01 AC 6 ms
7,832 KB
testcase_02 AC 5 ms
7,972 KB
testcase_03 AC 96 ms
9,496 KB
testcase_04 AC 128 ms
21,012 KB
testcase_05 AC 5 ms
7,844 KB
testcase_06 AC 8 ms
8,384 KB
testcase_07 AC 7 ms
8,176 KB
testcase_08 AC 97 ms
27,848 KB
testcase_09 AC 27 ms
9,952 KB
testcase_10 AC 107 ms
38,064 KB
testcase_11 AC 508 ms
108,028 KB
testcase_12 AC 592 ms
34,984 KB
testcase_13 AC 932 ms
170,992 KB
testcase_14 AC 917 ms
146,784 KB
testcase_15 AC 1,200 ms
31,560 KB
testcase_16 AC 1,423 ms
80,432 KB
testcase_17 AC 94 ms
32,100 KB
testcase_18 AC 1,437 ms
11,468 KB
testcase_19 AC 1,442 ms
12,924 KB
testcase_20 AC 1,150 ms
121,800 KB
testcase_21 MLE -
testcase_22 MLE -
testcase_23 MLE -
testcase_24 MLE -
testcase_25 MLE -
testcase_26 AC 6 ms
7,824 KB
testcase_27 AC 42 ms
8,188 KB
testcase_28 AC 43 ms
8,416 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define rt(i, n) (i == (ll)(n) -1 ? rt : sp)
#define len(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define ifn(x) if (not(x))
#define elif else if
#define elifn else ifn
#define fi first
#define se second

template <class T> bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}

// Debug
#define debug(...)                                                             \
    {                                                                          \
        cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ";                     \
        for (auto &&X : {__VA_ARGS__}) cerr << "[" << X << "] ";               \
        cerr << rt;                                                            \
    }

#define dump(a, h, w)                                                          \
    {                                                                          \
        cerr << __LINE__ << ": " << #a << " = [" << rt;                        \
        rep(_i, h) {                                                           \
            rep(_j, w) {                                                       \
                if (abs(a[_i][_j]) >= INF / 2 and a[_i][_j] <= -INF / 2)       \
                    cerr << '-';                                               \
                if (abs(a[_i][_j]) >= INF / 2)                                 \
                    cerr << "∞" << sp;                                         \
                else                                                           \
                    cerr << a[_i][_j] << sp;                                   \
            }                                                                  \
            cerr << rt;                                                        \
        }                                                                      \
        cerr << "]" << rt;                                                     \
    }

#define vdump(a, n)                                                            \
    {                                                                          \
        cerr << __LINE__ << ": " << #a << " = [";                              \
        rep(_i, n) {                                                           \
            if (_i) cerr << sp;                                                \
            if (abs(a[_i]) >= INF / 2 and a[_i] <= -INF / 2) cerr << '-';      \
            if (abs(a[_i]) >= INF / 2)                                         \
                cerr << "∞" << sp;                                             \
            else                                                               \
                cerr << a[_i];                                                 \
        }                                                                      \
        cerr << "]" << rt;                                                     \
    }

// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)

// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
    io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;

// Speed
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

// Math
inline constexpr ll gcd(const ll a, const ll b) {
    return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }

inline constexpr ll modulo(const ll n, const ll m = MOD) {
    ll k = n % m;
    return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
    n %= m;
    return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
    ll r = 1;
    rep(i, 64) {
        if (n & (1LL << i)) r *= a;
        chmod(r, m);
        a *= a;
        chmod(a, m);
    }
    return r;
}
inline ll inv(const ll n, const ll m = MOD) {
    ll a = n, b = m, x = 1, y = 0;
    while (b) {
        ll t = a / b;
        a -= t * b;
        swap(a, b);
        x -= t * y;
        swap(x, y);
    }
    return modulo(x, m);
}

template <class T = ll> struct SWA {
    using op = function<T(T, T)>;
    vector<T> A, B;
    deque<T> D;
    op f;
    SWA(op f = [](ll a, ll b) { return max(a, b); }) : f(f) {}
    void flip() {
        if (A.size() == 0) {
            B.clear();
            for (auto i = D.end() - 1; i >= D.begin(); i--) {
                if (i == D.end() - 1) {
                    A.push_back(*i);
                } else {
                    A.push_back(f(A.back(), *i));
                }
            }
        }
    }
    T operator()() {
        flip();
        if (A.size() == 0) {
            abort();
        } else if (B.size() == 0) {
            return A.back();
        } else {
            return f(A.back(), B.back());
        }
    }
    void push(T x) {
        D.push_back(x);
        if (B.size() == 0) {
            B.push_back(x);
        } else {
            B.push_back(f(B.back(), x));
        }
    }
    void pop() {
        flip();
        if (A.size() == 0) {
            abort();
        } else {
            A.pop_back();
            D.pop_front();
        }
    }
    size_t size() { return D.size(); }
};

SWA<ll> slm[3001][2];
ll DP[3001];

signed main() {
    ll N, M, K;
    cin >> N >> K >> M;
    ll A[N + 1] = {};

    rep(i, N) cin >> A[i + 1];
    rep(i, N) A[i + 1] += A[i];

    rep(j, K + 1) DP[j] = -INF;
    DP[0] = 0;

    rep(j, K + 1) {
        slm[j][0].push(DP[j] - A[0]);
        slm[j][1].push(DP[j] + A[0]);
    }

    inc(i, 1, N) {
        rep(j, K + 1) DP[j] = -INF;
        rep(j, K) {
            if (i - M > 0) {
                rep(k, 2) slm[j][k].pop();
            }
            DP[j + 1] = max(slm[j][0]() + A[i], slm[j][1]() - A[i]);
        }
        rep(j, K + 1) {
            slm[j][0].push(DP[j] - A[i]);
            slm[j][1].push(DP[j] + A[i]);
        }
    }

    cout << DP[K] << rt;
}
0