P[]<\/code> \u4e2d\u7684\u4e24\u9879\u3002\u3002\u3002<\/p>\n\u5bf9\u4e8e\u4ea4\u6362\u4e0b\u6392\u3002\u3002\u3002<\/p>\n
\r\nswap(B[a], B[b]); pB[B[a]]=a,pB[B[b]]=b,\r\nswap(P[a], P[b]);\r\n<\/pre>\n\u5bf9\u4e8e\u4ea4\u6362\u4e0a\u6392\u3002\u3002\u6709\u3002<\/p>\n
\r\nswap(A[a],A[b]); pA[A[a]]=a,pA[A[b]]=b,\r\nswap(P[pB[A[a]]], P[pB[A[b]]]); \r\n<\/pre>\n\u4e8e\u662f\u8f6c\u5316\u6210\u52a8\u6001\u9006\u5e8f\u5bf9\u95ee\u9898\uff0c\u652f\u6301\u4fee\u6539\u6392\u5217\u4e2d\u7684\u4efb\u610f\u4e00\u9879\u3002
\n\u52a8\u6001\u9006\u5e8f\u5bf9\u95ee\u9898\u7b49\u4ef7\u4e8e\u533a\u95f4 kth<\/code> \u5927\u503c\uff08\u533a\u95f4 Rank<\/code>\uff09\u95ee\u9898\u3002\u3002\u53ef\u4ee5\u7528\u7ecf\u5178\u7684\u6811\u5957\u6811\u65b9\u6cd5\u3002\u3002\u3002
\n\u3002\u3002\u590d\u6742\u5ea6 $$O(nlog^2n)$$\u3002<\/p>\n\r\n\/** Micro Mezz Macro Flation -- Overheated Economy ., Last Update: Aug. 17th 2014 **\/ \/\/{\r\n\r\n\/** Header .. **\/ \/\/{\r\n#pragma comment(linker, "\/STACK:36777216")\r\n\/\/#pragma GCC optimize ("O2")\r\n#define LOCAL\r\n\/\/#include "testlib.h"\r\n#include <functional>\r\n#include <algorithm>\r\n#include <iostream>\r\n#include <fstream>\r\n#include <sstream>\r\n#include <iomanip>\r\n#include <numeric>\r\n#include <cstring>\r\n#include <climits>\r\n#include <cassert>\r\n#include <complex>\r\n#include <cstdio>\r\n#include <string>\r\n#include <vector>\r\n#include <bitset>\r\n#include <queue>\r\n#include <stack>\r\n#include <cmath>\r\n#include <ctime>\r\n#include <list>\r\n#include <set>\r\n#include <map>\r\n\r\n\/\/#include <tr1\/unordered_set>\r\n\/\/#include <tr1\/unordered_map>\r\n\/\/#include <array>\r\n\r\nusing namespace std;\r\n\r\n#define REP(i, n) for (int i=0;i<n;++i)\r\n#define FOR(i, a, b) for (int i=a;i<b;++i)\r\n#define DWN(i, b, a) for (int i=b-1;i>=a;--i)\r\n#define REP_1(i, n) for (int i=1;i<=n;++i)\r\n#define FOR_1(i, a, b) for (int i=a;i<=b;++i)\r\n#define DWN_1(i, b, a) for (int i=b;i>=a;--i)\r\n#define REP_C(i, n) for (int n____=n,i=0;i<n____;++i)\r\n#define FOR_C(i, a, b) for (int b____=b,i=a;i<b____;++i)\r\n#define DWN_C(i, b, a) for (int a____=a,i=b-1;i>=a____;--i)\r\n#define REP_N(i, n) for (i=0;i<n;++i)\r\n#define FOR_N(i, a, b) for (i=a;i<b;++i)\r\n#define DWN_N(i, b, a) for (i=b-1;i>=a;--i)\r\n#define REP_1_C(i, n) for (int n____=n,i=1;i<=n____;++i)\r\n#define FOR_1_C(i, a, b) for (int b____=b,i=a;i<=b____;++i)\r\n#define DWN_1_C(i, b, a) for (int a____=a,i=b;i>=a____;--i)\r\n#define REP_1_N(i, n) for (i=1;i<=n;++i)\r\n#define FOR_1_N(i, a, b) for (i=a;i<=b;++i)\r\n#define DWN_1_N(i, b, a) for (i=b;i>=a;--i)\r\n#define REP_C_N(i, n) for (int n____=(i=0,n);i<n____;++i)\r\n#define FOR_C_N(i, a, b) for (int b____=(i=0,b);i<b____;++i)\r\n#define DWN_C_N(i, b, a) for (int a____=(i=b-1,a);i>=a____;--i)\r\n#define REP_1_C_N(i, n) for (int n____=(i=1,n);i<=n____;++i)\r\n#define FOR_1_C_N(i, a, b) for (int b____=(i=a,b);i<=b____;++i)\r\n#define DWN_1_C_N(i, b, a) for (int a____=(i=b,a);i>=a____;--i)\r\n\r\n#define ECH(it, A) for (__typeof(A.begin()) it=A.begin(); it != A.end(); ++it)\r\n#define REP_S(i, str) for (char*i=str;*i;++i)\r\n#define REP_L(i, hd, suc) for (int i=hd;i;i=suc[i])\r\n#define REP_G(i, u) REP_L(i,hd[u],suc)\r\n#define REP_SS(x, s) for (int x=s;x;x=(x-1)&s)\r\n#define DO(n) for ( int ____n = n; ____n-->0; )\r\n#define REP_2(i, j, n, m) REP(i, n) REP(j, m)\r\n#define REP_2_1(i, j, n, m) REP_1(i, n) REP_1(j, m)\r\n#define REP_3(i, j, k, n, m, l) REP(i, n) REP(j, m) REP(k, l)\r\n#define REP_3_1(i, j, k, n, m, l) REP_1(i, n) REP_1(j, m) REP_1(k, l)\r\n#define REP_4(i, j, k, ii, n, m, l, nn) REP(i, n) REP(j, m) REP(k, l) REP(ii, nn)\r\n#define REP_4_1(i, j, k, ii, n, m, l, nn) REP_1(i, n) REP_1(j, m) REP_1(k, l) REP_1(ii, nn)\r\n\r\n#define ALL(A) A.begin(), A.end()\r\n#define LLA(A) A.rbegin(), A.rend()\r\n#define CPY(A, B) memcpy(A, B, sizeof(A))\r\n#define INS(A, P, B) A.insert(A.begin() + P, B)\r\n#define ERS(A, P) A.erase(A.begin() + P)\r\n#define LBD(A, x) (lower_bound(ALL(A), x) - A.begin())\r\n#define UBD(A, x) (upper_bound(ALL(A), x) - A.begin())\r\n#define CTN(T, x) (T.find(x) != T.end())\r\n#define SZ(A) int((A).size())\r\n#define PB push_back\r\n#define MP(A, B) make_pair(A, B)\r\n#define PTT pair<T, T>\r\n#define Ts *this\r\n#define rTs return Ts\r\n#define fi first\r\n#define se second\r\n#define re real()\r\n#define im imag()\r\n\r\n#define Rush for(int ____T=RD(); ____T--;)\r\n#define Display(A, n, m) { \\\r\n REP(i, n){\t\t \\\r\n REP(j, m-1) cout << A[i][j] << " "; \\\r\n cout << A[i][m-1] << endl;\t\t \\\r\n\t}\t\t\t\t\t\t \\\r\n}\r\n#define Display_1(A, n, m) { \\\r\n\tREP_1(i, n){\t\t \\\r\n REP_1(j, m-1) cout << A[i][j] << " "; \\\r\n cout << A[i][m] << endl;\t\t \\\r\n\t}\t\t\t\t\t\t \\\r\n}\r\n\r\ntypedef long long LL;\r\n\/\/typedef long double DB;\r\ntypedef double DB;\r\ntypedef unsigned uint;\r\ntypedef unsigned long long uLL;\r\n\r\ntypedef vector<int> VI;\r\ntypedef vector<char> VC;\r\ntypedef vector<string> VS;\r\ntypedef vector<LL> VL;\r\ntypedef vector<DB> VF;\r\ntypedef set<int> SI;\r\ntypedef set<string> SS;\r\ntypedef map<int, int> MII;\r\ntypedef map<string, int> MSI;\r\ntypedef pair<int, int> PII;\r\ntypedef pair<LL, LL> PLL;\r\ntypedef vector<PII> VII;\r\ntypedef vector<VI> VVI;\r\ntypedef vector<VII> VVII;\r\n\r\ntemplate<class T> inline T& RD(T &);\r\ntemplate<class T> inline void OT(const T &);\r\n\/\/inline int RD(){int x; return RD(x);}\r\ninline LL RD(){LL x; return RD(x);}\r\ninline DB& RF(DB &);\r\ninline DB RF(){DB x; return RF(x);}\r\ninline char* RS(char *s);\r\ninline char& RC(char &c);\r\ninline char RC();\r\ninline char& RC(char &c){scanf(" %c", &c); return c;}\r\ninline char RC(){char c; return RC(c);}\r\n\/\/inline char& RC(char &c){c = getchar(); return c;}\r\n\/\/inline char RC(){return getchar();}\r\n\r\ntemplate<class T> inline T& RDD(T &);\r\ninline LL RDD(){LL x; return RDD(x);}\r\n\r\ntemplate<class T0, class T1> inline T0& RD(T0 &x0, T1 &x1){RD(x0), RD(x1); return x0;}\r\ntemplate<class T0, class T1, class T2> inline T0& RD(T0 &x0, T1 &x1, T2 &x2){RD(x0), RD(x1), RD(x2); return x0;}\r\ntemplate<class T0, class T1, class T2, class T3> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3){RD(x0), RD(x1), RD(x2), RD(x3); return x0;}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4); return x0;}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5); return x0;}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5, T6 &x6){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5), RD(x6); return x0;}\r\ntemplate<class T0, class T1> inline void OT(const T0 &x0, const T1 &x1){OT(x0), OT(x1);}\r\ntemplate<class T0, class T1, class T2> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2){OT(x0), OT(x1), OT(x2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3){OT(x0), OT(x1), OT(x2), OT(x3);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4, const T5 &x5){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4, const T5 &x5, const T6 &x6){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5), OT(x6);}\r\ninline char& RC(char &a, char &b){RC(a), RC(b); return a;}\r\ninline char& RC(char &a, char &b, char &c){RC(a), RC(b), RC(c); return a;}\r\ninline char& RC(char &a, char &b, char &c, char &d){RC(a), RC(b), RC(c), RC(d); return a;}\r\ninline char& RC(char &a, char &b, char &c, char &d, char &e){RC(a), RC(b), RC(c), RC(d), RC(e); return a;}\r\ninline char& RC(char &a, char &b, char &c, char &d, char &e, char &f){RC(a), RC(b), RC(c), RC(d), RC(e), RC(f); return a;}\r\ninline char& RC(char &a, char &b, char &c, char &d, char &e, char &f, char &g){RC(a), RC(b), RC(c), RC(d), RC(e), RC(f), RC(g); return a;}\r\ninline DB& RF(DB &a, DB &b){RF(a), RF(b); return a;}\r\ninline DB& RF(DB &a, DB &b, DB &c){RF(a), RF(b), RF(c); return a;}\r\ninline DB& RF(DB &a, DB &b, DB &c, DB &d){RF(a), RF(b), RF(c), RF(d); return a;}\r\ninline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e){RF(a), RF(b), RF(c), RF(d), RF(e); return a;}\r\ninline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e, DB &f){RF(a), RF(b), RF(c), RF(d), RF(e), RF(f); return a;}\r\ninline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e, DB &f, DB &g){RF(a), RF(b), RF(c), RF(d), RF(e), RF(f), RF(g); return a;}\r\ninline void RS(char *s1, char *s2){RS(s1), RS(s2);}\r\ninline void RS(char *s1, char *s2, char *s3){RS(s1), RS(s2), RS(s3);}\r\ntemplate<class T0,class T1>inline void RDD(T0&a, T1&b){RDD(a),RDD(b);}\r\ntemplate<class T0,class T1,class T2>inline void RDD(T0&a, T1&b, T2&c){RDD(a),RDD(b),RDD(c);}\r\n\r\ntemplate<class T> inline void RST(T &A){memset(A, 0, sizeof(A));}\r\ntemplate<class T> inline void FLC(T &A, int x){memset(A, x, sizeof(A));}\r\ntemplate<class T> inline void CLR(T &A){A.clear();}\r\n\r\ntemplate<class T0, class T1> inline void RST(T0 &A0, T1 &A1){RST(A0), RST(A1);}\r\ntemplate<class T0, class T1, class T2> inline void RST(T0 &A0, T1 &A1, T2 &A2){RST(A0), RST(A1), RST(A2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3){RST(A0), RST(A1), RST(A2), RST(A3);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4), RST(A5);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4), RST(A5), RST(A6);}\r\ntemplate<class T0, class T1> inline void FLC(T0 &A0, T1 &A1, int x){FLC(A0, x), FLC(A1, x);}\r\ntemplate<class T0, class T1, class T2> inline void FLC(T0 &A0, T1 &A1, T2 &A2, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x), FLC(A4, x);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x), FLC(A4, x), FLC(A5, x);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x), FLC(A4, x), FLC(A5, x), FLC(A6, x);}\r\ntemplate<class T> inline void CLR(priority_queue<T, vector<T>, less<T> > &Q){while (!Q.empty()) Q.pop();}\r\ntemplate<class T> inline void CLR(priority_queue<T, vector<T>, greater<T> > &Q){while (!Q.empty()) Q.pop();}\r\ntemplate<class T> inline void CLR(stack<T> &S){while (!S.empty()) S.pop();}\r\ntemplate<class T> inline void CLR(queue<T> &Q){while (!Q.empty()) Q.pop();}\r\n\r\ntemplate<class T0, class T1> inline void CLR(T0 &A0, T1 &A1){CLR(A0), CLR(A1);}\r\ntemplate<class T0, class T1, class T2> inline void CLR(T0 &A0, T1 &A1, T2 &A2){CLR(A0), CLR(A1), CLR(A2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3){CLR(A0), CLR(A1), CLR(A2), CLR(A3);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4), CLR(A5);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4), CLR(A5), CLR(A6);}\r\ntemplate<class T> inline void CLR(T &A, int n){REP(i, n) CLR(A[i]);}\r\n\r\ntemplate<class T> inline bool EPT(T &a){return a.empty();}\r\ntemplate<class T> inline T& SRT(T &A){sort(ALL(A)); return A;}\r\ntemplate<class T, class C> inline T& SRT(T &A, C B){sort(ALL(A), B); return A;}\r\ntemplate<class T> inline T& RVS(T &A){reverse(ALL(A)); return A;}\r\ntemplate<class T> inline T& UNQQ(T &A){A.resize(unique(ALL(A))-A.begin());return A;}\r\ntemplate<class T> inline T& UNQ(T &A){SRT(A);return UNQQ(A);}\r\n\r\n\r\n\/\/}\r\n\r\n\/** Constant List .. **\/ \/\/{\r\n\r\nconst int MOD = int(1e9) + 7;\r\nconst int INF = 0x3f3f3f3f;\r\nconst LL INFF = 0x3f3f3f3f3f3f3f3fLL;\r\nconst DB EPS = 1e-9;\r\nconst DB OO = 1e20;\r\nconst DB PI = acos(-1.0); \/\/M_PI;\r\n\r\nconst int dx[] = {-1, 0, 1, 0};\r\nconst int dy[] = {0, 1, 0, -1};\r\n\r\n\/\/}\r\n\r\n\/** Add On .. **\/ \/\/{\r\n\/\/ <<= '0. Nichi Joo ., \/\/{\r\n\r\ntemplate<class T> inline T& checkMin(T &a,const T b){if (b<a) a=b;return a;}\r\ntemplate<class T> inline T& checkMax(T &a,const T b){if (a<b) a=b;return a;}\r\ntemplate<class T> inline T& checkMin(T &a, T &b, const T x){checkMin(a, x), checkMin(b, x);return a;}\r\ntemplate<class T> inline T& checkMax(T &a, T &b, const T x){checkMax(a, x), checkMax(b, x);return a;}\r\ntemplate <class T, class C> inline T& checkMin(T& a, const T b, C c){if (c(b,a)) a = b;return a;}\r\ntemplate <class T, class C> inline T& checkMax(T& a, const T b, C c){if (c(a,b)) a = b;return a;}\r\ntemplate<class T> inline T min(T a, T b, T c){return min(min(a, b), c);}\r\ntemplate<class T> inline T max(T a, T b, T c){return max(max(a, b), c);}\r\ntemplate<class T> inline T min(T a, T b, T c, T d){return min(min(a, b), min(c, d));}\r\ntemplate<class T> inline T max(T a, T b, T c, T d){return max(max(a, b), max(c, d));}\r\ntemplate<class T> inline T min(T a, T b, T c, T d, T e){return min(min(min(a,b),min(c,d)),e);}\r\ntemplate<class T> inline T max(T a, T b, T c, T d, T e){return max(max(max(a,b),max(c,d)),e);}\r\ntemplate<class T> inline T sqr(T a){return a*a;}\r\ntemplate<class T> inline T cub(T a){return a*a*a;}\r\ntemplate<class T> inline T ceil(T x, T y){return (x - 1) \/ y + 1;}\r\ntemplate<class T> T abs(T x){return x>0?x:-x;}\r\ninline int sgn(DB x){return x < -EPS ? -1 : x > EPS;}\r\ninline int sgn(DB x, DB y){return sgn(x - y);}\r\n\r\ninline DB cos(DB a, DB b, DB c){return (sqr(a)+sqr(b)-sqr(c))\/(2*a*b);}\r\ninline DB cot(DB x){return 1.\/tan(x);};\r\ninline DB sec(DB x){return 1.\/cos(x);};\r\ninline DB csc(DB x){return 1.\/sin(x);};\r\n\r\n\/\/}\r\n\/\/ <<= '1. Bitwise Operation ., \/\/{\r\nnamespace BO{\r\n\r\ninline bool _1(int x, int i){return bool(x&1<<i);}\r\ninline bool _1(LL x, int i){return bool(x&1LL<<i);}\r\ninline LL _1(int i){return 1LL<<i;}\r\ninline LL _U(int i){return _1(i) - 1;};\r\n\r\ninline int reverse_bits(int x){\r\n x = ((x >> 1) & 0x55555555) | ((x << 1) & 0xaaaaaaaa);\r\n x = ((x >> 2) & 0x33333333) | ((x << 2) & 0xcccccccc);\r\n x = ((x >> 4) & 0x0f0f0f0f) | ((x << 4) & 0xf0f0f0f0);\r\n x = ((x >> 8) & 0x00ff00ff) | ((x << 8) & 0xff00ff00);\r\n x = ((x >>16) & 0x0000ffff) | ((x <<16) & 0xffff0000);\r\n return x;\r\n}\r\n\r\ninline LL reverse_bits(LL x){\r\n x = ((x >> 1) & 0x5555555555555555LL) | ((x << 1) & 0xaaaaaaaaaaaaaaaaLL);\r\n x = ((x >> 2) & 0x3333333333333333LL) | ((x << 2) & 0xccccccccccccccccLL);\r\n x = ((x >> 4) & 0x0f0f0f0f0f0f0f0fLL) | ((x << 4) & 0xf0f0f0f0f0f0f0f0LL);\r\n x = ((x >> 8) & 0x00ff00ff00ff00ffLL) | ((x << 8) & 0xff00ff00ff00ff00LL);\r\n x = ((x >>16) & 0x0000ffff0000ffffLL) | ((x <<16) & 0xffff0000ffff0000LL);\r\n x = ((x >>32) & 0x00000000ffffffffLL) | ((x <<32) & 0xffffffff00000000LL);\r\n return x;\r\n}\r\n\r\ntemplate<class T> inline bool odd(T x){return x&1;}\r\ntemplate<class T> inline bool even(T x){return !odd(x);}\r\ntemplate<class T> inline T low_bit(T x) {return x & -x;}\r\ntemplate<class T> inline T high_bit(T x) {T p = low_bit(x);while (p != x) x -= p, p = low_bit(x);return p;}\r\ntemplate<class T> inline T cover_bit(T x){T p = 1; while (p < x) p <<= 1;return p;}\r\ntemplate<class T> inline int cover_idx(T x){int p = 0; while (_1(p) < x ) ++p; return p;}\r\n\r\ninline int clz(int x){return __builtin_clz(x);}\r\ninline int clz(LL x){return __builtin_clzll(x);}\r\ninline int ctz(int x){return __builtin_ctz(x);}\r\ninline int ctz(LL x){return __builtin_ctzll(x);}\r\ninline int lg2(int x){return !x ? -1 : 31 - clz(x);}\r\ninline int lg2(LL x){return !x ? -1 : 63 - clz(x);}\r\ninline int low_idx(int x){return !x ? -1 : ctz(x);}\r\ninline int low_idx(LL x){return !x ? -1 : ctz(x);}\r\ninline int high_idx(int x){return lg2(x);}\r\ninline int high_idx(LL x){return lg2(x);}\r\ninline int parity(int x){return __builtin_parity(x);}\r\ninline int parity(LL x){return __builtin_parityll(x);}\r\ninline int count_bits(int x){return __builtin_popcount(x);}\r\ninline int count_bits(LL x){return __builtin_popcountll(x);}\r\n\r\n} using namespace BO;\/\/}\r\n\r\n\r\n\/\/ <<= '2. Number Theory .,\/\/{\r\nnamespace NT{\r\n#define gcd __gcd\r\ninline LL lcm(LL a, LL b){return a*b\/gcd(a,b);}\r\n\r\ninline void INC(int &a, int b){a += b; if (a >= MOD) a -= MOD;}\r\ninline int sum(int a, int b){a += b; if (a >= MOD) a -= MOD; return a;}\r\n\/* \u0123\ufffd\ufffd\ufffd\ufffd\ufffd\ufffd\ufffd\u057a\u00f3\ufffd int \u02b1\ufffd\ufffd\r\ninline int sum(uint a, int b){a += b; a %= MOD;if (a < 0) a += MOD; return a;}\r\ninline void INC(int &a, int b){a = sum(a, b);}\r\n*\/\r\n\r\ninline void DEC(int &a, int b){a -= b; if (a < 0) a += MOD;}\r\ninline int dff(int a, int b){a -= b; if (a < 0) a += MOD; return a;}\r\ninline void MUL(int &a, int b){a = (LL)a * b % MOD;}\r\ninline int pdt(int a, int b){return (LL)a * b % MOD;}\r\n\r\ninline int gcd(int m, int n, int &x, int &y){\r\n\r\n x = 1, y = 0; int xx = 0, yy = 1, q;\r\n\r\n while (1){\r\n q = m \/ n, m %= n;\r\n if (!m){x = xx, y = yy; return n;}\r\n DEC(x, pdt(q, xx)), DEC(y, pdt(q, yy));\r\n q = n \/ m, n %= m;\r\n if (!n) return m;\r\n DEC(xx, pdt(q, x)), DEC(yy, pdt(q, y));\r\n }\r\n}\r\n\r\ninline int sum(int a, int b, int c){return sum(a, sum(b, c));}\r\ninline int sum(int a, int b, int c, int d){return sum(sum(a, b), sum(c, d));}\r\ninline int pdt(int a, int b, int c){return pdt(a, pdt(b, c));}\r\ninline int pdt(int a, int b, int c, int d){return pdt(pdt(a, b), pdt(c, d));}\r\n\r\ninline int pow(int a, LL b){\r\n int c(1); while (b){\r\n if (b&1) MUL(c, a);\r\n MUL(a, a), b >>= 1;\r\n }\r\n return c;\r\n}\r\n\r\ntemplate<class T> inline T pow(T a, LL b){\r\n T c(1); while (b){\r\n if (b&1) c *= a;\r\n a *= a, b >>= 1;\r\n }\r\n return c;\r\n}\r\n\r\ntemplate<class T> inline T pow(T a, int b){\r\n return pow(a, (LL)b);\r\n}\r\n\r\ninline int _I(int b){\r\n int a = MOD, x1 = 0, x2 = 1, q; while (1){\r\n q = a \/ b, a %= b;\r\n if (!a) return x2;\r\n DEC(x1, pdt(q, x2));\r\n\r\n q = b \/ a, b %= a;\r\n if (!b) return x1;\r\n DEC(x2, pdt(q, x1));\r\n }\r\n}\r\n\r\ninline void DIV(int &a, int b){MUL(a, _I(b));}\r\ninline int qtt(int a, int b){return pdt(a, _I(b));}\r\n\r\n} using namespace NT;\/\/}\r\n\r\n\r\n\/\/}\r\n\r\n\r\n\/** I\/O Accelerator Interface .. **\/ \/\/{\r\n#define g (c=getchar())\r\n#define d isdigit(g)\r\n#define p x=x*10+c-'0'\r\n#define n x=x*10+'0'-c\r\n#define pp l\/=10,p\r\n#define nn l\/=10,n\r\ntemplate<class T> inline T& RD(T &x){\r\n char c;while(!d);x=c-'0';while(d)p;\r\n return x;\r\n}\r\ntemplate<class T> inline T& RDD(T &x){\r\n char c;while(g,c!='-'&&!isdigit(c));\r\n if (c=='-'){x='0'-g;while(d)n;}\r\n else{x=c-'0';while(d)p;}\r\n return x;\r\n}\r\ninline DB& RF(DB &x){\r\n \/\/scanf("%lf", &x);\r\n char c;while(g,c!='-'&&c!='.'&&!isdigit(c));\r\n if(c=='-')if(g=='.'){x=0;DB l=1;while(d)nn;x*=l;}\r\n else{x='0'-c;while(d)n;if(c=='.'){DB l=1;while(d)nn;x*=l;}}\r\n else if(c=='.'){x=0;DB l=1;while(d)pp;x*=l;}\r\n else{x=c-'0';while(d)p;if(c=='.'){DB l=1;while(d)pp;x*=l;}}\r\n return x;\r\n}\r\n#undef nn\r\n#undef pp\r\n#undef n\r\n#undef p\r\n#undef d\r\n#undef g\r\ninline char* RS(char *s){\r\n \/\/gets(s);\r\n scanf("%s", s);\r\n return s;\r\n}\r\n\r\nLL last_ans; int Case; template<class T> inline void OT(const T &x){\r\n \/\/printf("Case #%d: ", ++Case);\r\n \/\/printf("%lld\\n", x);\r\n \/\/printf("%.9f\\n", x);\r\n \/\/printf("%d\\n", x);\r\n cout << x << endl;\r\n \/\/last_ans = x;\r\n}\r\n\/\/}\r\n\r\n\r\n\/\/}\/* .................................................................................................................................. *\/\r\n\r\nconst int N = int(1e5) + 9, LV = 25;\r\n\r\nnamespace SBT{\r\n const int NN = N*LV;\r\n int c[2][NN], sz[NN], ky[NN], tot;\r\n#define lx l[x]\r\n#define rx r[x]\r\n#define l c[d]\r\n#define r c[!d]\r\n#define kx ky[x]\r\n#define sx sz[x]\r\n#define d 0\r\n int new_node(int v = 0){\r\n int x=++tot;lx=rx=0;\r\n sx=1;kx=v;\r\n return x;\r\n }\r\n\r\n void upd(int x){\r\n sx=sz[lx]+1+sz[rx];\r\n }\r\n#undef d\r\n void rot(int &x,int d){\r\n int y=rx;rx=l[y];l[y]=x;\r\n upd(x),upd(y),x=y;\r\n }\r\n\r\n void fix(int &x,int d){\r\n if (sz[l[lx]] > sz[rx]) rot(x,!d);\r\n else{\r\n if (sz[r[lx]] > sz[rx]) rot(lx,d),rot(x,!d);\r\n else return;\r\n }\r\n d=0,fix(lx,0),fix(rx,1);\r\n fix(x,0),fix(x,1);\r\n }\r\n#define d 0\r\n void Ins(int &x,int v){\r\n if(!x) x = new_node(v);\r\n else{\r\n ++sz[x]; Ins(c[v>kx][x],v);\r\n fix(x,v>=kx);\r\n }\r\n }\r\n\r\n int d_key; void Del(int &x,int v){\r\n --sx;if(kx==v||(v<kx&&!lx)||(v>kx&&!rx)){\r\n if(!lx||!rx) d_key = kx, x = lx | rx;\r\n else Del(lx,v+1), kx = d_key;\r\n }\r\n else Del(c[v>kx][x],v);\r\n }\r\n\r\n int Rank(int x,int v){\r\n int z=0;while(x){\r\n if(kx<v){\r\n z+=sz[lx]+1;\r\n x=rx;\r\n }\r\n else{\r\n x=lx;\r\n }\r\n }\r\n return z;\r\n }\r\n\r\n bool Find(int x,int v){\r\n if (!x) return 0;if (kx==v) return 1;\r\n return Find(c[v>kx][x],v);\r\n }\r\n\r\n void Init(){\r\n tot = 0;\r\n }\r\n\r\n#undef d\r\n#undef l\r\n#undef r\r\n#undef lx\r\n#undef rx\r\n#undef sx\r\n#undef kx\r\n};\r\n\r\nLL res;\r\nint n, m;\r\n\r\nnamespace BIT{\r\n int C[N];\r\n void Ins(int x, int v){\r\n for (;x<=n;x+=low_bit(x)) SBT::Ins(C[x],v);\r\n }\r\n void Del(int x, int v){\r\n for (;x<=n;x+=low_bit(x)) SBT::Del(C[x],v);\r\n }\r\n int Rank(int x, int v){\r\n int res = 0; for (;x;x^=low_bit(x)) res += SBT::Rank(C[x],v);\r\n return res;\r\n }\r\n int Count(int x){\r\n int res = 0; for (;x;x^=low_bit(x)) res += SBT::sz[C[x]];\r\n return res;\r\n }\r\n void Init(){\r\n fill(C+1, C+n+1, 0);\r\n }\r\n};\r\n\r\nint A[N], pA[N], B[N], pB[N];\r\nint P[N];\r\n\r\nvoid Init(){\r\n SBT::Init(); BIT::Init(); res = 0; int x;\r\n\tREP_1(i, n) pA[++RD(A[i])] = i;\r\n\r\n\tREP_1(i, n){\r\n pB[++RD(B[i])] = i; int x = pA[B[i]];\r\n\t res += i-1-BIT::Rank(n,x+1); \/\/#\r\n BIT::Ins(i, x), P[i] = x;\r\n\t}\r\n}\r\n\r\n#define v P[x]\r\n#define delta ((x-1)-BIT::Rank(x,v+1)+BIT::Rank(n,v)-BIT::Rank(x,v))\r\nvoid Change(int x, int vv){\r\n BIT::Del(x, v);\r\n res -= delta; v = vv;\r\n res += delta; BIT::Ins(x, v);\r\n}\r\n#undef v\r\n\r\nint main(){\r\n\r\n#ifndef ONLINE_JUDGE\r\n freopen("in.txt", "r", stdin);\r\n \/\/freopen("out.txt", "w", stdout);\r\n#endif\r\n\r\n\/\/#define a A[x]\r\n\/\/#define delta ((x-1)-BIT::Rank(x,a+1)+BIT::Rank(n,a)-BIT::Rank(x,a))\r\n\r\n\r\n\/\/\u6c47\u7f16\u8c03\u6808\r\nint __size__ = 256 << 20; \/\/ 256MB\r\nchar *__p__ = (char*)malloc(__size__) + __size__;\r\n__asm__("movl %0, %%esp\\n" :: "r"(__p__));\r\n\r\n while (~scanf("%d", &n)){\r\n\r\n Init();\r\n\r\n char cmd[9]; Rush{\r\n RS(cmd); if (cmd[0] == 'Q') OT(res);\r\n else{\r\n int p, a, b; RD(p, a, b); ++a, ++b;\r\n if (p == 1){\r\n swap(B[a], B[b]);\r\n pB[B[a]]=a,pB[B[b]]=b,\r\n Change(a, pA[B[a]]);\r\n Change(b, pA[B[b]]);\r\n }\r\n else{\r\n swap(A[a],A[b]);\r\n pA[A[a]]=a,pA[A[b]]=b,\r\n Change(pB[A[a]], a);\r\n Change(pB[A[b]], b);\r\n }\r\n\r\n \/*REP_1(i, n){\r\n assert(P[i] == pA[B[i]]);\r\n }*\/\r\n }\r\n }\r\n\r\n }\r\n\r\n \/\/\/\/int x, aa; RD(x, aa); BIT::Del(x, a);\r\n}\r\n\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","enabled":false}}},"categories":[1],"tags":[],"class_list":["post-952","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p2tdP7-fm","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/952","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/comments?post=952"}],"version-history":[{"count":1,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/952\/revisions"}],"predecessor-version":[{"id":954,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/952\/revisions\/954"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/media?parent=952"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/categories?post=952"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/tags?post=952"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
![](\"https:\/\/i.minus.com\/iiz0ufNWly1II.jpg\")