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

提出ソース

結果

問題	No.1199 お菓子配り-2
ユーザー	hirono999
提出日時	2020-08-29 16:05:30
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	134 ms / 1,000 ms
コード長	5,571 bytes
コンパイル時間	3,999 ms
コンパイル使用メモリ	222,780 KB
実行使用メモリ	11,136 KB
最終ジャッジ日時	2024-11-14 23:44:02
合計ジャッジ時間	10,338 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	2 ms 5,248 KB
testcase_03	AC	32 ms 5,376 KB
testcase_04	AC	76 ms 8,192 KB
testcase_05	AC	4 ms 5,248 KB
testcase_06	AC	6 ms 5,248 KB
testcase_07	AC	38 ms 5,760 KB
testcase_08	AC	52 ms 6,528 KB
testcase_09	AC	32 ms 5,248 KB
testcase_10	AC	9 ms 5,248 KB
testcase_11	AC	25 ms 5,248 KB
testcase_12	AC	25 ms 5,248 KB
testcase_13	AC	10 ms 5,248 KB
testcase_14	AC	8 ms 5,248 KB
testcase_15	AC	7 ms 5,248 KB
testcase_16	AC	67 ms 6,400 KB
testcase_17	AC	27 ms 5,248 KB
testcase_18	AC	55 ms 6,528 KB
testcase_19	AC	15 ms 5,248 KB
testcase_20	AC	101 ms 9,344 KB
testcase_21	AC	57 ms 6,912 KB
testcase_22	AC	31 ms 5,248 KB
testcase_23	AC	43 ms 6,016 KB
testcase_24	AC	59 ms 7,168 KB
testcase_25	AC	10 ms 5,248 KB
testcase_26	AC	65 ms 7,552 KB
testcase_27	AC	53 ms 6,656 KB
testcase_28	AC	120 ms 11,136 KB
testcase_29	AC	121 ms 11,136 KB
testcase_30	AC	134 ms 11,136 KB
testcase_31	AC	124 ms 11,136 KB
testcase_32	AC	123 ms 11,136 KB
testcase_33	AC	122 ms 11,136 KB
testcase_34	AC	120 ms 11,136 KB
testcase_35	AC	121 ms 11,136 KB
testcase_36	AC	121 ms 11,136 KB
testcase_37	AC	121 ms 11,008 KB
testcase_38	AC	120 ms 11,136 KB
testcase_39	AC	121 ms 11,008 KB
testcase_40	AC	119 ms 11,008 KB
testcase_41	AC	120 ms 11,136 KB
testcase_42	AC	121 ms 11,136 KB
testcase_43	AC	121 ms 11,136 KB
testcase_44	AC	121 ms 11,008 KB
testcase_45	AC	121 ms 11,008 KB
testcase_46	AC	120 ms 11,136 KB
testcase_47	AC	132 ms 11,136 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
constexpr long long INF = 1LL << 60;
constexpr long long MOD = 1000000007;
double PI = acos(-1.0);
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) sort(ALL(c));for(bool c##p=1;c##p;c##p=next_permutation(ALL(c)))
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define pb push_back
#define to_s to_string
#define len(v) (ll)v.size()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define print(x) cout << (x) << '\n'
#define drop(x) cout << (x) << '\n', exit(0)
#define debug(x) cout << #x << ": " << (x) << '\n'
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> tpl;
typedef vector<ll> vec;
typedef vector<vector<ll>> vec2;
typedef vector<vector<vector<ll>>> vec3;
template<class S, class T> inline bool chmax(S &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class S, class T> inline bool chmin(S &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline ll msb(ll v) { return 1 << (31 - __builtin_clzll(v)); }
inline ll devc(ll x, ll y) { return (x + y - 1) / y; }
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); }
 
struct IoSetup {
    IoSetup() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(10);
        cerr << fixed << setprecision(10);
    }
} iosetup;
 
template< typename T1, typename T2 >
ostream &operator << (ostream &os, const pair< T1, T2 > &p) {
    os << p.first << " " << p.second;
    return os;
}
 
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, typename T3 >
ostream &operator << (ostream &os, const tuple< T1, T2, T3 > &t) {
    os << get<0>(t) << " " << get<1>(t) << " " << get<2>(t);
    return os;
}
 
