結果
問題 | No.748 yuki国のお財布事情 |
ユーザー |
![]() |
提出日時 | 2019-02-28 22:20:14 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 334 ms / 2,000 ms |
コード長 | 2,310 bytes |
コンパイル時間 | 1,216 ms |
コンパイル使用メモリ | 90,540 KB |
実行使用メモリ | 38,508 KB |
最終ジャッジ日時 | 2024-06-23 11:51:53 |
合計ジャッジ時間 | 5,440 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
#include <iostream>#include <algorithm>#include <cstring>#include <sstream>#include <map>#include <queue>#include <set>#include <vector>#include <stack>#include <cstdio>#include <cmath>#define mk make_pair#define pb push_back#define printf printf_s#define scanf scanf_susing namespace std;typedef long long int ll;typedef pair<ll, ll> pos;const ll MOD = 1000000007, N = 100001, dx[4] = { -1,1,0,0 }, dy[4] = { 0,0,-1,1 }, MIN = -72340172838, MAX = 72340172838;ll mn(ll a, ll b) {if (a == -1)return b;if (b == -1)return a;return min(a, b);}ll gcd(ll v1, ll v2) {if (v1 == 0)return v2; if (v2 == 0)return v1; if (v2 > v1)return gcd(v2%v1, v1); return gcd(v1%v2, v2);}ll pw(ll v1, ll v2) {ll v3 = 1;while (v2 > 0) {if (v2 % 2)v3 = (v3*v1) % MOD;v1 = (v1*v1) % MOD;v2 /= 2;}return v3;}struct ab {ll a, b;bool operator<(const ab& right) const {return right.b*a - right.a*b < 0;}};ll n, m, k, ind[N], ans = 0;vector<pos> g[N];pair<pos, ll> edg[N];priority_queue<pair<ll,pos> > q;ll rt(ll ci) {if (ind[ci] == ci)return ci;return ind[ci] = rt(ind[ci]);}void mrg(ll i1, ll i2) {ind[rt(i1)] = rt(i2);}int main() {cin >> n >> m >> k;for (int i = 1; i <= n; i++)ind[i] = i;for (int i = 0; i < m;i++) {ll v1, v2, v3;cin >> v1 >> v2 >> v3;edg[i] = mk(mk(v1, v2), v3);g[v1].pb(mk(v3, v2));g[v2].pb(mk(v3, v1));ans += v3;}while (k--) {ll v1; cin >> v1; v1--;ans -= edg[v1].second;mrg(edg[v1].first.first, edg[v1].first.second);ll i1 = edg[v1].first.first, i2 = edg[v1].first.second;for (int i = 0; i < g[i1].size(); i++) {q.push(mk(-g[i1][i].first, mk(g[i1][i].second, i1)));}for (int i = 0; i < g[i2].size(); i++) {q.push(mk(-g[i2][i].first, mk(g[i2][i].second, i2)));}}if (k == -1) {ll i2 = 1;for (int i = 0; i < g[i2].size(); i++) {q.push(mk(-g[i2][i].first, mk(g[i2][i].second, i2)));}}while (!q.empty()) {ll v1 = -q.top().first, ci = q.top().second.first, bi = q.top().second.second;q.pop();if (rt(ci) == rt(bi)) continue;mrg(ci, bi);ans -= v1;for (int i = 0; i < g[ci].size(); i++) {ll ni = g[ci][i].second,nd=g[ci][i].first;if (rt(ni) == rt(ci))continue;q.push(mk(-nd, mk(ni, ci)));}}cout << ans << endl;return 0;}