結果
問題 | No.2290 UnUnion Find |
ユーザー |
|
提出日時 | 2023-05-05 21:47:26 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 435 ms / 2,000 ms |
コード長 | 3,600 bytes |
コンパイル時間 | 3,674 ms |
コンパイル使用メモリ | 177,532 KB |
実行使用メモリ | 13,568 KB |
最終ジャッジ日時 | 2024-11-23 06:48:56 |
合計ジャッジ時間 | 23,041 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 46 |
ソースコード
#include <stdio.h>#include <iostream>#include <iomanip>#include <string>#include <vector>#include <map>#include <algorithm>#include <array>#include <queue>#include <stack>#include <set>#include <list>#include <limits>#include <unordered_map>#include <unordered_set>#include <bitset>#include <cmath>#include <math.h>#include <climits>#pragma warning(push)#pragma warning(disable:26498 26450 26451 26812)#include "atcoder/all"#pragma warning(pop)//#include <boost/multiprecision/cpp_int.hpp>//using namespace boost::multiprecision;// std::fixed << std::setprecision(10)using namespace std;using namespace atcoder;using ll = long long;using ull = unsigned long long;using mint = modint998244353;using mint2 = modint1000000007;const double eps = 1e-9;#define REP(i, n) for (ll i = 0; i < (n); ++i)#define REPI(i, init, n) for (ll i = init; i < (n); ++i)#define REPD(i, init) for (ll i = init; i >=0; --i)#define REPE(i, c) for (const auto& i : c)using vl = vector<ll>;#define VL(a, n) vector<ll> a; a.assign(n, 0);#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;using vvl = vector<vector<ll>>;#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);struct uv { ll u; ll v; ll c; };#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}vvl to_edge(const int n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }vvl to_edge_d(const int n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }template <class T = long long> using pql = priority_queue<T>;template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;const char* YES = "Yes";const char* NO = "No";void yn(bool f) { std::cout << (f ? YES : NO) << endl; };template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値template<class T, class U> bool chmin(T& a, const U& b) { a = min(a, b); return b == a; }template<class T, class U> bool chmax(T& a, const U& b) { a = max(a, b); return b == a; }template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };int main() {cin.tie(nullptr);ios::sync_with_stdio(false);ll n, q;cin >> n >> q;set<ll> s;REP(i, n) {s.insert(i);}dsu d(n);REP(i, q) {ll op;cin >> op;if (op == 1) {ll u, v;cin >> u >> v;u--; v--;s.erase(d.leader(u));s.erase(d.leader(v));s.insert(d.merge(u, v));}if (op == 2) {ll v;cin >> v;v--;if (s.size() == 1) {cout << -1 << endl;}else {ll l = d.leader(v);auto it = s.begin();if (*(it) == l) {it++;}cout << (*it + 1) << endl;}}}}