結果
| 問題 | No.114 遠い未来 |
| ユーザー |
 横山緑
|
| 提出日時 | 2025-03-03 04:56:04 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 9,346 bytes |
| コンパイル時間 | 4,184 ms |
| コンパイル使用メモリ | 309,676 KB |
| 実行使用メモリ | 8,608 KB |
| 最終ジャッジ日時 | 2025-03-03 04:56:24 |
| 合計ジャッジ時間 | 16,001 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 24 TLE * 1 |
ソースコード
#line 1 "/home/y_midori/cp/test/ng.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/114"
#line 2 "template.hpp"
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
// https://xn--kst.jp/blog/2019/08/29/cpp-comp/
// debug methods
// usage: debug(x,y);
// vector 出力できるように修正
template <typename T>
ostream& debug_print(ostream& os, const vector<T>& v) {
os << "[";
for (size_t i = 0; i < v.size(); ++i) {
os << v[i];
if (i < v.size() - 1) os << ", ";
}
os << "]";
return os;
}
template <typename T>
ostream& debug_print(ostream& os, const T& var) {
os << var;
return os;
}
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define debug_1(x1) { cout << #x1 << ": "; debug_print(cout, x1) << endl; }
#define debug_2(x1, x2) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << endl; }
#define debug_3(x1, x2, x3) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << endl; }
#define debug_4(x1, x2, x3, x4) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << ", " << #x4 << ": "; debug_print(cout, x4) << endl; }
#define debug_5(x1, x2, x3, x4, x5) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << ", " << #x4 << ": "; debug_print(cout, x4) << ", " << #x5 << ": "; debug_print(cout, x5) << endl; }
#ifdef LOCAL
#define debug(...) CHOOSE((__VA_ARGS__, debug_5, debug_4, debug_3, debug_2, debug_1, ~))(__VA_ARGS__)
#else
#define debug(...)
#endif
using ll = long long;
using vl = vector<ll>;
using vll = vector<vl>;
using P = pair<ll, ll>;
#define all(v) v.begin(), v.end()
template <typename T> inline bool chmax(T &a, T b) {
return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
return ((a > b) ? (a = b, true) : (false));
}
#define rep1(i, n) for(ll i = 1; i <= ((ll)n); ++i)
// https://trap.jp/post/1224/
template <class... T> constexpr auto min(T... a) {
return min(initializer_list<common_type_t<T...>>{a...});
}
template <class... T> constexpr auto max(T... a) {
return max(initializer_list<common_type_t<T...>>{a...});
}
template <class... T> void input(T &...a) { (cin >> ... >> a); }
template <class T> void input(vector<T> &a) {
for(T &x : a)
cin >> x;
}
void print() { cout << '\n'; }
template <class T, class... Ts> void print(const T &a, const Ts &...b) {
cout << a;
(cout << ... << (cout << ' ', b));
cout << '\n';
}
void print(const string &s) {
cout << s << '\n';
}
template <class Container, typename = void>
struct is_container : std::false_type {};
template <class Container>
struct is_container<Container, std::void_t<decltype(std::declval<Container>().begin()), decltype(std::declval<Container>().end())>> : std::true_type {};
template <class Container>
typename enable_if<is_container<Container>::value>::type print(const Container& x) {
if (!x.empty()) {
auto it = x.begin();
for (; it != prev(x.end()); ++it) {
cout << *it << " ";
}
cout << *it << "\n"; // 最後の要素を出力して改行
}
}
#define INT(...) \
int __VA_ARGS__; \
input(__VA_ARGS__)
#define LL(...) \
long long __VA_ARGS__; \
input(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
input(__VA_ARGS__)
#define REP1(a) for(ll i = 0; i < a; i++)
#define REP2(i, a) for(ll i = 0; i < a; i++)
#define REP3(i, a, b) for(ll i = a; i < b; i++)
#define REP4(i, a, b, c) for(ll i = a; i < b; i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)
ll inf = 3e18;
vl dx = {1, -1, 0, 0};
vl dy = {0, 0, 1, -1};
#line 3 "data_structure/union-find.hpp"
struct UnionFind {
int n;
vector<int> p;
UnionFind(int n) : n(n), p(n, -1) {}
int leader(int x) {
if(p[x] < 0)
return x;
return p[x] = leader(p[x]);
}
int merge(int x, int y) {
x = leader(x), y = leader(y);
if(x == y)
return x;
if(-p[x] < -p[y])
swap(x, y);
p[x] += p[y];
p[y] = x;
return x;
}
int size(int x) { return -p[leader(x)]; }
bool same(int x, int y) { return leader(x) == leader(y); }
};
#line 3 "graph/graph-template.hpp"
// https://ei1333.github.io/library/graph/graph-template.hpp
template <class T = ll> struct Edge {
int from, to;
T cost;
int idx;
Edge() = default;
Edge(int from, int to, T cost = 1, int idx = -1)
: from(from), to(to), cost(cost), idx(idx) {}
};
template <class T = ll> struct Graph {
vector<vector<Edge<T>>> g;
int es; // edge_size
Graph(int n) : g(n), es(0) {};
int size() const { return ssize(g); }
void add_directed_edge(int from, int to, T cost = 1) {
g[from].emplace_back(from, to, cost, es++);
}
void add_edge(int from, int to, T cost = 1) {
g[from].emplace_back(from, to, cost, es);
g[to].emplace_back(to, from, cost, es++);
}
vector<Edge<T>> &operator[](const int &k) { return g[k]; }
const vector<Edge<T>> &operator[](const int &k) const { return g[k]; }
void read(int m, int padding = -1, bool weighted = false,
bool directed = false) {
rep(i, m) {
int a, b;
T c(1);
cin >> a >> b;
a += padding;
b += padding;
if(weighted)
cin >> c;
if(directed)
add_directed_edge(a, b, c);
else
add_edge(a, b, c);
}
}
};
#line 3 "graph/minimum-steiner-tree.hpp"
template <class T = ll> struct MinimumSteinerTree {
int n, k;
vector<int> terminal;
T cost;
const T infty = numeric_limits<T>::max();
vector<vector<T>> dp;
MinimumSteinerTree(const Graph<T> &g, const vector<int> terminal)
: n(g.size()), k(terminal.size()), terminal(terminal), cost(0),
dp(1 << k, vector<T>(n, infty)) {
assert(!terminal.empty());
rep(i, k) { dp[1 << i][terminal[i]] = 0; }
rep(bit, 1, 1 << k) {
rep(i, n) {
for(int sub = (bit - 1) & bit; sub > 0; sub = (sub - 1) & bit) {
if(dp[sub][i] != infty and dp[bit ^ sub][i] != infty)
chmin(dp[bit][i], dp[sub][i] + dp[bit ^ sub][i]);
}
}
using pti = pair<T, int>;
priority_queue<pti, vector<pti>, greater<pti>> pq;
rep(i, n) pq.push(pti(dp[bit][i], i));
while(pq.size()) {
auto [c, v] = pq.top();
pq.pop();
if(c != dp[bit][v] or c == infty)
continue;
for(auto &e : g[v]) {
T nc = c + e.cost;
if(chmin(dp[bit][e.to], nc))
pq.push(pti(nc, e.to));
}
}
}
cost = dp.back()[terminal.front()];
}
};
#line 5 "/home/y_midori/cp/test/ng.test.cpp"
void solve() {
INT(n, m, t);
if(t < 15) {
Graph<ll> g(n);
g.read(m, -1, true);
vector<int> term(t);
for(auto &ti : term) {
cin >> ti;
--ti;
}
MinimumSteinerTree<ll> mst(g, term);
print(mst.cost);
} else {
using T = tuple<int, int, int>;
vector<T> edge(m);
rep(i, m) {
INT(a, b, c);
edge[i] = T(c, --a, --b);
}
ranges::sort(edge);
vector<int> oth(n, -2);
vector<int> term(t);
{
rep(i, t) {
INT(ti);
oth[--ti] = -1;
term[i] = ti;
}
ll sz = 0;
rep(i, n) {
if(oth[i] == -2)
oth[i] = sz++;
}
}
int ans = numeric_limits<int>::max();
rep(bit, 1 << (n - t)) {
UnionFind uf(n);
int cost = 0;
for(auto [c, a, b] : edge) {
if(uf.same(a, b) or (oth[a] >= 0 and (~bit >> (oth[a])) & 1) or
(oth[b] >= 0 and (~bit >> (oth[b])) & 1))
continue;
cost += c;
uf.merge(a, b);
}
bool flag = true;
rep(i, 1, t) {
if(!uf.same(term[0], term[i])) {
flag = false;
break;
}
}
if(flag)
chmin(ans, cost);
}
print(ans);
}
}
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
solve();
}