//#pragma GCC optimize ("-O3") #include using namespace std; //@起動時 struct initon { initon() { cin.tie(0); ios::sync_with_stdio(false); cout.setf(ios::fixed); cout.precision(16); srand((unsigned) clock() + (unsigned) time(NULL)); }; } __initon; //衝突対策 #define ws ___ws struct T { int f, s, t; T() { f = -1, s = -1, t = -1; } T(int f, int s, int t) : f(f), s(s), t(t) {} bool operator<(const T &r) const { return f != r.f ? f < r.f : s != r.s ? s < r.s : t < r.t; //return f != r.f ? f > r.f : s != r.s ? s > r.s : t > r.t; 大きい順 } bool operator>(const T &r) const { return f != r.f ? f > r.f : s != r.s ? s > r.s : t > r.t; //return f != r.f ? f > r.f : s != r.s ? s > r.s : t > r.t; 小さい順 } bool operator==(const T &r) const { return f == r.f && s == r.s && t == r.t; } bool operator!=(const T &r) const { return f != r.f || s != r.s || t != r.t; } int operator[](int i) { assert(i < 3); return i == 0 ? f : i == 1 ? s : t; } }; #define int long long #define ll long long #define double long double #define ull unsigned long long using dou = double; using itn = int; using str = string; using bo= bool; #define au auto using P = pair; #define fi first #define se second #define vec vector #define beg begin #define rbeg rbegin #define con continue #define bre break #define brk break #define is == //マクロ省略系コンテナ using vi = vector; #define _overloadvvi(_1, _2, _3, _4, name, ...) name #define vvi0() vec #define vvi1(a) vec a #define vvi2(a, b) vec a(b) #define vvi3(a, b, c) vec a(b,vi(c)) #define vvi4(a, b, c, d) vec a(b,vi(c,d)) #define vvi(...) _overloadvvi(__VA_ARGS__,vvi4,vvi3,vvi2 ,vvi1,vvi0)(__VA_ARGS__) using vl = vector; #define _overloadvvl(_1, _2, _3, _4, name, ...) name #define vvl1(a) vec a #define vvl2(a, b) vec a(b) #define vvl3(a, b, c) vec a(b,vl(c)) #define vvl4(a, b, c, d) vec a(b,vl(c,d)) #define vvl(...) _overloadvvl(__VA_ARGS__,vvl4,vvl3,vvl2 ,vvl1)(__VA_ARGS__) using vb = vector; #define _overloadvvb(_1, _2, _3, _4, name, ...) name #define vvb1(a) vec a #define vvb2(a, b) vec a(b) #define vvb3(a, b, c) vec a(b,vb(c)) #define vvb4(a, b, c, d) vec a(b,vb(c,d)) #define vvb(...) _overloadvvb(__VA_ARGS__,vvb4,vvb3,vvb2 ,vvb1)(__VA_ARGS__) using vs = vector; #define _overloadvvs(_1, _2, _3, _4, name, ...) name #define vvs1(a) vec a #define vvs2(a, b) vec a(b) #define vvs3(a, b, c) vec a(b,vs(c)) #define vvs4(a, b, c, d) vec a(b,vs(c,d)) #define vvs(...) _overloadvvs(__VA_ARGS__,vvs4,vvs3,vvs2 ,vvs1)(__VA_ARGS__) using vd = vector; #define _overloadvvd(_1, _2, _3, _4, name, ...) name #define vvd1(a) vec a #define vvd2(a, b) vec a(b) #define vvd3(a, b, c) vec a(b,vd(c)) #define vvd4(a, b, c, d) vec a(b,vd(c,d)) #define vvd(...) _overloadvvd(__VA_ARGS__,vvd4,vvd3,vvd2 ,vvd1)(__VA_ARGS__) using vc=vector; #define _overloadvvc(_1, _2, _3, _4, name, ...) name #define vvc1(a) vec a #define vvc2(a, b) vec a(b) #define vvc3(a, b, c) vec a(b,vc(c)) #define vvc4(a, b, c, d) vec a(b,vc(c,d)) #define vvc(...) _overloadvvc(__VA_ARGS__,vvc4,vvc3,vvc2 ,vvc1)(__VA_ARGS__) using vp = vector

