#419242 (C++17) No.974 最後の日までに

提出ソース

結果

問題	No.974 最後の日までに
ユーザー	Pachicobue
提出日時	2020-01-18 00:04:19
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	7,565 bytes
コンパイル時間	2,706 ms
コンパイル使用メモリ	212,360 KB
実行使用メモリ	43,264 KB
最終ジャッジ日時	2024-06-26 02:14:28
合計ジャッジ時間	65,150 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	WA	-
testcase_01	WA	-
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	AC	1,427 ms 6,940 KB
testcase_24	WA	-
testcase_25	AC	2 ms 6,940 KB
testcase_26	AC	3 ms 6,944 KB
testcase_27	WA	-
testcase_28	WA	-
testcase_29	AC	2 ms 6,940 KB
testcase_30	WA	-
testcase_31	AC	2 ms 6,940 KB
testcase_32	AC	2 ms 6,944 KB
testcase_33	WA	-
testcase_34	WA	-
testcase_35	AC	2 ms 6,940 KB
testcase_36	WA	-
testcase_37	WA	-
testcase_38	WA	-
testcase_39	AC	2 ms 6,940 KB
testcase_40	AC	970 ms 6,944 KB
testcase_41	AC	1,429 ms 6,944 KB
testcase_42	WA	-
testcase_43	AC	1,454 ms 6,944 KB
testcase_44	WA	-
testcase_45	AC	731 ms 6,940 KB
testcase_46	AC	2 ms 6,940 KB
testcase_47	WA	-
testcase_48	WA	-
testcase_49	AC	2 ms 6,944 KB
testcase_50	AC	2 ms 6,940 KB
testcase_51	WA	-

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

ソースコード

raw source code

#include <bits/stdc++.h>
// created [2020/01/17] 22:58:41
#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 int N = in<int>();
    std::vector<ll> a(N), b(N), c(N);
    for (int i = 0; i < N; i++) { std::cin >> a[i] >> b[i] >> c[i]; }
    const int L = (N + 1) / 2;
    const int R = N / 2;
    std::map<ll, ll> lmp1, lmp2;
    std::map<ll, ll> rmp1, rmp3;
    for (int m = 0; m < (1 << L); m++) {
        const bool first = btest(m, 0);
        if (first) { continue; }
        const bool last = btest(m, L - 1);
        ll V = 0, C = 0;
        bool ng = false;
        for (int j = 0; j < L; j++) {
            if (btest(m, j)) {
                if (j > 0 and btest(m, j - 1)) {
                    ng = true;
                    break;
                }
                V += b[j], C += c[j] + a[j - 1];
            } else {
                C -= a[j];
            }
        }
        if (ng) { continue; }
        chmax((last ? lmp1 : lmp2)[C], V);
    }
    for (int m = 0; m < (1 << R); m++) {
        const bool first = btest(m, 0);
        ll V = 0, C = 0;
        bool ng = false;
        for (int j = 0; j < R; j++) {
            if (btest(m, j)) {
                if (j > 0 and btest(m, j - 1)) {
                    ng = true;
                    break;
                }
                V += b[L + j], C += c[L + j] + a[L + j - 1];
                if (j == 0) { C -= a[L - 1]; }
            } else {
                C -= a[L + j];
            }
        }
        if (ng) { continue; }
        chmax(rmp3[C], V);
        if (first) { chmax(rmp1[C], V); }
    }
    auto conv = [&](std::map<ll, ll>& mp) {
        ll v = 0;
        for (auto& p : mp) {
            chmax(v, p.second);
            p.second = v;
        }
    };
    SHOW(lmp1, lmp2, rmp1, rmp3);
    conv(lmp1), conv(lmp2);
    conv(rmp1), conv(rmp3);
    SHOW(lmp1, lmp2, rmp1, rmp3);
    ll ans = 0;
    for (const auto& p1 : lmp1) {
        const ll lc = p1.first;
        const ll lv = p1.second;
        const ll rc = -lc;
        auto it     = rmp1.upper_bound(rc);
        if (it == rmp1.begin()) { continue; }
        it--;
        const ll rv = it->second;
        chmax(ans, lv + rv);
    }
    for (const auto& p2 : lmp2) {
        const ll lc = p2.first;
        const ll lv = p2.second;
        const ll rc = -lc;
        auto it     = rmp3.upper_bound(rc);
        if (it == rmp3.begin()) { continue; }
        it--;
        const ll rv = it->second;
        chmax(ans, lv + rv);
    }
    outln(ans);
    return 0;
}

yukicoder

結果

テストケース

ソースコード