template< typename T1, typename T2, typename T3 >
istream &operator >> (istream &is, tuple< T1, T2, T3 > &t) {
    is >> get<0>(t) >> get<1>(t) >> get<2>(t);
    return is;
}
 
template< typename T >
ostream &operator << (ostream &os, const vector< T > &v){
    for (int i = 0; i < (int)v.size(); ++i) {
        os << v[i] << (i + 1 != v.size() ? " " : "");
    }
    return os;
}
 
template< typename T >
istream &operator >>  (istream &is, vector< T > &v){
    for(T &in : v) is >> in;
    return is;
}

template< typename T >
ostream &operator << (ostream &os, const set< T > &st){
    int ct = 0;
    for(auto& s : st) cout << s << (++ct != st.size() ? " " : "");
    return os;
}

template <typename T>
constexpr set<T> &operator|= (set<T> &st1, const set<T> &st2) { 
    for(auto& s : st2) st1.insert(s);
    return st1; 
}

template <typename T>
constexpr set<T> &operator-= (set<T> &st1, const set<T> &st2) {
    for(auto& s : st2) if(st1.count(s)) st1.erase(s);
    return st1;
}

template <typename T>
constexpr set<T> &operator&= (set<T> &st1, const set<T> &st2) {
    auto itr = st1.begin();
    while(itr != st1.end()){
        if(!st2.count(*itr)) itr = st1.erase(itr);
        else ++itr;
    }
    return st1;
}

template <typename T>
constexpr set<T> operator| (const set<T> &st1, const set<T> &st2) {
    set<T> res = st1;
    res |= st2;
    return res;
}

template <typename T>
constexpr set<T> operator- (const set<T> &st1, const set<T> &st2) {
    set<T> res = st1;
    res -= st2;
    return res;
}

template <typename T>
constexpr set<T> operator& (const set<T> &st1, const set<T> &st2) {
    set<T> res = st1;
    res &= st2;
    return res;
}

/*---------------------------------    Tools    ------------------------------------------*/
template< typename T >
vector<T> cumsum(const vector<T> &X){
    vector<T> res(X.size() + 1, 0);
    for(int i = 0; i < X.size(); ++i) res[i + 1] += res[i] + X[i];
    return res;
}
 
template< typename S, typename T, typename F>
pair<T, T> bisearch(S left, T right, F f) {
    while(abs(right - left) > 1){
        T mid = (right + left) / 2;
        if(f(mid)) right = mid;
        else left = mid;
    }
    return {left, right};
}
 
template< typename S, typename T, typename F>
double trisearch(S left, T right, F f, int maxLoop = 90){
    double low = left, high = right;
    while(maxLoop--){
        double mid_left = high / 3 + low * 2 / 3;
        double mid_right = high * 2 / 3 + low / 3;
        if(f(mid_left) >= f(mid_right)) low = mid_left;
        else high = mid_right;
    }
    return (low + high) * 0.5;
}

template< typename F >
ll ternarySearch(ll L, ll R, F f) { //[L, R)
    ll lo = L - 1, hi = R - 1;
    while (lo + 1 != hi) {
        ll mi = (lo + hi) / 2;
        if (f(mi) <= f(mi + 1)) hi = mi;
        else lo = mi;
    }
    return hi;
}

/*------------------------------- Main Code Here -----------------------------------------*/
 
int main()
{
    ll N, M;
    cin >> N >> M;
    vec2 A(N, vec(M));
    cin >> A;
    vec snack(N);
    rep(i, N) rep(j, M) snack[i] += A[i][j];

    vec f0(N + 1), f1(N + 1);
    ll ans = 0;
    rep1(i, N){
        chmax(f0[i], f0[i - 1]);
        chmax(f1[i], f1[i - 1]);
        chmax(f0[i], f1[i - 1] + snack[i - 1]);
        chmax(f1[i], f0[i - 1] - snack[i - 1]);

        chmax(ans, f0[i]);
        chmax(ans, f1[i]);
    }

    print(ans);

    return 0;
}

yukicoder

結果

テストケース

ソースコード