; #define _overloadvvp(_1, _2, _3, _4, name, ...) name #define vvp1(a) vec a #define vvp2(a, b) vec a(b) #define vvp3(a, b, c) vec a(b,vp(c)) #define vvp4(a, b, c, d) vec a(b,vp(c,d)) using vt = vector; #define _overloadvvt(_1, _2, _3, _4, name, ...) name #define vvt1(a) vec a #define vvt2(a, b) vec a(b) #define vvt3(a, b, c) vec a(b,vt(c)) #define vvt4(a, b, c, d) vec a(b,vt(c,d)) #define v3i(a, b, c, d) vector> a(b, vector(c, vi(d))) #define v3d(a, b, c, d) vector> a(b, vector(c, vd(d))) #define v3m(a, b, c, d) vector> a(b, vector(c, vm(d))) #define _vvi vector #define _vvl vector #define _vvb vector #define _vvs vector #define _vvd vector #define _vvc vector #define _vvp vector #define PQ priority_queue, greater > #define tos to_string using mapi = map; using mapd = map; using mapc = map; using maps = map; using seti = set; using setd = set; using setc = set; using sets = set; using qui = queue; #define bset bitset #define uset unordered_set #define mset multiset #define umap unordered_map #define umapi unordered_map #define umapp unordered_map #define mmap multimap //マクロ繰り返し #define _overloadrep(_1, _2, _3, _4, name, ...) name # define _rep(i, n) for(int i = 0,_lim=n; i < _lim ; i++) #define repi(i, m, n) for(int i = m,_lim=n; i < _lim ; i++) #define repadd(i, m, n, ad) for(int i = m,_lim=n; i < _lim ; i+= ad) #define rep(...) _overloadrep(__VA_ARGS__,repadd,repi,_rep,)(__VA_ARGS__) #define _rer(i, n) for(int i = n; i >= 0 ; i--) #define reri(i, m, n) for(int i = m,_lim=n; i >= _lim ; i--) #define rerdec(i, m, n, dec) for(int i = m,_lim=n; i >= _lim ; i-=dec) #define rer(...) _overloadrep(__VA_ARGS__,rerdec,reri,_rer,)(__VA_ARGS__) #define fora(a, b) for(auto&& a : b) //マクロ定数 #define k3 1010 #define k4 10101 #define k5 101010 #define k6 1010101 #define k7 10101010 const int inf = (int) 1e9 + 100; const ll linf = (ll) 1e18 + 100; const double eps = 1e-9; const double PI = 3.1415926535897932384626433832795029L; ll ma = numeric_limits::min(); ll mi = numeric_limits::max(); const int y4[] = {-1, 1, 0, 0}; const int x4[] = {0, 0, -1, 1}; const int y8[] = {0, 1, 0, -1, -1, 1, 1, -1}; const int x8[] = {1, 0, -1, 0, 1, -1, 1, -1}; //マクロ省略形関数等 #define arsz(a) (sizeof(a)/sizeof(a[0])) #define sz(a) ((int)(a).size()) #define rs resize #define mp make_pair #define pb push_back #define pf push_front #define eb emplace_back #define all(a) (a).begin(),(a).end() #define rall(a) (a).rbegin(),(a).rend() inline void sort(string &a) { sort(a.begin(), a.end()); } template inline void sort(vector &a) { sort(a.begin(), a.end()); }; template inline void sort(vector &a, int len) { sort(a.begin(), a.begin() + len); }; template inline void sort(vector &a, F f) { sort(a.begin(), a.end(), [&](T l, T r) { return f(l) < f(r); }); }; enum ___pcomparator { fisi, fisd, fdsi, fdsd, sifi, sifd, sdfi, sdfd }; inline void sort(vector

