結果
問題 | No.748 yuki国のお財布事情 |
ユーザー |
![]() |
提出日時 | 2018-10-19 22:34:43 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 160 ms / 2,000 ms |
コード長 | 5,394 bytes |
コンパイル時間 | 2,161 ms |
コンパイル使用メモリ | 214,284 KB |
最終ジャッジ日時 | 2025-01-06 14:41:58 |
ジャッジサーバーID (参考情報) |
judge2 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
#include <bits/stdc++.h>using namespace std;using namespace std::chrono;using ll=long long;using pii=pair<int,int>;using pll=pair<ll,ll>;using pdd=pair<double,double>;using pq_int=priority_queue<int,vector<int>,greater<int>>;const ll LINF=0x3fffffffffffffff;const ll MOD=1000000007;const ll MODD=0x3b800001;const int INF=0x3fffffff;const double DINF=numeric_limits<double>::infinity();#define _overload4(_1,_2,_3,_4,name,...) name#define _overload3(_1,_2,_3,name,...) name#define _rep1(n) _rep2(i,n)#define _rep2(i,n) _rep3(i,0,n)#define _rep3(i,a,b) for(ll i=a;i<b;++i)#define _rep4(i,a,b,c) for(ll i=a;i<b;i+=c)#define rep(...) _overload4(__VA_ARGS__,_rep4,_rep3,_rep2,_rep1)(__VA_ARGS__)#define _rrep1(n) _rrep2(i,n)#define _rrep2(i,n) _rrep3(i,0,n)#define _rrep3(i,a,b) for(ll i=b-1;i>=a;i--)#define _rrep4(i,a,b,c) for(ll i=a+(b-a-1)/c*c;i>=a;i-=c)#define rrep(...) _overload4(__VA_ARGS__,_rrep4,_rrep3,_rrep2,_rrep1)(__VA_ARGS__)#define each(i,a) for(auto&& i:a)#define sum(...) accumulate(range(__VA_ARGS__),0LL)#define _range(i) (i).begin(),(i).end()#define _range2(i,k) (i).begin(),(i).begin()+k#define _range3(i,a,b) (i).begin()+a,(i).begin()+b#define range(...) _overload3(__VA_ARGS__,_range3,_range2,_range)(__VA_ARGS__)#define Yes(i) out(i?"Yes":"No")#define YES(i) out(i?"YES":"NO")//#define START auto start=system_clock::now()//#define END auto end=system_clock::now();cerr<<duration_cast<milliseconds>(end-start).count()<<" ms\n"#define elif else if#define unless(a) if(!(a))#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)#define vec(type,name,...) vector<type> name(__VA_ARGS__)#define VEC(type,name,size) vector<type> name(size);in(name)#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))__attribute__((constructor)) void SETTINGS(){cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(15);};template<class T>inline constexpr T gcd (T a,T b) {if(a==b)return a;else return gcd(b,(a-1)%b+1);}template<class T>inline constexpr T min(vector<T>& v){return *min_element(range(v));}inline char min(string& v){return *min_element(range(v));}template<class T>inline constexpr T max(vector<T>& v){return *max_element(range(v));}inline char max(string& v){return *max_element(range(v));}template<typename T>inline bool update_min(T& mn,const T& cnt){if(mn>cnt){mn=cnt;return 1;}else return 0;}template<typename T>inline bool update_max(T& mx,const T& cnt){if(mx<cnt){mx=cnt;return 1;}else return 0;}inline void in() {}template<class T>istream& operator >> (istream& is, vector<T>& vec);template<class T,size_t size>istream& operator >> (istream& is, array<T,size>& vec);template<class T,class L>istream& operator >> (istream& is, pair<T,L>& p);template<class T>ostream& operator << (ostream& os, vector<T>& vec);template<class T,class L>ostream& operator << (ostream& os, pair<T,L>& p);template<class T>istream& operator >> (istream& is, vector<T>& vec){for(T& x: vec) is >> x;return is;}template<class T,class L>istream& operator >> (istream& is, pair<T,L>& p){is >> p.first;is >> p.second;return is;}template<class T>ostream& operator << (ostream& os, vector<T>& vec){os << vec[0];rep(i,1,vec.size()){os << ' ' << vec[i];}return os;}template<class T>ostream& operator << (ostream& os, deque<T>& deq){os << deq[0];rep(i,1,deq.size()){os << ' ' << deq[i];}return os;}template<class T,class L>ostream& operator << (ostream& os, pair<T,L>& p){os << p.first << " " << p.second;return os;}template <class Head, class... Tail>inline void in(Head&& head,Tail&&... tail){cin>>head;in(move(tail)...);}template <class T>inline void out(T t){cout<<t<<'\n';}inline void out(){cout<<'\n';}template <class Head, class... Tail>inline void out(Head head,Tail... tail){cout<<head<<' ';out(move(tail)...);}template <class T>inline void err(T t){cerr<<t<<'\n';}inline void err(){cerr<<'\n';}template <class Head, class... Tail>inline void err(Head head,Tail... tail){cerr<<head<<' ';out(move(tail)...);}#define int llclass UnionFind{public:std::vector<ll> data_array;const ll root(ll id){if(data_array[id] >= 0)return data_array[id] = root(data_array[id]);else return id;}UnionFind(size_t size) : data_array(size,-1){}bool Union(ll lhs, ll rhs){lhs = root(lhs);rhs = root(rhs);if(lhs-rhs){if( data_array[lhs] > data_array[rhs]){swap(lhs,rhs);}data_array[lhs] += data_array[rhs];data_array[rhs] = lhs;}return lhs-rhs;}bool Find(ll lhs, ll rhs){return root(lhs)==root(rhs);}};signed main(){INT(n,m,k);int ans=0;UnionFind uf(n+1);vector<unordered_map<int,int>> d(n+1);vector<vector<int>> v(m+1);rep(m){INT(a,b,c);d[a][b]=d[b][a]=c;v[i+1]={c,a,b};ans+=c;}rep(k){INT(e);ans-=v[e][0];uf.Union(v[e][1], v[e][2]);v[e][1]=0;}sort(v.begin()+1, v.end());rep(i,1,m+1)if(v[i][1]&&uf.root(v[i][1])!=uf.root(v[i][2])){ans-=v[i][0];uf.Union(v[i][1], v[i][2]);}out(ans);}