結果
問題 | No.2290 UnUnion Find |
ユーザー |
|
提出日時 | 2023-05-05 22:39:57 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,990 bytes |
コンパイル時間 | 4,206 ms |
コンパイル使用メモリ | 255,476 KB |
最終ジャッジ日時 | 2025-02-12 18:59:40 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 2 TLE * 44 |
ソースコード
#line 2 "/Users/2P/Desktop/ramstream/library/template/template.hpp"/*** @brief Header*/#include <bits/stdc++.h>// #include <algorithm>// #include <cmath>// #include <complex>// #include <cstdio>// #include <iostream>// #include <map>// #include <numeric>// #include <queue>// #include <set>// #include <stack>// #include <string>// #include <vector>// #include <climits>// #include <deque>// #include <iomanip>// #include <limits>using namespace std;typedef long long ll;#define overload4(_1, _2, _3, _4, name, ...) name#define rep1(i, n) for (int i = 0; i < int(n); ++i)#define rep2(i, s, n) for (int i = int(s); i < int(n); ++i)#define rep3(i, s, n, d) for(int i = int(s); i < int(n); i+=d)#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)#define all(x) (x).begin(),(x).end()#define rall(x) (x).rbegin(),(x).rend()#define fir first#define sec second#define pb push_back#define em emplace_back#define mk make_pair#define SUM(a) accumulate(all(a),0LL)#define MIN(a) *min_element(all(a))#define MAX(a) *max_element(all(a))template<class... T> void input(T&... a){(cin >> ... >> a);}#define INT(...) int __VA_ARGS__;input(__VA_ARGS__)#define LL(...) ll __VA_ARGS__;input(__VA_ARGS__)#define STR(...) string __VA_ARGS__;input(__VA_ARGS__)#define DBL(...) double __VA_ARGS__;input(__VA_ARGS__)void Yes(bool iSizIs=true) {if(iSizIs){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}}void No() {cout<<"No"<<endl;}template<class T> void OUT(T x) {cout << (x) << endl;}template<class T> bool chmin(T &a, T b) {if (a > b) {a = b;return true;}return false;}template<class T> bool chmax(T &a, T b) {if (a < b) {a = b;return true;}return false;}ll POW(ll a, ll n, ll MOD) {if (n == 0) return 1;if (n == 1) return a % MOD;ll ret = POW(a, n / 2, MOD) % MOD;(ret *= ret) %= MOD;if (n % 2 == 1) {(ret *= a) %= MOD;}return ret;}const int inf = INT_MAX / 2;const ll infl = 1LL << 60;using vi = vector<int>;using vvi = vector<vi>;using vl = vector<ll>;using vvl = vector<vl>;using vd = vector<double>;using vvd = vector<vd>;using vs = vector<string>;using vvs = vector<vs>;using vb = vector<bool>;using vvb = vector<vb>;using pii = pair<int, int>;using pll = pair<ll, ll>;using mii = map<int, int>;using mll = map<ll, ll>;#include <atcoder/all>using namespace atcoder;#line 2 "sol.cpp"int main() {int n, q; cin >> n >> q;dsu uni(n);rep(qi, q) {int t; cin >> t;if(t == 1) {int u, v; cin >> u >> v;uni.merge(u-1,v-1);} else {int v; cin >> v;v--;if(uni.groups().size() == 1) {cout << -1 << endl;} else {for(auto x : uni.groups()) {if(!uni.same(x[0], v)) {cout << x[0] + 1 << endl;break;}}}}}}