st; hdep[rt] = 0; st.emplace(rt, 0); while (!st.empty()) { int v = st.top().first; int &i = st.top().second; if (i < (int) g[v].size()) { int u = g[v][i++].t; if (u == par[v]) continue; hdep[u] = hdep[v] + 1; st.emplace(u, 0); } else { st.pop(); int res = 0; forg(gi, g[v]) { int u = t; if (u == par[v]) continue; sub[v] += sub[u]; if (res < sub[u]) res = sub[u], hvy[v] = u; } } } } void bfs(int r, int c) { int &k = pos; queue q({r}); while (!q.empty()) { int h = q.front(); q.pop(); for (int i = h; i != -1; i = hvy[i]) { type[i] = c; vid[i] = k++; inv[vid[i]] = i; head[i] = h; forg(gi, g[i])if (t != par[i] && t != hvy[i]) q.push(t); } } } vi vid;public: using undigraph::g; using undigraph::n; using undigraph::edges; using undigraph::usedv; vector disv; vector dep, par; vector head, sub, hvy, inv, type, hdep/*おそらくグループ内のdep*/;/*vid := bel()*/ int root; tree(int n_, int root = 0) : undigraph(n_), root(root) { n = n_; } int lca(int a, int b) { if (never)precalc(); int x = in[a]; int y = in[b]; if (x > y) { swap(x, y); } int pos = rmq.query(x, y + 1); return id[pos]; } int dis(int a, int b) { if (never)precalc(); int x = in[a]; int y = in[b]; if (x > y) { swap(x, y); } int pos = rmq.query(x, y + 1); int p = id[pos]; return disv[a] + disv[b] - disv[p] * 2; } void for_each_l/*O(N) 頂点に対しての処理順が可換*/(int u, int v, function fnode) { int r = lca(u, v); while (u != r) { fnode(u); u = par[u]; } while (v != r) { fnode(v); v = par[v]; } fnode(r); } void for_each_edge_l/*O(N) 頂点に対しての処理順が可換*/(int u, int v, function &)> fedge) { int r = lca(u, v); auto sub = [&](int u, int r) { while (u != r) { forg(gi, g[u]) { if (t == par[u]) { fedge(g[u][gi]); u = par[u]; break; } } } }; sub(u, r); sub(v, r); } void for_each_/*[l,r) O(log(N))*/ (int u, int v, const function &f) { if (never_hld)hld_build(); while (1) { if (vid[u] > vid[v]) swap(u, v); int l = max(vid[head[v]], vid[u]); int r = vid[v] + 1; f(l, r); if (head[u] != head[v]) v = par[head[v]]; else break; } } void for_each_edge/*[l,r) O(log(N)) 辺を頂点として扱っている上と同じ感じで使える*/(int u, int v, const function &f) { if (never_hld)hld_build(); while (1) { if (vid[u] > vid[v]) swap(u, v); if (head[u] != head[v]) { int l = vid[head[v]]; int r = vid[v] + 1; f(l, r); v = par[head[v]]; } else { if (u != v) { int l = vid[u] + 1; int r = vid[v] + 1; f(l, r); } break; } } } int bel(int v) { /*hld内での頂点番号を返す*/ if (never_hld)hld_build(); return vid[v]; } int bel(int f, int t) { /*辺のクエリを扱うときどの頂点に持たせればいいか(vidを返すのでそのままupd出来る)*/ if (never_hld)hld_build(); return hdep[f] > hdep[t] ? vid[f] : vid[t]; } int bel(edge &e) { /*辺のクエリを扱うときどの頂点に持たせればいいか(vidを返すのでそのままupd出来る)*/ if (never_hld)hld_build(); return hdep[e.f] > hdep[e.t] ? vid[e.f] : vid[e.t]; } template int operator()(U ... args) { return bel(args...); }};; undigraph<> g(2 * k5); template struct LowLink { /*@formatter:off*/ undigraph &g; vector used, ord, low; vector articulation; vector > bridge; LowLink(undigraph &g) : g(g) {} int dfs(int idx, int k, int par) { used[idx] = true; ord[idx] = k++; low[idx] = ord[idx]; bool is_articulation = false; int cnt = 0; forg(gi, g[idx]) { if (!used[t]) { ++cnt; k = dfs(t, k, idx); low[idx] = min(low[idx], low[t]); is_articulation |= ~par && low[t] >= ord[idx]; if (ord[idx] < low[t]) bridge.emplace_back(minmax(idx, (int) t)); } else if (t != par) { low[idx] = min(low[idx], ord[t]); } } is_articulation |= par == -1 && cnt > 1; if (is_articulation) articulation.push_back(idx); return k; } virtual void build() { used.assign(g.n, 0); ord.assign(g.n, 0); low.assign(g.n, 0); int k = 0; for (int i = 0; i < g.n; i++) { if (!used[i]) k = dfs(i, k, -1); } }}; template class scc_un : LowLink { /****************************************************************************/using LL = LowLink;using LL::g;void dfs(int idx, int par, int &k) { if (~par && this->ord[par] >= this->low[idx]) bel_[idx] = bel_[par]; else bel_[idx] = k++; forg(gi, g[idx]){ if (bel_[t] == -1) dfs(t, idx, k); } } vi bel_; public : int operator[](const int &k) {return bel_[k];} void build(undigraph<> &comp) {LL::build(); bel_.assign(this->g.size(), -1); int k = 0; for (int i = 0; i < bel_.size(); i++) { if (bel_[i] == -1) dfs(i, -1, k); } comp.resize(k); for (auto &e : this->bridge) { int x = bel_[e.first], y = bel_[e.second]; comp.add(x, y); } list.resize(sz(bel_)); rep(i, bel_.size()) { list[bel_[i]].push_back(i); } #ifdef _DEBUG cerr << "---scc_un_index---" << endl; vi inds; rep(i, n) if (sz(g[i]))inds.push_back(i); rep(i, sz(inds)) { str s = tos(bel(inds[i])); cerr << std::right << std::setw(sz(s) + (i ? 1 : 0)) << inds[i]; } cerr << endl; rep(i, sz(inds)) { cerr << bel(inds[i])<<" "; } cerr << endl << endl; #endif } scc_un(undigraph<> &g) : LL(g) {} scc_un(undigraph<> &g, undigraph<> &comp) : LL(g) { build(comp); } //[i] := iが所属するグループid int bel(int i){return bel_[i];} int operator()(int i){return bel_[i];} vector list; //[gi] := giに所属する頂点集合 }; tree<> comp(0);//縮約後のグラフをもつ template struct segmax {/*@formatter:off*/int n;vector seg; M f(M a,M b){ return a > b ? a : b; }const M e = MIN(M); segmax(int len,M init_value=MIN(M)):e(init_value){ n = 1; int asz = len; while (n <= asz)n <<= 1; seg.assign((n << 1) - 1, e); rep(i, asz) seg[i + n - 1] =e; rer(i, n - 2)seg[i] = f(seg[(i << 1) | 1], seg[(i << 1) + 2]); debu();} segmax(vector& dat,M init_value=MIN(M)) :e(init_value){n = 1; int asz = dat.size(); while (n <= asz)n <<= 1; seg.assign((n << 1) - 1, e); rep(i, asz) seg[i + n - 1] = dat[i]; rer(i, n - 2)seg[i] = f(seg[(i << 1) | 1], seg[(i << 1) + 2]); debu(); }void update(int k, M v) {int tk=k; seg[k + n - 1] = v; k += n - 1; while (k) { k = (k - 1) >> 1; seg[k] = f(seg[(k << 1) | 1], seg[(k << 1) + 2]); } debup(tk, v); }void del(int k) { update(k, e); }void add(int k, int v) { update(k, v + seg[k + n - 1]); }M query_bottomup(int l, int r) { int tl = l, tr = r; M retl = e; M retr = e; l += n - 1; r += n - 1; while (l < r) { /*右なら、次に右上へ移動してしまうので*/ if (!(l & 1)) { retl = f(retl, seg[l]); } /*右なら、左を取らないと機会を逃す*/ if (!(r & 1)) { retr = f(seg[r - 1], retr); } l >>= 1; r = (r - 1) >> 1; } M ret = f(retl, retr); debge(tl, tr, ret); return ret; } M query(int a, int b, int k, int l, int r) { if (r <= a || b <= l)return e; else if (a <= l && r <= b)return seg[k]; else { M sl = query(a, b, (k << 1) | 1, l, (l + r) >> 1); M sr = query(a, b, (k << 1) + 2, (l + r) >> 1, r); return f(sl, sr); } }/* M get(int a = 0, int b = -1) { return query(a, b == -1 ? n : b, 0, 0, n); }*/ M get(int a, int b) { return query_bottomup(a, min(b, n)); } M get(int b = inf) { return query_bottomup(0, min(b, n)); } int operator()(int b = inf) { return get(0, b); } int operator()(int a, int b) { return get(a, b); } M operator[](int k) { return seg[k + n - 1]; } #ifdef _DEBUG void debu() { rep(i, min(n, 10ll)) { int v = operator[](i); if (v == MIN(ll) || v == MAX(ll)) { cerr << "e "; } else { cerr << v << " "; } } cerr << "" << endl << endl; } void debup(int k, int v) { cerr << "upd : [" << k << "] = " << v << endl; debu(); } void debge(int l, int r, M v) { cerr << "get : [" << l << ", " << r << ") = " << v << endl; debu(); } #else void debu(){;} void debup(int k,int v){;} void debge(int l,int r,M v){;}/*@formatter:on*/ #endif }; priority_queue pq[k5];//大きい順 signed main() { cin >> n >> m >> q; // g.resize(n); g.ing(n,m); scc_un<> sc(g, comp); segmax seg(k5,-1); mapi whe; rep(i, q) { int t; cin >> t; auto get=[&](int i){ i=sc.bel(i); i=comp.bel(i); return i; }; //uにwが現れる if (t == 1) { int u, v; cin >> u >> v; u = comp(sc(u - 1)); if (seg[u] < v)seg.update(u, v); pq[u].push(v); whe[v] = u; } else { int s, t; cin >> s >> t; --s, --t; s=sc(s); t=sc(t); int res = -1; auto f = [&](int l, int r) { chma(res, seg.get(l, r)); }; comp.for_each_(s,t,f); cout << res << endl; if (res == -1)con; int p = whe[res]; pq[p].pop(); if(pq[p].empty())seg.update(p,-1); else seg.update(p,pq[p].top()); } } return 0; }