結果

問題 No.519 アイドルユニット
ユーザー scol_kpscol_kp
提出日時 2020-12-14 01:26:41
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 3,467 bytes
コンパイル時間 2,145 ms
コンパイル使用メモリ 203,808 KB
実行使用メモリ 36,300 KB
最終ジャッジ日時 2024-09-20 00:21:28
合計ジャッジ時間 4,937 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 RE -
testcase_01 RE -
testcase_02 AC 14 ms
36,280 KB
testcase_03 AC 11 ms
36,180 KB
testcase_04 AC 10 ms
36,104 KB
testcase_05 AC 9 ms
36,064 KB
testcase_06 AC 10 ms
36,128 KB
testcase_07 AC 10 ms
36,120 KB
testcase_08 AC 10 ms
36,116 KB
testcase_09 AC 9 ms
36,128 KB
testcase_10 AC 10 ms
36,180 KB
testcase_11 AC 11 ms
36,212 KB
testcase_12 AC 11 ms
36,236 KB
testcase_13 AC 11 ms
36,156 KB
testcase_14 AC 10 ms
36,080 KB
testcase_15 AC 10 ms
36,088 KB
testcase_16 AC 11 ms
36,120 KB
testcase_17 AC 9 ms
36,284 KB
testcase_18 AC 10 ms
36,140 KB
testcase_19 AC 11 ms
36,160 KB
testcase_20 AC 10 ms
36,112 KB
testcase_21 AC 11 ms
36,284 KB
testcase_22 AC 11 ms
36,300 KB
testcase_23 AC 11 ms
36,180 KB
testcase_24 AC 11 ms
36,084 KB
testcase_25 AC 12 ms
36,104 KB
testcase_26 AC 12 ms
36,164 KB
testcase_27 AC 11 ms
36,088 KB
testcase_28 AC 12 ms
36,240 KB
testcase_29 RE -
testcase_30 RE -
testcase_31 RE -
testcase_32 RE -
testcase_33 AC 11 ms
36,216 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define FASTIO
using namespace std;

using ll = long long;
using Vi = std::vector<int>;
using Vl = std::vector<ll>;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;

constexpr int I_INF = std::numeric_limits<int>::max();
constexpr ll L_INF = std::numeric_limits<ll>::max();

template <typename T1, typename T2>
inline bool chmin(T1& a, const T2& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2>
inline bool chmax(T1& a, const T2& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <ostream& os = std::cout>
class Prints {
private:
    class __Prints {
    public:
        __Prints(const char* sep, const char* term) : sep(sep), term(term) {}
        template <class... Args>
        auto operator()(const Args&... args) const -> decltype((os << ... << std::declval<Args>()), void()) { print(args...); }
        template <typename T>
        auto pvec(const T& vec, size_t sz) const -> decltype(os << std::declval<decltype(std::declval<T>()[0])>(), void()) {
            for (size_t i = 0; i < sz; i++)
                os << vec[i] << (i == sz - 1 ? term : sep);
        }
        template <typename T>
        auto pmat(const T& mat, size_t h, size_t w) -> decltype(os << std::declval<decltype(std::declval<T>()[0][0])>(), void()) {
            for (size_t i = 0; i < h; i++)
                for (size_t j = 0; j < w; j++)
                    os << mat[i][j] << (j == w - 1 ? term : sep);
        }

    private:
        const char *sep, *term;
        void print() const { os << term; }
        void print_rest() const { os << term; }
        template <class T, class... Tail>
        void print(const T& head, const Tail&... tail) const { os << head, print_rest(tail...); }
        template <class T, class... Tail>
        void print_rest(const T& head, const Tail&... tail) const { os << sep << head, print_rest(tail...); }
    };

public:
    Prints() {}
    __Prints operator()(const char* sep = " ", const char* term = "\n") const { return __Prints(sep, term); }
};

Prints<> prints;
Prints<std::cerr> prints_err;

//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

int F[23][23];
int dp[1 << 23];

void solve() {
    int N;
    cin >> N;
    for (ll i = 0; i < N; i++) {
        for (ll j = 0; j < N; j++) {
            cin >> F[i][j];
        }
    }
    memset(dp, -1, sizeof(dp));
    auto dfs = [&](auto&& self, int S) noexcept -> int {
        if (dp[S] != -1) return dp[S];
        if (S == (1 << N) - 1) return 0;
        int idx = 0;
        while (idx < N && S >> idx & 1) ++idx;
        int res = 0;
        for (ll i = idx + 1; i < N; i++) {
            if (~S >> i & 1) {
                chmax(res, self(self, S | (1 << idx) | (1 << i)) + F[idx][i]);
            }
        }
        dp[S] = res;
        return res;
    };
    prints()(dfs(dfs, 0));
}

//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

int main() {
#ifdef FASTIO
    std::cin.tie(nullptr), std::cout.tie(nullptr);
    std::ios::sync_with_stdio(false);
#endif
#ifdef FILEINPUT
    std::ifstream ifs("./in_out/input.txt");
    std::cin.rdbuf(ifs.rdbuf());
#endif
#ifdef FILEOUTPUT
    std::ofstream ofs("./in_out/output.txt");
    std::cout.rdbuf(ofs.rdbuf());
#endif
    std::cout << std::setprecision(18) << std::fixed;
    solve();
    std::cout << std::flush;
    return 0;
}
0