結果
| 問題 | No.556 仁義なきサルたち |
| ユーザー |
 kissshot7
|
| 提出日時 | 2020-08-26 00:26:34 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 19 ms / 2,000 ms |
| コード長 | 3,608 bytes |
| コンパイル時間 | 1,860 ms |
| コンパイル使用メモリ | 172,696 KB |
| 実行使用メモリ | 7,880 KB |
| 最終ジャッジ日時 | 2024-11-06 11:54:48 |
| 合計ジャッジ時間 | 3,272 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 22 |
ソースコード
#include <bits/stdc++.h>using namespace std;//#define int long longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;const ll mod = 1000000007;const ll INF = mod * mod;const int INF_N = 1e+9;typedef pair<int, int> P;#define stop char nyaa;cin>>nyaa;#define rep(i,n) for(int i=0;i<n;i++)#define per(i,n) for(int i=n-1;i>=0;i--)#define Rep(i,sta,n) for(int i=sta;i<n;i++)#define rep1(i,n) for(int i=1;i<=n;i++)#define per1(i,n) for(int i=n;i>=1;i--)#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)#define all(v) (v).begin(),(v).end()typedef pair<ll, ll> LP;typedef long double ld;typedef pair<ld, ld> LDP;const ld eps = 1e-12;const ld pi = acos(-1.0);//typedef vector<vector<ll>> mat;typedef vector<int> vec;//繰り返し二乗法ll mod_pow(ll a, ll n, ll m) {ll res = 1;while (n) {if (n & 1)res = res * a%m;a = a * a%m; n >>= 1;}return res;}struct modint {ll n;modint() :n(0) { ; }modint(ll m) :n(m) {if (n >= mod)n %= mod;else if (n < 0)n = (n%mod + mod) % mod;}operator int() { return n; }};bool operator==(modint a, modint b) { return a.n == b.n; }modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }modint operator+(modint a, modint b) { return a += b; }modint operator-(modint a, modint b) { return a -= b; }modint operator*(modint a, modint b) { return a *= b; }modint operator^(modint a, int n) {if (n == 0)return modint(1);modint res = (a*a) ^ (n / 2);if (n % 2)res = res * a;return res;}//逆元(Eucledean algorithm)ll inv(ll a, ll p) {return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);}modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }const int max_n = 1 << 18;modint fact[max_n], factinv[max_n];void init_f() {fact[0] = modint(1);for (int i = 0; i < max_n - 1; i++) {fact[i + 1] = fact[i] * modint(i + 1);}factinv[max_n - 1] = modint(1) / fact[max_n - 1];for (int i = max_n - 2; i >= 0; i--) {factinv[i] = factinv[i + 1] * modint(i + 1);}}modint comb(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[b] * factinv[a - b];}using mP = pair<modint, modint>;int dx[4] = { 0,1,0,-1 };int dy[4] = { 1,0,-1,0 };struct uf {private:vector<int> par, ran,sz;public:uf(int n) {par.resize(n, 0);ran.resize(n, 0);sz.resize(n, 1);rep(i, n) {par[i] = i;}}int find(int x) {if (par[x] == x)return x;else return par[x] = find(par[x]);}void unite(int x, int y) {x = find(x), y = find(y);if (x == y)return;if (sz[x] < sz[y]) {par[x] = y; sz[y] += sz[x];}else if(sz[x] > sz[y]) {par[y] = x; sz[x] += sz[y];// if (ran[x] == ran[y])ran[x]++;}else{if(x > y){par[x] = y; sz[y] += sz[x];}else{par[y] = x; sz[x] += sz[y];}}}bool same(int x, int y) {return find(x) == find(y);}int num(int x) { return sz[find(x)]; }};void solve() {int N, M; cin >> N >> M;uf u(N);rep(i, M){int a, b; cin >> a >> b;a--; b--;u.unite(a, b);}rep(i, N){cout << u.find(i)+1 << endl;}}signed main() {ios::sync_with_stdio(false);cin.tie(0);//cout << fixed << setprecision(10);//init_f();//init();//int t; cin >> t; rep(i, t)solve();solve();// stopreturn 0;}