/** * author: tsuyu93 * started: 2021-06-25 23:05:20 * 継続は力なり、雨だれ石を穿つ * make the impossible possible **/ #pragma GCC optimize("Ofast") #include // #include // #include // namespace mpb = boost::multiprecision; // using bint = mpb::cpp_int; // // 仮数部が1024ビットの浮動小数点数型(TLEしたら小さくする) // using Real = mpb::number>; #ifdef __HOGE__ #pragma region macro #endif using namespace std; using ll = long long; using ld = long double; using ull = unsigned long long; using uint = unsigned; using pll = pair; using pli = pair; using pii = pair; using pld = pair; using ppiii = pair; using ppiill = pair; using ppllll = pair; using pplii = pair; using mii = map; using dll = deque; using qll = queue; using pqll = priority_queue; using pqrll = priority_queue, greater>; using pqrpll = priority_queue, greater>; using vint = vector; using vbool = vector; using vstr = vector; using vll = vector; using vld = vector; using vpll = vector; using vvll = vector>; using vvint = vector>; using vvld = vector>; using vvbool = vector; using vvstr = vector; using vvpll = vector>; #define REP(i,n) for(ll i=0;i=0;i--) #define FOR(i,a,b) for(ll i=a;i<=ll(b);i++) #define FORD(i,a,b) for(ll i=a;i>=ll(b);i--) #define overload4(_1,_2,_3,_4,name,...) name #define overload3(_1,_2,_3,name,...) name #define rep1(n) for(ll i=0;i(a);) #define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c) #define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__) #define each1(i,a) for(auto&&i:a) #define each2(x,y,a) for(auto&&[x,y]:a) #define each3(x,y,z,a) for(auto&&[x,y,z]:a) #define each(...) overload4(__VA_ARGS__,each3,each2,each1)(__VA_ARGS__) #define all1(i) begin(i),end(i) #define all2(i,a) begin(i),begin(i)+a #define all3(i,a,b) begin(i)+a,begin(i)+b #define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__) #define rall1(i) (i).rbegin(),(i).rend() #define rall2(i,k) (i).rbegin(),(i).rbegin()+k #define rall3(i,a,b) (i).rbegin()+a,(i).rbegin()+b #define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__) #define SUM(...) accumulate(all(__VA_ARGS__),0LL) #define ALL(x) x.begin(),x.end() #define rALL(x) x.rbegin(),x.rend() #define SIZE(x) ll(x.size()) #define Sort(a) sort(all(a)) #define INT(...) int __VA_ARGS__;in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;in(__VA_ARGS__) #define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__) #define STR(...) string __VA_ARGS__;in(__VA_ARGS__) #define CHR(...) char __VA_ARGS__;in(__VA_ARGS__) #define DBL(...) double __VA_ARGS__;in(__VA_ARGS__) #define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)int scan(){ return getchar(); } #define fs first #define sc second #define endl '\n' #define elif else if #define ADD_OVERFLOW(a, b) __builtin_add_overflow_p (a, b, (decltype((a)+(b))) 0) #define SUB_OVERFLOW(a, b) __builtin_sub_overflow_p (a, b, (decltype((a)+(b))) 0) #define MUL_OVERFLOW(a, b) __builtin_mul_overflow_p (a, b, (decltype((a)+(b))) 0) void scan(int& a){ scanf("%d", &a); } void scan(unsigned& a){ scanf("%u", &a); } void scan(long& a){ scanf("%ld", &a); } void scan(long long& a){ scanf("%lld", &a); } void scan(unsigned long long& a){ scanf("%llu", &a); } void scan(char& a){ do{ a = getchar(); }while(a == ' ' || a == '\n'); } void scan(float& a){ scanf("%f", &a); } void scan(double& a){ scanf("%lf", &a); } void scan(long double& a){ scanf("%Lf", &a); } void scan(vector& a){ for(unsigned i = 0; i < a.size(); i++){ int b; scan(b); a[i] = b; } } void scan(char a[]){ scanf("%s", a); } void scan(string& a){ cin >> a; } template void scan(vector&); template void scan(array&); template void scan(pair&); template void scan(T(&)[size]); template void scan(vector& a){ for(auto&& i : a) scan(i); } template void scan(deque& a){ for(auto&& i : a) scan(i); } template void scan(array& a){ for(auto&& i : a) scan(i); } template void scan(pair& p){ scan(p.first); scan(p.second); } template void scan(T (&a)[size]){ for(auto&& i : a) scan(i); } template void scan(T& a){ cin >> a; } void in(){} template void in(Head& head, Tail&... tail){ scan(head); in(tail...); } 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(float a){ printf("%.15f", 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 void print(const complex& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag()); print('i'); } template void print(const vector&); template void print(const array&); template void print(const pair& p); template void print(const T (&)[size]); template void print(const vector& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } } template void print(const deque& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } } template void print(const array& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } } template void print(const pair& p){ print(p.first); putchar(' '); print(p.second); } template void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } } template void print(const T& a){ cout << a; } int out(){ putchar('\n'); return 0; } template int out(const T& t){ print(t); putchar('\n'); return 0; } template int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; } template vector make_vec(size_t a, T b) {return vector(a, b);} template auto make_vec(size_t a, Ts... ts) {return vector(ts...))>(a, make_vec(ts...));} #ifdef DEBUG inline ll __lg(ull x){ return 63 - __builtin_clzll(x); } #define debug(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); } #else #define debug(...) void(0) #endif #define INF32 2147483647 //2.147483647x10^{9}:32bit整数のinf #define INF64 9223372036854775807 //9.223372036854775807x10^{18}:64bit整数のinf const ll MOD = 1000000007; // const ll MOD = 998244353; const int inf = 1e9; const ll INF = (1LL<<61); const ll MAXR = 100000; //10^5:配列の最大のrange const ld PI = acos(-1); inline void Yes(bool b = true) { cout << (b ? "Yes" : "No") << '\n'; } inline void YES(bool b = true) { cout << (b ? "YES" : "NO") << '\n'; } inline void OKNG(bool b = true) { cout << (b ? "OK" : "NG") << '\n'; } inline void GAme(bool b = true) { cout << (b ? "First" : "Second") << '\n'; } inline void gAme(bool b = true) { cout << (b ? "first" : "second") << '\n'; } inline void Takahashi_Aoki(bool b = true) { cout << (b ? "Takahashi" : "Aoki") << '\n'; } inline void takahashi_aoki(bool b = true) { cout << (b ? "takahashi" : "aoki") << '\n'; } inline void possible(bool i = true){ cout << (i?"possible":"impossible") << '\n'; } inline void Possible(bool i = true){ cout << (i?"Possible":"Impossible") << '\n'; } inline void POSSIBLE(bool i = true){ cout << (i?"POSSIBLE":"IMPOSSIBLE") << '\n'; } template inline bool chmin(A& a, B b) {if (a > b) {a = b;return true;}return false;} template inline bool chmax(A& a, B b) {if (a < b) {a = b;return true;}return false;} template auto min(const T& a){ return *min_element(a.begin(),a.end()); } template auto max(const T& a){ return *max_element(a.begin(),a.end()); } template T power(T a, T b) {T res=1;while (b>0) {if (b&1){res*=a;}b/=2;a*=a;}return res;} long long powmod(long long a, long long b) {long long res=1;while (b>0) {if (b&1){res*=a;res%=MOD;}b/=2;a*=a;a%=MOD;}return res;} template T powmod(T a, T b,T m) {T res=1;while (b>0) {if (b&1){res*=a;res%=m;}b/=2;a*=a;a%=m;}return res%m;} template T nlcm(const vector &a) {T res;res = a[0];for (ll i = 1; i < (ll)a.size(); i++) {res = lcm(res, a[i]);}return res;} template T ngcd(const vector &a){T res;res = a[0];for(ll i = 1; i < (ll)a.size() && res != 1; i++) {res = gcd(a[i], res);}return res;} template T sqr(T x){T r=sqrt(x)-1;while((r+1)*(r+1)<=x)r++;return r;} template T bit_length(T a){T k = 0;while(a){k++;a/=2;}return k;} template T isqrt(T n){T a = 0, r = 0;for(T s = bit_length(n)-(bit_length(n)%2?1:2); s >= 0;s-=2){T t = ((n >> s) & 3);r = ((r << 2) | t);T c = ((a << 2) | 1);int b = (r >= c);if(b){r -= c;}a = ((a << 1) | b);}return a;} int popcount(long long a){return __builtin_popcountll(a);} int popcount(int a){return __builtin_popcount(a);} template T ceil(T a, T b) {if(b < 0) a = -a, b = -b;return (a >= 0 ? (a + b - 1) / b : a / b);} template T floor(T a, T b) {if(b < 0) a = -a, b = -b;return (a >= 0 ? a / b : (a - b + 1) / b);} template T sum_of_digit(T a) {T res = 0;while(a){res += a%10; a /= 10;}return res;} template void add_edge(vector> &G, A a, A b,bool directed = false){G[a].emplace_back(b);if(!directed)G[b].emplace_back(a);} template void add_edge(vector>> &G, A a, A b, A p,bool directed = false){G[a].emplace_back(p,b);if(!directed)G[b].emplace_back(p,a);} #ifdef __HOGE__ #pragma endregion #endif // #include // using namespace atcoder; // using mint = modint1000000007; // using mint = modint998244353; /* Dynamic Connectivity (削除可能Union Find) link(u,v) O(log^2 N) cut(u,v) O(log^2 N) same(u,v) O(log N) //https://qiita.com/hotman78/items/78cd3aa50b05a57738d4 */ template class dynamic_connectivity{ class euler_tour_tree{ public: struct node; using np=node*; using lint=long long; struct node{ np ch[2]={nullptr,nullptr}; np p=nullptr; int l,r,sz; T val=et,sum=et; bool exact; bool child_exact; bool edge_connected=0; bool child_edge_connected=0; node(){} node(int l,int r):l(l),r(r),sz(l==r),exact(l>ptr; np get_node(int l,int r){ if(ptr[l].find(r)==ptr[l].end())ptr[l][r]=new node(l,r); return ptr[l][r]; } np root(np t){ if(!t)return t; while(t->p)t=t->p; return t; } bool same(np s,np t){ if(s)splay(s); if(t)splay(t); return root(s)==root(t); } np reroot(np t){ auto s=split(t); return merge(s.second,s.first); } pair split(np s){ splay(s); np t=s->ch[0]; if(t)t->p=nullptr; s->ch[0]=nullptr; return {t,update(s)}; } pair split2(np s){ splay(s); np t=s->ch[0]; np u=s->ch[1]; if(t)t->p=nullptr; s->ch[0]=nullptr; if(u)u->p=nullptr; s->ch[1]=nullptr; return {t,u}; } tuple split(np s,np t){ auto u=split2(s); if(same(u.first,t)){ auto r=split2(t); return make_tuple(r.first,r.second,u.second); }else{ auto r=split2(t); return make_tuple(u.first,r.first,r.second); } } template np merge(First s,Rest... t){ return merge(s,merge(t...)); } np merge(np s,np t){ if(!s)return t; if(!t)return s; while(s->ch[1])s=s->ch[1]; splay(s); s->ch[1]=t; if(t)t->p=s; return update(s); } int size(np t){return t?t->sz:0;} np update(np t){ t->sum=et; if(t->ch[0])t->sum=fn(t->sum,t->ch[0]->sum); if(t->l==t->r)t->sum=fn(t->sum,t->val); if(t->ch[1])t->sum=fn(t->sum,t->ch[1]->sum); t->sz=size(t->ch[0])+(t->l==t->r)+size(t->ch[1]); t->child_edge_connected=(t->ch[0]?t->ch[0]->child_edge_connected:0)|(t->edge_connected)|(t->ch[1]?t->ch[1]->child_edge_connected:0); t->child_exact=(t->ch[0]?t->ch[0]->child_exact:0)|(t->exact)|(t->ch[1]?t->ch[1]->child_exact:0); return t; } void push(np t){ //遅延評価予定 } void rot(np t,bool b){ np x=t->p,y=x->p; if((x->ch[1-b]=t->ch[b]))t->ch[b]->p=x; t->ch[b]=x,x->p=t; update(x);update(t); if((t->p=y)){ if(y->ch[0]==x)y->ch[0]=t; if(y->ch[1]==x)y->ch[1]=t; update(y); } } void splay(np t){ push(t); while(!t->is_root()){ np q=t->p; if(q->is_root()){ push(q), push(t); rot(t,q->ch[0]==t); }else{ np r=q->p; push(r), push(q), push(t); bool b=r->ch[0]==q; if(q->ch[1-b]==t)rot(q,b),rot(t,b); else rot(t,1-b),rot(t,b); } } } // void debug(np t){ // if(!t)return; // debug(t->ch[0]); // cerr<l<<"-"<r<<" "; // debug(t->ch[1]); // } public: euler_tour_tree(){} euler_tour_tree(int sz){ ptr.resize(sz); for(int i=0;isz; } bool same(int s,int t){ return same(get_node(s,s),get_node(t,t)); } void set_size(int sz){ ptr.resize(sz); for(int i=0;ival=fn(t->val,x); update(t); } void edge_update(int s,auto g){ np t=get_node(s,s); splay(t); functiondfs=[&](np t){ assert(t); if(t->lr&&t->exact){ splay(t); t->exact=0; update(t); g(t->l,t->r); return; } if(t->ch[0]&&t->ch[0]->child_exact)dfs(t->ch[0]); else dfs(t->ch[1]); }; while(t&&t->child_exact){ dfs(t); splay(t); } } bool try_reconnect(int s,auto f){ np t=get_node(s,s); splay(t); functiondfs=[&](np t)->bool{ assert(t); if(t->edge_connected){ splay(t); return f(t->l); } if(t->ch[0]&&t->ch[0]->child_edge_connected)return dfs(t->ch[0]); else return dfs(t->ch[1]); }; while(t->child_edge_connected){ if(dfs(t))return 1; splay(t); } return 0; } void edge_connected_update(int s,bool b){ np t=get_node(s,s); splay(t); t->edge_connected=b; update(t); } bool link(int l,int r){ if(same(l,r))return 0; merge(reroot(get_node(l,l)),get_node(l,r),reroot(get_node(r,r)),get_node(r,l)); return 1; } bool cut(int l,int r){ if(ptr[l].find(r)==ptr[l].end())return 0; np s,t,u; tie(s,t,u)=split(get_node(l,r),get_node(r,l)); merge(s,u); np p=ptr[l][r]; np q=ptr[r][l]; ptr[l].erase(r); ptr[r].erase(l); delete p;delete q; return 1; } T get_sum(int p,int v){ cut(p,v); np t=get_node(v,v); splay(t); T res=t->sum; link(p,v); return res; } T get_sum(int s){ np t=get_node(s,s); splay(t); return t->sum; } }; int dep=1; vector ett; vector>>edges; int sz; public: dynamic_connectivity(int sz):sz(sz){ ett.emplace_back(sz); edges.emplace_back(sz); } bool link(int s,int t){ if(s==t)return 0; if(ett[0].link(s,t))return 1; edges[0][s].insert(t); edges[0][t].insert(s); if(edges[0][s].size()==1)ett[0].edge_connected_update(s,1); if(edges[0][t].size()==1)ett[0].edge_connected_update(t,1); return 0; } bool same(int s,int t){ return ett[0].same(s,t); } int size(int s){ return ett[0].size(s); } vectorget_vertex(int s){ return ett[0].vertex_list(s); } void update(int s,T x){ ett[0].update(s,x); } T get_sum(int s){ return ett[0].get_sum(s); } bool cut(int s,int t){ if(s==t)return 0; for(int i=0;i=0;i--){ if(ett[i].cut(s,t)){ if(dep-1==i){ dep++; ett.emplace_back(sz); edges.emplace_back(sz); } return !try_reconnect(s,t,i); } } return 0; } bool try_reconnect(int s,int t,int k){ for(int i=0;i=0;i--){ if(ett[i].size(s)>ett[i].size(t))swap(s,t); auto g=[&](int s,int t){ett[i+1].link(s,t);}; ett[i].edge_update(s,g); auto f=[&](int x)->bool{ for(auto itr=edges[i][x].begin();itr!=edges[i][x].end();){ auto y=*itr; itr=edges[i][x].erase(itr); edges[i][y].erase(x); if(edges[i][x].size()==0)ett[i].edge_connected_update(x,0); if(edges[i][y].size()==0)ett[i].edge_connected_update(y,0); if(ett[i].same(x,y)){ edges[i+1][x].insert(y); edges[i+1][y].insert(x); if(edges[i+1][x].size()==1)ett[i+1].edge_connected_update(x,1); if(edges[i+1][y].size()==1)ett[i+1].edge_connected_update(y,1); }else{ for(int j=0;j<=i;j++){ ett[j].link(x,y); } return 1; } } return 0; }; if(ett[i].try_reconnect(s,f))return 1; } return 0; } constexpr static T et=T(); constexpr static T fn(T s,T t){ return s+t; } }; signed main(){ ios::sync_with_stdio(false); cin.tie(nullptr); //cout << fixed << setprecision(15); ll N,M,Q; cin >> N >> M >> Q; dynamic_connectivity uf(N*(M+2)); // rep(i,N){ // rep(j,M){ // uf.link(j*N+i,(j+1)*N+i); // } // } while(Q--){ ll q; cin >> q; if(q==1){ ll d; cin >> d; vll p(N); rep(i,N){ cin >> p[i]; p[i]--; } rep(i,N){ rep(j,N){ if(uf.same((d-1)*N+i,d*N+j)){ uf.cut((d-1)*N+i,d*N+j); break; } } } rep(i,N){ uf.link((d-1)*N+i,d*N+p[i]); } } if(q==2){ ll s; cin >> s; rep(i,N){ rep(j,N){ if(uf.same(j,s*N+i)){ cout << j+1 << " "; break; } } } cout << endl; } if(q==3){ ll l,r; cin >> l >> r; ll ans = 0; rep(i,N){ rep(j,N){ if(uf.same((l-1)*N+i,r*N+j)){ ans += abs(i-j);break; } } } cout << ans << endl; } } //cout << ans << endl; return 0; }