#292723 (C++14) No.748 yuki国のお財布事情

• 問題: No.748 yuki国のお財布事情
• ユーザー: pazzle1230
• 提出日時: 2018-10-19 21:35:01
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: RE
• 実行時間: -
• コード長: 1,839 bytes
• コンパイル時間: 1,935 ms
• コンパイル使用メモリ: 183,448 KB
• 実行使用メモリ: 7,224 KB
• 最終ジャッジ日時: 2024-04-29 15:28:36
• 合計ジャッジ時間: 3,772 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	RE	-
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	1 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	RE	-
testcase_23	RE	-
testcase_24	RE	-
testcase_25	WA	-
testcase_26	AC	46 ms; 7,160 KB
testcase_27	WA	-
testcase_28	AC	35 ms; 6,736 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;

#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second

using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;

const double eps = 1e-10;

template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}

class UnionFind{
private:
	std::vector<int_fast32_t> par;
	size_t n;

public:
	UnionFind(){}
	UnionFind(size_t n):n(n){
		par.resize(n, -1);
	}

	uint_fast32_t find(uint_fast32_t x){
		return par[x] < 0 ? x : par[x] = find(par[x]);
	}

	size_t size(uint_fast32_t x){
		return -par[find(x)];
	}

	void unite(uint_fast32_t x, uint_fast32_t y){
		x = find(x);
		y = find(y);
		if(x == y) return;
		if(size(x) < size(y)) std::swap(x, y);
		par[x] += par[y];
		par[y] = x;
	}

	bool same(uint_fast32_t x, uint_fast32_t y){
		return find(x) == find(y);
	}
};

int64 gcd(int64 a, int64 b){
	if(b == 0) return a;
	return gcd(b, a%b);
}

int main(void){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int32 N, M, K;
	using T = tuple<int64, int64, int64>;
	vector<T> edge;
	cin >> N >> M >> K;
	UnionFind uf(N);
	int64 sum = 0, use = 0;
	REP(i, M){
		int32 a, b, c;
		cin >> a >> b >> c; a--; b--;
		sum += c;
		edge.push_back(T(c, a, b));
	}
	REP(i, K){
		int64 a;
		cin >> a; a--;
		uf.unite(get<1>(edge[a]), get<2>(edge[a]));
		use += get<0>(edge[a]);
	}
	sort(all(edge));
	REP(i, N){
		int64 u, v, c;
		tie(c, u, v) = edge[i];
		if(!uf.same(u, v)){
			use += c;
			uf.unite(u, v);
		}
	}
	cout << sum-use << endl;
}