結果

問題 No.2290 UnUnion Find
ユーザー ecottea
提出日時 2023-05-05 22:32:50
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 8,153 bytes
コンパイル時間 4,062 ms
コンパイル使用メモリ 265,772 KB
最終ジャッジ日時 2025-02-12 18:48:34
ジャッジサーバーID
(参考情報)
judge5 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 3 WA * 43
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; // -2^63 2^63 = 9 * 10^18int -2^31 2^31 = 2 * 10^9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
const vi DX = { 1, 0, -1, 0 }; // 4
const vi DY = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004004004004004LL;
double EPS = 1e-15;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define YES(b) {cout << ((b) ? "YES\n" : "NO\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // mod
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
//
template <class T> inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
template <class T> inline T get(T set, int i) { return (set >> i) & T(1); }
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
// Visual Studio
#ifdef _MSC_VER
#include "local.hpp"
// gcc
#else
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define gcd __gcd
#define dump(...)
#define dumpel(v)
#define dump_list(v)
#define dump_list2D(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) while (1) cout << "OLE"; }
#endif
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
//using mint = modint1000000007;
using mint = modint998244353;
//using mint = modint; // mint::set_mod(m);
namespace atcoder {
inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;
#endif
//
/*
* Mex() : O(1)
*
*
* insert(int v) : O(log n)
* v 1
*
* erase(int v) : O(log n)
* v 1
*
* int get() : O(log n)
* mex
*/
struct Mex {
// lrs : [l, r]
set<pii> lrs;
// cnt[v] : v
unordered_map<int, int> cnt;
//
Mex() {}
// v 1
void insert(int v) {
// verify : https://atcoder.jp/contests/abc194/tasks/abc194_e
// v 1
cnt[v]++;
// v
if (cnt[v] > 1) return;
// v 調
bool ljoin = false, rjoin = false;
auto it = lrs.upper_bound({ v, v });
if (it != lrs.begin() && prev(it)->second == v - 1) ljoin = true;
if (it != lrs.end() && it->first == v + 1) rjoin = true;
//
if (ljoin) {
if (rjoin) {
pii lr = { prev(it)->first, it->second };
it = lrs.erase(it);
lrs.erase(prev(it));
lrs.insert(lr);
}
else {
pii lr = { prev(it)->first, v };
lrs.erase(prev(it));
lrs.insert(lr);
}
}
else {
if (rjoin) {
pii lr = { v, it->second };
lrs.erase(it);
lrs.insert(lr);
}
else {
lrs.insert({ v, v });
}
}
}
// v 1
void erase(int v) {
// verify : https://atcoder.jp/contests/abc194/tasks/abc194_e
// v
if (cnt[v] == 0) return;
// v 1
cnt[v]--;
// v
if (cnt[v] >= 1) return;
// v
auto it = prev(lrs.upper_bound({ v, INF }));
int l, r;
tie(l, r) = *it;
lrs.erase(it);
if (l < v) lrs.insert({ l, v - 1 });
if (r > v) lrs.insert({ v + 1, r });
}
//
int get() {
// verify : https://atcoder.jp/contests/abc194/tasks/abc194_e
if (lrs.empty() || lrs.begin()->first > 0) return 0;
return lrs.begin()->second + 1;
}
#ifdef _MSC_VER
friend ostream& operator<<(ostream& os, Mex nm) {
vi res;
repe(p, nm.cnt) rep(hoge, p.second) res.push_back(p.first);
sort(all(res));
repe(v, res) os << v << " ";
return os;
}
#endif
};
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
int n, q;
cin >> n >> q;
dsu d(n);
vector<Mex> mex(n);
rep(i, n) mex[i].insert(i);
rep(hoge, q) {
int t;
cin >> t;
if (t == 1) {
int u, v;
cin >> u >> v;
u--; v--;
if (d.same(u, v)) continue;
int ldu = d.leader(u);
int ldv = d.leader(v);
d.merge(u, v);
int ld = d.leader(u);
int sub = ldu ^ ldv ^ ld;
repe(tmp, mex[sub].cnt) {
mex[ld].insert(tmp.first);
}
}
else {
int v;
cin >> v;
v--;
int res = mex[v].get();
if (res == n) res = -1;
else res++;
dump("ans:");
cout << res << endl;
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0