verify/aoj_dpl/aoj_dpl_2_a.test.cpp

View this file on GitHub
Last update: 2024-01-30 13:51:21+09:00
Problem: https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_2_A

Depends on

Code

#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_2_A"

#include <bits/stdc++.h>

#include "dp/traveling_salesman_problem.hpp"
#include "graph/read_graph.hpp"

int main() {
    int N, M;
    std::cin >> N >> M;
    auto G = read_graph<long long>(N, M, true, true, 0);
    const long long INF = 1LL << 60;
    auto res = traveling_salesman_problem<long long>(G, INF);
    long long ans = res.back()[0];
    if (ans == INF) ans = -1;
    std::cout << ans << '\n';
    return 0;
}

#line 1 "verify/aoj_dpl/aoj_dpl_2_a.test.cpp"
#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_2_A"

#include <bits/stdc++.h>

#line 2 "dp/traveling_salesman_problem.hpp"

#line 2 "graph/graph_template.hpp"

#line 4 "graph/graph_template.hpp"
template <class T> struct Edge {
    int from, to;
    T cost;
    int id;

    Edge() = default;
    Edge(int from, int to, T cost = 1, int id = -1) : from(from), to(to), cost(cost), id(id) {}

    friend std::ostream &operator<<(std::ostream &os, const Edge<T> &e) {
        // output format: "{ id : from -> to, cost }"
        return os << "{ " << e.id << " : " << e.from << " -> " << e.to << ", " << e.cost << " }";
    }
};

template <class T> using Edges = std::vector<Edge<T>>;
template <class T> using Graph = std::vector<std::vector<Edge<T>>>;
#line 4 "dp/traveling_salesman_problem.hpp"

template <class T>
std::vector<std::vector<T>>  //
traveling_salesman_problem(Graph<T> &G, const T INF) {
    const int N = (int)G.size();
    const int N2 = 1 << N;

    std::vector dist(N, std::vector<T>(N, INF));
    for (int i = 0; i < N; i++) dist[i][i] = T(0);
    for (int i = 0; i < N; i++) {
        for (auto &&e : G[i]) {
            dist[e.from][e.to] = std::min(dist[e.from][e.to], e.cost);
        }
    }
    std::vector dp(N2, std::vector<T>(N, INF));
    dp[0][0] = 0;
    for (int bit = 0; bit < N2; bit++) {
        for (int u = 0; u < N; u++) {
            if (dp[bit][u] == INF) continue;
            for (int v = 0; v < N; v++) {
                if (bit >> v & 1) continue;
                if (dist[u][v] == INF) continue;
                dp[bit | (1 << v)][v] = std::min(dp[bit | (1 << v)][v], dp[bit][u] + dist[u][v]);
            }
        }
    }
    return dp;
}
#line 2 "graph/read_graph.hpp"

#line 4 "graph/read_graph.hpp"

template <class T> Graph<T> read_graph(const int n, const int m, const bool weight = false, const bool directed = false, const int offset = 1) {
    Graph<T> g(n);
    for (int i = 0; i < m; i++) {
        int a, b;
        std::cin >> a >> b;
        a -= offset, b -= offset;
        if (weight) {
            T c;
            std::cin >> c;
            if (!directed) g[b].push_back(Edge(b, a, c, i));
            g[a].push_back(Edge(a, b, c, i));
        } else {
            // c = 1
            if (!directed) g[b].push_back(Edge(b, a, T(1), i));
            g[a].push_back(Edge(a, b, T(1), i));
        }
    }
    return g;
}

template <class T> Graph<T> read_parent(const int n, const bool weight = false, const bool directed = false, const int offset = 1) {
    Graph<T> g(n);
    for (int i = 1; i < n; i++) {
        int p;
        std::cin >> p;
        p -= offset;
        if (weight) {
            T c;
            std::cin >> c;
            if (!directed) g[i].push_back(Edge(i, p, c, i - 1));
            g[p].push_back(Edge(p, i, c, i - 1));
        } else {
            // c = 1
            if (!directed) g[i].push_back(Edge(i, p, T(1), i - 1));
            g[p].push_back(Edge(p, i, T(1), i - 1));
        }
    }
    return g;
}

std::tuple<Graph<int>, std::vector<std::vector<int>>, std::vector<std::pair<int, int>>> read_grid(const int h, const int w, std::string rel = ".#") {
    std::vector<std::string> s(h);
    std::vector id(h, std::vector<int>(w, -1));
    std::vector<std::pair<int, int>> loc;
    int n = 0;
    for (int i = 0; i < h; i++) {
        std::cin >> s[i];
        for (int j = 0; j < w; j++) {
            if (s[i][j] == rel[1]) {
                id[i][j] = n++;
                loc.emplace_back(i, j);
            }
        }
    }
    int m = 0;
    Graph<int> g(n);
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            if (s[i][j] == rel[1]) {
                if (i + 1 < h and s[i + 1][j] == rel[1]) {
                    g[id[i][j]].push_back(Edge(id[i][j], id[i + 1][j], 1, m));
                    g[id[i + 1][j]].push_back(Edge(id[i + 1][j], id[i][j], 1, m++));
                }
                if (j + 1 < w and s[i][j + 1] == rel[1]) {
                    g[id[i][j]].push_back(Edge(id[i][j], id[i][j + 1], 1, m));
                    g[id[i][j + 1]].push_back(Edge(id[i][j + 1], id[i][j], 1, m++));
                }
            }
        }
    }
    return {g, id, loc};
}
#line 7 "verify/aoj_dpl/aoj_dpl_2_a.test.cpp"

int main() {
    int N, M;
    std::cin >> N >> M;
    auto G = read_graph<long long>(N, M, true, true, 0);
    const long long INF = 1LL << 60;
    auto res = traveling_salesman_problem<long long>(G, INF);
    long long ans = res.back()[0];
    if (ans == INF) ans = -1;
    std::cout << ans << '\n';
    return 0;
}