結果
問題 | No.2290 UnUnion Find |
ユーザー | noya2 |
提出日時 | 2023-05-05 21:23:54 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 261 ms / 2,000 ms |
コード長 | 4,270 bytes |
コンパイル時間 | 4,428 ms |
コンパイル使用メモリ | 272,524 KB |
実行使用メモリ | 13,376 KB |
最終ジャッジ日時 | 2023-08-15 02:45:28 |
合計ジャッジ時間 | 16,021 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 41 ms
4,380 KB |
testcase_03 | AC | 129 ms
8,364 KB |
testcase_04 | AC | 133 ms
8,348 KB |
testcase_05 | AC | 134 ms
8,352 KB |
testcase_06 | AC | 128 ms
8,216 KB |
testcase_07 | AC | 133 ms
8,292 KB |
testcase_08 | AC | 127 ms
8,240 KB |
testcase_09 | AC | 130 ms
8,240 KB |
testcase_10 | AC | 133 ms
8,232 KB |
testcase_11 | AC | 128 ms
8,236 KB |
testcase_12 | AC | 127 ms
8,296 KB |
testcase_13 | AC | 131 ms
8,240 KB |
testcase_14 | AC | 133 ms
8,492 KB |
testcase_15 | AC | 130 ms
8,224 KB |
testcase_16 | AC | 128 ms
8,368 KB |
testcase_17 | AC | 139 ms
8,292 KB |
testcase_18 | AC | 130 ms
8,220 KB |
testcase_19 | AC | 177 ms
8,980 KB |
testcase_20 | AC | 261 ms
13,372 KB |
testcase_21 | AC | 50 ms
4,376 KB |
testcase_22 | AC | 91 ms
5,884 KB |
testcase_23 | AC | 90 ms
6,008 KB |
testcase_24 | AC | 204 ms
10,488 KB |
testcase_25 | AC | 76 ms
5,232 KB |
testcase_26 | AC | 232 ms
12,124 KB |
testcase_27 | AC | 222 ms
11,012 KB |
testcase_28 | AC | 133 ms
7,408 KB |
testcase_29 | AC | 198 ms
10,028 KB |
testcase_30 | AC | 57 ms
4,396 KB |
testcase_31 | AC | 188 ms
9,424 KB |
testcase_32 | AC | 78 ms
5,432 KB |
testcase_33 | AC | 130 ms
7,596 KB |
testcase_34 | AC | 255 ms
13,376 KB |
testcase_35 | AC | 236 ms
11,804 KB |
testcase_36 | AC | 84 ms
5,652 KB |
testcase_37 | AC | 117 ms
7,096 KB |
testcase_38 | AC | 82 ms
5,492 KB |
testcase_39 | AC | 96 ms
6,124 KB |
testcase_40 | AC | 227 ms
11,264 KB |
testcase_41 | AC | 73 ms
5,116 KB |
testcase_42 | AC | 164 ms
8,656 KB |
testcase_43 | AC | 155 ms
8,412 KB |
testcase_44 | AC | 132 ms
8,288 KB |
testcase_45 | AC | 136 ms
8,272 KB |
testcase_46 | AC | 140 ms
8,244 KB |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> #define rep(i,n) for (int i = 0; i < int(n); ++i) #define repp(i,m,n) for (int i = m; i < int(n); ++i) #define reb(i,n) for (int i = int(n)-1; i >= 0; --i) #define all(v) v.begin(),v.end() using namespace std; using namespace atcoder; using ll = long long; using ull = unsigned long long; using ld = long double; using P = pair<int, int>; using PL = pair<long long, long long>; using pdd = pair<long double, long double>; using pil = pair<int,ll>; using pli = pair<ll,int>; template<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;} template<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);} template<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));} template<typename T> T rev(const T& str_or_vec){T res = str_or_vec; reverse(res.begin(),res.end()); return res; } template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;} template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;} template<typename T>void uniq(vector<T> &v){sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());} template<typename T1, typename T2>void print(pair<T1,T2> a); template<typename T>void print(vector<T> v); template<typename T>void print(vector<vector<T>> v); void print(){ putchar(' '); } void print(bool a){ printf("%d", a); } void print(int a){ printf("%d", a); } void print(long a){ printf("%ld", a); } void print(long long a){ printf("%lld", 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(long double a){ printf("%.15Lf", a); } void print(const string& a){ for(auto&& i : a) print(i); } void print(unsigned int a){ printf("%u", a); } void print(unsigned long long a) { printf("%llu", a); } template<class T> void print(const T& a){ cout << a; } int out(){ putchar('\n'); return 0; } template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; } template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; } template<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);} template<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}} template<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}} void yes(){out("Yes");} void no (){out("No");} void yn (bool t){if(t)yes();else no();} void fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);} void o(){out("!?");} namespace noya2{ const int INF = 1001001007; const long long mod1 = 998244353; const long long mod2 = 1000000007; const long long inf = 2e18; const long double pi = 3.14159265358979323; const long double eps = 1e-7; const vector<int> dx = {0,1,0,-1,1,1,-1,-1}; const vector<int> dy = {1,0,-1,0,1,-1,-1,1}; const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string alp = "abcdefghijklmnopqrstuvwxyz"; const string NUM = "0123456789"; } // namespace noya2 using namespace noya2; using mint = modint998244353; //using mint = modint1000000007; //using mint = modint; void out(mint a){out(a.val());} void out(vector<mint> a){vector<ll> b(a.size()); rep(i,a.size()) b[i] = a[i].val(); out(b);} void out(vector<vector<mint>> a){for (auto v : a) out(v);} void solve(){ int n, q; cin >> n >> q; dsu d(n); set<int> st; rep(i,n) st.insert(i); while (q--){ int t; cin >> t; if (t == 1){ int u, v; cin >> u >> v; u--, v--; if (d.same(u,v)) continue; st.erase(d.leader(u)), st.erase(d.leader(v)); st.insert(d.merge(u,v)); } if (t == 2){ int v; cin >> v; v--; v = d.leader(v); if ((int)st.size() == 1){ out(-1); } else { auto ite = st.begin(); int ans = *ite; if (ans == v) ans = *next(ite); out(ans+1); } } } } int main(){ fast_io(); int t = 1; //cin >> t; while(t--) solve(); }