#8171 (D) No.114 遠い未来

• 問題: No.114 遠い未来
• ユーザー: 👑 hos.lyric
• 提出日時: 2015-01-06 20:05:40
• 言語: D (dmd 2.106.1)
• 結果: WA
• 実行時間: -
• コード長: 3,275 bytes
• コンパイル時間: 875 ms
• コンパイル使用メモリ: 127,092 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-06-12 01:53:03
• 合計ジャッジ時間: 22,731 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	3,029 ms; 5,376 KB
testcase_02	AC	681 ms; 5,376 KB
testcase_03	AC	80 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	1,566 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	4,358 ms; 5,376 KB
testcase_10	AC	3,753 ms; 5,376 KB
testcase_11	AC	2,297 ms; 5,376 KB
testcase_12	WA	-
testcase_13	AC	1,118 ms; 5,376 KB
testcase_14	AC	1,094 ms; 5,376 KB
testcase_15	AC	574 ms; 5,376 KB
testcase_16	AC	443 ms; 5,376 KB
testcase_17	AC	289 ms; 5,376 KB
testcase_18	WA	-
testcase_19	WA	-
testcase_20	AC	39 ms; 5,376 KB
testcase_21	WA	-
testcase_22	AC	10 ms; 5,376 KB
testcase_23	AC	2 ms; 5,376 KB
testcase_24	WA	-
testcase_25	AC	2 ms; 5,376 KB
testcase_26	AC	1 ms; 5,376 KB
testcase_27	AC	1 ms; 5,376 KB

ソースコード

import core.thread;
import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex;

//	Input
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { tokens = readln.split; if (stdin.eof) throw new EOFException; } auto token = tokens[0]; tokens.popFront; return token; }
int readInt() { return to!int(readToken); }
long readLong() { return to!long(readToken); }
real readReal() { return to!real(readToken); }

//	chmin/chmax
void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

//	Pair
struct Pair(S, T) {
	S x; T y;
	int opCmp(    const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; }
	int opCmp(ref const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; }
	string toString() const { return "(" ~ to!string(x) ~ ", " ~ to!string(y) ~ ")"; }
}
auto pair(S, T)(inout(S) x, inout(T) y) { return Pair!(S, T)(x, y); }

//	Array
int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = as.length; for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) { return (a <  val); }); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) { return (a <= val); }); }
T[] unique(T)(in T[] as) { T[] bs; foreach (a; as) if (bs.empty || bs[$ - 1] != a) bs ~= a; return bs; }


int N, M, K;
int[] A, B, C;
int[] T;

void main(string[] args) {
	try {
	for (; ; ) {
		N = readInt;
		M = readInt;
		K = readInt;
		A = new int[M];
		B = new int[M];
		C = new int[M];
		foreach (i; 0 .. M) {
			A[i] = readInt - 1;
			B[i] = readInt - 1;
			C[i] = readInt;
		}
		T = new int[K];
		foreach (k; 0 .. K) {
			T[k] = readInt - 1;
		}
		
		bool[] isT = new bool[N];
		foreach (t; T) {
			isT[t] = true;
		}
		int[] nonTs;
		foreach (u; 0 .. N) if (!isT[u]) {
			nonTs ~= u;
		}
		
		int[][] D = new int[][](N, N);
		foreach (u; 0 .. N) {
			D[u][] = int.max / 2;
			D[u][u] = 0;
		}
		foreach (i; 0 .. M) {
			chmin(D[A[i]][B[i]], C[i]);
			chmin(D[B[i]][A[i]], C[i]);
		}
		foreach (w; 0 .. N) foreach (u; 0 .. N) foreach (v; 0 .. N) {
			chmin(D[u][v], D[u][w] + D[w][v]);
		}
		
		int ans = int.max;
		foreach (L; 0 .. K) if (L <= N - K) {
			bool[] flg = new bool[N - K];
			flg[N - K - L .. $] = true;
			do {
				int[] us = T;
				foreach (j, u; nonTs) {
					if (flg[j]) {
						us ~= u;
					}
				}
				int[] ds = new int[K + L];
				ds[] = int.max / 2;
				bool[] vis = new bool[K + L];
				ds[0] = 0;
				int sum;
				foreach (iter; 0 .. K + L) {
					int xm = -1;
					foreach (x; 0 .. K + L) if (!vis[x]) {
						if (xm == -1 || ds[xm] > ds[x]) {
							xm = x;
						}
					}
					if (ans <= sum + ds[xm] * (K + L - iter)) {
						sum = int.max;
						break;
					}
					sum += ds[xm];
					vis[xm] = true;
					foreach (y; 0 .. K + L) if (!vis[y]) {
						chmin(ds[y], D[us[xm]][us[y]]);
					}
				}
debug{
writeln(flg," ",us," ",sum);
}
				chmin(ans, sum);
			} while (flg.nextPermutation);
		}
		writeln(ans);
	}
	} catch (EOFException) {}
}