結果

問題 No.748 yuki国のお財布事情
ユーザー tutuztutuz
提出日時 2018-10-20 09:32:55
言語 Java21
(openjdk 21)
結果
AC  
実行時間 533 ms / 2,000 ms
コード長 4,826 bytes
コンパイル時間 2,168 ms
コンパイル使用メモリ 81,632 KB
実行使用メモリ 63,968 KB
最終ジャッジ日時 2024-11-19 02:12:17
合計ジャッジ時間 9,329 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
50,276 KB
testcase_01 AC 52 ms
50,424 KB
testcase_02 AC 52 ms
50,228 KB
testcase_03 AC 51 ms
50,628 KB
testcase_04 AC 52 ms
50,536 KB
testcase_05 AC 50 ms
50,548 KB
testcase_06 AC 51 ms
50,464 KB
testcase_07 AC 52 ms
50,360 KB
testcase_08 AC 52 ms
50,572 KB
testcase_09 AC 53 ms
50,336 KB
testcase_10 AC 53 ms
50,216 KB
testcase_11 AC 54 ms
50,340 KB
testcase_12 AC 53 ms
50,108 KB
testcase_13 AC 197 ms
56,080 KB
testcase_14 AC 234 ms
57,988 KB
testcase_15 AC 208 ms
56,664 KB
testcase_16 AC 310 ms
60,212 KB
testcase_17 AC 437 ms
61,692 KB
testcase_18 AC 508 ms
63,800 KB
testcase_19 AC 533 ms
63,968 KB
testcase_20 AC 489 ms
61,740 KB
testcase_21 AC 486 ms
62,124 KB
testcase_22 AC 53 ms
50,172 KB
testcase_23 AC 53 ms
50,508 KB
testcase_24 AC 52 ms
50,752 KB
testcase_25 AC 456 ms
61,388 KB
testcase_26 AC 493 ms
61,896 KB
testcase_27 AC 448 ms
63,648 KB
testcase_28 AC 427 ms
62,444 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskX solver = new TaskX();
		solver.solve(1, in, out);
		out.close();
	}

	static int INF = 1 << 30;
	static long LINF = 1L << 55;
	static int MOD = 1000000007;
	static int[] mh4 = { 0, -1, 1, 0 };
	static int[] mw4 = { -1, 0, 0, 1 };
	static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
	static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };

	static class TaskX {

		public void solve(int testNumber, InputReader in, PrintWriter out) {

			int n = in.nextInt();
			int m = in.nextInt();
			int k = in.nextInt();

			long sum = 0;
			P[] p = new P[m];
			for (int i = 0; i < m; i++) {
				int a = in.nextInt()-1;
				int b = in.nextInt()-1;
				long c = in.nextLong();
				p[i] = new P(i, a, b, c);
				sum += c;
			}

			int[] es = new int[k];
			for (int i = 0; i < k; i++) {
				int e = in.nextInt()-1;
				es[i] = e;
			}

			DisjointSet set = new DisjointSet(n);

			int j = 0;
			long cost = 0;
			for (int i = 0; i < m && j < k; i++) {
				if (p[i].idx == es[j]) {
					set.unite(p[i].a, p[i].b);
					cost += p[i].c;
					j++;
				}
			}

			Arrays.sort(p);

			for (int i = 0; i < m; i++) {
				if (!set.same(p[i].a, p[i].b)) {
					set.unite(p[i].a, p[i].b);
					cost += p[i].c;
				}
			}

			out.println(sum - cost);
		}
	}

	public static class DisjointSet {

		int[] p, rank, cnt;

		public DisjointSet(int size) {
			p = new int[size];
			rank = new int[size];
			cnt = new int[size];

			for (int j = 0; j < size; j++) {
				makeSet(j);
			}
		}

		private void makeSet(int x) {
			p[x] = x;
			rank[x] = 0;
			cnt[x] = 1;
		}

		public int findSet(int x) {
			return p[x] == x ? x : findSet(p[x]);
		}

		private void link(int x, int y) {
			if (rank[x] > rank[y]) {
				p[y] = x;
			} else if (rank[x] < rank[y]) {
				p[x] = y;
			} else if (rank[x] == rank[y]) {
				p[x] = y;
				rank[y]++;
			}

			if (x != y) {
				cnt[x] = cnt[y] += cnt[x];
			}
		}

		public void unite(int x, int y) {
			link(findSet(x), findSet(y));
		}

		public boolean same(int x, int y) {
			return findSet(x) == findSet(y);
		}

		public int getSize(int x) {
			return cnt[findSet(x)];
		}
	}

	static class P implements Comparable<P> {
		int idx, a, b;
		long c;

		public P(int idx, int a, int b, long c) {
			super();
			this.idx = idx;
			this.a = a;
			this.b = b;
			this.c = c;
		}

		@Override
		public int compareTo(P o) {
			return Long.compare(this.c, o.c);
		}

		@Override
		public String toString() {
			return "P [idx=" + idx + ", a=" + a + ", b=" + b + ", c=" + c + "]";
		}

	}

	static class InputReader {
		BufferedReader in;
		StringTokenizer tok;

		public String nextString() {
			while (!tok.hasMoreTokens()) {
				try {
					tok = new StringTokenizer(in.readLine(), " ");
				} catch (IOException e) {
					throw new InputMismatchException();
				}
			}
			return tok.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(nextString());
		}

		public long nextLong() {
			return Long.parseLong(nextString());
		}

		public double nextDouble() {
			return Double.parseDouble(nextString());
		}

		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}

		public int[] nextIntArrayDec(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt() - 1;
			}
			return res;
		}

		public int[] nextIntArray1Index(int n) {
			int[] res = new int[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextInt();
			}
			return res;
		}

		public long[] nextLongArray(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong();
			}
			return res;
		}

		public long[] nextLongArrayDec(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong() - 1;
			}
			return res;
		}

		public long[] nextLongArray1Index(int n) {
			long[] res = new long[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextLong();
			}
			return res;
		}

		public double[] nextDoubleArray(int n) {
			double[] res = new double[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextDouble();
			}
			return res;
		}

		public InputReader(InputStream inputStream) {
			in = new BufferedReader(new InputStreamReader(inputStream));
			tok = new StringTokenizer("");
		}
	}


}
0