Submit Info #2666

Problem Lang User Status Time Memory
Unionfind cpp fumiphys AC 168 ms 2.90 MiB

ケース詳細
Name Status Time Memory
example_00 AC 5 ms 0.63 MiB
random_00 AC 124 ms 2.25 MiB
random_01 AC 126 ms 2.50 MiB
random_02 AC 100 ms 1.38 MiB
random_03 AC 28 ms 2.62 MiB
random_04 AC 84 ms 0.84 MiB
random_05 AC 114 ms 1.38 MiB
random_06 AC 95 ms 2.90 MiB
random_07 AC 14 ms 1.75 MiB
random_08 AC 44 ms 0.75 MiB
random_09 AC 168 ms 2.09 MiB

// includes #include <bits/stdc++.h> using namespace std; // macros #define pb emplace_back #define mk make_pair #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define rep(i, n) FOR(i, 0, n) #define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--) #define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr) #define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr) #define whole(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) #define bit(n) (1LL<<(n)) // functions template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;} template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;} template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;} template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;} template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} 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 T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} // types using ll = long long int; using P = pair<int, int>; // constants const int inf = 1e9; const ll linf = 1LL << 50; const double EPS = 1e-10; const int mod = 1000000007; const int dx[4] = {-1, 0, 1, 0}; const int dy[4] = {0, -1, 0, 1}; // io struct fast_io{ fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);} } fast_io_; typedef struct UnionFind_ { vector<int> par, rank_, siz; UnionFind_(){} explicit UnionFind_(int n): rank_(n, 0), siz(n, 1) { par.resize(n); for(int i = 0; i < n; i++)par[i] = i; } int find(int x) { if(par[x] == x)return x; else return par[x] = find(par[x]); } bool same(int x, int y) { if(find(x) == find(y))return true; else return false; } bool unite(int x, int y){ int xp = find(x); int yp = find(y); if(xp == yp)return false; if(rank_[xp] > rank_[yp]){ par[yp] = xp; siz[xp] += siz[yp]; } else if(rank_[xp] < rank_[yp]){ par[xp] = yp; siz[yp] += siz[xp]; } else { par[yp] = xp; siz[xp] += siz[yp]; rank_[xp]++; } return true; } int size(int i){ return siz[find(i)]; } } UnionFind; int main(int argc, char const* argv[]) { int n, q; cin >> n >> q; UnionFind uf(n); rep(i_, q){ int t, u, v; cin >> t >> u >> v; if(t == 0){ uf.unite(u, v); }else{ if(uf.same(u, v))cout << 1 << endl; else cout << 0 << endl; } } return 0; }