結果
| 問題 | No.330 Eigenvalue Decomposition |
| ユーザー |
 shimomire
|
| 提出日時 | 2015-12-23 00:48:21 |
| 言語 | C++11（廃止可能性あり） (gcc 13.3.0) |
| 結果 |
AC
|
| 実行時間 | 73 ms / 5,000 ms |
| コード長 | 6,680 bytes |
| コンパイル時間 | 1,035 ms |
| コンパイル使用メモリ | 117,780 KB |
| 実行使用メモリ | 5,632 KB |
| 最終ジャッジ日時 | 2024-09-18 19:22:35 |
| 合計ジャッジ時間 | 2,767 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 5 |
| other | AC * 31 |
ソースコード
#include <cassert>// c#include <iostream>// io#include <iomanip>#include <fstream>#include <sstream>#include <vector>// container#include <map>#include <set>#include <queue>#include <bitset>#include <stack>#include <algorithm>// other#include <complex>#include <numeric>#include <functional>#include <random>#include <regex>using namespace std;typedef long long ll;typedef unsigned long long ull;#define ALL(c) (begin(c)),(end(c))#define REP(i,n) FOR(i,0,n)#define REPr(i,n) FORr(i,0,n)#define FOR(i,l,r) for(int i=(int)(l);i<(int)(r);++i)#define FORr(i,l,r) for(int i=(int)(r)-1;i>=(int)(l);--i)#define EACH(it,o) for(auto it = (o).begin(); it != (o).end(); ++it)#define IN(l,v,r) ((l)<=(v) && (v)<(r))#define UNIQUE(v) v.erase(unique(ALL(v)),v.end())//debug#define DUMP(x) cerr << #x << " = " << (x)#define LINE() cerr<< " (L" << __LINE__ << ")"class range {private:struct Iter{int v;int operator*(){return v;}bool operator!=(Iter& itr) {return v < itr.v;}void operator++() {++v;}};Iter i, n;public:range(int n) : i({0}), n({n}) {}range(int i, int n) : i({i}), n({n}) {}Iter& begin() {return i;}Iter& end() {return n;}};//inputtemplate<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){is>>p.first>>p.second;return is;}template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){is >> get<0>(t);return is;}template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){is >> get<0>(t) >> get<1>(t);return is;}template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){is >>get<0>(t)>>get<1>(t)>>get<2>(t);return is;}template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);return is;}template<typename T1,typename T2,typename T3,typename T4,typename T5> istream& operator >> (istream& is, const tuple<T1,T2,T3,T4,T5>& t){is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t) >> get<4>(t);return is;}template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6> istream& operator >> (istream& is, const tuple<T1,T2,T3,T4,T5,T6>&t){is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t) >> get<4>(t) >> get<5>(t);return is;}template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6,typename T7> istream& operator >> (istream& is, const tuple<T1,T2,T3,T4,T5,T6,T7>& t){is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t) >> get<4>(t) >> get<5>(t) >> get<6>(t);return is;}template<typename T> istream& operator >> (istream& is,vector<T>& as){REP(i,as.size())is >>as[i];return is;}//outputtemplate<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}return os;}template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){os<<p.first<<" "<<p.second;return os;}template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){os << get<0>(t);return os;}template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){os << get<0>(t)<<" "<<get<1>(t);return os;}template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);return os;}template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);return os;}template<typename T1,typename T2,typename T3,typename T4,typename T5> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t);return os;}template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5,T6>&t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t)<<" "<<get<5>(t);return os;}template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6,typename T7> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5,T6,T7>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t)<<" "<<get<5>(t)<<" "<<get<6>(t);return os;}template<typename T> ostream& operator << (ostream& os, const vector<T>& as){REP(i,as.size()){if(i!=0)os<<" "; os<<as[i];}return os;}template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){REP(i,as.size()){if(i!=0)os<<endl; os<<as[i];}return os;}//inputchar tmp[1000];#define nextInt(n) scanf("%d",&n)#define nextLong(n) scanf("%lld",&n) //I64d#define nextDouble(n) scanf("%lf",&n)#define nextChar(n) scanf("%c",&n)#define nextString(n) scanf("%s",tmp);n=tmp// valuestemplate<typename T> T INF(){assert(false);};template<> int INF<int>(){return 1<<28;};template<> ll INF<ll>(){return 1LL<<58;};template<> double INF<double>(){return 1e16;};template<> long double INF<long double>(){return 1e16;};template<class T> T EPS(){assert(false);};template<> int EPS<int>(){return 1;};template<> ll EPS<ll>(){return 1LL;};template<> double EPS<double>(){return 1e-8;};template<> long double EPS<long double>(){return 1e-8;};template<typename T,typename U> T pmod(T v,U M){return (v%M+M)%M;}struct UnionFind{vector<int> par,rank,ss;int size;UnionFind(int n):size(n){par=vector<int>(n);iota(ALL(par),0);rank = vector<int>(n);ss=vector<int>(n,1);}int root(int x){ return par[x] = par[x] == x ? x: root(par[x]);}bool same(int x,int y){ return root(x) == root(y);}void unite(int x,int y){x = root(x);y = root(y);if(x==y)return;if(rank[x]>rank[y])swap(x,y);par[x] = y;ss[y]+=ss[x];if(rank[x] == rank[y]) rank[x]++;size--;}int getS(int x){ return ss[root(x)];}};class Main{public:void run(){int N,M;cin >> N >> M;// uso?UnionFind uf(N);// vector<vector<int>> A(N,vector<int>(N));for(int i:range(M)){int a,b,c;cin >> a >> b >> c;a--;b--;// A[a][b]=A[b][a]=c;uf.unite(a,b);}// for(int i:range(N)){// int sum=0;// for(int j:range(N))sum+=A[i][j];// A[i][i]=-sum;// }// cout << A << endl;cout << uf.size << endl;}};int main(){cout <<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);Main().run();return 0;}