#867464 (C++23) No.2290 UnUnion Find

提出ソース

結果

問題	No.2290 UnUnion Find
ユーザー	abc23
提出日時	2023-05-08 21:14:08
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	351 ms / 2,000 ms
コード長	5,610 bytes
コンパイル時間	6,060 ms
コンパイル使用メモリ	312,220 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-05-04 04:03:11
合計ジャッジ時間	22,968 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	341 ms 6,944 KB
testcase_03	AC	261 ms 6,940 KB
testcase_04	AC	254 ms 6,940 KB
testcase_05	AC	257 ms 6,940 KB
testcase_06	AC	255 ms 6,944 KB
testcase_07	AC	258 ms 6,940 KB
testcase_08	AC	260 ms 6,940 KB
testcase_09	AC	251 ms 6,940 KB
testcase_10	AC	262 ms 6,944 KB
testcase_11	AC	257 ms 6,944 KB
testcase_12	AC	264 ms 6,944 KB
testcase_13	AC	251 ms 6,940 KB
testcase_14	AC	260 ms 6,940 KB
testcase_15	AC	263 ms 6,940 KB
testcase_16	AC	258 ms 6,940 KB
testcase_17	AC	259 ms 6,944 KB
testcase_18	AC	255 ms 6,940 KB
testcase_19	AC	273 ms 6,944 KB
testcase_20	AC	276 ms 6,944 KB
testcase_21	AC	351 ms 6,940 KB
testcase_22	AC	311 ms 6,944 KB
testcase_23	AC	317 ms 6,940 KB
testcase_24	AC	265 ms 6,944 KB
testcase_25	AC	325 ms 6,944 KB
testcase_26	AC	270 ms 6,944 KB
testcase_27	AC	266 ms 6,944 KB
testcase_28	AC	286 ms 6,940 KB
testcase_29	AC	270 ms 6,940 KB
testcase_30	AC	336 ms 6,940 KB
testcase_31	AC	273 ms 6,944 KB
testcase_32	AC	323 ms 6,940 KB
testcase_33	AC	287 ms 6,940 KB
testcase_34	AC	273 ms 6,940 KB
testcase_35	AC	271 ms 6,944 KB
testcase_36	AC	318 ms 6,940 KB
testcase_37	AC	292 ms 6,944 KB
testcase_38	AC	318 ms 6,940 KB
testcase_39	AC	309 ms 6,944 KB
testcase_40	AC	266 ms 6,944 KB
testcase_41	AC	326 ms 6,940 KB
testcase_42	AC	273 ms 6,944 KB
testcase_43	AC	272 ms 6,944 KB
testcase_44	AC	256 ms 6,940 KB
testcase_45	AC	266 ms 6,940 KB
testcase_46	AC	259 ms 6,944 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#if !__INCLUDE_LEVEL__

#include __FILE__

struct Solver {
void solve() {
	int n,q;cin>>n>>q;
	dsu d(n);
	int l=0,r=1;
	while(q--){
		int t;cin>>t;
		if(t==1){
			int u,v;cin>>u>>v;
			u--;v--;
			d.merge(u,v);
			if(d.size(0)==n)continue;
			while(d.same(l,r)){
				r++;
			}
		}
		else{
			int v;cin>>v;
			v--;
			if(d.size(v)==n){
				cout<<-1<<endl;
			}
			elif(!d.same(l,v)){
				cout<<l+1<<endl;
			}
			else{
				cout<<r+1<<endl;
			}
		}
	}
}};

signed main() {
	int ts = 1;
	// scanf("%lld",&ts);
	rep(ti,ts) {
		Solver solver;
		solver.solve();
	}
	return 0;
}

#else

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

using namespace std;

#define int ll

using ll=long long;
using ld = long double;
using uint = unsigned;
using ull = unsigned long long;
using P=pair<int,int>;
using TP=tuple<int,int,int>;

const int INF = 1001001001;
const long long INFL = 3e18;
const int MAX = 2e6+5;

#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define rrep(...) overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define fore(i,a) for(auto &i:a)

#define all(x) x.begin(),x.end() 
#define allr(x) x.rbegin(),x.rend() 
#define sz(x) ((int)(x).size())
#define bp(x) (__builtin_popcountll((long long)(x)))
#define elif else if
#define mpa make_pair
#define bit(n) (1LL<<(n))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))

template<typename T> using V = vector<T>;
template<typename T> using max_heap = priority_queue<T>;
template<typename T> using min_heap = priority_queue<T, vector<T>, greater<>>;
template<typename T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vector<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const V<V<T>>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(all(a));a.erase(unique(all(a)),a.end());}
template<typename T>void prepend(vector<T>&a,const T&x){a.insert(a.begin(),x);}
template<typename T>T vgcd(T m, T n) {return std::gcd(m, n);}
template<typename T, typename... Args>T vgcd(T a, Args... args) {return vgcd(a, vgcd(args...));}

void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
// void print(int a){ printf("%d", a); }
void print(unsigned a){ printf("%u", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", a); }
void print(unsigned long long a){ printf("%llu", a); }
void print(char a){ printf("%c", a); }
void print(char *a){ printf("%s", a); }
void print(const char *a){ printf("%s", a); }
void print(double a){ printf("%.15f", a); }
void print(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
template<typename T> void print(const complex<T>& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag()); print('i'); }
template<typename T> void print(const vector<T>&);
template<typename T, size_t size> void print(const array<T, size>&);
template<typename T, typename L> void print(const pair<T, L>& p);
template<typename T, size_t size> void print(const T (&)[size]);
template<typename T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<typename T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<typename T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<typename T, typename L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }
template<typename T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }
template<typename T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<typename T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<typename Head, typename... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }


ll binary_search(function<bool(ll)> check, ll ok, ll ng) {
assert(check(ok));
	while (abs(ok - ng) > 1) {
		auto x = (ng + ok) / 2;
		if (check(x))
			ok = x;
		else
			ng = x;
	}
	return ok;
}

#endif

yukicoder

結果

テストケース

ソースコード