結果

問題 No.1690 Power Grid
コンテスト
ユーザー daut-dlang
提出日時 2021-09-24 22:58:13
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 106 ms / 3,000 ms
コード長 3,979 bytes
コンパイル時間 1,736 ms
コンパイル使用メモリ 173,856 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-06-22 12:37:02
合計ジャッジ時間 3,172 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

diff # 

import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }
double[] rotate(double[] vec, double rad) { return [cos(rad)*vec[0] - sin(rad)*vec[1], sin(rad)*vec[0] + cos(rad)*vec[1]]; }

//long mod = 10^^9 + 7;
long mod = 998_244_353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }
void modpow(ref long x, long y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(ref long x, long y) { y.modpow(mod - 2); x.modm(y); }

struct UnionFind(T)
{
	void init(T n) { par = new T[](n); foreach (i; 0..n) par[i] = i; cnt = new T[](n); fill(cnt, 1); }
	T root(T i) { return par[i] == i ? i : (par[i] = root(par[i])); }
	bool same(T i, T j) { return root(i) == root(j); }
	void unite(T i, T j) { i = root(i); j = root(j); if (i == j) return; par[i] = j; cnt[j] += cnt[i]; }
	T size(T i) { return cnt[root(i)]; }
	T[] par, cnt;
}

void main()
{
	auto N = RD;
	auto M = RD;
	auto K = RD;
	auto A = RDA;
	auto edges = new long[][][](N);
	foreach (i; 0..M)
	{
		auto X = RD-1;
		auto Y = RD-1;
		auto Z = RD;
		edges[X] ~= [Y, Z];
		edges[Y] ~= [X, Z];
	}
	auto dist = new long[][](N, N);
	foreach (i; 0..N)
	{
		dist[i][] = long.max;
		dist[i][i] = 0;
		auto q = new RedBlackTree!(long[], "a[1] < b[1]", true);
		q.insert([i, 0]);
		while (!q.empty)
		{
			auto nd = q.front; q.removeFront;
			auto u = nd[0];
			auto d = nd[1];
			foreach (e; edges[u])
			{
				auto v = e[0];
				auto z = e[1];
				if (d + z < dist[i][v])
				{
					dist[i][v] = d + z;
					q.insert([v, d+z]);
				}
			}
		}
	}
	long[][] edges2;
	foreach (i; 0..N)
	{
		foreach (j; i+1..N)
		{
			edges2 ~= [i, j, dist[i][j]];
		}
	}
	edges2.sort!"a[2] < b[2]";

	long ans = long.max;
	foreach (i; 0..2^^N)
	{
		if (popcnt(i) != K) continue;

		long tmp;
		UnionFind!long uf;
		uf.init(N);
		foreach (e; edges2)
		{
			auto x = e[0];
			auto y = e[1];
			auto z = e[2];
			debug writeln("x:", x, " y:", y);
			if (!(i & (1L << x))) continue;
			if (!(i & (1L << y))) continue;
			debug writeln("x:", x, " y:", y);
			if (uf.same(x, y)) continue;
			tmp += z;
			uf.unite(x, y);
			debug writeln("x:", x, " y:", y);
		}
		debug writeln(i, " tmp:", tmp);

		bool ok = true;
		long root = -1;
		foreach (j; 0..N)
		{
			if (!(i & (1L << j))) continue;
			if (root == -1)
				root = uf.root(j);
			else if (root != uf.root(j))
				ok = false;
			tmp += A[j];
		}
		debug writeln(i, " tmp:", tmp);
		if (ok)
			ans.chmin(tmp);
	}

	writeln(ans);
	stdout.flush;
	debug readln;
}
0