結果
問題 | No.330 Eigenvalue Decomposition |
ユーザー |
![]() |
提出日時 | 2018-10-14 16:18:36 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 60 ms / 5,000 ms |
コード長 | 2,185 bytes |
コンパイル時間 | 1,897 ms |
コンパイル使用メモリ | 168,908 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-12 18:18:35 |
合計ジャッジ時間 | 3,181 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 31 |
ソースコード
#include "bits/stdc++.h"using namespace std;typedef long long ll;typedef pair<int, int> pii;typedef pair<ll, ll> pll;const int INF = 1e9;const ll LINF = 1e18;template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out<< Mat[i];} return out; }template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out <<it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }/*<url:https://yukicoder.me/problems/no/330>問題文=============================================================================================================================解説=============================================================================================================================*/struct UnionFind{vector<int> parent, rank;UnionFind(int n) : parent(n, -1), rank(n, 0) { }int find(int x){if(parent[x] == -1) return x;else return (parent[x] = find(parent[x]));}bool unite(int x, int y){x = find(x);y = find(y);if(x == y) return false;if(rank[x] < rank[y])parent[x] = y;elseparent[y] = x;if(rank[x] == rank[y]) rank[x]++;return true;}bool same(int x, int y){return find(x) == find(y);}};ll solve(){ll res = 0;int N,M; cin >> N >> M;UnionFind UF(N);for(int i = 0; i < M;i++){int a,b,c; cin >> a >> b >> c;a--; b--;UF.unite(a,b);}for(int i = 0; i < N;i++) if(UF.find(i)==i) res++;return res;}int main(void) {cin.tie(0); ios_base::sync_with_stdio(false);cout << solve() << endl;return 0;}