結果

問題 No.974 最後の日までに
ユーザー 👑 hitonanodehitonanode
提出日時 2020-01-17 23:15:10
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 4,547 bytes
コンパイル時間 2,287 ms
コンパイル使用メモリ 179,456 KB
実行使用メモリ 324,428 KB
最終ジャッジ日時 2023-09-08 07:04:43
合計ジャッジ時間 8,947 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 TLE -
testcase_01 -- -
testcase_02 -- -
testcase_03 -- -
testcase_04 -- -
testcase_05 -- -
testcase_06 -- -
testcase_07 -- -
testcase_08 -- -
testcase_09 -- -
testcase_10 -- -
testcase_11 -- -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
testcase_41 -- -
testcase_42 -- -
testcase_43 -- -
testcase_44 -- -
testcase_45 -- -
testcase_46 -- -
testcase_47 -- -
testcase_48 -- -
testcase_49 -- -
testcase_50 -- -
testcase_51 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////


vector<plint> sol(vector<plint> v) {

    int n = v.size();
    vector<plint> ret(1e7, plint(1e18, 1e18));
    int t = 0;
    REP(S, 1 << n) {
        bool ok = true;
        REP(d, n - 1) {
            if ((S >> d) & (S >> (d + 1)) & 1) ok = false;
        }
        if (!ok) continue;
        lint cost = 0, val = 0;
        REP(d, n) if ((S >> d) & 1) cost += v[d].first, val += v[d].second;
        ret[t] = plint(cost, val);
        t++;
    }
    ret.resize(t);
    std::sort(ALL(ret));
    IREP(i, t - 1) if (ret[i].first == ret[i + 1].first) ret[i] = ret[i + 1];
    return ret;
}

lint maxcost;

lint solve(vector<plint> v1, vector<plint> v2) {
    vector<plint> w1 = sol(v1);
    vector<plint> w2 = sol(v2);
    lint ret = 0;
    for (auto p : w1) {
        lint cost = maxcost - p.first;
        auto itr = lower_bound(ALL(w2), plint(cost + 1, -1));
        if (itr == w2.begin()) continue;
        mmax(ret, prev(itr)->second + p.second);
    }
    return ret;
}

int main()
{
    int W;
    cin >> W;
    if (W == 1)
    {
        puts("0");
        return 0;
    }

    vector<lint> A(W), B(W), C(W);
    REP(i, W) cin >> A[i] >> B[i] >> C[i];
    maxcost = accumulate(ALL(A), 0LL);

    int n = (W - 1) / 2;
    vector<plint> cost_v1, cost_v2;

    vector<plint> D;
    REP(i, W - 1) D.emplace_back(A[i] + A[i + 1] + C[i + 1], B[i + 1]);

    REP(i, n - 1) cost_v1.emplace_back(D[i]);
    FOR(i, n, W - 1) cost_v2.emplace_back(D[i]);
    lint ret1 = solve(cost_v1, cost_v2);

    cost_v1.clear();
    cost_v2.clear();
    REP(i, n) cost_v1.emplace_back(D[i]);
    FOR(i, n + 1, W - 1) cost_v2.emplace_back(D[i]);
    lint ret2 = solve(cost_v1, cost_v2);

    cout << max(ret1, ret2) << endl;
}
0