結果
問題 | No.556 仁義なきサルたち |
ユーザー | uchiiii |
提出日時 | 2020-08-17 00:18:00 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,400 bytes |
コンパイル時間 | 2,743 ms |
コンパイル使用メモリ | 206,120 KB |
最終ジャッジ日時 | 2024-04-19 18:36:56 |
合計ジャッジ時間 | 3,269 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/string:43, from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bitset:52, from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/x86_64-pc-linux-gnu/bits/stdc++.h:52, from main.cpp:4: /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/allocator.h: In destructor 'std::_Vector_base<int, std::allocator<int> >::_Vector_impl::~_Vector_impl()': /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/allocator.h:184:7: error: inlining failed in call to 'always_inline' 'std::allocator< <template-parameter-1-1> >::~allocator() noexcept [with _Tp = int]': target specific option mismatch 184 | ~allocator() _GLIBCXX_NOTHROW { } | ^ In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/vector:66, from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/functional:64, from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/x86_64-pc-linux-gnu/bits/stdc++.h:53: /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/stl_vector.h:133:14: note: called from here 133 | struct _Vector_impl | ^~~~~~~~~~~~
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("03") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; typedef long double ld; typedef long long ll; typedef unsigned long long ull; #define endl "\n" #define FOR(i,a,b) for(int i=(a);i<=(b);i++) #define rep(i,n) for(int i=0;i<(n);i++) #define PII pair<int, int> #define PLL pair<ll, ll> #define ALL(x) (x).begin(), (x).end() constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1; template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; } template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; } template<class T>inline int popcount(T a) {return __builtin_popcount(a);} template<class T>inline T emod(T a, T p) { return (a%p + p) % p;} //------------------- class UnionFind { private: unsigned size_; std::vector<int> par, rank; //par = root? -size: par public: UnionFind() : size_(0), par(std::vector<int>()), rank(std::vector<int>()) {}; UnionFind(unsigned size__) : size_(size__) { par.resize(size_+1); rank.resize(size_+1); for (unsigned i = 0; i <= size_; i++) par[i] = -1, rank[i] = 0; } //unsigned size() { return size_; } unsigned root(unsigned x) {return par[x] < 0 ? x : par[x] = root(par[x]); } bool same(unsigned x, unsigned y) { return root(x) == root(y); } void unite(unsigned x, unsigned y) { unsigned prev_x = x, prev_y = y; x = root(x), y = root(y); if(x==y) return; if (size(x) < size(y))par[y] += par[x], par[x] = y; else if (size(x) == size(y) and x < y)par[x] += par[y], par[y] = x, rank[x]++; else if (size(x) == size(y)) par[y] += par[x], par[x] = y, rank[y]++; else par[x] += par[y], par[y] = x; } int size(int x){ return -par[root(x)];} bool operator==(const UnionFind &u) { return par == u.par; } bool operator!=(const UnionFind &u) { return par != u.par; } }; int main() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(15); int n,m; cin >> n >> m; UnionFind uf(n); rep(i, m) { int a,b; cin >> a >> b; a--; b--; uf.unite(a,b); } // vector<int> mp(n, INF); // rep(i, n) { // chmin(mp[uf.root(i)], i); // } // rep(i, n) cout << mp[uf.root(i)]+1 << endl; rep(i, n) { cout << uf.root(i)+1 << endl; } return 0; }