結果

問題 No.974 最後の日までに
ユーザー PachicobuePachicobue
提出日時 2020-01-18 17:04:15
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 172 ms / 2,000 ms
コード長 7,202 bytes
コンパイル時間 2,572 ms
コンパイル使用メモリ 213,952 KB
実行使用メモリ 33,176 KB
最終ジャッジ日時 2024-04-14 21:55:19
合計ジャッジ時間 9,642 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 149 ms
31,072 KB
testcase_01 AC 143 ms
30,336 KB
testcase_02 AC 143 ms
30,884 KB
testcase_03 AC 148 ms
32,648 KB
testcase_04 AC 148 ms
30,300 KB
testcase_05 AC 144 ms
30,240 KB
testcase_06 AC 142 ms
31,852 KB
testcase_07 AC 147 ms
32,396 KB
testcase_08 AC 147 ms
29,852 KB
testcase_09 AC 155 ms
31,900 KB
testcase_10 AC 153 ms
30,636 KB
testcase_11 AC 151 ms
31,916 KB
testcase_12 AC 152 ms
32,252 KB
testcase_13 AC 153 ms
30,252 KB
testcase_14 AC 152 ms
32,880 KB
testcase_15 AC 153 ms
31,548 KB
testcase_16 AC 154 ms
32,896 KB
testcase_17 AC 166 ms
31,560 KB
testcase_18 AC 168 ms
30,320 KB
testcase_19 AC 170 ms
31,316 KB
testcase_20 AC 168 ms
30,720 KB
testcase_21 AC 167 ms
30,404 KB
testcase_22 AC 172 ms
30,776 KB
testcase_23 AC 163 ms
30,808 KB
testcase_24 AC 169 ms
33,008 KB
testcase_25 AC 2 ms
6,940 KB
testcase_26 AC 2 ms
6,944 KB
testcase_27 AC 117 ms
20,416 KB
testcase_28 AC 158 ms
30,848 KB
testcase_29 AC 2 ms
6,940 KB
testcase_30 AC 167 ms
31,624 KB
testcase_31 AC 2 ms
6,940 KB
testcase_32 AC 2 ms
6,944 KB
testcase_33 AC 100 ms
18,260 KB
testcase_34 AC 160 ms
29,988 KB
testcase_35 AC 2 ms
6,940 KB
testcase_36 AC 2 ms
6,944 KB
testcase_37 AC 168 ms
30,680 KB
testcase_38 AC 2 ms
6,940 KB
testcase_39 AC 2 ms
6,944 KB
testcase_40 AC 92 ms
20,156 KB
testcase_41 AC 123 ms
30,636 KB
testcase_42 AC 168 ms
33,176 KB
testcase_43 AC 166 ms
30,108 KB
testcase_44 AC 120 ms
20,288 KB
testcase_45 AC 101 ms
18,268 KB
testcase_46 AC 1 ms
6,944 KB
testcase_47 AC 1 ms
6,940 KB
testcase_48 AC 2 ms
6,940 KB
testcase_49 AC 2 ms
6,944 KB
testcase_50 AC 2 ms
6,944 KB
testcase_51 AC 2 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
// created [2020/01/18] 16:39:20
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

using i32   = int32_t;
using i64   = int64_t;
using u32   = uint32_t;
using u64   = uint64_t;
using uint  = unsigned int;
using usize = std::size_t;
using ll    = long long;
using ull   = unsigned long long;
using ld    = long double;
template<typename T, usize n>
using arr = T (&)[n];
template<typename T, usize n>
using c_arr = const T (&)[n];
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }
template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }
template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }
template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod                  = 1000000007;
template<typename T> constexpr T inf_v      = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};
auto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };

template<typename T>
T in()
{
    T v;
    return std::cin >> v, v;
}
template<typename T, typename Uint, usize n, usize i>
T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); }
template<typename T, typename Uint, usize n, usize i>
auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs)
{
    const usize s = (usize)szs[i];
    std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);
    for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); }
    return ans;
}
template<typename T, typename Uint, usize n>
auto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); }
template<typename... Types>
auto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; }
struct io_init
{
    io_init()
    {
        std::cin.tie(nullptr), std::ios::sync_with_stdio(false);
        std::cout << std::fixed << std::setprecision(20);
    }
    void clear()
    {
        std::cin.tie(), std::ios::sync_with_stdio(true);
    }
} io_setting;

template<typename T>
int out(const T& v) { return std::cout << v, 0; }
template<typename T>
int out(const std::vector<T>& v)
{
    for (usize i = 0; i < v.size(); i++) {
        if (i > 0) { std::cout << ' '; }
        out(v[i]);
    }
    return std::cout << "\n", 0;
}
template<typename T1, typename T2>
int out(const std::pair<T1, T2>& v) { return out(v.first), std::cout << ' ', out(v.second), 0; }
template<typename T, typename... Args>
int out(const T& v, const Args... args) { return out(v), std::cout << ' ', out(args...), 0; }
template<typename... Args>
int outln(const Args... args) { return out(args...), std::cout << '\n', 0; }
template<typename... Args>
void outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }
#    define SHOW(...) static_cast<void>(0)
constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }

template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; }
template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{})
{
    const usize s = (usize)szs[i];
    return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v));
}
template<typename T, typename Uint, usize n>
auto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); }
int main()
{
    const auto N = in<int>();
    std::vector<ll> a(N), b(N), c(N);
    for (int i = 0; i < N; i++) { std::tie(a[i], b[i], c[i]) = in_t<ll, ll, ll>(); }
    const int L = (N + 1) / 2;
    using pll   = std::pair<ll, ll>;  // <cost,value>
    std::vector<pll> l[3];
    auto left = mfp([&](auto&& self, const int day, const ll cost, const ll value, const int last) -> void {
        if (day >= L) {
            l[last].push_back({cost, value});
        } else if (last == 1) {
            self(self, day + 1, cost + c[day], value + b[day], 2);
        } else {
            self(self, day + 1, cost - a[day], value, 0);
            self(self, day + 1, cost, value, 1);
        }
    });
    left(0, 0, 0, 0);
    std::vector<pll> r[3];
    auto right = mfp([&](auto&& self, const int day, const ll cost, const ll value, const int last, const int first) -> void {
        if (day >= N) {
            r[first].push_back({cost, value});
        } else if (last == 1) {
            self(self, day + 1, cost + c[day], value + b[day], 2, first);
        } else {
            self(self, day + 1, cost - a[day], value, 0, first);
            self(self, day + 1, cost, value, 1, first);
        }
    });
    for (int i = 0; i < 3; i++) { right(L, 0, 0, i, i); }
    auto unique = [&](std::vector<pll>& v) {
        std::sort(v.begin(), v.end());
        ll max = 0;
        for (auto& p : v) {
            chmax(max, p.second);
            p.second = max;
        }
        v.erase(std::unique(v.begin(), v.end()), v.end());
    };
    for (int i = 0; i < 3; i++) { unique(l[i]), unique(r[i]); }
    ll ans = 0;
    for (int i = 0; i < 3; i++) {
        for (const auto& p : l[i]) {
            const ll lc = p.first;
            const ll lv = p.second;
            const ll rc = -lc;
            auto it     = std::lower_bound(r[i].begin(), r[i].end(), pll{rc + 1, 0LL});
            if (it == r[i].begin()) { break; }
            it--;
            const ll rv = it->second;
            chmax(ans, lv + rv);
        }
    }
    outln(ans);
    return 0;
}
0