結果

問題 No.1045 直方体大学
ユーザー TAISA_TAISA_
提出日時 2020-05-01 22:16:46
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 342 ms / 2,000 ms
コード長 4,686 bytes
コンパイル時間 2,571 ms
コンパイル使用メモリ 208,856 KB
実行使用メモリ 63,024 KB
最終ジャッジ日時 2023-08-26 14:39:50
合計ジャッジ時間 4,606 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 3 ms
4,376 KB
testcase_07 AC 3 ms
4,380 KB
testcase_08 AC 111 ms
63,020 KB
testcase_09 AC 104 ms
63,024 KB
testcase_10 AC 108 ms
62,960 KB
testcase_11 AC 104 ms
62,972 KB
testcase_12 AC 120 ms
62,920 KB
testcase_13 AC 115 ms
62,916 KB
testcase_14 AC 110 ms
62,904 KB
testcase_15 AC 122 ms
62,968 KB
testcase_16 AC 133 ms
62,972 KB
testcase_17 AC 2 ms
4,376 KB
testcase_18 AC 342 ms
62,972 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
constexpr ll INF = (1LL << 30) - 1LL;
constexpr ll MOD = 1e9 + 7;
constexpr int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
template <class T>
void chmin(T &a, T b) { a = min(a, b); }
template <class T>
void chmax(T &a, T b) { a = max(a, b); }
void debug() { cerr << "ok" << endl; }
template <class T>
void printv(const vector<T> &v) {
    for (int i = 0; i < v.size(); i++) cout << v[i] << (i + 1 == v.size() ? '\n' : ' ');
}
template <class T>
void readv(vector<T> &v) {
    for (int i = 0; i < v.size(); i++) cin >> v[i];
}
//from http://noshi91.hatenablog.com/entry/2019/03/31/174006
template <std::uint_fast64_t Modulus>
class modint {
    using u64 = std::uint_fast64_t;

  public:
    u64 a;
    constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
    constexpr u64 &value() noexcept { return a; }
    constexpr const u64 &value() const noexcept { return a; }
    constexpr modint operator+(const modint rhs) const noexcept {
        return modint(*this) += rhs;
    }
    constexpr modint operator-(const modint rhs) const noexcept {
        return modint(*this) -= rhs;
    }
    constexpr modint operator*(const modint rhs) const noexcept {
        return modint(*this) *= rhs;
    }
    constexpr modint operator/(const modint rhs) const noexcept {
        return modint(*this) /= rhs;
    }
    constexpr modint operator^(const u64 rhs) const noexcept {
        return modint(*this) ^= rhs;
    }
    constexpr modint &operator+=(const modint rhs) noexcept {
        a += rhs.a;
        if (a >= Modulus) {
            a -= Modulus;
        }
        return *this;
    }
    constexpr modint &operator-=(const modint rhs) noexcept {
        if (a < rhs.a) {
            a += Modulus;
        }
        a -= rhs.a;
        return *this;
    }
    constexpr modint &operator*=(const modint rhs) noexcept {
        a = a * rhs.a % Modulus;
        return *this;
    }
    constexpr modint &operator/=(modint rhs) noexcept {
        u64 exp = Modulus - 2;
        while (exp) {
            if (exp % 2) {
                *this *= rhs;
            }
            rhs *= rhs;
            exp /= 2;
        }
        return *this;
    }
    constexpr modint &operator^=(u64 exp) {
        modint rhs = modint(*this);
        a = 1;
        while (exp) {
            if (exp % 2) {
                *this *= rhs;
            }
            rhs *= rhs;
            exp /= 2;
        }
        return *this;
    }
    friend ostream &operator<<(ostream &os, const modint &x) {
        os << x.a;
        return os;
    }
    friend istream &operator>>(istream &is, modint &x) {
        is >> x.a;
        return is;
    }
};
using mint = modint<MOD>;
vector<mint> f, fi;
void comb(int n) {
    f.resize(n + 1);
    fi.resize(n + 1);
    f[0] = 1;
    for (ll i = 1; i <= n; i++) {
        f[i] = f[i - 1] * mint(i);
    }
    fi[n] = mint(1) / f[n];
    for (ll i = n - 1; i >= 0; i--) {
        fi[i] = fi[i + 1] * mint(i + 1LL);
    }
}
mint ncr(ll n, ll r) {
    if (n < r) {
        return mint(0);
    }
    if (r == 0) {
        return mint(1);
    }
    return f[n] * fi[n - r] * fi[r];
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    V<V<int>> a(n, V<int>(3));
    for (int i = 0; i < n; i++) {
        cin >> a[i][0] >> a[i][1] >> a[i][2];
    }
    int id[3][2] = {{1, 2}, {2, 0}, {0, 1}};
    V<V<V<int>>> dp((1 << n), V<V<int>>(n, V<int>(3, -INF)));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 3; j++) {
            dp[(1 << i)][i][j] = a[i][j];
        }
    }
    int res = -INF;
    for (int i = 0; i < (1 << n); i++) {
        for (int j = 0; j < n; j++) {
            for (int k = 0; k < 3; k++) {
                if (dp[i][j][k] == -INF) continue;
                chmax(res, dp[i][j][k]);
                for (int l = 0; l < n; l++) {
                    if ((i >> l) & 1) continue;
                    for (int m = 0; m < 3; m++) {
                        if (a[l][id[m][0]] >= a[j][id[k][0]] && a[l][id[m][1]] >= a[j][id[k][1]]) {
                            chmax(dp[i | (1 << l)][l][m], dp[i][j][k] + a[l][m]);
                        }
                        if (a[l][id[m][1]] >= a[j][id[k][0]] && a[l][id[m][0]] >= a[j][id[k][1]]) {
                            chmax(dp[i | (1 << l)][l][m], dp[i][j][k] + a[l][m]);
                        }
                    }
                }
            }
        }
    }
    cout << res << '\n';
}
0