結果

問題 No.974 最後の日までに
ユーザー iiljj
提出日時 2020-11-29 23:54:45
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 365 ms / 2,000 ms
コード長 10,875 bytes
コンパイル時間 2,974 ms
コンパイル使用メモリ 217,960 KB
最終ジャッジ日時 2025-01-16 10:18:46
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 49
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

/* #region Head */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;
#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))
#define endl '\n'
constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;
template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector
for (T &x : vec) is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector (for dump)
os << "{";
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
os << "}";
return os;
}
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector (inline)
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
return os;
}
template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair
is >> pair_var.first >> pair_var.second;
return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// map, um, set, us
template <class T> ostream &out_iter(ostream &os, T &map_var) {
os << "{";
REPI(itr, map_var) {
os << *itr;
auto itrcp = itr;
if (++itrcp != map_var.end()) os << ", ";
}
return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) {
os << "{";
REPI(itr, map_var) {
auto [key, value] = *itr;
os << "(" << key << ", " << value << ")";
auto itrcp = itr;
if (++itrcp != map_var.end()) os << ", ";
}
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
pq<T> pq_cp(pq_var);
os << "{";
if (!pq_cp.empty()) {
os << pq_cp.top(), pq_cp.pop();
while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
}
return os << "}";
}
void pprint() { cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&... tail) {
cout << head;
if (sizeof...(Tail) > 0) cout << ' ';
pprint(move(tail)...);
}
// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) DUMPOUT << ", ";
dump_func(move(tail)...);
}
// chmax ()
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
if (comp(xmax, x)) {
xmax = x;
return true;
}
return false;
}
// chmin ()
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
if (comp(x, xmin)) {
xmin = x;
return true;
}
return false;
}
//
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
#define VAR(type, ...) \
type __VA_ARGS__; \
cin >> __VA_ARGS__;
template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }
struct AtCoderInitialize {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
AtCoderInitialize() {
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH) cout << unitbuf;
}
} ATCODER_INITIALIZE;
void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }
/* #endregion */
// #include <atcoder/all>
// using namespace atcoder;
/* #region SparseTable */
template <typename T> struct SparseTable {
using F = function<T(T, T)>;
vc<vc<T>> dat;
vc<int> ht;
const F f;
SparseTable() {}
SparseTable(F f) : f(f) {}
void build(const vc<T> &v) {
ll n = SIZE(v), h = 1;
while ((1 << h) <= n) h++;
dat.assign(h, vc<T>(n));
ht.assign(n + 1, 0);
REPM(j, 2, n) ht[j] = ht[j >> 1] + 1;
REP(j, 0, n) dat[0][j] = v[j];
for (int i = 1, p = 1; i < h; i++, p <<= 1)
REP(j, 0, n) dat[i][j] = f(dat[i - 1][j], dat[i - 1][min(j + p, n - 1)]);
};
// [a, b)
T query(int a, int b) {
int l = b - a;
return f(dat[ht[l]][a], dat[ht[l]][b - (1 << ht[l])]);
}
};
/* #endregion */
// Problem
void solve() {
VAR(ll, w);
vll a(w), b(w), c(w);
REP(i, 0, w) cin >> a[i] >> b[i] >> c[i];
// 0,1,2
// - 0 0, 1 0 2
// - 1 +a[i]
// - 0 2 -c[i], +b[i]
// - 1, 2 2
// [0,2] 1 0
ll sz2 = w / 2, sz1 = w - sz2;
vc<pll> set1_rem0, set1_rem1, set2_rem0, set2_rem1;
// dump(sz1, sz2);
auto dfs1 = [&](auto &&dfs1, int pos, ll point, ll money) -> void {
if (pos == sz1) {
set1_rem0.emplace_back(money, point);
return;
}
if (pos == sz1 - 1) {
// 1 1 使 1 使
set1_rem1.emplace_back(money, point);
dfs1(dfs1, pos + 1, point, money + a[pos]);
} else {
// 2 [0,1] 1
dfs1(dfs1, pos + 2, point + b[pos + 1], money - c[pos + 1]);
dfs1(dfs1, pos + 1, point, money + a[pos]);
}
};
dfs1(dfs1, 0, 0, 0);
sort(ALL(set1_rem0));
sort(ALL(set1_rem1));
// dump(set1_rem0);
// dump(set1_rem1);
auto dfs2 = [&](auto &&dfs2, int pos, ll point, ll money, int offset) -> void {
if (pos == w) {
if (offset == sz1)
set2_rem0.emplace_back(money, point);
else
set2_rem1.emplace_back(money, point);
return;
}
if (pos == w - 1) {
// 1 1 使
dfs2(dfs2, pos + 1, point, money + a[pos], offset);
} else {
// 2 [0,1] 1
dfs2(dfs2, pos + 2, point + b[pos + 1], money - c[pos + 1], offset);
dfs2(dfs2, pos + 1, point, money + a[pos], offset);
}
};
dfs2(dfs2, sz1, 0, 0, sz1);
dfs2(dfs2, sz1 - 1, 0, 0, sz1 - 1);
sort(ALL(set2_rem0));
sort(ALL(set2_rem1));
// dump(set2_rem0);
// dump(set2_rem1);
auto f = [](pll a, pll b) -> pll {
if (a.second > b.second)
return a;
else
return b;
};
SparseTable<pll> tbl2_0(f), tbl2_1(f);
tbl2_0.build(set2_rem0);
tbl2_1.build(set2_rem1);
ll ma = 0;
// set1_rem0
for (auto [money, point] : set1_rem0) {
// set2_rem0
pll needle = {-money, -INF};
auto it = lower_bound(ALL(set2_rem0), needle);
if (it != set2_rem0.end()) {
int idx = it - set2_rem0.begin(); //
pll r = tbl2_0.query(idx, SIZE(set2_rem0));
chmax(ma, point + r.second);
}
}
// set1_rem1
for (auto [money, point] : set1_rem1) {
// set2_rem0
pll needle = {-money, -INF};
auto it = lower_bound(ALL(set2_rem1), needle);
if (it != set2_rem1.end()) {
int idx = it - set2_rem1.begin(); //
pll r = tbl2_1.query(idx, SIZE(set2_rem1));
chmax(ma, point + r.second);
}
}
pprint(ma);
}
// entry point
int main() {
solve();
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0