結果

問題 No.1199 お菓子配り-2
ユーザー Shuz*Shuz*
提出日時 2020-08-28 21:28:03
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 8,749 bytes
コンパイル時間 1,738 ms
コンパイル使用メモリ 174,604 KB
実行使用メモリ 6,824 KB
最終ジャッジ日時 2024-11-14 02:44:37
合計ジャッジ時間 12,107 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,820 KB
testcase_01 AC 2 ms
6,820 KB
testcase_02 AC 2 ms
6,820 KB
testcase_03 AC 30 ms
6,816 KB
testcase_04 RE -
testcase_05 AC 4 ms
6,816 KB
testcase_06 AC 5 ms
6,820 KB
testcase_07 AC 37 ms
6,816 KB
testcase_08 AC 50 ms
6,820 KB
testcase_09 AC 31 ms
6,820 KB
testcase_10 AC 9 ms
6,816 KB
testcase_11 AC 24 ms
6,820 KB
testcase_12 AC 26 ms
6,820 KB
testcase_13 AC 10 ms
6,816 KB
testcase_14 AC 8 ms
6,816 KB
testcase_15 AC 7 ms
6,820 KB
testcase_16 AC 49 ms
6,816 KB
testcase_17 AC 24 ms
6,820 KB
testcase_18 RE -
testcase_19 AC 14 ms
6,816 KB
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 AC 10 ms
6,816 KB
testcase_26 AC 66 ms
6,820 KB
testcase_27 AC 52 ms
6,816 KB
testcase_28 RE -
testcase_29 RE -
testcase_30 RE -
testcase_31 RE -
testcase_32 RE -
testcase_33 RE -
testcase_34 RE -
testcase_35 RE -
testcase_36 RE -
testcase_37 RE -
testcase_38 RE -
testcase_39 RE -
testcase_40 RE -
testcase_41 RE -
testcase_42 RE -
testcase_43 RE -
testcase_44 RE -
testcase_45 RE -
testcase_46 RE -
testcase_47 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
//#pragma GCC target("arch=skylake-avx512")

#pragma region template

// 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
#define uniq(x) (sort(all(x)), (x).erase(unique(all(x)), (x).end()))
#define bis(x, y) ((ll)(lower_bound(all(x), y) - (x).begin()))

using graph = vector<vector<ll>>;
template <class T> using wgraph = vector<vector<pair<ll, T>>>;
bool __DIRECTED__ = true;
bool __ZERO_INDEXED__ = false;
istream &operator>>(istream &is, graph &g) {
    ll a, b;
    is >> a >> b;
    if (__ZERO_INDEXED__ == false) a--, b--;
    g[a].pb(b);
    if (__DIRECTED__ == false) g[b].pb(a);
    return is;
}
template <class T> istream &operator>>(istream &is, wgraph<T> &g) {
    ll a, b;
    T c;
    is >> a >> b >> c;
    if (__ZERO_INDEXED__ == false) a--, b--;
    g[a].pb({b, c});
    if (__DIRECTED__ == false) g[b].pb({a, c});
    return is;
}

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 &&__i : {__VA_ARGS__}) cerr << "[" << __i << "] ";                               \
        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 target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("Ofast,unroll-loops")

// 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);
}

#pragma endregion

struct Rational {
    using Int = long long;
    using Double = long double;
    Int n, d;
    Rational(Int x = 0, Int y = 1) : n(x), d(y) {
        Int g = gcd(abs(n), abs(d));
        if (d < 0) g *= -1;
        n /= g, d /= g;
        // if (d == 0) n = 1;
        // inf と -inf を同一視したくない場合は消す
    }
    Rational operator-() const { return Rational(-n, d); }
    Rational &operator+=(const Rational &a) { return *this = Rational(n * a.d + d * a.n, d * a.d); }
    Rational &operator-=(const Rational &a) { return *this = Rational(n * a.d - d * a.n, d * a.d); }
    Rational &operator*=(const Rational &a) { return *this = Rational(n * a.n, d * a.d); }
    Rational &operator/=(const Rational &a) { return *this = Rational(n * a.d, d * a.n); }
    Rational operator+(const Rational &a) const { return Rational(*this) += a; }
    Rational operator-(const Rational &a) const { return Rational(*this) -= a; }
    Rational operator*(const Rational &a) const { return Rational(*this) *= a; }
    Rational operator/(const Rational &a) const { return Rational(*this) /= a; }
    bool operator==(const Rational &a) const { return n == a.n and d == a.d; }
    bool operator!=(const Rational &a) const { return n != a.n or d != a.d; }
    bool operator<=(const Rational &a) const { return n * a.d <= d * a.n; }
    bool operator<(const Rational &a) const { return n * a.d < d * a.n; }
    friend Int rtoi(const Rational &a) { return a.n / a.d; }
    friend Double rtod(const Rational &a) { return Double(a.n) / Double(a.d); }
    friend istream &operator>>(istream &is, Rational &a) {
        string x;
        is >> x;
        Int y = 1;
        auto iter = find(x.begin(), x.end(), '.');
        if (iter != x.end()) {
            Int dig = x.end() - iter - 1;
            for (Int i = 0; i < dig; i++) y *= 10;
            x.erase(iter);
        }
        a = Rational(stol(x), y);
        return is;
    }
    friend ostream &operator<<(ostream &os, const Rational &a) {
        os << a.n << '/' << a.d;
        return os;
    }
};

ll DP[1001][2];
signed main() {
    ll N, M, X;
    cin >> N >> M;
    ll A[N];
    rep(i, N) A[i] = 0;
    rep(i, N) rep(j, M) cin >> X, A[i] += X;

    rep(i, N + 1) rep(j, 2) DP[i][j] = -INF;
    DP[0][0] = 0;
    rep(i, N) rep(j, 2) {
        chmax(DP[i + 1][!j], DP[i][j] + (j ? -A[i] : A[i]));
        chmax(DP[i + 1][j], DP[i][j]);
    }
    // dump(DP, N + 1, N + 1);
    cout << *max_element(DP[N], DP[N] + N + 1) << rt;
}
0