#541826 (C++17) No.1199 お菓子配り-2

• 問題: No.1199 お菓子配り-2
• ユーザー: opt
• 提出日時: 2020-08-28 21:38:56
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 117 ms / 1,000 ms
• コード長: 2,680 bytes
• コンパイル時間: 2,118 ms
• コンパイル使用メモリ: 204,692 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-11-14 03:03:08
• 合計ジャッジ時間: 8,922 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,816 KB
testcase_01	AC	2 ms; 6,816 KB
testcase_02	AC	2 ms; 6,816 KB
testcase_03	AC	30 ms; 6,816 KB
testcase_04	AC	71 ms; 6,820 KB
testcase_05	AC	4 ms; 6,820 KB
testcase_06	AC	5 ms; 6,816 KB
testcase_07	AC	36 ms; 6,816 KB
testcase_08	AC	49 ms; 6,816 KB
testcase_09	AC	31 ms; 6,816 KB
testcase_10	AC	9 ms; 6,816 KB
testcase_11	AC	23 ms; 6,816 KB
testcase_12	AC	23 ms; 6,816 KB
testcase_13	AC	10 ms; 6,816 KB
testcase_14	AC	8 ms; 6,816 KB
testcase_15	AC	7 ms; 6,816 KB
testcase_16	AC	47 ms; 6,820 KB
testcase_17	AC	23 ms; 6,816 KB
testcase_18	AC	50 ms; 6,816 KB
testcase_19	AC	14 ms; 6,820 KB
testcase_20	AC	87 ms; 6,820 KB
testcase_21	AC	54 ms; 6,816 KB
testcase_22	AC	30 ms; 6,816 KB
testcase_23	AC	41 ms; 6,820 KB
testcase_24	AC	55 ms; 6,820 KB
testcase_25	AC	10 ms; 6,816 KB
testcase_26	AC	63 ms; 6,816 KB
testcase_27	AC	52 ms; 6,820 KB
testcase_28	AC	115 ms; 6,816 KB
testcase_29	AC	115 ms; 6,820 KB
testcase_30	AC	115 ms; 6,820 KB
testcase_31	AC	115 ms; 6,820 KB
testcase_32	AC	115 ms; 6,816 KB
testcase_33	AC	115 ms; 6,816 KB
testcase_34	AC	115 ms; 6,820 KB
testcase_35	AC	115 ms; 6,816 KB
testcase_36	AC	115 ms; 6,816 KB
testcase_37	AC	115 ms; 6,820 KB
testcase_38	AC	115 ms; 6,820 KB
testcase_39	AC	117 ms; 6,816 KB
testcase_40	AC	115 ms; 6,820 KB
testcase_41	AC	115 ms; 6,816 KB
testcase_42	AC	115 ms; 6,816 KB
testcase_43	AC	114 ms; 6,816 KB
testcase_44	AC	115 ms; 6,820 KB
testcase_45	AC	114 ms; 6,816 KB
testcase_46	AC	114 ms; 6,816 KB
testcase_47	AC	115 ms; 6,816 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define all(a) (a).begin(), (a).end()
template<typename T = int> using V = vector<T>;
template<typename T = int> using P = pair<T, T>;
using Vi = V<int>;
using Vl = V<ll>;
using Vd = V<ld>;
using Vb = V<bool>;
using VVi = V<Vi>;
using VVl = V<Vl>;
using VVb = V<Vb>;
using Pi = P<int>;
using Pl = P<ll>;
using Pd = P<ld>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<typename T> inline int sz(T &x) { return x.size(); }
template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &e : v) is >> e; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<typename T> inline int count_between(vector<T> &a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r)
inline int fLog2(const ll x) { assert(x > 0); return 63-__builtin_clzll(x); } // floor(log2(x))
inline int cLog2(const ll x) { assert(x > 0); return (x == 1) ? 0 : 64-__builtin_clzll(x-1); } // ceil(log2(x))
inline int popcount(const ll x) { return __builtin_popcountll(x); }
inline void fail() { cout << -1 << '\n'; exit(0); }
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
// const int INF  = 1<<30;
const ll INFll = 1ll<<60;
// const ld EPS   = 1e-10;
// const ld PI    = acos(-1.0);
// const int MOD  = int(1e9)+7;
// const int MOD  = 998244353;


int main() {
  int n, m; cin >> n >> m;
  Vl a(n);
  rep(i, n) rep(j, m) {
    ll x; cin >> x;
    a[i] += x;
  }

  Vl dp(2);
  dp[1] = -INFll;

  rep(i, n) {
    auto tmp = dp;
    chmax(tmp[0], dp[1] - a[i]);
    chmax(tmp[1], dp[0] + a[i]);
    swap(dp, tmp);
  }

  ll ans = max(dp[0], dp[1]);
  cout << ans << '\n';
}