結果
問題 | No.2290 UnUnion Find |
ユーザー |
![]() |
提出日時 | 2023-05-05 21:49:17 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 364 ms / 2,000 ms |
コード長 | 4,822 bytes |
コンパイル時間 | 9,424 ms |
コンパイル使用メモリ | 451,704 KB |
実行使用メモリ | 14,464 KB |
最終ジャッジ日時 | 2024-11-23 06:56:46 |
合計ジャッジ時間 | 22,656 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 46 |
ソースコード
/*このコード、と~おれ!Be accepted!∧_∧(。・ω・。)つ━☆・*。⊂ ノ ・゜+.しーJ °。+ *´¨).· ´¸.·*´¨) ¸.·*¨)(¸.·´ (¸.·'* ☆*/#include <cstdio>#include <algorithm>#include <string>#include <cmath>#include <cstring>#include <vector>#include <numeric>#include <iostream>#include <random>#include <map>#include <unordered_map>#include <queue>#include <regex>#include <functional>#include <complex>#include <list>#include <cassert>#include <iomanip>#include <set>#include <stack>#include <bitset>#include <array>#include <chrono>#include <limits>//#pragma GCC target("arch=skylake-avx512")//#pragma GCC target("avx2")//#pragma GCC optimize("O3")#//pragma GCC optimize("Ofast")//#pragma GCC target("sse4")#//pragma GCC optimize("unroll-loops")//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")#define repeat(i, n, m) for(int i = n; i < (m); ++i)#define rep(i, n) for(int i = 0; i < (n); ++i)#define printynl(a) printf(a ? "yes\n" : "no\n")#define printyn(a) printf(a ? "Yes\n" : "No\n")#define printYN(a) printf(a ? "YES\n" : "NO\n")#define printim(a) printf(a ? "possible\n" : "imposible\n")#define printdb(a) printf("%.50lf\n", a)#define printLdb(a) printf("%.50Lf\n", a)#define printdbd(a) printf("%.16lf\n", a)#define prints(s) printf("%s\n", s.c_str())#define all(x) (x).begin(), (x).end()#define deg_to_rad(deg) (((deg)/360.0L)*2.0L*PI)#define rad_to_deg(rad) (((rad)/2.0L/PI)*360.0L)#define Please return#define AC 0#define manhattan_dist(a, b, c, d) (abs(a - c) + abs(b - d))using ll = long long;using ull = unsigned long long;constexpr int INF = 1073741823;constexpr int MINF = -1073741823;constexpr ll LINF = ll(4661686018427387903);constexpr ll MOD = 1e9 + 7;constexpr ll mod = 998244353;constexpr long double eps = 1e-14;const long double PI = acosl(-1.0L);using namespace std;void scans(string& str) {char c;str = "";scanf("%c", &c);if (c == '\n')scanf("%c", &c);while (c != '\n' && c != -1 && c != ' ') {str += c;scanf("%c", &c);}}void scanc(char& str) {char c;scanf("%c", &c);if (c == -1)return;while (c == '\n') {scanf("%c", &c);}str = c;}double acot(double x) {return PI / 2 - atan(x);}ll LSB(ll n) { return (n & (-n)); }template<typename T>inline T chmin(T& a, const T& b) {if (a > b)a = b;return a;}template<typename T>inline T chmax(T& a, const T& b) {if (a < b)a = b;return a;}//cpp_int#if __has_include(<boost/multiprecision/cpp_int.hpp>)#include <boost/multiprecision/cpp_int.hpp>#include <boost/multiprecision/cpp_dec_float.hpp>using namespace boost::multiprecision;#elseusing cpp_int = ll;#endif//atcoder library#if __has_include(<atcoder/all>)#include <atcoder/all>//using namespace atcoder;#endif/*random_device seed_gen;mt19937 engine(seed_gen());uniform_int_distribution dist(1, 100);*//*----------------------------------------------------------------------------------*//** @title unionfind* @docs kyopro/docs/unionfind.md*///0-indexedstruct unionfind {vector<int> par, siz;unionfind(int n) : par(n), siz(n) {for (int i = 0; i < n; ++i) {//全部根で初期化par[i] = i;//サイズは1siz[i] = 1;}}void init(int n) {par.resize(n);siz.resize(n);for (int i = 0; i < n; ++i) {//全部根で初期化par[i] = i;//サイズは1siz[i] = 1;}}//根を返すint find(int a) {return par[a] == a ? a : par[a] = find(par[a]);}//くっつける。元から同じだったらfalseを返すbool unite(int a, int b) {int x = find(a), y = find(b);if (x == y)return false;else if (siz[x] < siz[y]) {par[x] = y;siz[y] += siz[x];}else if (siz[x] > siz[y]) {par[y] = x;siz[x] += siz[y];}else {par[x] = y;siz[y] += siz[x];}return true;}//同じ集合か判定するbool same(int a, int b) {return find(a) == find(b);}//サイズを返すint size(int a) {return siz[find(a)];}};random_device seed_gen;mt19937 engine(seed_gen());int main() {int n, q;scanf("%d%d", &n, &q);unionfind uni(n);uniform_int_distribution dist(0, n);set<int> st;rep(i, n)st.insert(i);while (q--) {int t;scanf("%d", &t);if (t == 1) {int u, v;scanf("%d%d", &u, &v);--u, --v;st.erase(uni.find(u));st.erase(uni.find(v));uni.unite(u, v);st.insert(uni.find(u));}else {int u;scanf("%d", &u);--u;if (st.size() == 1)puts("-1");else if (st.find(uni.find(u)) == st.begin())printf("%d\n", *next(st.begin()) + 1);else printf("%d\n", *st.begin() + 1);}}Please AC;}