Last active
December 25, 2015 01:09
-
-
Save lychees/6892516 to your computer and use it in GitHub Desktop.
http://www.lydsy.com/JudgeOnline/problem.php?id=1014
1014: [JSOI2008]火星人prefix http://www.shuizilong.com/house/archives/spoj-6292-shmoogle-wave/
6292. Shmoogle Wave
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /** Micro Mezz Macro Flation -- Overheated Economy ., Last Update: Sep. 22th 2013 **/ //{ | |
| /** Header .. **/ //{ | |
| #pragma comment(linker, "/STACK:36777216") | |
| //#pragma GCC optimize ("O2") | |
| #define LOCAL | |
| //#include "testlib.h" | |
| #include <functional> | |
| #include <algorithm> | |
| #include <iostream> | |
| #include <fstream> | |
| #include <sstream> | |
| #include <iomanip> | |
| #include <numeric> | |
| #include <cstring> | |
| #include <climits> | |
| #include <cassert> | |
| #include <complex> | |
| #include <cstdio> | |
| #include <string> | |
| #include <vector> | |
| #include <bitset> | |
| #include <queue> | |
| #include <stack> | |
| #include <cmath> | |
| #include <ctime> | |
| #include <list> | |
| #include <set> | |
| #include <map> | |
| //#include <tr1/unordered_set> | |
| //#include <tr1/unordered_map> | |
| //#include <array> | |
| using namespace std; | |
| #define REP(i, n) for (int i=0;i<int(n);++i) | |
| #define FOR(i, a, b) for (int i=int(a);i<int(b);++i) | |
| #define DWN(i, b, a) for (int i=int(b-1);i>=int(a);--i) | |
| #define REP_1(i, n) for (int i=1;i<=int(n);++i) | |
| #define FOR_1(i, a, b) for (int i=int(a);i<=int(b);++i) | |
| #define DWN_1(i, b, a) for (int i=int(b);i>=int(a);--i) | |
| #define REP_C(i, n) for (int n____=int(n),i=0;i<n____;++i) | |
| #define FOR_C(i, a, b) for (int b____=int(b),i=a;i<b____;++i) | |
| #define DWN_C(i, b, a) for (int a____=int(a),i=b-1;i>=a____;--i) | |
| #define REP_N(i, n) for (i=0;i<int(n);++i) | |
| #define FOR_N(i, a, b) for (i=int(a);i<int(b);++i) | |
| #define DWN_N(i, b, a) for (i=int(b-1);i>=int(a);--i) | |
| #define REP_1_C(i, n) for (int n____=int(n),i=1;i<=n____;++i) | |
| #define FOR_1_C(i, a, b) for (int b____=int(b),i=a;i<=b____;++i) | |
| #define DWN_1_C(i, b, a) for (int a____=int(a),i=b;i>=a____;--i) | |
| #define REP_1_N(i, n) for (i=1;i<=int(n);++i) | |
| #define FOR_1_N(i, a, b) for (i=int(a);i<=int(b);++i) | |
| #define DWN_1_N(i, b, a) for (i=int(b);i>=int(a);--i) | |
| #define REP_C_N(i, n) for (int n____=(i=0,int(n));i<n____;++i) | |
| #define FOR_C_N(i, a, b) for (int b____=(i=0,int(b);i<b____;++i) | |
| #define DWN_C_N(i, b, a) for (int a____=(i=b-1,int(a));i>=a____;--i) | |
| #define REP_1_C_N(i, n) for (int n____=(i=1,int(n));i<=n____;++i) | |
| #define FOR_1_C_N(i, a, b) for (int b____=(i=1,int(b);i<=b____;++i) | |
| #define DWN_1_C_N(i, b, a) for (int a____=(i=b,int(a));i>=a____;--i) | |
| #define ECH(it, A) for (__typeof(A.begin()) it=A.begin(); it != A.end(); ++it) | |
| #define REP_S(i, str) for (char*i=str;*i;++i) | |
| #define REP_L(i, hd, nxt) for (int i=hd;i;i=nxt[i]) | |
| #define REP_G(i, u) REP_L(i,hd[u],suc) | |
| #define REP_SS(x, s) for (int x=s;x;x=(x-1)&s) | |
| #define DO(n) for ( int ____n = n; ____n-->0; ) | |
| #define REP_2(i, j, n, m) REP(i, n) REP(j, m) | |
| #define REP_2_1(i, j, n, m) REP_1(i, n) REP_1(j, m) | |
| #define REP_3(i, j, k, n, m, l) REP(i, n) REP(j, m) REP(k, l) | |
| #define REP_3_1(i, j, k, n, m, l) REP_1(i, n) REP_1(j, m) REP_1(k, l) | |
| #define REP_4(i, j, k, ii, n, m, l, nn) REP(i, n) REP(j, m) REP(k, l) REP(ii, nn) | |
| #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) | |
| #define ALL(A) A.begin(), A.end() | |
| #define LLA(A) A.rbegin(), A.rend() | |
| #define CPY(A, B) memcpy(A, B, sizeof(A)) | |
| #define INS(A, P, B) A.insert(A.begin() + P, B) | |
| #define ERS(A, P) A.erase(A.begin() + P) | |
| #define BSC(A, x) (lower_bound(ALL(A), x) - A.begin()) | |
| #define CTN(T, x) (T.find(x) != T.end()) | |
| #define SZ(A) int((A).size()) | |
| #define PB push_back | |
| #define MP(A, B) make_pair(A, B) | |
| #define PTT pair<T, T> | |
| #define Ts *this | |
| #define rTs return Ts | |
| #define fi first | |
| #define se second | |
| #define re real() | |
| #define im imag() | |
| #define Rush for(int ____T=RD(); ____T--;) | |
| #define Display(A, n, m) { \ | |
| REP(i, n){ \ | |
| REP(j, m-1) cout << A[i][j] << " "; \ | |
| cout << A[i][m-1] << endl; \ | |
| } \ | |
| } | |
| #define Display_1(A, n, m) { \ | |
| REP_1(i, n){ \ | |
| REP_1(j, m-1) cout << A[i][j] << " "; \ | |
| cout << A[i][m] << endl; \ | |
| } \ | |
| } | |
| typedef long long LL; | |
| //typedef long double DB; | |
| typedef double DB; | |
| typedef unsigned uint; | |
| typedef unsigned long long uLL; | |
| typedef vector<int> VI; | |
| typedef vector<char> VC; | |
| typedef vector<string> VS; | |
| typedef vector<LL> VL; | |
| typedef vector<DB> VF; | |
| typedef set<int> SI; | |
| typedef set<string> SS; | |
| typedef map<int, int> MII; | |
| typedef map<string, int> MSI; | |
| typedef pair<int, int> PII; | |
| typedef pair<LL, LL> PLL; | |
| typedef vector<PII> VII; | |
| typedef vector<VI> VVI; | |
| typedef vector<VII> VVII; | |
| template<class T> inline T& RD(T &); | |
| template<class T> inline void OT(const T &); | |
| //inline int RD(){int x; return RD(x);} | |
| inline LL RD(){LL x; return RD(x);} | |
| inline DB& RF(DB &); | |
| inline DB RF(){DB x; return RF(x);} | |
| inline char* RS(char *s); | |
| inline char& RC(char &c); | |
| inline char RC(); | |
| inline char& RC(char &c){scanf(" %c", &c); return c;} | |
| inline char RC(){char c; return RC(c);} | |
| //inline char& RC(char &c){c = getchar(); return c;} | |
| //inline char RC(){return getchar();} | |
| template<class T> inline T& RDD(T &); | |
| inline LL RDD(){LL x; return RDD(x);} | |
| template<class T0, class T1> inline T0& RD(T0 &x0, T1 &x1){RD(x0), RD(x1); return x0;} | |
| template<class T0, class T1, class T2> inline T0& RD(T0 &x0, T1 &x1, T2 &x2){RD(x0), RD(x1), RD(x2); return x0;} | |
| template<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;} | |
| template<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;} | |
| template<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;} | |
| template<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;} | |
| template<class T0, class T1> inline void OT(const T0 &x0, const T1 &x1){OT(x0), OT(x1);} | |
| template<class T0, class T1, class T2> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2){OT(x0), OT(x1), OT(x2);} | |
| template<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);} | |
| template<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);} | |
| template<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);} | |
| template<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);} | |
| inline char& RC(char &a, char &b){RC(a), RC(b); return a;} | |
| inline char& RC(char &a, char &b, char &c){RC(a), RC(b), RC(c); return a;} | |
| inline char& RC(char &a, char &b, char &c, char &d){RC(a), RC(b), RC(c), RC(d); return a;} | |
| inline char& RC(char &a, char &b, char &c, char &d, char &e){RC(a), RC(b), RC(c), RC(d), RC(e); return a;} | |
| inline 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;} | |
| inline 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;} | |
| inline DB& RF(DB &a, DB &b){RF(a), RF(b); return a;} | |
| inline DB& RF(DB &a, DB &b, DB &c){RF(a), RF(b), RF(c); return a;} | |
| inline DB& RF(DB &a, DB &b, DB &c, DB &d){RF(a), RF(b), RF(c), RF(d); return a;} | |
| inline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e){RF(a), RF(b), RF(c), RF(d), RF(e); return a;} | |
| inline 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;} | |
| inline 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;} | |
| inline void RS(char *s1, char *s2){RS(s1), RS(s2);} | |
| inline void RS(char *s1, char *s2, char *s3){RS(s1), RS(s2), RS(s3);} | |
| template<class T0,class T1>inline void RDD(T0&a, T1&b){RDD(a),RDD(b);} | |
| template<class T0,class T1,class T2>inline void RDD(T0&a, T1&b, T2&c){RDD(a),RDD(b),RDD(c);} | |
| template<class T> inline void RST(T &A){memset(A, 0, sizeof(A));} | |
| template<class T> inline void FLC(T &A, int x){memset(A, x, sizeof(A));} | |
| template<class T> inline void CLR(T &A){A.clear();} | |
| template<class T0, class T1> inline void RST(T0 &A0, T1 &A1){RST(A0), RST(A1);} | |
| template<class T0, class T1, class T2> inline void RST(T0 &A0, T1 &A1, T2 &A2){RST(A0), RST(A1), RST(A2);} | |
| template<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);} | |
| template<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);} | |
| template<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);} | |
| template<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);} | |
| template<class T0, class T1> inline void FLC(T0 &A0, T1 &A1, int x){FLC(A0, x), FLC(A1, x);} | |
| template<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);} | |
| template<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);} | |
| template<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);} | |
| template<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);} | |
| template<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);} | |
| template<class T> inline void CLR(priority_queue<T, vector<T>, less<T> > &Q){while (!Q.empty()) Q.pop();} | |
| template<class T> inline void CLR(priority_queue<T, vector<T>, greater<T> > &Q){while (!Q.empty()) Q.pop();} | |
| template<class T> inline void CLR(stack<T> &S){while (!S.empty()) S.pop();} | |
| template<class T0, class T1> inline void CLR(T0 &A0, T1 &A1){CLR(A0), CLR(A1);} | |
| template<class T0, class T1, class T2> inline void CLR(T0 &A0, T1 &A1, T2 &A2){CLR(A0), CLR(A1), CLR(A2);} | |
| template<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);} | |
| template<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);} | |
| template<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);} | |
| template<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);} | |
| template<class T> inline void CLR(T &A, int n){REP(i, n) CLR(A[i]);} | |
| template<class T> inline bool EPT(T &a){return a.empty();} | |
| template<class T> inline T& SRT(T &A){sort(ALL(A)); return A;} | |
| template<class T, class C> inline T& SRT(T &A, C B){sort(ALL(A), B); return A;} | |
| template<class T> inline T& RVS(T &A){reverse(ALL(A)); return A;} | |
| template<class T> inline T& UNQQ(T &A){A.resize(unique(ALL(A))-A.begin());return A;} | |
| template<class T> inline T& UNQ(T &A){SRT(A);return UNQQ(A);} | |
| //} | |
| /** Constant List .. **/ //{ | |
| const int MOD = int(1e9) + 7; | |
| //int MOD = 99990001; | |
| const int INF = 0x3f3f3f3f; | |
| const LL INFF = 0x3f3f3f3f3f3f3f3fLL; | |
| const DB EPS = 1e-9; | |
| const DB OO = 1e20; | |
| const DB PI = acos(-1.0); //M_PI; | |
| const int dx[] = {-1, 0, 1, 0}; | |
| const int dy[] = {0, 1, 0, -1}; | |
| //} | |
| /** Add On .. **/ //{ | |
| // <<= '0. Nichi Joo ., //{ | |
| template<class T> inline T& checkMin(T &a,const T b){if (b<a) a=b;return a;} | |
| template<class T> inline T& checkMax(T &a,const T b){if (a<b) a=b;return a;} | |
| template<class T> inline T& checkMin(T &a, T &b, const T x){checkMin(a, x), checkMin(b, x);return a;} | |
| template<class T> inline T& checkMax(T &a, T &b, const T x){checkMax(a, x), checkMax(b, x);return a;} | |
| template <class T, class C> inline T& checkMin(T& a, const T b, C c){if (c(b,a)) a = b;return a;} | |
| template <class T, class C> inline T& checkMax(T& a, const T b, C c){if (c(a,b)) a = b;return a;} | |
| template<class T> inline T min(T a, T b, T c){return min(min(a, b), c);} | |
| template<class T> inline T max(T a, T b, T c){return max(max(a, b), c);} | |
| template<class T> inline T min(T a, T b, T c, T d){return min(min(a, b), min(c, d));} | |
| template<class T> inline T max(T a, T b, T c, T d){return max(max(a, b), max(c, d));} | |
| template<class T> inline T sqr(T a){return a*a;} | |
| template<class T> inline T cub(T a){return a*a*a;} | |
| template<class T> inline T ceil(T x, T y){return (x - 1) / y + 1;} | |
| template<class T> T abs(T x){return x>0?x:-x;} | |
| inline int sgn(DB x){return x < -EPS ? -1 : x > EPS;} | |
| inline int sgn(DB x, DB y){return sgn(x - y);} | |
| inline DB cos(DB a, DB b, DB c){return (sqr(a)+sqr(b)-sqr(c))/(2*a*b);} | |
| inline DB cot(DB x){return 1./tan(x);}; | |
| inline DB sec(DB x){return 1./cos(x);}; | |
| inline DB csc(DB x){return 1./sin(x);}; | |
| //} | |
| // <<= '1. Bitwise Operation ., //{ | |
| namespace BO{ | |
| inline bool _1(int x, int i){return bool(x&1<<i);} | |
| inline bool _1(LL x, int i){return bool(x&1LL<<i);} | |
| inline LL _1(int i){return 1LL<<i;} | |
| inline LL _U(int i){return _1(i) - 1;}; | |
| inline int reverse_bits(int x){ | |
| x = ((x >> 1) & 0x55555555) | ((x << 1) & 0xaaaaaaaa); | |
| x = ((x >> 2) & 0x33333333) | ((x << 2) & 0xcccccccc); | |
| x = ((x >> 4) & 0x0f0f0f0f) | ((x << 4) & 0xf0f0f0f0); | |
| x = ((x >> 8) & 0x00ff00ff) | ((x << 8) & 0xff00ff00); | |
| x = ((x >>16) & 0x0000ffff) | ((x <<16) & 0xffff0000); | |
| return x; | |
| } | |
| inline LL reverse_bits(LL x){ | |
| x = ((x >> 1) & 0x5555555555555555LL) | ((x << 1) & 0xaaaaaaaaaaaaaaaaLL); | |
| x = ((x >> 2) & 0x3333333333333333LL) | ((x << 2) & 0xccccccccccccccccLL); | |
| x = ((x >> 4) & 0x0f0f0f0f0f0f0f0fLL) | ((x << 4) & 0xf0f0f0f0f0f0f0f0LL); | |
| x = ((x >> 8) & 0x00ff00ff00ff00ffLL) | ((x << 8) & 0xff00ff00ff00ff00LL); | |
| x = ((x >>16) & 0x0000ffff0000ffffLL) | ((x <<16) & 0xffff0000ffff0000LL); | |
| x = ((x >>32) & 0x00000000ffffffffLL) | ((x <<32) & 0xffffffff00000000LL); | |
| return x; | |
| } | |
| template<class T> inline bool odd(T x){return x&1;} | |
| template<class T> inline bool even(T x){return !odd(x);} | |
| template<class T> inline T low_bit(T x) {return x & -x;} | |
| template<class T> inline T high_bit(T x) {T p = low_bit(x);while (p != x) x -= p, p = low_bit(x);return p;} | |
| template<class T> inline T cover_bit(T x){T p = 1; while (p < x) p <<= 1;return p;} | |
| template<class T> inline int cover_idx(T x){int p = 0; while (_1(p) < x ) ++p; return p;} | |
| inline int clz(int x){return __builtin_clz(x);} | |
| inline int clz(LL x){return __builtin_clzll(x);} | |
| inline int ctz(int x){return __builtin_ctz(x);} | |
| inline int ctz(LL x){return __builtin_ctzll(x);} | |
| inline int lg2(int x){return !x ? -1 : 31 - clz(x);} | |
| inline int lg2(LL x){return !x ? -1 : 63 - clz(x);} | |
| inline int low_idx(int x){return !x ? -1 : ctz(x);} | |
| inline int low_idx(LL x){return !x ? -1 : ctz(x);} | |
| inline int high_idx(int x){return lg2(x);} | |
| inline int high_idx(LL x){return lg2(x);} | |
| inline int parity(int x){return __builtin_parity(x);} | |
| inline int parity(LL x){return __builtin_parityll(x);} | |
| inline int count_bits(int x){return __builtin_popcount(x);} | |
| inline int count_bits(LL x){return __builtin_popcountll(x);} | |
| } using namespace BO;//} | |
| //} | |
| /** I/O Accelerator Interface .. **/ //{ | |
| #define g (c=getchar()) | |
| #define d isdigit(g) | |
| #define p x=x*10+c-'0' | |
| #define n x=x*10+'0'-c | |
| #define pp l/=10,p | |
| #define nn l/=10,n | |
| template<class T> inline T& RD(T &x){ | |
| char c;while(!d);x=c-'0';while(d)p; | |
| return x; | |
| } | |
| template<class T> inline T& RDD(T &x){ | |
| char c;while(g,c!='-'&&!isdigit(c)); | |
| if (c=='-'){x='0'-g;while(d)n;} | |
| else{x=c-'0';while(d)p;} | |
| return x; | |
| } | |
| inline DB& RF(DB &x){ | |
| //scanf("%lf", &x); | |
| char c;while(g,c!='-'&&c!='.'&&!isdigit(c)); | |
| if(c=='-')if(g=='.'){x=0;DB l=1;while(d)nn;x*=l;} | |
| else{x='0'-c;while(d)n;if(c=='.'){DB l=1;while(d)nn;x*=l;}} | |
| else if(c=='.'){x=0;DB l=1;while(d)pp;x*=l;} | |
| else{x=c-'0';while(d)p;if(c=='.'){DB l=1;while(d)pp;x*=l;}} | |
| return x; | |
| } | |
| #undef nn | |
| #undef pp | |
| #undef n | |
| #undef p | |
| #undef d | |
| #undef g | |
| inline char* RS(char *s){ | |
| //gets(s); | |
| scanf("%s", s); | |
| return s; | |
| } | |
| LL last_ans; int Case; template<class T> inline void OT(const T &x){ | |
| //printf("Case #%d: ", ++Case); | |
| //printf("%lld\n", x); | |
| //printf("%.4f\n", x); | |
| printf("%d\n", x); | |
| //cout << x << endl; | |
| //last_ans = x; | |
| } | |
| //} | |
| //}/* .................................................................................................................................. */ | |
| const int N = 100009, Z = 27; | |
| namespace Splay{ | |
| #define l c[0] | |
| #define r c[1] | |
| #define lx l[x] | |
| #define rx r[x] | |
| #define px p[x] | |
| #define ly l[y] | |
| #define ry r[y] | |
| #define py p[y] | |
| #define m (a + b >> 1) | |
| #define lc lx, a, m | |
| #define rc rx, m+1, b | |
| int c[2][N], p[N], sz[N]; char buf[N]; uint P[N], A[N], S[N]; | |
| int n, root, tot; | |
| inline int sgn(int x){return l[px] == x ? 0 : 1;} | |
| inline void setc(int y, int d, int x){c[d][y] = x, px = y;} | |
| inline void setl(int y, int x){c[0][y] = x, px = y;} | |
| inline void setr(int y, int x){c[1][y] = x, px = y;} | |
| inline int new_node(char ch){ | |
| ++tot, l[tot] = r[tot] = p[tot] = 0; | |
| sz[tot] = 1, S[tot] = A[tot] = ch - 'a' + 1; | |
| return tot; | |
| } | |
| inline void release(int x){ | |
| } | |
| inline void update(int x){ | |
| sz[x] = sz[lx] + 1 + sz[rx]; | |
| S[x] = (S[lx] * Z + A[x]) * P[sz[rx]] + S[rx]; | |
| } | |
| inline void _rot(int x, int d){ | |
| int y = px, z = py; setc(z, sgn(y), x); | |
| setc(y, d, c[d^1][x]); setc(x, d^1, y); | |
| update(y); | |
| } | |
| inline void rot(int x){_rot(x, sgn(x));} | |
| inline void zig(int x){_rot(x, 0);} | |
| inline void zag(int x){_rot(x, 1);} | |
| int splay(int x, int t = 0){ | |
| while (px != t){ | |
| int y = px, z = py; if (z == t){rot(x); break;} | |
| if (l[z] == y){ | |
| if (l[y] == x) zig(y), zig(x); | |
| else zag(x), zig(x); | |
| } | |
| else { | |
| if (r[y] == x) zag(y), zag(x); | |
| else zig(x), zag(x); | |
| } | |
| } | |
| update(x); if (!t) root = x; | |
| return x; | |
| } | |
| void Build(int &x = root, int a = 0, int b = n+2){ | |
| if (a >= b) return; | |
| x = new_node(buf[m]), Build(lc), Build(rc); | |
| sz[x] = b - a, p[lx] = p[rx] = x; update(x); | |
| } | |
| void Inorder(int x = root){ | |
| if (!x) return; | |
| Inorder(lx); | |
| putchar('a' + A[x] - 1); | |
| Inorder(rx); | |
| } | |
| int Select(int k){ | |
| int x = root; while (release(x), !(sz[lx] <= k && k < sz[lx] + 1)){ | |
| if (sz[lx] + 1 <= k) k -= sz[lx] + 1, x = rx; | |
| else x = lx; | |
| } | |
| k -= sz[lx], ++k; | |
| return x; | |
| } | |
| int Select(int a, int b){ // Type II. | |
| //cout << a-1 << " " << b+1 << " " << n << endl; | |
| int y = Select(a-1), x = Select(b+1); | |
| return l[splay(x, splay(y))]; | |
| } | |
| #undef l | |
| #undef r | |
| #undef lx | |
| #undef rx | |
| #undef px | |
| #undef ly | |
| #undef ry | |
| #undef py | |
| #undef m | |
| #undef lc | |
| #undef rc | |
| int Query(int x, int y){ | |
| int l = -1, r = n - max(x, y); while (l < r){ | |
| int m = l + r + 1 >> 1; | |
| if (S[Select(x, x+m)] == S[Select(y, y+m)]) l = m; | |
| else r = m - 1; | |
| } | |
| return l+1; | |
| } | |
| } using namespace Splay; | |
| int main(){ | |
| #ifndef ONLINE_JUDGE | |
| freopen("in.txt", "r", stdin); | |
| //freopen("out.txt", "w", stdout); | |
| #endif | |
| P[0] = 1; FOR(i, 1, N) P[i] = P[i-1] * Z; | |
| n = strlen(RS(buf+1)); Build(); Rush{ | |
| //Inorder(); cout << endl; | |
| char cmd; if (RC(cmd) == 'Q') OT(Query(RD(), RD())); | |
| else{ | |
| int x; char c; RD(x); RC(c); int y = Select(x+1); x = Select(x); splay(x, splay(y)); | |
| if (cmd == 'R') S[x] = A[x] = c - 'a' + 1, update(y); | |
| else ++n, setr(x, new_node(c)), update(x), update(y); | |
| } | |
| } | |
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /** Micro Mezzo Macro Flation -- Overheated Economy ., Last Update: Dec. 4th 2012 **/ //{ | |
| /** Header .. **/ //{ | |
| #define LOCAL | |
| #include <functional> | |
| #include <algorithm> | |
| #include <iostream> | |
| #include <fstream> | |
| #include <sstream> | |
| #include <iomanip> | |
| #include <numeric> | |
| #include <cstring> | |
| #include <cassert> | |
| #include <cstdio> | |
| #include <string> | |
| #include <vector> | |
| #include <bitset> | |
| #include <queue> | |
| #include <stack> | |
| #include <cmath> | |
| #include <ctime> | |
| #include <list> | |
| #include <set> | |
| #include <map> | |
| using namespace std; | |
| #define REP(i, n) for (int i=0;i<int(n);++i) | |
| #define FOR(i, a, b) for (int i=int(a);i<int(b);++i) | |
| #define DWN(i, b, a) for (int i=int(b-1);i>=int(a);--i) | |
| #define REP_1(i, n) for (int i=1;i<=int(n);++i) | |
| #define FOR_1(i, a, b) for (int i=int(a);i<=int(b);++i) | |
| #define DWN_1(i, b, a) for (int i=int(b);i>=int(a);--i) | |
| #define REP_C(i, n) for (int n____=int(n),i=0;i<n____;++i) | |
| #define FOR_C(i, a, b) for (int b____=int(b),i=a;i<b____;++i) | |
| #define DWN_C(i, b, a) for (int a____=int(a),i=b-1;i>=a____;--i) | |
| #define REP_N(i, n) for (i=0;i<int(n);++i) | |
| #define FOR_N(i, a, b) for (i=int(a);i<int(b);++i) | |
| #define DWN_N(i, b, a) for (i=int(b-1);i>=int(a);--i) | |
| #define REP_1_C(i, n) for (int n____=int(n),i=1;i<=n____;++i) | |
| #define FOR_1_C(i, a, b) for (int b____=int(b),i=a;i<=b____;++i) | |
| #define DWN_1_C(i, b, a) for (int a____=int(a),i=b;i>=a____;--i) | |
| #define REP_1_N(i, n) for (i=1;i<=int(n);++i) | |
| #define FOR_1_N(i, a, b) for (i=int(a);i<=int(b);++i) | |
| #define DWN_1_N(i, b, a) for (i=int(b);i>=int(a);--i) | |
| #define REP_C_N(i, n) for (int n____=(i=0,int(n));i<n____;++i) | |
| #define FOR_C_N(i, a, b) for (int b____=(i=0,int(b);i<b____;++i) | |
| #define DWN_C_N(i, b, a) for (int a____=(i=b-1,int(a));i>=a____;--i) | |
| #define REP_1_C_N(i, n) for (int n____=(i=1,int(n));i<=n____;++i) | |
| #define FOR_1_C_N(i, a, b) for (int b____=(i=1,int(b);i<=b____;++i) | |
| #define DWN_1_C_N(i, b, a) for (int a____=(i=b,int(a));i>=a____;--i) | |
| //#define ECH(it, A) for (typeof(A.begin()) it=A.begin(); it != A.end(); ++it) | |
| #define ECH(it, A) for (__typeof(A.begin()) it=A.begin(); it != A.end(); ++it) | |
| #define REP_S(it, str) for (char*it=str;*it;++it) | |
| #define REP_G(it, u) for (int it=hdl[u];it;it=suc[it]) | |
| #define DO(n) for ( int ____n ## __line__ = n; ____n ## __line__ -- ; ) | |
| #define REP_2(i, j, n, m) REP(i, n) REP(j, m) | |
| #define REP_2_1(i, j, n, m) REP_1(i, n) REP_1(j, m) | |
| #define REP_3(i, j, k, n, m, l) REP(i, n) REP(j, m) REP(k, l) | |
| #define REP_3_1(i, j, k, n, m, l) REP_1(i, n) REP_1(j, m) REP_1(k, l) | |
| #define ALL(A) A.begin(), A.end() | |
| #define LLA(A) A.rbegin(), A.rend() | |
| #define CPY(A, B) memcpy(A, B, sizeof(A)) | |
| #define INS(A, P, B) A.insert(A.begin() + P, B) | |
| #define ERS(A, P) A.erase(A.begin() + P) | |
| #define BSC(A, X) find(ALL(A), X) // != A.end() | |
| #define CTN(T, x) (T.find(x) != T.end()) | |
| #define SZ(A) int(A.size()) | |
| #define PB push_back | |
| #define MP(A, B) make_pair(A, B) | |
| #define PTT pair<T, T> | |
| #define fi first | |
| #define se second | |
| #define Rush for(int ____T=RD(); ____T--;) | |
| #define Display(A, n, m) { \ | |
| REP(i, n){ \ | |
| REP(j, m) cout << A[i][j] << " "; \ | |
| cout << endl; \ | |
| } \ | |
| } | |
| #define Display_1(A, n, m) { \ | |
| REP_1(i, n){ \ | |
| REP_1(j, m) cout << A[i][j] << " "; \ | |
| cout << endl; \ | |
| } \ | |
| } | |
| #pragma comment(linker, "/STACK:36777216") | |
| //#pragma GCC optimize ("O2") | |
| #define Ruby system("ruby main.rb") | |
| #define Haskell system("runghc main.hs") | |
| #define Python system("python main.py") | |
| #define Pascal system("fpc main.pas") | |
| typedef long long LL; | |
| //typedef long double DB; | |
| typedef double DB; | |
| typedef unsigned UINT; | |
| typedef unsigned long long ULL; | |
| typedef vector<int> VI; | |
| typedef vector<char> VC; | |
| typedef vector<string> VS; | |
| typedef vector<LL> VL; | |
| typedef vector<DB> VD; | |
| typedef set<int> SI; | |
| typedef set<string> SS; | |
| typedef map<int, int> MII; | |
| typedef map<string, int> MSI; | |
| typedef pair<int, int> PII; | |
| typedef pair<LL, LL> PLL; | |
| typedef vector<PII> VII; | |
| typedef vector<VI> VVI; | |
| typedef vector<VII> VVII; | |
| template<class T> inline T& RD(T &); | |
| template<class T> inline void OT(const T &); | |
| inline LL RD(){LL x; return RD(x);} | |
| inline DB& RF(DB &x){scanf("%lf", &x); return x;} | |
| inline DB RF(){DB x; return RF(x);} | |
| inline char* RS(char *s); | |
| inline char& RC(char &c); | |
| inline char RC(); | |
| inline char& RC(char &c){scanf(" %c", &c); return c;} | |
| inline char RC(){char c; return RC(c);} | |
| //inline char& RC(char &c){c = getchar(); return c;} | |
| //inline char RC(){return getchar();} | |
| template<class T0, class T1> inline T0& RD(T0 &x0, T1 &x1){RD(x0), RD(x1); return x0;} | |
| template<class T0, class T1, class T2> inline T0& RD(T0 &x0, T1 &x1, T2 &x2){RD(x0), RD(x1), RD(x2); return x0;} | |
| template<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;} | |
| template<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;} | |
| template<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;} | |
| template<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;} | |
| template<class T0, class T1> inline void OT(const T0 &x0, const T1 &x1){OT(x0), OT(x1);} | |
| template<class T0, class T1, class T2> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2){OT(x0), OT(x1), OT(x2);} | |
| template<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);} | |
| template<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);} | |
| template<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);} | |
| template<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);} | |
| inline char& RC(char &a, char &b){RC(a), RC(b); return a;} | |
| inline char& RC(char &a, char &b, char &c){RC(a), RC(b), RC(c); return a;} | |
| inline char& RC(char &a, char &b, char &c, char &d){RC(a), RC(b), RC(c), RC(d); return a;} | |
| inline char& RC(char &a, char &b, char &c, char &d, char &e){RC(a), RC(b), RC(c), RC(d), RC(e); return a;} | |
| inline 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;} | |
| inline 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;} | |
| inline DB& RF(DB &a, DB &b){RF(a), RF(b); return a;} | |
| inline DB& RF(DB &a, DB &b, DB &c){RF(a), RF(b), RF(c); return a;} | |
| inline DB& RF(DB &a, DB &b, DB &c, DB &d){RF(a), RF(b), RF(c), RF(d); return a;} | |
| inline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e){RF(a), RF(b), RF(c), RF(d), RF(e); return a;} | |
| inline 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;} | |
| inline 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;} | |
| inline void RS(char *s1, char *s2){RS(s1), RS(s2);} | |
| inline void RS(char *s1, char *s2, char *s3){RS(s1), RS(s2), RS(s3);} | |
| template<class T> inline void RST(T &A){memset(A, 0, sizeof(A));} | |
| template<class T0, class T1> inline void RST(T0 &A0, T1 &A1){RST(A0), RST(A1);} | |
| template<class T0, class T1, class T2> inline void RST(T0 &A0, T1 &A1, T2 &A2){RST(A0), RST(A1), RST(A2);} | |
| template<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);} | |
| template<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);} | |
| template<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);} | |
| template<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);} | |
| template<class T> inline void FLC(T &A, int x){memset(A, x, sizeof(A));} | |
| template<class T0, class T1> inline void FLC(T0 &A0, T1 &A1, int x){FLC(A0, x), FLC(A1, x);} | |
| template<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);} | |
| template<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);} | |
| template<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);} | |
| template<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);} | |
| template<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);} | |
| template<class T> inline void CLR(priority_queue<T, vector<T>, less<T> > &Q){while (!Q.empty()) Q.pop();} | |
| template<class T> inline void CLR(priority_queue<T, vector<T>, greater<T> > &Q){while (!Q.empty()) Q.pop();} | |
| template<class T> inline void CLR(T &A){A.clear();} | |
| template<class T0, class T1> inline void CLR(T0 &A0, T1 &A1){CLR(A0), CLR(A1);} | |
| template<class T0, class T1, class T2> inline void CLR(T0 &A0, T1 &A1, T2 &A2){CLR(A0), CLR(A1), CLR(A2);} | |
| template<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);} | |
| template<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);} | |
| template<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);} | |
| template<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);} | |
| template<class T> inline void CLR(T &A, int n){REP(i, n) CLR(A[i]);} | |
| template<class T> inline T& SRT(T &A){sort(ALL(A)); return A;} | |
| template<class T, class C> inline T& SRT(T &A, C B){sort(ALL(A), B); return A;} | |
| //} | |
| /** Constant List .. **/ //{ | |
| const int MOD = 1000000007; | |
| //int MOD = 99990001; | |
| const int INF = 0x3f3f3f3f; | |
| const LL INFF = 1LL << 60; | |
| const DB EPS = 1e-9; | |
| const DB OO = 1e15; | |
| const DB PI = acos(-1.0); //M_PI; | |
| const int dx[] = {-1, 0, 1, 0}; | |
| const int dy[] = {0, 1, 0, -1}; | |
| //} | |
| /** Add On .. **/ //{ | |
| // <<= '0. Nichi Joo ., //{ | |
| template<class T> inline void checkMin(T &a,const T b){if (b<a) a=b;} | |
| template<class T> inline void checkMax(T &a,const T b){if (a<b) a=b;} | |
| template<class T> inline void checkMin(T &a, T &b, const T x){checkMin(a, x), checkMin(b, x);} | |
| template<class T> inline void checkMax(T &a, T &b, const T x){checkMax(a, x), checkMax(b, x);} | |
| template <class T, class C> inline void checkMin(T& a, const T b, C c){if (c(b,a)) a = b;} | |
| template <class T, class C> inline void checkMax(T& a, const T b, C c){if (c(a,b)) a = b;} | |
| template<class T> inline T min(T a, T b, T c){return min(min(a, b), c);} | |
| template<class T> inline T max(T a, T b, T c){return max(max(a, b), c);} | |
| template<class T> inline T min(T a, T b, T c, T d){return min(min(a, b), min(c, d));} | |
| template<class T> inline T max(T a, T b, T c, T d){return max(max(a, b), max(c, d));} | |
| template<class T> inline T sqr(T a){return a*a;} | |
| template<class T> inline T cub(T a){return a*a*a;} | |
| inline int Ceil(int x, int y){return (x - 1) / y + 1;} | |
| //} | |
| // <<= '1. Bitwise Operation ., //{ | |
| namespace BO{ | |
| inline bool _1(int x, int i){return bool(x&1<<i);} | |
| inline bool _1(LL x, int i){return bool(x&1LL<<i);} | |
| inline LL _1(int i){return 1LL<<i;} | |
| inline LL _U(int i){return _1(i) - 1;}; | |
| inline int reverse_bits(int x){ | |
| x = ((x >> 1) & 0x55555555) | ((x << 1) & 0xaaaaaaaa); | |
| x = ((x >> 2) & 0x33333333) | ((x << 2) & 0xcccccccc); | |
| x = ((x >> 4) & 0x0f0f0f0f) | ((x << 4) & 0xf0f0f0f0); | |
| x = ((x >> 8) & 0x00ff00ff) | ((x << 8) & 0xff00ff00); | |
| x = ((x >>16) & 0x0000ffff) | ((x <<16) & 0xffff0000); | |
| return x; | |
| } | |
| inline LL reverse_bits(LL x){ | |
| x = ((x >> 1) & 0x5555555555555555LL) | ((x << 1) & 0xaaaaaaaaaaaaaaaaLL); | |
| x = ((x >> 2) & 0x3333333333333333LL) | ((x << 2) & 0xccccccccccccccccLL); | |
| x = ((x >> 4) & 0x0f0f0f0f0f0f0f0fLL) | ((x << 4) & 0xf0f0f0f0f0f0f0f0LL); | |
| x = ((x >> 8) & 0x00ff00ff00ff00ffLL) | ((x << 8) & 0xff00ff00ff00ff00LL); | |
| x = ((x >>16) & 0x0000ffff0000ffffLL) | ((x <<16) & 0xffff0000ffff0000LL); | |
| x = ((x >>32) & 0x00000000ffffffffLL) | ((x <<32) & 0xffffffff00000000LL); | |
| return x; | |
| } | |
| template<class T> inline bool odd(T x){return x&1;} | |
| template<class T> inline bool even(T x){return !odd(x);} | |
| template<class T> inline T low_bit(T x) {return x & -x;} | |
| template<class T> inline T high_bit(T x) {T p = low_bit(x);while (p != x) x -= p, p = low_bit(x);return p;} | |
| template<class T> inline T cover_bit(T x){T p = 1; while (p < x) p <<= 1;return p;} | |
| inline int low_idx(int x){return __builtin_ffs(x);} | |
| inline int low_idx(LL x){return __builtin_ffsll(x);} | |
| inline int high_idx(int x){return low_idx(reverse_bits(x));} | |
| inline int high_idx(LL x){return low_idx(reverse_bits(x));} | |
| inline int clz(int x){return __builtin_clz(x);} | |
| inline int clz(LL x){return __builtin_clzll(x);} | |
| inline int ctz(int x){return __builtin_ctz(x);} | |
| inline int ctz(LL x){return __builtin_ctzll(x);} | |
| inline int parity(int x){return __builtin_parity(x);} | |
| inline int parity(LL x){return __builtin_parityll(x);} | |
| inline int lg2(int a){return 31 - clz(a);} | |
| inline int lg2(LL a){return 63 - clz(a);} | |
| inline int count_bits(int x){return __builtin_popcount(x);} | |
| inline int count_bits(LL x){return __builtin_popcountll(x);} | |
| } using namespace BO;//} | |
| // <<= '2. Number Theory .,//{ | |
| namespace NT{ | |
| inline LL __lcm(LL a, LL b){return a*b/__gcd(a,b);} | |
| inline void INC(int &a, int b){a += b; if (a >= MOD) a -= MOD;} | |
| inline int sum(int a, int b){a += b; if (a >= MOD) a -= MOD; return a;} | |
| inline void DEC(int &a, int b){a -= b; if (a < 0) a += MOD;} | |
| inline int dff(int a, int b){a -= b; if (a < 0) a += MOD; return a;} | |
| inline void MUL(int &a, int b){a = (LL)a * b % MOD;} | |
| inline int pdt(int a, int b){return (LL)a * b % MOD;} | |
| inline int sum(int a, int b, int c){return sum(sum(a, b), c);} | |
| inline int sum(int a, int b, int c, int d){return sum(sum(a, b), sum(c, d));} | |
| inline int pdt(int a, int b, int c){return pdt(pdt(a, b), c);} | |
| inline int pdt(int a, int b, int c, int d){return pdt(pdt(pdt(a, b), c), d);} | |
| inline int pow(int a, int b){ | |
| int c(1); while (b){ | |
| if (b&1) MUL(c, a); | |
| MUL(a, a), b >>= 1; | |
| } | |
| return c; | |
| } | |
| inline int pow(int a, LL b){ | |
| int c(1); while (b){ | |
| if (b&1) MUL(c, a); | |
| MUL(a, a), b >>= 1; | |
| } | |
| return c; | |
| } | |
| template<class T> inline T pow(T a, LL b){ | |
| T c(1); while (b){ | |
| if (b&1) c *= a; | |
| a *= a, b >>= 1; | |
| } | |
| return c; | |
| } | |
| inline int _I(int b){ | |
| int a = MOD, x1 = 0, x2 = 1, q; | |
| while (true){ | |
| q = a / b, a %= b; | |
| if (!a) return (x2 + MOD) % MOD; | |
| DEC(x1, pdt(q, x2)); | |
| q = b / a, b %= a; | |
| if (!b) return (x1 + MOD) % MOD; | |
| DEC(x2, pdt(q, x1)); | |
| } | |
| } | |
| inline void DIV(int &a, int b){MUL(a, _I(b));} | |
| inline int qtt(int a, int b){return pdt(a, _I(b));} | |
| inline int phi(int n){ | |
| int res = n; for (int i=2;sqr(i)<=n;++i) if (!(n%i)){ | |
| DEC(res, qtt(res, i)); | |
| do{n /= i;} while(!(n%i)); | |
| } | |
| if (n != 1) | |
| DEC(res, qtt(res, n)); | |
| return res; | |
| } | |
| } using namespace NT;//} | |
| //} | |
| /** I/O Accelerator Interface .. **/ //{ | |
| template<class T> inline T& RD(T &x){ | |
| //cin >> x; | |
| //scanf("%d", &x); | |
| char c; for (c = getchar(); c < '0'; c = getchar()); x = c - '0'; for (c = getchar(); '0' <= c && c <= '9'; c = getchar()) x = x * 10 + c - '0'; | |
| //char c; c = getchar(); x = c - '0'; for (c = getchar(); c >= '0'; c = getchar()) x = x * 10 + c - '0'; | |
| return x; | |
| } | |
| inline char* RS(char *s){ | |
| gets(s); | |
| //scanf("%s", s); | |
| return s; | |
| } | |
| int Case; template<class T> inline void OT(const T &x){ | |
| //printf("Case %d: %d\n", ++Case, x); | |
| //printf("%I64d\n", x); | |
| //printf("%.2lf\n", x); | |
| printf("%d\n", x); | |
| //cout << x << endl; | |
| } | |
| //} | |
| //}/* .................................................................................................................................. */ | |
| namespace Splay{ | |
| #define l c[0] | |
| #define r c[1] | |
| #define lx l[x] | |
| #define rx r[x] | |
| #define px p[x] | |
| #define ly l[y] | |
| #define ry r[y] | |
| #define py p[y] | |
| #define mid ((a + b) >> 1) | |
| #define lc lx, a, mid | |
| #define rc rx, mid+1, b | |
| const int N = 1000009; | |
| int c[2][N], p[N], sz[N], cc[N]; int sc[N], dl[N]; char ch[N], buf[N]; | |
| int n, root, total, cursor, cur; | |
| inline int sgn(int x){return l[px] == x ? 0 : 1;} | |
| inline void setc(int y, int d, int x){c[d][y] = x, px = y;} | |
| inline void setl(int y, int x){c[0][y] = x, px = y;} | |
| inline void setr(int y, int x){c[1][y] = x, px = y;} | |
| inline int new_node(int _cnt = 1, char _ch = 0){ | |
| ++total, c[0][total] = c[1][total] = 0; | |
| p[total] = 0, sz[total] = _cnt, cc[total] = _cnt, dl[total] = 0; ch[total] = _ch; | |
| sc[total] = bool(_ch); | |
| return total; | |
| } | |
| inline void release(int x){ | |
| } | |
| inline void update(int x){ | |
| sz[x] = sz[lx] + cc[x] + sz[rx]; | |
| sc[x] = sc[lx] + bool(ch[x]) + sc[rx]; | |
| } | |
| inline void _rot(int x, int d){ | |
| int y = px, z = py; setc(z, sgn(y), x); | |
| setc(y, d, c[d^1][x]); setc(x, d^1, y); | |
| update(y); | |
| } | |
| inline void rot(int x){_rot(x, sgn(x));} | |
| inline void zig(int x){_rot(x, 0);} | |
| inline void zag(int x){_rot(x, 1);} | |
| /*/ | |
| int splay(int x, int t = 0){ // Type I. | |
| while (p[x] != t) rot(x); | |
| if (!t) root = x; | |
| return x; | |
| } | |
| /*/ | |
| int splay(int x, int t = 0){ // Type II. | |
| while (px != t){ | |
| int y = px, z = py; if (z == t){ rot(x); break;} | |
| if (l[z] == y){ | |
| if (l[y] == x) zig(y), zig(x); | |
| else zag(x), zig(x); | |
| } | |
| else { | |
| if (r[y] == x) zag(y), zag(x); | |
| else zig(x), zag(x); | |
| } | |
| } | |
| update(x); if (!t) root = x; | |
| return x; | |
| } | |
| //*/ | |
| void Build(int &x = root, int a = 0, int b = n){ | |
| if (a >= b) return; | |
| x = new_node(1, buf[mid]), Build(lc), Build(rc); | |
| sz[x] = sc[x] = b - a, p[lx] = p[rx] = x; | |
| } | |
| void Inorder(int x = root){ // Debug .. . | |
| if (!x) return; | |
| Inorder(lx); | |
| if (ch[x]) putchar(ch[x]); | |
| else if (cc[x] >= 10) printf("..."); | |
| else DO(cc[x]) putchar(' '); | |
| Inorder(rx); | |
| } | |
| int Split(int y, int z){ | |
| int x = new_node(z); | |
| setl(x, ly), setl(y, x), cc[y] -= z; | |
| update(x), update(y); | |
| return x; | |
| } | |
| int Select(int k){ | |
| int x = root; while (release(x), !(sz[lx] <= k && k < sz[lx] + cc[x])){ | |
| if (sz[lx] + cc[x] <= k) k -= sz[lx] + cc[x], x = rx; | |
| else x = lx; | |
| } | |
| k -= sz[lx], ++k; | |
| if (k < cc[x]) return Split(x, k); | |
| return x; | |
| } | |
| /*/ | |
| int Select(int a, int b){ | |
| Select(b+1); return Select(a-1)[r][l]; | |
| } | |
| /*/ | |
| int Select(int a, int b){ // Type II. | |
| int y = Select(a-1), x = Select(b+1); | |
| return l[splay(x, splay(y))]; | |
| } | |
| //*/ | |
| void Init(){ | |
| total = 0, root = new_node(N); | |
| } | |
| void Move_Right(){ | |
| cursor += RD(); | |
| } | |
| void Insert(){ | |
| RD(n), gets(buf); | |
| int y = Select(cursor), x = Select(cursor+1); | |
| Build(l[splay(x, splay(y))]), p[lx] = x, update(x), update(y); | |
| cursor += n; | |
| //Inorder(root); puts(""); | |
| } | |
| void Delete(){ | |
| int len = RD(); | |
| int y = Select(cursor + len + 1), x = Select(cursor); | |
| splay(x, splay(y)); | |
| dl[x] += len - sc[rx], rx = 0, update(x), update(y); | |
| //Inorder(root); puts(""); | |
| } | |
| void Home(){ | |
| cursor = 0; | |
| } | |
| bool print; int line, dd; void _Output(int x = root){ | |
| if (!x) return; | |
| _Output(lx); | |
| if (!ch[x] && n){ | |
| if (cursor){ | |
| if (print) printf("R %d\n", cursor); else ++line; | |
| cursor = 0; | |
| } | |
| if (dd){ | |
| if (print) printf("D %d\n", dd); else ++line; | |
| dd = 0; | |
| } | |
| buf[n] = 0; | |
| if (print) printf("C %d %s\n", n, buf); else ++line; | |
| cursor = 0, n = 0; | |
| } | |
| if (ch[x]) buf[n++] = ch[x]; else cursor += cc[x]; | |
| dd += dl[x]; | |
| _Output(rx); | |
| } | |
| void Output(){ | |
| cursor = -1, n = 0, line = 0, print = false, _Output(), OT(line); | |
| cursor = -1, n = 0, print = true, _Output(); | |
| } | |
| #undef l | |
| #undef r | |
| #undef lx | |
| #undef rx | |
| #undef px | |
| #undef ly | |
| #undef ry | |
| #undef py | |
| #undef mid | |
| #undef lc | |
| #undef rc | |
| } using namespace Splay; | |
| int main(){ | |
| #ifndef ONLINE_JUDGE | |
| freopen("in.txt", "r", stdin); | |
| //freopen("out.txt", "w", stdout); | |
| #endif | |
| bool first_blood = true; | |
| Rush{ | |
| if (first_blood) first_blood = false; else puts(""); | |
| Init(); Rush{ | |
| Home(); Rush switch(RC()){ | |
| case 'R': Move_Right(); break; | |
| case 'C': Insert(); break; | |
| default: Delete(); | |
| } | |
| } | |
| Output(); | |
| } | |
| } | |
| /* | |
| 4 | |
| 2 | |
| 4 | |
| R 4 | |
| C 3 abc | |
| R 2 | |
| C 3 xyz | |
| 3 | |
| R 7 | |
| C 3 def | |
| D 3 | |
| 2 | |
| 3 | |
| R 10 | |
| D 5 | |
| C 1 A | |
| 2 | |
| R 11 | |
| D 5 | |
| 2 | |
| 2 | |
| R 100000 | |
| C 10 $$$$$$$$$z | |
| 2 | |
| R 100000 | |
| C 10 z$$$$$$$$$ | |
| 3 | |
| 3 | |
| R 100000 | |
| R 100000 | |
| C 10 abcdefghij | |
| 3 | |
| R 100000 | |
| R 100000 | |
| D 8 | |
| 3 | |
| R 100000 | |
| R 100001 | |
| C 9 xxxxxxxxxxxxxxxx | |
| 3 | |
| 3 | |
| R 100000 | |
| R 100000 | |
| C 10 abcdefghij | |
| 3 | |
| R 100000 | |
| R 100000 | |
| D 8 | |
| 3 | |
| R 100000 | |
| R 100001 | |
| C 9 xxxxxxxxxxxxxxxx | |
| */ |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment