結果
問題 | No.974 最後の日までに |
ユーザー |
👑 ![]() |
提出日時 | 2025-01-08 15:04:48 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,953 bytes |
コンパイル時間 | 1,594 ms |
コンパイル使用メモリ | 137,536 KB |
実行使用メモリ | 21,484 KB |
最終ジャッジ日時 | 2025-01-08 15:04:56 |
合計ジャッジ時間 | 7,098 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 29 WA * 20 |
ソースコード
#include <algorithm>// #include <atcoder/all>#include <bitset>#include <cassert>#include <cmath>#include <ctime>#include <functional>#include <iomanip>#include <iostream>#include <map>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <tuple>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;// using namespace atcoder;typedef long long ll;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)#define repk(i, k, n) for (int i = k; i < (int)(n); i++)#define all(v) v.begin(), v.end()#define mod1 1000000007#define mod2 998244353#define mod3 100000007#define vi vector<int>#define vs vector<string>#define vc vector<char>#define vl vector<ll>#define vb vector<bool>#define vvi vector<vector<int>>#define vvc vector<vector<char>>#define vvl vector<vector<ll>>#define vvb vector<vector<bool>>#define vvvi vector<vector<vector<int>>>#define vvvl vector<vector<vector<ll>>>#define pii pair<int, int>#define pil pair<int, ll>#define pli pair<ll, int>#define pll pair<ll, ll>#define vpii vector<pair<int, int>>#define vpll vector<pair<ll, ll>>#define vvpii vector<vector<pair<int, int>>>#define vvpll vector<vector<pair<ll, ll>>>// using mint = modint998244353;template <typename T>void debug(T e) {cerr << e << endl;}template <typename T>void debug(vector<T> &v) {rep(i, v.size()) { cerr << v[i] << " "; }cerr << endl;}template <typename T>void debug(vector<vector<T>> &v) {rep(i, v.size()) {rep(j, v[i].size()) { cerr << v[i][j] << " "; }cerr << endl;}}template <typename T>void debug(vector<pair<T, T>> &v) {rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }}template <typename T>void debug(set<T> &st) {for (auto itr = st.begin(); itr != st.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(multiset<T> &ms) {for (auto itr = ms.begin(); itr != ms.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(map<T, T> &mp) {for (auto itr = mp.begin(); itr != mp.end(); itr++) {cerr << itr->first << " " << itr->second << endl;}}void debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << H << " ";debug_out(T...);}void dfs(ll last, vector<ll> &a, vector<ll> &b, vector<ll> &c,vector<vector<pll>> &p, ll now_idx, ll like, ll money) {if (now_idx == a.size()) {p[last].push_back(pll(money, like));return;}if (last == 0) {dfs(2, a, b, c, p, now_idx + 1, like + b[now_idx], money - c[now_idx]);} else {dfs(0, a, b, c, p, now_idx + 1, like, money);dfs(1, a, b, c, p, now_idx + 1, like, money + a[now_idx]);}}int main() {ll W;cin >> W;vector<ll> a(W);vector<ll> b(W);vector<ll> c(W);for (ll i = 0; i < W; i++) {cin >> a[i] >> b[i] >> c[i];}vector<vector<pll>> former_p(3, vector<pll>(0));if (W <= 28) {dfs(-1, a, b, c, former_p, 0, 0, 0);ll ans = 0;for (ll i = 0; i < 3; i++) {for (ll j = 0; j < former_p[i].size(); j++) {if (former_p[i][j].first >= 0) {ans = max(ans, former_p[i][j].second);}}}cout << ans << endl;} else {vector<ll> af(0);vector<ll> bf(0);vector<ll> cf(0);for (ll i = 0; i < W / 2; i++) {af.push_back(a[i]);bf.push_back(b[i]);cf.push_back(c[i]);}dfs(-1, af, bf, cf, former_p, 0, 0, 0);vector<vector<pll>> ordered_fp(3, vector<pll>(0));for (ll i = 0; i < 3; i++) {sort(all(former_p[i]));ll len = former_p[i].size();ordered_fp[i].push_back(former_p[i][len - 1]);ll prev_like = former_p[i][len - 1].second;for (ll j = len - 2; j >= 0; j--) {if (prev_like < former_p[i][j].second) {ordered_fp[i].push_back(former_p[i][j]);}}reverse(all(ordered_fp[i]));// debug(ordered_fp[i]);// cout << endl;}vector<ll> al(0);vector<ll> bl(0);vector<ll> cl(0);for (ll i = W / 2; i < W; i++) {al.push_back(a[i]);bl.push_back(b[i]);cl.push_back(c[i]);}ll ans = 0;for (ll i = 0; i < 3; i++) {vector<vector<pll>> latter_p(3, vector<pll>(0));if (i == 0) {dfs(0, al, bl, cl, latter_p, 1, 0, 0);} else if (i == 1) {dfs(1, al, bl, cl, latter_p, 1, 0, al[0]);} else {dfs(2, al, bl, cl, latter_p, 1, bl[0], -cl[0]);}for (ll j = 0; j < 3; j++) {if (j == 0) {if (i == 0 || i == 1) {continue;}} else {if (i == 2) {continue;}}for (ll k = 0; k < 3; k++) {for (ll l = 0; l < latter_p[k].size(); l++) {auto itr =lower_bound(all(ordered_fp[j]),make_pair(-latter_p[k][l].first, 0LL));if (itr != ordered_fp[j].end()) {ans =max(ans, latter_p[k][l].second + (*itr).second);}}}}}cout << ans << endl;}}