結果

問題 No.1690 Power Grid
コンテスト
ユーザー scol_kp
提出日時 2021-09-24 23:07:35
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 185 ms / 3,000 ms
コード長 5,195 bytes
コンパイル時間 2,296 ms
コンパイル使用メモリ 201,404 KB
最終ジャッジ日時 2025-01-24 17:42:52
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

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>;
template <class T>
using min_priority_queue = std::priority_queue<T, std::vector<T>, std::greater<T>>;

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

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

template <typename T>
struct WeightedEdge {
    int to;
    T cost;
    constexpr WeightedEdge(int to, T cost = -1) noexcept : to(to), cost(cost) {}
};
template <typename T>
using WeightedGraph = std::vector<std::vector<WeightedEdge<T>>>;

ll dp[1 << 18];
ll dist[18][18];

void solve() {
    ll N, M, K;
    cin >> N >> M >> K;
    Vl A(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
    }
    WeightedGraph<ll> g(N);
    fill_n((ll*)dist, sizeof(dist) / sizeof(ll), L_INF);
    for (ll i = 0; i < N; i++) {
        dist[i][i] = 0;
    }
    for (ll i = 0; i < M; i++) {
        ll x, y, z;
        cin >> x >> y >> z;
        --x, --y;
        g[x].emplace_back(y, z);
        g[y].emplace_back(x, z);
        dist[x][y] = z;
        dist[y][x] = z;
    }

    for (ll k = 0; k < N; k++) {
        for (ll i = 0; i < N; i++) {
            for (ll j = 0; j < N; j++) {
                if (dist[i][k] != L_INF && dist[k][j] != L_INF) {
                    chmin(dist[i][j], dist[i][k] + dist[k][j]);
                }
            }
        }
    }

    fill_n((ll*)dp, sizeof(dp) / sizeof(ll), L_INF);
    for (ll i = 0; i < N; i++) {
        dp[1 << i] = A[i];
    }
    for (ll i = 0; i < K; i++) {
        for (ll mask = 0; mask < 1 << N; mask++) {
            if (__builtin_popcountll(mask) != i)
                continue;
            for (ll j = 0; j < N; j++) {
                if (mask >> j & 1)
                    continue;
                for (ll k = 0; k < N; k++) {
                    if (~mask >> k & 1)
                        continue;
                    if (dp[mask] != L_INF)
                        chmin(dp[mask | (1 << j)], dp[mask] + dist[j][k] + A[j]);
                }
            }
        }
    }
    ll ans = L_INF;
    for (ll mask = 0; mask < 1 << N; mask++) {
        if (__builtin_popcountll(mask) == K) {
            chmin(ans, dp[mask]);
        }
    }
    prints()(ans);
}

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

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