結果
問題 | No.1045 直方体大学 |
ユーザー |
![]() |
提出日時 | 2022-09-12 00:06:14 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,624 bytes |
コンパイル時間 | 901 ms |
コンパイル使用メモリ | 84,236 KB |
最終ジャッジ日時 | 2025-02-07 04:24:55 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 7 TLE * 10 |
ソースコード
#include <algorithm>#include <iostream>#include <numeric>#include <string>#include <tuple>#include <utility>#include <vector>#include <limits>#define rep(i, a, b) for (int i = int(a); i < int(b); i++)using namespace std;using ll = long long int; // NOLINTusing P = pair<ll, ll>;// clang-format off#ifdef _DEBUG_#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }#else#define dump(...) do{ } while(false)#endiftemplate<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }struct Inf { template<typename T> constexpr operator T() { return numeric_limits<T>::max() / 2; } };// clang-format on#include <array>template<typename T, typename... Index>class FlatVector : public vector<T> {private:array<size_t, sizeof...(Index)> args;public:template<typename F>FlatVector(F &&init, Index... arg) : vector<T>((arg * ...), forward<T>(init)), args({static_cast<size_t>(arg)...}) {}T &idx(Index... arg) {array<size_t, sizeof...(Index)> _args = {static_cast<size_t>(arg)...};size_t index = 0;for (size_t i = 0; i < sizeof...(Index); i++) {index *= args[i];index += _args[i];}return this->operator[](index);}};template<typename T, typename... Index>FlatVector(T, Index...) -> FlatVector<T, Index...>;int main() {cin.tie(nullptr);ios::sync_with_stdio(false);int n;cin, n;vector<vector<ll>> v(n);rep(i, 0, n) {int a, b, c;cin, a, b, c;v[i] = {a, b, c};}const int bits = 1 << n;auto dp = FlatVector(0LL, bits, n, 3);ll ans = 0;rep(i, 0, n) {rep(j, 0, 3) {dp.idx(1 << i, i, j) = v[i][j];chmax(ans, v[i][j]);}}rep(bit, 1, bits) {rep(i, 0, n) {if (!((bit >> i) & 1)) continue;rep(j, 0, 3) {vector<int> box;rep(t, 0, 3) {if (t != j) box.push_back(v[i][t]);}if (box[0] > box[1]) swap(box[0], box[1]);rep(k, 0, n) {if ((bit >> k) & 1) continue;rep(l, 0, 3) {vector<int> nbox;rep(t, 0, 3) {if (t != l) nbox.push_back(v[k][t]);}if (nbox[0] > nbox[1]) swap(nbox[0], nbox[1]);if (nbox[0] <= box[0] && nbox[1] <= box[1]) {chmax(dp.idx(bit | (1 << k), k, l), dp.idx(bit, i, j) + v[k][l]);chmax(ans, dp.idx(bit | (1 << k), k, l));}}}}}}print(ans);return 0;}