testcase-data/ht-ce-2.json

[
    {
        "code_id": 3,
        "code": "// InterestingLSY\r\n// codeforces&github: interestingLSY, qq: 2659723130\r\n// 《幽灵公主》是真的好看！\r\n#ifdef intLSY\r\n#include <intlsy/stdc++.h>\r\n#else\r\n#include <bits/stdc++.h>\r\n#endif\r\n#include <bits/c++0x_warning.h>\r\nusing namespace std;\r\n#define il inline\r\n#define elif else if\r\n\r\n// Type\r\n#define ld double\r\n#define ll long long\r\n#define ull unsigned ll\r\n\r\n// Vector\r\n#define vc vector\r\n#define Pb push_back\r\n#define Pf push_front\r\n#define Eb emplace_back\r\n#define All(x) x.begin(),x.end()\r\n#define AllRev(x) x.rbegin(),x.rend()\r\n\r\n// Memory\r\n#define Ms(_data) memset(_data,0,sizeof(_data))\r\n#define Msn(_data,_num) memset(_data,_num,sizeof(_data))\r\n\r\n// Pair\r\n#define F first\r\n#define S second\r\n#define pii pair<int,int>\r\n#define pli pair<ll,int>\r\n#define pil pair<int,ll>\r\n#define pll pair<ll,ll>\r\n\r\n// Loop\r\n#define For(i,j) for( int (i) = 1 ; (i) <= (j) ; ++(i) )\r\n#define For0(i,j) for( int (i) = 0 ; (i) < (j) ; ++(i) )\r\n#define Forx(i,j,k) for( int (i) = (j) ; (i) <= (k) ; ++(i) )\r\n#define Forstep(i,j,k,st) for( int (i) = (j) ; (i) <= (k) ; (i) += (st) )\r\n#define fOR(i,j) for( int (i) = (j) ; (i) >= 1 ; --(i) )\r\n#define fOR0(i,j) for( int (i) = (j)-1 ; (i) >= 0 ; --(i) )\r\n#define fORx(i,j,k) for( int (i) = (k) ; (i) >= (j) ; --(i) )\r\n\r\n// Read\r\nstruct InputReader{\r\n\tstatic constexpr int MAXSZ = 1048576;\r\n\tchar buf[MAXSZ]; int p, ed;\r\n\tbool detectedEOF = false;\r\n\til InputReader(){ p = MAXSZ; }\r\n\til void Flush(){ p = 0; ed = fread(buf,1,MAXSZ,stdin); }\r\n\til void GetChar( char &c ){\r\n\t\tif(p >= MAXSZ) Flush();\r\n\t\tif( p == ed ){ detectedEOF = true; }\r\n\t\tc = buf[p++];\r\n\t}\r\n\til void ReadNum( char &c ){ GetChar(c); while( !isdigit(c) && c != '-' && !detectedEOF ) GetChar(c); }\r\n\til void ReadAlpha( char &c ){ GetChar(c); while( !isalpha(c) && !detectedEOF ) GetChar(c); }\r\n\til void ReadInt( int &ans ){\r\n\t\tans = 0; int nega = 1;\r\n\t\tchar c; ReadNum(c); if(detectedEOF) return;\r\n\t\tif( c == '-' ){\r\n\t\t\tnega = -1;\r\n\t\t\tGetChar(c);\r\n\t\t}\r\n\t\twhile( isdigit(c) && !detectedEOF ){\r\n\t\t\tans = ans*10 + c-'0';\r\n\t\t\tGetChar(c);\r\n\t\t}\r\n\t\tans *= nega;\r\n\t}\r\n\til void Readll( ll &ans ){\r\n\t\tans = 0; int nega = 1;\r\n\t\tchar c; ReadNum(c); if(detectedEOF) return;\r\n\t\tif( c == '-' ){\r\n\t\t\tnega = -1;\r\n\t\t\tGetChar(c);\r\n\t\t}\r\n\t\twhile( isdigit(c) && !detectedEOF ){\r\n\t\t\tans = ans*10 + c-'0';\r\n\t\t\tGetChar(c);\r\n\t\t}\r\n\t\tans *= nega;\r\n\t}\r\n\til void ReadString( string &x ){\r\n\t\tx.clear(); char ch; GetChar(ch);\r\n\t\twhile( !isdigit(ch) && !isalpha(ch) && ch != '#' && ch != '.' && !detectedEOF ) GetChar(ch); if(detectedEOF) return;\r\n\t\twhile( (isdigit(ch) || isalpha(ch) || ch == '#' || ch == '.') && !detectedEOF ){\r\n\t\t\tx += ch;\r\n\t\t\tGetChar(ch);\r\n\t\t}\r\n\t}\r\n\til void ReadCString( char s[] ){\r\n\t\tint len = 0; char ch; GetChar(ch);\r\n\t\twhile( !isdigit(ch) && !isalpha(ch) && ch != '#' && ch != '.' && !detectedEOF ) GetChar(ch); if(detectedEOF) return;\r\n\t\twhile( (isdigit(ch) || isalpha(ch) || ch == '#' || ch == '.') && !detectedEOF ){\r\n\t\t\ts[len++] = ch;\r\n\t\t\tGetChar(ch);\r\n\t\t}\r\n\t\ts[len] = '\\0';\r\n\t}\r\n\til void SpecialRead( char &c ){\r\n\t\tGetChar(c); if(detectedEOF) return;\r\n\t\twhile( !isdigit(c) && !isalpha(c) && c != '#' && c != '.' && c != '=' && c != 'B' && !detectedEOF ) GetChar(c);\r\n\t}\r\n}In;\r\nil void Read( int &x ){ In.ReadInt(x); }\r\nil void Read( int &x, int &y ){ In.ReadInt(x); In.ReadInt(y); }\r\nil void Read( int &x1 , int &x2 , int &x3 ){ In.ReadInt(x1); In.ReadInt(x2); In.ReadInt(x3); }\r\nil void Read( int &x1 , int &x2 , int &x3 , int &x4 ){ In.ReadInt(x1); In.ReadInt(x2); In.ReadInt(x3); In.ReadInt(x4); }\r\nil void Read( ll &x ){ In.Readll(x); }\r\nil void Read( ll &x, ll &y ){ In.Readll(x); In.Readll(y); }\r\nil void Read( ll &x1 , ll &x2 , ll &x3 ){ In.Readll(x1); In.Readll(x2); In.Readll(x3); }\r\nil void Read( ll &x1 , ll &x2 , ll &x3 , ll &x4 ){ In.Readll(x1); In.Readll(x2); In.Readll(x3); In.Readll(x4); }\r\ntemplate<typename T> void Read( T a[] , int st , int ed ){ Forx(i,st,ed) Read(a[i]); }\r\n#define iRead(k) int k; Read(k);\r\n#define iRead2(a,b) iRead(a); iRead(b);\r\n#define iRead3(a,b,c) iRead2(a,b); iRead(c);\r\n#define iRead4(a,b,c,d) iRead2(a,b); iRead2(c,d);\r\n#define lRead(k) ll k; Read(k);\r\n#define lRead2(a,b) lRead(a); lRead(b);\r\n#define lRead3(a,b,c) lRead2(a,b); lRead(c);\r\n#define lRead4(a,b,c,d) lRead2(a,b); lRead2(c,d);\r\n\r\n// File\r\nil void FILEIO(){\r\n\t#ifdef intLSY\r\n\t\tFin(\"in.in\");\r\n\t#endif\r\n}\r\nil void FILEIO( string pname ){\r\n\t#ifndef intLSY\r\n\t\tFin((pname+\".in\").c_str());\r\n\t\tFout((pname+\".out\").c_str());\r\n\t#else\r\n\t\tFin(\"in.in\");\r\n\t#endif\r\n}\r\nil void FILEIO_OICONTEST( string pname ){\r\n\tFin((pname+\".in\").c_str());\r\n\t#ifndef intLSY\r\n\t\tFout((pname+\".out\").c_str());\r\n\t#endif\r\n}\r\nvoid Printtime(){\r\n\t#ifdef intLSY\r\n\t\tdouble _timeuse = clock()* 1000.0 / CLOCKS_PER_SEC;\r\n\t\tfprintf(stderr,\"\\n\\nTime usage:\\n%.0lf ms\\n\",_timeuse);\r\n\t#endif\r\n}\r\nvoid END(){ Printtime(); exit(0); }\r\ntemplate<typename T>void END( T mes ){ cout << mes << endl; END(); }\r\n\r\n// Debug\r\n#define B cerr << \"BreakPoint\" << endl;\r\n#define O(x) cerr << #x << \" \" << (x) << endl;\r\n#define o(x) cerr << #x << \" \" << (x) << \"  \";\r\ntemplate<typename T0>\r\nvoid P( T0 t0 ){\r\n\tcerr << t0 << endl;\r\n}\r\ntemplate<typename T0, typename... Ts>\r\nvoid P( T0 t0 , Ts... ts ){\r\n\tcerr << t0 << \" \";\r\n\tP(ts...);\r\n}\r\n#define Msz(x) cerr << \"Sizeof \" << #x << \" \" << sizeof(x)/1024/1024 << \" MB\" << endl;\r\ntemplate<typename T>void Print( T a[] , int s , int t , char sp = ' ' , char ed = '\\n' ){\r\n\tif( s > t ) return;\r\n\tfor( int i = s ; i < t ; i++ )\r\n\t\tcout << a[i] << sp;\r\n\tcout << a[t] << ed;\r\n\tcout.flush();\r\n}\r\ntemplate<typename T>void Print( T a , int s = 0 , int t = -1 , char sp = ' ' , char ed = '\\n' ){\r\n\tif( t == -1 ) t = a.size()-1;\r\n\tfor( int i = s ; i <= t ; i++ )\r\n\t\tcout << a[i] << sp;\r\n\tcout << ed;\r\n\tcout.flush();\r\n}\r\n\r\n// Optimize\r\n#define Max(a,b) ((a)>(b)?(a):(b))\r\n#define Min(a,b) ((a)<(b)?(a):(b))\r\n#define Mymax(a,b) (a) = max((a),(b))\r\n#define Mymin(a,b) (a) = min((a),(b))\r\n#define MyMax(a,b) (a) = Max((a),(b))\r\n#define MyMin(a,b) (a) = Min((a),(b))\r\n#define INF (0x3f3f3f3f)\r\n#define LINF ((long long)(0x3f3f3f3f3f3f3f3f))\r\n#define Sqr(x) ((x)*(x))\r\n#define Lowbit(a) ((a)&(-(a)))\r\n///////////////////////////////////////////////////////////////////////////////////////\r\n///////////////////////////////////////////////////////////////////////////////////////\r\nconstexpr int MAXN = 131072;\r\n\r\nint n,m;\r\nvc<int> e[MAXN];\r\n\r\nint in[MAXN], out[MAXN];\r\nvoid InitDfs( int pos , int fa ){\r\n\tstatic int nowTime = 0;\r\n\tin[pos] = ++nowTime;\r\n\tfor( auto v : e[pos] ){\r\n\t\tif( v == fa ) continue;\r\n\t\tInitDfs(v,pos);\r\n\t}\r\n\tout[pos] = nowTime;\r\n}\r\n\r\nstruct FenwickTree{\r\n\tll di[MAXN], idi[MAXN];\r\n\til void Add( int pos , ll diAdd ){\r\n\t\tll idiAdd = pos*diAdd;\r\n\t\tfor( ; pos <= n ; pos += Lowbit(pos) ){\r\n\t\t\tdi[pos] += diAdd;\r\n\t\t\tidi[pos] += idiAdd;\r\n\t\t}\r\n\t}\r\n\til void Add( int l , int r , ll x ){\r\n\t\t// P(\"Add\",l,r,x);\r\n\t\tAdd(l,x); Add(r+1,-x);\r\n\t}\r\n\til ll Sum( int pos ){\r\n\t\tint oPos = pos;\r\n\t\tll diSum = 0, idiSum = 0;\r\n\t\tfor( ; pos ; pos -= Lowbit(pos) ){\r\n\t\t\tdiSum += di[pos];\r\n\t\t\tidiSum += idi[pos];\r\n\t\t}\r\n\t\treturn (oPos+1)*diSum - idiSum;\r\n\t}\r\n\til ll Sum( int l , int r ){\r\n\t\treturn Sum(r) - Sum(l-1);\r\n\t}\r\n}bit;\r\n\r\nstruct ColorKeeper{\r\n\tset<pii> intervals;\r\n\tvoid Color( int l , int r ){\r\n\t\tstatic const auto nullP = intervals.end();\r\n\t\tauto nxtP = intervals.upper_bound(pii{l,r});\r\n\t\tauto preP = nxtP == intervals.begin() ? nullP : prev(nxtP);\r\n\t\tnxtP = nxtP == intervals.end() ? nullP : nxtP;\r\n\t\tif( preP != nullP and preP->S >= r ) return;\r\n\r\n\t\tif( preP != nullP and preP->S < l-1 ) preP = nullP;\r\n\t\tif( nxtP != nullP and nxtP->F > r+1 ) nxtP = nullP;\r\n\r\n\t\tbit.Add(\r\n\t\t\tpreP != nullP ? preP->S+1 : l,\r\n\t\t\tnxtP != nullP ? nxtP->F-1 : r,\r\n\t\t\t1\r\n\t\t);\r\n\t\tif( preP != nullP ){ l = preP->F; intervals.erase(preP); }\r\n\t\tif( nxtP != nullP ){ r = nxtP->S; intervals.erase(nxtP); }\r\n\r\n\t\tintervals.insert({l,r});\r\n\t}\r\n}colorKeepers[MAXN];\r\n\r\nint main(){\r\n\tFILEIO();\r\n\r\n\tRead(n,m);\r\n\tFor(i,n-1){\r\n\t\tiRead2(a,b);\r\n\t\te[a].Eb(b);\r\n\t\te[b].Eb(a);\r\n\t}\r\n\r\n\tInitDfs(1,0);\r\n\r\n\tFor(i,m){\r\n\t\tiRead(op);\r\n\t\tif( op == 1 ){\r\n\t\t\tiRead2(pos,c);\r\n\t\t\tcolorKeepers[c].Color(in[pos],out[pos]);\r\n\t\t}else{\r\n\t\t\tiRead(pos);\r\n\t\t\tll ans = bit.Sum(in[pos],out[pos]);\r\n\t\t\tprintf(\"%lld\\n\",ans);\r\n\t\t}\r\n\t}\r\n\r\n\tEND();\r\n}\r\n",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpf54596uj/09b92ae9-7633-4ef2-a995-ca33604e07a0.cpp: In function ‘void FILEIO(std::string)’:\n/tmp/tmpf54596uj/09b92ae9-7633-4ef2-a995-ca33604e07a0.cpp:136:17: error: ‘Fin’ was not declared in this scope; did you mean ‘sin’?\n  136 |                 Fin((pname+\".in\").c_str());\n      |                 ^~~\n      |                 sin\n/tmp/tmpf54596uj/09b92ae9-7633-4ef2-a995-ca33604e07a0.cpp:137:17: error: ‘Fout’ was not declared in this scope\n  137 |                 Fout((pname+\".out\").c_str());\n      |                 ^~~~\n/tmp/tmpf54596uj/09b92ae9-7633-4ef2-a995-ca33604e07a0.cpp: In function ‘void FILEIO_OICONTEST(std::string)’:\n/tmp/tmpf54596uj/09b92ae9-7633-4ef2-a995-ca33604e07a0.cpp:143:9: error: ‘Fin’ was not declared in this scope; did you mean ‘sin’?\n  143 |         Fin((pname+\".in\").c_str());\n      |         ^~~\n      |         sin\n/tmp/tmpf54596uj/09b92ae9-7633-4ef2-a995-ca33604e07a0.cpp:145:17: error: ‘Fout’ was not declared in this scope\n  145 |                 Fout((pname+\".out\").c_str());\n      |                 ^~~~\n"
        ],
        "tcb_id": "Bessie's Snow Cow"
    },
    {
        "code_id": 11,
        "code": "// This code wrote by relatorpunch\n#include <bits/stdc++.h>\n#define reg\n#define ALL(x) (x).begin(),(x).end()\n#define mem(x,y) memset(x,y,sizeof x)\n#define sz(x) (int)(x).size()\n#define ln putchar('\\n')\n#define lsp putchar(32)\n#define pb push_back\n#define MP std::make_pair\n#define MT std::make_tuple\n#ifdef _LOCAL_\n#define dbg(x) std::cerr<<__func__<<\"\\tLine:\"<<__LINE__<<' '<<#x<<\": \"<<x<<\"\\n\"\n#define dprintf(x...) std::fprintf(stderr,x)\n#else\n#define dbg(x) 42\n#define dprintf(x...) 42\n#endif\n#define rep(i,a,b) for(int i=(a);i<=(b);++i)\n#define per(i,b,a) for(int i=(b);i>=(a);--i)\ntypedef std::pair<int,int> pii;\ntypedef std::vector<int> poly;\ntemplate <class t> inline void read(t &s){s=0;\nsigned f=1;char c=getchar();while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}\nwhile(isdigit(c))s=(s<<3)+(s<<1)+(c^48),c=getchar();;s*=f;}\ntemplate<class t,class ...A> inline void read(t &x,A &...a){read(x);read(a...);}\ntemplate <class t> inline void write(t x){if(x<0)putchar('-'),x=-x;\nstatic int buf[50],top=0;while(x)buf[++top]=x%10,x/=10;if(!top)buf[++top]=0;\nwhile(top)putchar(buf[top--]^'0');}\ninline void setIO(std::string s=\"\"){setIn(s+\".in\");setOut(s+\".out\");return;}\ntemplate <class t>inline bool ckmin(t&x,t y){if(x>y){x=y;return 1;}return 0;}\ntemplate <class t>inline bool ckmax(t&x,t y){if(x<y){x=y;return 1;}return 0;}\ninline int lowbit(int x){return x&(-x);}\nconst int MaxN=1e5+50;\npoly E[MaxN];\nint mid,failed;\ninline int dfs(int u,int fa)\n{\n\tstd::multiset<int> S;\n\tfor(auto v:E[u])if(v!=fa)S.insert(dfs(v,u)+1);\n\tif((~S.size()&1)^!fa)S.insert(0);\n\tint ret=0;\n\twhile(S.size()>1u)\n\t{\n\t\tint x=*S.begin();S.erase(S.begin());\n\t\tstd::multiset<int>::iterator y=S.lower_bound(mid-x);\n\t\tif(y==S.end())\n\t\t{\n\t\t\tif(ret)return failed=1,-1;\n\t\t\telse ret=x;\n\t\t\tcontinue;\n\t\t}\n\t\tS.erase(y);\n\t}\n\tif(S.size())ret=*S.begin();\n\treturn ret;\n}\nsigned main(void)\n{\n\tint n;read(n);\n\tint u,v;\n\trep(i,1,n-1)read(u,v),E[u].pb(v),E[v].pb(u);\n\tint l=0,r=n-1,ans=-1;\n\twhile(l<=r)\n\t{\n\t\tmid=(l+r)>>1,failed=0;\n\t\tif(!dfs(1,0)&&!failed)ans=mid,l=mid+1;\n\t\telse r=mid-1;\n\t}\n\twrite(ans),ln;\n\treturn 0;\n}\n\n/*\n * Check List:\n * 1. Input / Output File (OI)\n * 2. long long \n * 3. Special Test such as n=1\n * 4. Array Size\n * 5. Memory Limit (OI) int is 4 and longlong is 8\n * 6. Mod (a*b%p*c%p not a*b*c%p  ,  (a-b+p)%p not a-b )\n * 7. Name ( int k; for(int k...))\n * 8. more tests , (T=2 .. more)\n * 9. blank \\n after a case\n*/\n\n\n\n",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpeouoaktj/ea258746-3130-441b-bea1-abb5167e0318.cpp: In function ‘void setIO(std::string)’:\n/tmp/tmpeouoaktj/ea258746-3130-441b-bea1-abb5167e0318.cpp:30:37: error: ‘setIn’ was not declared in this scope; did you mean ‘setIO’?\n   30 | inline void setIO(std::string s=\"\"){setIn(s+\".in\");setOut(s+\".out\");return;}\n      |                                     ^~~~~\n      |                                     setIO\n/tmp/tmpeouoaktj/ea258746-3130-441b-bea1-abb5167e0318.cpp:30:52: error: ‘setOut’ was not declared in this scope; did you mean ‘setbuf’?\n   30 | inline void setIO(std::string s=\"\"){setIn(s+\".in\");setOut(s+\".out\");return;}\n      |                                                    ^~~~~~\n      |                                                    setbuf\n"
        ],
        "tcb_id": "Delegation"
    },
    {
        "code_id": 0,
        "code": "#include<bits/stdc++.h>\nusing namespace std;\nchar s[1000015];\nint main()\n{\nios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\nwhile(cin>>s+1){\n\tif(s[1]=='.')break;\n\tint next[1000015];\n\tint len=strlen(s+1);\n\tint j=0;\n\tfor(int i=2;i<=len;i++){\n\t\twhile(s[i]!=s[j+1]&&j)j--;\n\t\tif(s[i]==s[j+1])j++;\n\t\tnext[i]=j;\n\t}\n\tcout<<len/(len-next[len])<<'\\n';\n}\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp: In function ‘int main()’:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:10: error: no match for ‘operator>>’ (operand types are ‘std::istream’ {aka ‘std::basic_istream<char>’} and ‘char*’)\n    7 | while(cin>>s+1){\n      |       ~~~^~~~~\n      |       |     |\n      |       |     char*\n      |       std::istream {aka std::basic_istream<char>}\nIn file included from /usr/include/c++/11/sstream:38,\n                 from /usr/include/c++/11/complex:45,\n                 from /usr/include/c++/11/ccomplex:39,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/istream:168:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(bool&) [with _CharT = char; _Traits = std::char_traits<char>; std::basic_istream<_CharT, _Traits>::__istream_type = std::basic_istream<char>]’ (near match)\n  168 |       operator>>(bool& __n)\n      |       ^~~~~~~~\n/usr/include/c++/11/istream:168:7: note:   conversion of argument 1 would be ill-formed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: error: cannot bind non-const lvalue reference of type ‘bool&’ to a value of type ‘char*’\n    7 | while(cin>>s+1){\n      |            ~^~\nIn file included from /usr/include/c++/11/sstream:38,\n                 from /usr/include/c++/11/complex:45,\n                 from /usr/include/c++/11/ccomplex:39,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/istream:172:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(short int&) [with _CharT = char; _Traits = std::char_traits<char>]’ (near match)\n  172 |       operator>>(short& __n);\n      |       ^~~~~~~~\n/usr/include/c++/11/istream:172:7: note:   conversion of argument 1 would be ill-formed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: error: invalid conversion from ‘char*’ to ‘short int’ [-fpermissive]\n    7 | while(cin>>s+1){\n      |            ~^~\n      |             |\n      |             char*\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: error: cannot bind rvalue ‘(short int)(((char*)(& s)) + 1)’ to ‘short int&’\nIn file included from /usr/include/c++/11/sstream:38,\n                 from /usr/include/c++/11/complex:45,\n                 from /usr/include/c++/11/ccomplex:39,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/istream:175:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(short unsigned int&) [with _CharT = char; _Traits = std::char_traits<char>; std::basic_istream<_CharT, _Traits>::__istream_type = std::basic_istream<char>]’ (near match)\n  175 |       operator>>(unsigned short& __n)\n      |       ^~~~~~~~\n/usr/include/c++/11/istream:175:7: note:   conversion of argument 1 would be ill-formed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: error: invalid conversion from ‘char*’ to ‘short unsigned int’ [-fpermissive]\n    7 | while(cin>>s+1){\n      |            ~^~\n      |             |\n      |             char*\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: error: cannot bind rvalue ‘(short unsigned int)(((char*)(& s)) + 1)’ to ‘short unsigned int&’\nIn file included from /usr/include/c++/11/sstream:38,\n                 from /usr/include/c++/11/complex:45,\n                 from /usr/include/c++/11/ccomplex:39,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/istream:179:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(int&) [with _CharT = char; _Traits = std::char_traits<char>]’ (near match)\n  179 |       operator>>(int& __n);\n      |       ^~~~~~~~\n/usr/include/c++/11/istream:179:7: note:   conversion of argument 1 would be ill-formed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: error: invalid conversion from ‘char*’ to ‘int’ [-fpermissive]\n    7 | while(cin>>s+1){\n      |            ~^~\n      |             |\n      |             char*\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: error: cannot bind rvalue ‘(int)(((char*)(& s)) + 1)’ to ‘int&’\nIn file included from /usr/include/c++/11/sstream:38,\n                 from /usr/include/c++/11/complex:45,\n                 from /usr/include/c++/11/ccomplex:39,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/istream:182:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(unsigned int&) [with _CharT = char; _Traits = std::char_traits<char>; std::basic_istream<_CharT, _Traits>::__istream_type = std::basic_istream<char>]’ (near match)\n  182 |       operator>>(unsigned int& __n)\n      |       ^~~~~~~~\n/usr/include/c++/11/istream:182:7: note:   conversion of argument 1 would be ill-formed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: error: invalid conversion from ‘char*’ to ‘unsigned int’ [-fpermissive]\n    7 | while(cin>>s+1){\n      |            ~^~\n      |             |\n      |             char*\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: error: cannot bind rvalue ‘(unsigned int)(((char*)(& s)) + 1)’ to ‘unsigned int&’\nIn file included from /usr/include/c++/11/sstream:38,\n                 from /usr/include/c++/11/complex:45,\n                 from /usr/include/c++/11/ccomplex:39,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/istream:186:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long int&) [with _CharT = char; _Traits = std::char_traits<char>; std::basic_istream<_CharT, _Traits>::__istream_type = std::basic_istream<char>]’ (near match)\n  186 |       operator>>(long& __n)\n      |       ^~~~~~~~\n/usr/include/c++/11/istream:186:7: note:   conversion of argument 1 would be ill-formed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: error: invalid conversion from ‘char*’ to ‘long int’ [-fpermissive]\n    7 | while(cin>>s+1){\n      |            ~^~\n      |             |\n      |             char*\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: error: cannot bind rvalue ‘(long int)(((char*)(& s)) + 1)’ to ‘long int&’\nIn file included from /usr/include/c++/11/sstream:38,\n                 from /usr/include/c++/11/complex:45,\n                 from /usr/include/c++/11/ccomplex:39,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/istream:190:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long unsigned int&) [with _CharT = char; _Traits = std::char_traits<char>; std::basic_istream<_CharT, _Traits>::__istream_type = std::basic_istream<char>]’ (near match)\n  190 |       operator>>(unsigned long& __n)\n      |       ^~~~~~~~\n/usr/include/c++/11/istream:190:7: note:   conversion of argument 1 would be ill-formed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: error: invalid conversion from ‘char*’ to ‘long unsigned int’ [-fpermissive]\n    7 | while(cin>>s+1){\n      |            ~^~\n      |             |\n      |             char*\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: error: cannot bind rvalue ‘(long unsigned int)(((char*)(& s)) + 1)’ to ‘long unsigned int&’\nIn file included from /usr/include/c++/11/sstream:38,\n                 from /usr/include/c++/11/complex:45,\n                 from /usr/include/c++/11/ccomplex:39,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/istream:195:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long long int&) [with _CharT = char; _Traits = std::char_traits<char>; std::basic_istream<_CharT, _Traits>::__istream_type = std::basic_istream<char>]’ (near match)\n  195 |       operator>>(long long& __n)\n      |       ^~~~~~~~\n/usr/include/c++/11/istream:195:7: note:   conversion of argument 1 would be ill-formed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: error: invalid conversion from ‘char*’ to ‘long long int’ [-fpermissive]\n    7 | while(cin>>s+1){\n      |            ~^~\n      |             |\n      |             char*\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: error: cannot bind rvalue ‘(long long int)(((char*)(& s)) + 1)’ to ‘long long int&’\nIn file included from /usr/include/c++/11/sstream:38,\n                 from /usr/include/c++/11/complex:45,\n                 from /usr/include/c++/11/ccomplex:39,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/istream:199:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long long unsigned int&) [with _CharT = char; _Traits = std::char_traits<char>; std::basic_istream<_CharT, _Traits>::__istream_type = std::basic_istream<char>]’ (near match)\n  199 |       operator>>(unsigned long long& __n)\n      |       ^~~~~~~~\n/usr/include/c++/11/istream:199:7: note:   conversion of argument 1 would be ill-formed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: error: invalid conversion from ‘char*’ to ‘long long unsigned int’ [-fpermissive]\n    7 | while(cin>>s+1){\n      |            ~^~\n      |             |\n      |             char*\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: error: cannot bind rvalue ‘(long long unsigned int)(((char*)(& s)) + 1)’ to ‘long long unsigned int&’\nIn file included from /usr/include/c++/11/sstream:38,\n                 from /usr/include/c++/11/complex:45,\n                 from /usr/include/c++/11/ccomplex:39,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/istream:235:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(void*&) [with _CharT = char; _Traits = std::char_traits<char>; std::basic_istream<_CharT, _Traits>::__istream_type = std::basic_istream<char>]’ (near match)\n  235 |       operator>>(void*& __p)\n      |       ^~~~~~~~\n/usr/include/c++/11/istream:235:7: note:   conversion of argument 1 would be ill-formed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: error: cannot bind non-const lvalue reference of type ‘void*&’ to an rvalue of type ‘void*’\n    7 | while(cin>>s+1){\n      |            ~^~\nIn file included from /usr/include/c++/11/sstream:38,\n                 from /usr/include/c++/11/complex:45,\n                 from /usr/include/c++/11/ccomplex:39,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/istream:120:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(std::basic_istream<_CharT, _Traits>::__istream_type& (*)(std::basic_istream<_CharT, _Traits>::__istream_type&)) [with _CharT = char; _Traits = std::char_traits<char>; std::basic_istream<_CharT, _Traits>::__istream_type = std::basic_istream<char>]’\n  120 |       operator>>(__istream_type& (*__pf)(__istream_type&))\n      |       ^~~~~~~~\n/usr/include/c++/11/istream:120:36: note:   no known conversion for argument 1 from ‘char*’ to ‘std::basic_istream<char>::__istream_type& (*)(std::basic_istream<char>::__istream_type&)’ {aka ‘std::basic_istream<char>& (*)(std::basic_istream<char>&)’}\n  120 |       operator>>(__istream_type& (*__pf)(__istream_type&))\n      |                  ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~\n/usr/include/c++/11/istream:124:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(std::basic_istream<_CharT, _Traits>::__ios_type& (*)(std::basic_istream<_CharT, _Traits>::__ios_type&)) [with _CharT = char; _Traits = std::char_traits<char>; std::basic_istream<_CharT, _Traits>::__istream_type = std::basic_istream<char>; std::basic_istream<_CharT, _Traits>::__ios_type = std::basic_ios<char>]’\n  124 |       operator>>(__ios_type& (*__pf)(__ios_type&))\n      |       ^~~~~~~~\n/usr/include/c++/11/istream:124:32: note:   no known conversion for argument 1 from ‘char*’ to ‘std::basic_istream<char>::__ios_type& (*)(std::basic_istream<char>::__ios_type&)’ {aka ‘std::basic_ios<char>& (*)(std::basic_ios<char>&)’}\n  124 |       operator>>(__ios_type& (*__pf)(__ios_type&))\n      |                  ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~\n/usr/include/c++/11/istream:131:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(std::ios_base& (*)(std::ios_base&)) [with _CharT = char; _Traits = std::char_traits<char>; std::basic_istream<_CharT, _Traits>::__istream_type = std::basic_istream<char>]’\n  131 |       operator>>(ios_base& (*__pf)(ios_base&))\n      |       ^~~~~~~~\n/usr/include/c++/11/istream:131:30: note:   no known conversion for argument 1 from ‘char*’ to ‘std::ios_base& (*)(std::ios_base&)’\n  131 |       operator>>(ios_base& (*__pf)(ios_base&))\n      |                  ~~~~~~~~~~~~^~~~~~~~~~~~~~~~\n/usr/include/c++/11/istream:214:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(float&) [with _CharT = char; _Traits = std::char_traits<char>; std::basic_istream<_CharT, _Traits>::__istream_type = std::basic_istream<char>]’\n  214 |       operator>>(float& __f)\n      |       ^~~~~~~~\n/usr/include/c++/11/istream:214:25: note:   no known conversion for argument 1 from ‘char*’ to ‘float&’\n  214 |       operator>>(float& __f)\n      |                  ~~~~~~~^~~\n/usr/include/c++/11/istream:218:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(double&) [with _CharT = char; _Traits = std::char_traits<char>; std::basic_istream<_CharT, _Traits>::__istream_type = std::basic_istream<char>]’\n  218 |       operator>>(double& __f)\n      |       ^~~~~~~~\n/usr/include/c++/11/istream:218:26: note:   no known conversion for argument 1 from ‘char*’ to ‘double&’\n  218 |       operator>>(double& __f)\n      |                  ~~~~~~~~^~~\n/usr/include/c++/11/istream:222:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long double&) [with _CharT = char; _Traits = std::char_traits<char>; std::basic_istream<_CharT, _Traits>::__istream_type = std::basic_istream<char>]’\n  222 |       operator>>(long double& __f)\n      |       ^~~~~~~~\n/usr/include/c++/11/istream:222:31: note:   no known conversion for argument 1 from ‘char*’ to ‘long double&’\n  222 |       operator>>(long double& __f)\n      |                  ~~~~~~~~~~~~~^~~\n/usr/include/c++/11/istream:259:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(std::basic_istream<_CharT, _Traits>::__streambuf_type*) [with _CharT = char; _Traits = std::char_traits<char>; std::basic_istream<_CharT, _Traits>::__streambuf_type = std::basic_streambuf<char>]’\n  259 |       operator>>(__streambuf_type* __sb);\n      |       ^~~~~~~~\n/usr/include/c++/11/istream:259:36: note:   no known conversion for argument 1 from ‘char*’ to ‘std::basic_istream<char>::__streambuf_type*’ {aka ‘std::basic_streambuf<char>*’}\n  259 |       operator>>(__streambuf_type* __sb);\n      |                  ~~~~~~~~~~~~~~~~~~^~~~\nIn file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:45,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/cstddef:132:5: note: candidate: ‘template<class _IntegerType> constexpr std::__byte_op_t<_IntegerType> std::operator>>(std::byte, _IntegerType)’\n  132 |     operator>>(byte __b, _IntegerType __shift) noexcept\n      |     ^~~~~~~~\n/usr/include/c++/11/cstddef:132:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:7: note:   cannot convert ‘std::cin’ (type ‘std::istream’ {aka ‘std::basic_istream<char>’}) to type ‘std::byte’\n    7 | while(cin>>s+1){\n      |       ^~~\nIn file included from /usr/include/c++/11/string:56,\n                 from /usr/include/c++/11/bits/locale_classes.h:40,\n                 from /usr/include/c++/11/bits/ios_base.h:41,\n                 from /usr/include/c++/11/ios:42,\n                 from /usr/include/c++/11/istream:38,\n                 from /usr/include/c++/11/sstream:38,\n                 from /usr/include/c++/11/complex:45,\n                 from /usr/include/c++/11/ccomplex:39,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/basic_string.tcc:1485:5: note: candidate: ‘template<class _CharT, class _Traits, class _Alloc> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::__cxx11::basic_string<_CharT, _Traits, _Allocator>&)’\n 1485 |     operator>>(basic_istream<_CharT, _Traits>& __in,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/basic_string.tcc:1485:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::__cxx11::basic_string<_CharT, _Traits, _Allocator>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/istream:1016,\n                 from /usr/include/c++/11/sstream:38,\n                 from /usr/include/c++/11/complex:45,\n                 from /usr/include/c++/11/ccomplex:39,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/istream.tcc:958:5: note: candidate: ‘template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, _CharT&)’\n  958 |     operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c)\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/istream.tcc:958:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   deduced conflicting types for parameter ‘_CharT’ (‘char’ and ‘char*’)\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/sstream:38,\n                 from /usr/include/c++/11/complex:45,\n                 from /usr/include/c++/11/ccomplex:39,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/istream:756:5: note: candidate: ‘template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(std::basic_istream<char, _Traits>&, unsigned char&)’\n  756 |     operator>>(basic_istream<char, _Traits>& __in, unsigned char& __c)\n      |     ^~~~~~~~\n/usr/include/c++/11/istream:756:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: note:   cannot convert ‘(((char*)(& s)) + 1)’ (type ‘char*’) to type ‘unsigned char&’\n    7 | while(cin>>s+1){\n      |            ~^~\nIn file included from /usr/include/c++/11/sstream:38,\n                 from /usr/include/c++/11/complex:45,\n                 from /usr/include/c++/11/ccomplex:39,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/istream:761:5: note: candidate: ‘template<class _Traits> std::basic_istream<char, _Traits>& std::operator>>(std::basic_istream<char, _Traits>&, signed char&)’\n  761 |     operator>>(basic_istream<char, _Traits>& __in, signed char& __c)\n      |     ^~~~~~~~\n/usr/include/c++/11/istream:761:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: note:   cannot convert ‘(((char*)(& s)) + 1)’ (type ‘char*’) to type ‘signed char&’\n    7 | while(cin>>s+1){\n      |            ~^~\nIn file included from /usr/include/c++/11/sstream:38,\n                 from /usr/include/c++/11/complex:45,\n                 from /usr/include/c++/11/ccomplex:39,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/istream:859:5: note: candidate: ‘template<class _CharT, class _Traits, long unsigned int _Num> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, _CharT (&)[_Num])’\n  859 |     operator>>(basic_istream<_CharT, _Traits>& __in, _CharT (&__s)[_Num])\n      |     ^~~~~~~~\n/usr/include/c++/11/istream:859:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘_CharT [_Num]’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/sstream:38,\n                 from /usr/include/c++/11/complex:45,\n                 from /usr/include/c++/11/ccomplex:39,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/istream:868:5: note: candidate: ‘template<class _Traits, long unsigned int _Num> std::basic_istream<char, _Traits>& std::operator>>(std::basic_istream<char, _Traits>&, unsigned char (&)[_Num])’\n  868 |     operator>>(basic_istream<char, _Traits>& __in, unsigned char (&__s)[_Num])\n      |     ^~~~~~~~\n/usr/include/c++/11/istream:868:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘unsigned char [_Num]’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/sstream:38,\n                 from /usr/include/c++/11/complex:45,\n                 from /usr/include/c++/11/ccomplex:39,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/istream:873:5: note: candidate: ‘template<class _Traits, long unsigned int _Num> std::basic_istream<char, _Traits>& std::operator>>(std::basic_istream<char, _Traits>&, signed char (&)[_Num])’\n  873 |     operator>>(basic_istream<char, _Traits>& __in, signed char (&__s)[_Num])\n      |     ^~~~~~~~\n/usr/include/c++/11/istream:873:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘signed char [_Num]’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/sstream:38,\n                 from /usr/include/c++/11/complex:45,\n                 from /usr/include/c++/11/ccomplex:39,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/istream:1006:5: note: candidate: ‘template<class _Istream, class _Tp> _Istream&& std::operator>>(_Istream&&, _Tp&&)’\n 1006 |     operator>>(_Istream&& __is, _Tp&& __x)\n      |     ^~~~~~~~\n/usr/include/c++/11/istream:1006:5: note:   template argument deduction/substitution failed:\n/usr/include/c++/11/istream: In substitution of ‘template<class _Istream, class _Tp> _Istream&& std::operator>>(_Istream&&, _Tp&&) [with _Istream = std::basic_istream<char>&; _Tp = char*]’:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14:   required from here\n/usr/include/c++/11/istream:1006:5: error: template constraint failure for ‘template<class _Is, class _Tp>  requires (__derived_from_ios_base<_Is>) && requires(_Is& __is, _Tp&& __t) {__is >> (forward<_Tp>)(__t);} using __rvalue_stream_extraction_t = _Is&&’\n/usr/include/c++/11/istream:1006:5: note: constraints not satisfied\nIn file included from /usr/include/c++/11/istream:39,\n                 from /usr/include/c++/11/sstream:38,\n                 from /usr/include/c++/11/complex:45,\n                 from /usr/include/c++/11/ccomplex:39,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/ostream: In substitution of ‘template<class _Is, class _Tp>  requires (__derived_from_ios_base<_Is>) && requires(_Is& __is, _Tp&& __t) {__is >> (forward<_Tp>)(__t);} using __rvalue_stream_extraction_t = _Is&& [with _Is = std::basic_istream<char>&; _Tp = char*]’:\n/usr/include/c++/11/istream:1006:5:   required by substitution of ‘template<class _Istream, class _Tp> _Istream&& std::operator>>(_Istream&&, _Tp&&) [with _Istream = std::basic_istream<char>&; _Tp = char*]’\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14:   required from here\n/usr/include/c++/11/ostream:717:13:   required for the satisfaction of ‘__derived_from_ios_base<_Is>’ [with _Is = std::basic_istream<char, std::char_traits<char> >&]\n/usr/include/c++/11/ostream:717:39: note: the expression ‘is_class_v<_Tp> [with _Tp = std::basic_istream<char, std::char_traits<char> >&]’ evaluated to ‘false’\n  717 |     concept __derived_from_ios_base = is_class_v<_Tp>\n      |                                       ^~~~~~~~~~~~~~~\nIn file included from /usr/include/c++/11/ccomplex:39,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/complex:501:5: note: candidate: ‘template<class _Tp, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::complex<_Tp>&)’\n  501 |     operator>>(basic_istream<_CharT, _Traits>& __is, complex<_Tp>& __x)\n      |     ^~~~~~~~\n/usr/include/c++/11/complex:501:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::complex<_Tp>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:66,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bitset:1472:5: note: candidate: ‘template<class _CharT, class _Traits, long unsigned int _Nb> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::bitset<_Nb>&)’\n 1472 |     operator>>(std::basic_istream<_CharT, _Traits>& __is, bitset<_Nb>& __x)\n      |     ^~~~~~~~\n/usr/include/c++/11/bitset:1472:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::bitset<_Nb>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:72,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/iomanip:71:5: note: candidate: ‘template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::_Resetiosflags)’\n   71 |     operator>>(basic_istream<_CharT, _Traits>& __is, _Resetiosflags __f)\n      |     ^~~~~~~~\n/usr/include/c++/11/iomanip:71:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: note:   cannot convert ‘(((char*)(& s)) + 1)’ (type ‘char*’) to type ‘std::_Resetiosflags’\n    7 | while(cin>>s+1){\n      |            ~^~\nIn file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:72,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/iomanip:101:5: note: candidate: ‘template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::_Setiosflags)’\n  101 |     operator>>(basic_istream<_CharT, _Traits>& __is, _Setiosflags __f)\n      |     ^~~~~~~~\n/usr/include/c++/11/iomanip:101:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: note:   cannot convert ‘(((char*)(& s)) + 1)’ (type ‘char*’) to type ‘std::_Setiosflags’\n    7 | while(cin>>s+1){\n      |            ~^~\nIn file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:72,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/iomanip:132:5: note: candidate: ‘template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::_Setbase)’\n  132 |     operator>>(basic_istream<_CharT, _Traits>& __is, _Setbase __f)\n      |     ^~~~~~~~\n/usr/include/c++/11/iomanip:132:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: note:   cannot convert ‘(((char*)(& s)) + 1)’ (type ‘char*’) to type ‘std::_Setbase’\n    7 | while(cin>>s+1){\n      |            ~^~\nIn file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:72,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/iomanip:170:5: note: candidate: ‘template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::_Setfill<_CharT>)’\n  170 |     operator>>(basic_istream<_CharT, _Traits>& __is, _Setfill<_CharT> __f)\n      |     ^~~~~~~~\n/usr/include/c++/11/iomanip:170:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::_Setfill<_CharT>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:72,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/iomanip:200:5: note: candidate: ‘template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::_Setprecision)’\n  200 |     operator>>(basic_istream<_CharT, _Traits>& __is, _Setprecision __f)\n      |     ^~~~~~~~\n/usr/include/c++/11/iomanip:200:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: note:   cannot convert ‘(((char*)(& s)) + 1)’ (type ‘char*’) to type ‘std::_Setprecision’\n    7 | while(cin>>s+1){\n      |            ~^~\nIn file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:72,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/iomanip:230:5: note: candidate: ‘template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::_Setw)’\n  230 |     operator>>(basic_istream<_CharT, _Traits>& __is, _Setw __f)\n      |     ^~~~~~~~\n/usr/include/c++/11/iomanip:230:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: note:   cannot convert ‘(((char*)(& s)) + 1)’ (type ‘char*’) to type ‘std::_Setw’\n    7 | while(cin>>s+1){\n      |            ~^~\nIn file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:72,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/iomanip:264:5: note: candidate: ‘template<class _CharT, class _Traits, class _MoneyT> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::_Get_money<_MoneyT>)’\n  264 |     operator>>(basic_istream<_CharT, _Traits>& __is, _Get_money<_MoneyT> __f)\n      |     ^~~~~~~~\n/usr/include/c++/11/iomanip:264:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::_Get_money<_MoneyT>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:72,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/iomanip:418:5: note: candidate: ‘template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::_Get_time<_CharT>)’\n  418 |     operator>>(basic_istream<_CharT, _Traits>& __is, _Get_time<_CharT> __f)\n      |     ^~~~~~~~\n/usr/include/c++/11/iomanip:418:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::_Get_time<_CharT>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/valarray:603,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/valarray_after.h:414:5: note: candidate: ‘template<class _Dom1, class _Dom2> std::_Expr<std::__detail::_BinClos<std::__shift_right, std::_Expr, std::_Expr, _Dom1, _Dom2>, typename std::__fun<std::__shift_right, typename _Dom1::value_type>::result_type> std::operator>>(const std::_Expr<_Dom1, typename _Dom1::value_type>&, const std::_Expr<_Dom2, typename _Dom2::value_type>&)’\n  414 |     _DEFINE_EXPR_BINARY_OPERATOR(>>, struct std::__shift_right)\n      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~\n/usr/include/c++/11/bits/valarray_after.h:414:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   ‘std::istream’ {aka ‘std::basic_istream<char>’} is not derived from ‘const std::_Expr<_Dom1, typename _Dom1::value_type>’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/valarray:603,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/valarray_after.h:414:5: note: candidate: ‘template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__shift_right, std::_Expr, std::_Constant, _Dom, typename _Dom::value_type>, typename std::__fun<std::__shift_right, typename _Dom1::value_type>::result_type> std::operator>>(const std::_Expr<_Dom1, typename _Dom1::value_type>&, const typename _Dom::value_type&)’\n  414 |     _DEFINE_EXPR_BINARY_OPERATOR(>>, struct std::__shift_right)\n      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~\n/usr/include/c++/11/bits/valarray_after.h:414:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   ‘std::istream’ {aka ‘std::basic_istream<char>’} is not derived from ‘const std::_Expr<_Dom1, typename _Dom1::value_type>’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/valarray:603,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/valarray_after.h:414:5: note: candidate: ‘template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__shift_right, std::_Constant, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__shift_right, typename _Dom1::value_type>::result_type> std::operator>>(const typename _Dom::value_type&, const std::_Expr<_Dom1, typename _Dom1::value_type>&)’\n  414 |     _DEFINE_EXPR_BINARY_OPERATOR(>>, struct std::__shift_right)\n      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~\n/usr/include/c++/11/bits/valarray_after.h:414:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘const std::_Expr<_Dom1, typename _Dom1::value_type>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/valarray:603,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/valarray_after.h:414:5: note: candidate: ‘template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__shift_right, std::_Expr, std::_ValArray, _Dom, typename _Dom::value_type>, typename std::__fun<std::__shift_right, typename _Dom1::value_type>::result_type> std::operator>>(const std::_Expr<_Dom1, typename _Dom1::value_type>&, const std::valarray<typename _Dom::value_type>&)’\n  414 |     _DEFINE_EXPR_BINARY_OPERATOR(>>, struct std::__shift_right)\n      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~\n/usr/include/c++/11/bits/valarray_after.h:414:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   ‘std::istream’ {aka ‘std::basic_istream<char>’} is not derived from ‘const std::_Expr<_Dom1, typename _Dom1::value_type>’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/valarray:603,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/valarray_after.h:414:5: note: candidate: ‘template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__shift_right, std::_ValArray, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__shift_right, typename _Dom1::value_type>::result_type> std::operator>>(const std::valarray<typename _Dom::value_type>&, const std::_Expr<_Dom1, typename _Dom1::value_type>&)’\n  414 |     _DEFINE_EXPR_BINARY_OPERATOR(>>, struct std::__shift_right)\n      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~\n/usr/include/c++/11/bits/valarray_after.h:414:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘const std::_Expr<_Dom1, typename _Dom1::value_type>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/valarray:1195:1: note: candidate: ‘template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__shift_right, std::_ValArray, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__shift_right, _Tp>::result_type> std::operator>>(const std::valarray<_Tp>&, const std::valarray<_Tp>&)’\n 1195 | _DEFINE_BINARY_OPERATOR(>>, __shift_right)\n      | ^~~~~~~~~~~~~~~~~~~~~~~\n/usr/include/c++/11/valarray:1195:1: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   ‘std::istream’ {aka ‘std::basic_istream<char>’} is not derived from ‘const std::valarray<_Tp>’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/valarray:1195:1: note: candidate: ‘template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__shift_right, std::_ValArray, std::_Constant, _Tp, _Tp>, typename std::__fun<std::__shift_right, _Tp>::result_type> std::operator>>(const std::valarray<_Tp>&, const typename std::valarray<_Tp>::value_type&)’\n 1195 | _DEFINE_BINARY_OPERATOR(>>, __shift_right)\n      | ^~~~~~~~~~~~~~~~~~~~~~~\n/usr/include/c++/11/valarray:1195:1: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   ‘std::istream’ {aka ‘std::basic_istream<char>’} is not derived from ‘const std::valarray<_Tp>’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/valarray:1195:1: note: candidate: ‘template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__shift_right, std::_Constant, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__shift_right, _Tp>::result_type> std::operator>>(const typename std::valarray<_Tp>::value_type&, const std::valarray<_Tp>&)’\n 1195 | _DEFINE_BINARY_OPERATOR(>>, __shift_right)\n      | ^~~~~~~~~~~~~~~~~~~~~~~\n/usr/include/c++/11/valarray:1195:1: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘const std::valarray<_Tp>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:921:5: note: candidate: ‘template<class _IntType, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::uniform_int_distribution<_IntType>&)’\n  921 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:921:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::uniform_int_distribution<_IntType>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:982:5: note: candidate: ‘template<class _RealType, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::uniform_real_distribution<_IntType>&)’\n  982 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:982:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::uniform_real_distribution<_IntType>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:2167:5: note: candidate: ‘template<class _RealType, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::cauchy_distribution<_RealType>&)’\n 2167 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:2167:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::cauchy_distribution<_RealType>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:49,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.h:3722:5: note: candidate: ‘template<class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::bernoulli_distribution&)’\n 3722 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.h:3722:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:13: note:   cannot convert ‘(((char*)(& s)) + 1)’ (type ‘char*’) to type ‘std::bernoulli_distribution&’\n    7 | while(cin>>s+1){\n      |            ~^~\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:1124:5: note: candidate: ‘template<class _IntType, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::geometric_distribution<_IntType>&)’\n 1124 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:1124:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::geometric_distribution<_IntType>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:1775:5: note: candidate: ‘template<class _RealType, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::exponential_distribution<_RealType>&)’\n 1775 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:1775:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::exponential_distribution<_RealType>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:2561:5: note: candidate: ‘template<class _RealType, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::weibull_distribution<_RealType>&)’\n 2561 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:2561:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::weibull_distribution<_RealType>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:2635:5: note: candidate: ‘template<class _RealType, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::extreme_value_distribution<_RealType>&)’\n 2635 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:2635:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::extreme_value_distribution<_RealType>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:175:5: note: candidate: ‘template<class _UIntType, _UIntType __a, _UIntType __c, _UIntType __m, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::linear_congruential_engine<_UIntType, __a, __c, __m>&)’\n  175 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:175:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::linear_congruential_engine<_UIntType, __a, __c, __m>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:501:5: note: candidate: ‘template<class _UIntType1, long unsigned int __w1, long unsigned int __n1, long unsigned int __m1, long unsigned int __r1, _UIntType1 __a1, long unsigned int __u1, _UIntType1 __d1, long unsigned int __s1, _UIntType1 __b1, long unsigned int __t1, _UIntType1 __c1, long unsigned int __l1, _UIntType1 __f1, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>&)’\n  501 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:501:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:652:5: note: candidate: ‘template<class _UIntType, long unsigned int __w, long unsigned int __s, long unsigned int __r, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::subtract_with_carry_engine<_UIntType, __w, __s, __r>&)’\n  652 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:652:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::subtract_with_carry_engine<_UIntType, __w, __s, __r>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:718:5: note: candidate: ‘template<class _RandomNumberEngine, long unsigned int __p, long unsigned int __r, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::discard_block_engine<_RandomNumberEngine, __p, __r>&)’\n  718 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:718:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::discard_block_engine<_RandomNumberEngine, __p, __r>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:881:5: note: candidate: ‘template<class _RandomNumberEngine, long unsigned int __k, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::shuffle_order_engine<_RandomNumberEngine, __k>&)’\n  881 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:881:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::shuffle_order_engine<_RandomNumberEngine, __k>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:1239:5: note: candidate: ‘template<class _IntType, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::negative_binomial_distribution<_IntType>&)’\n 1239 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:1239:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::negative_binomial_distribution<_IntType>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:1449:5: note: candidate: ‘template<class _IntType, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::poisson_distribution<_IntType>&)’\n 1449 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:1449:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::poisson_distribution<_IntType>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:1716:5: note: candidate: ‘template<class _IntType, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::binomial_distribution<_IntType>&)’\n 1716 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:1716:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::binomial_distribution<_IntType>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:1945:5: note: candidate: ‘template<class _RealType1, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::normal_distribution<_RealType>&)’\n 1945 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:1945:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::normal_distribution<_RealType>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:2010:5: note: candidate: ‘template<class _RealType, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::lognormal_distribution<_RealType>&)’\n 2010 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:2010:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::lognormal_distribution<_RealType>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:2081:5: note: candidate: ‘template<class _RealType, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::chi_squared_distribution<_RealType>&)’\n 2081 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:2081:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::chi_squared_distribution<_RealType>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:2243:5: note: candidate: ‘template<class _RealType, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::fisher_f_distribution<_RealType>&)’\n 2243 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:2243:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::fisher_f_distribution<_RealType>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:2316:5: note: candidate: ‘template<class _RealType, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::student_t_distribution<_RealType>&)’\n 2316 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:2316:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::student_t_distribution<_RealType>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:2486:5: note: candidate: ‘template<class _RealType1, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::gamma_distribution<_RealType>&)’\n 2486 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:2486:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::gamma_distribution<_RealType>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:2794:5: note: candidate: ‘template<class _IntType, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::discrete_distribution<_IntType>&)’\n 2794 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:2794:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::discrete_distribution<_IntType>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:3001:5: note: candidate: ‘template<class _RealType, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::piecewise_constant_distribution<_RealType>&)’\n 3001 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:3001:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::piecewise_constant_distribution<_RealType>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\nIn file included from /usr/include/c++/11/random:51,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:108,\n                 from /tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:1:\n/usr/include/c++/11/bits/random.tcc:3207:5: note: candidate: ‘template<class _RealType, class _CharT, class _Traits> std::basic_istream<_CharT, _Traits>& std::operator>>(std::basic_istream<_CharT, _Traits>&, std::piecewise_linear_distribution<_RealType>&)’\n 3207 |     operator>>(std::basic_istream<_CharT, _Traits>& __is,\n      |     ^~~~~~~~\n/usr/include/c++/11/bits/random.tcc:3207:5: note:   template argument deduction/substitution failed:\n/tmp/tmp4_jrs3yu/a52dab64-79a6-4b0e-84fb-362275c9a052.cpp:7:14: note:   mismatched types ‘std::piecewise_linear_distribution<_RealType>’ and ‘char*’\n    7 | while(cin>>s+1){\n      |              ^\n"
        ],
        "tcb_id": "Power Strings"
    },
    {
        "code_id": 3,
        "code": "#include <unordered_map>\r\n#include <unordered_set>\r\n#include <functional>\r\n#include <algorithm>\r\n#include <iostream>\r\n#include <complex>\r\n#include <cstdlib>\r\n#include <cstring>\r\n#include <cassert>\r\n#include <climits>\r\n#include <iomanip>\r\n#include <bitset>\r\n#include <vector>\r\n#include <cstdio>\r\n#include <cmath>\r\n#include <queue>\r\n#include <deque>\r\n#include <stack>\r\n#include <ctime>\r\n#include <set>\r\n#include <map>\r\nusing namespace std;\r\n#define il inline\r\n#define elif else if\r\n\r\n// Type\r\n#define ld double\r\n#define ll long long\r\n#define ull unsigned ll\r\n\r\n// Vector\r\n#define vc vector\r\n#define Pb push_back\r\n#define Pf push_front\r\n#define All(x) x.begin(),x.end()\r\n\r\n// Memory\r\n#define Ms(_data) memset(_data,0,sizeof(_data))\r\n#define Msn(_data,_num) memset(_data,_num,sizeof(_data))\r\n\r\n// Template\r\n#define _cl class\r\n#define _tp template\r\n#define _tyn typename\r\n\r\n// Pair\r\n#define Mp make_pair\r\n#define F first\r\n#define S second\r\n#define pii pair<int,int>\r\n#define pli pair<ll,int>\r\n#define pil pair<int,ll>\r\n#define pll pair<ll,ll>\r\n\r\n// Read\r\nstruct InputReader{\r\n\t#define bs 1000001\r\n\tchar buf[bs]; int p;\r\n\til InputReader(){ p = bs; }\r\n\til void Flush(){ p = 0; fread(buf,1,bs,stdin); }\r\n\til char C(){ if(p >= bs) Flush(); return buf[p++]; }\r\n\til char Readnum(){ char ch = C(); while( !isdigit(ch) && ch != '-' ) ch = C(); return ch; }\r\n\til void Readalpha( char &c ){ c = C(); while( !isalpha(c) ) c = C(); }\r\n\tint operator() (){\r\n\t\tint ans = 0, fu = 1; char ch = Readnum();\r\n\t\tif( ch == '-' ) fu = -1, ch = C();\r\n\t\twhile( ch >= '0' && ch <= '9' ){\r\n\t\t\tans = ans*10 + ch-'0';\r\n\t\t\tch = C();\r\n\t\t}\r\n\t\treturn ans * fu;\r\n\t}\r\n\tll Readll(){\r\n\t\tll ans = 0LL, fu = 1LL; char ch = Readnum();\r\n\t\tif( ch == '-' ) fu = -1LL, ch = C();\r\n\t\twhile( ch >= '0' && ch <= '9' ){\r\n\t\t\tans = ans*10LL + ch-'0';\r\n\t\t\tch = C();\r\n\t\t}\r\n\t\treturn ans * fu;\r\n\t}\r\n\til void Readstring( string &x ){\r\n\t\tx.clear(); char ch = C();\r\n\t\twhile( !isdigit(ch)  &&  !isalpha(ch)  &&  ch != '#'  &&  ch != '.' ) ch = C();\r\n\t\twhile( isdigit(ch)  ||  isalpha(ch)  ||  ch == '#'  ||  ch == '.' ){\r\n\t\t\tx += ch;\r\n\t\t\tch = C();\r\n\t\t}\r\n\t}\r\n\til void Readchstring( char s[] ){\r\n\t\tint len = 0; char ch = C();\r\n\t\twhile( !isdigit(ch)  &&  !isalpha(ch)  /*&&  ch != '*'  &&  ch != '?'*/ ) ch = C();\r\n\t\twhile( isdigit(ch)  ||  isalpha(ch)  /*||  ch == '*'  ||  ch == '?'*/ ){\r\n\t\t\ts[len++] = ch;\r\n\t\t\tch = C();\r\n\t\t}\r\n\t\ts[len] = '\\0';\r\n\t}\r\n\til void Specialread( char &c ){\r\n\t\tc = C();\r\n\t\twhile( !isdigit(c) && !isalpha(c) && c != '#'  &&  c != '>'  &&  c != '='  &&  c != '<' ) c = C();\r\n\t}\r\n\t#undef bs\r\n}In;\r\nil void Read( int &x ){ x = In(); }\r\nil void Read( int &x, int &y ){ x = In(); y = In(); }\r\nil void Read( int &x1 , int &x2 , int &x3 ){ x1 = In(); x2 = In(); x3 = In(); }\r\nil void Read( int &x1 , int &x2 , int &x3 , int &x4 ){ x1 = In(); x2 = In(); x3 = In(); x4 = In(); }\r\nil void Read( ll &x ){ x = In.Readll(); }\r\nil void Read( ll &x, ll &y ){ x = In.Readll(); y = In.Readll(); }\r\nil void Read( ll &x1 , ll &x2 , ll &x3 ){ x1 = In.Readll(); x2 = In.Readll(); x3 = In.Readll(); }\r\nil void Read( ll &x1 , ll &x2 , ll &x3 , ll &x4 ){ x1 = In.Readll(); x2 = In.Readll(); x3 = In.Readll(); x4 = In.Readll(); }\r\n#define iRead(k) int k; Read(k);\r\n#define iRead2(a,b) iRead(a); iRead(b);\r\n#define iRead3(a,b,c) iRead2(a,b); iRead(c);\r\n#define iRead4(a,b,c,d) iRead2(a,b); iRead2(c,d);\r\n#define lRead(k) ll k; Read(k);\r\n#define lRead2(a,b) lRead(a); lRead(b);\r\n#define lRead3(a,b,c) lRead2(a,b); lRead(c);\r\n#define lRead4(a,b,c,d) lRead2(a,b); lRead2(c,d);\r\n\r\n// File\r\nil void FILEIO(){\r\n\t#ifdef intLSY\r\n\t\tFin(\"in.in\");\r\n\t#endif\r\n}\r\nil void FILEIO( string pname ){\r\n\tFin((pname+\".in\").c_str());\r\n\t#ifndef intLSY\r\n\t\tFout((pname+\".out\").c_str());\r\n\t#endif\r\n}\r\nvoid Printtime(){\r\n\t#ifdef intLSY\r\n\t\tdouble _timeuse = clock()* 1000.0 / CLOCKS_PER_SEC;\r\n\t\tprintf(\"\\n\\nTime usage:\\n%.0lf ms\\n\",_timeuse);\r\n\t#endif\r\n}\r\nvoid END(){ Printtime(); exit(0); }\r\n_tp<_tyn T>void END( T mes ){ cout << mes << endl; END(); }\r\n\r\n\r\n// Loop\r\n#define For(i,j) for( int (i) = 1 ; (i) <= (j) ; ++(i) )\r\n#define For0(i,j) for( int (i) = 0 ; (i) < (j) ; ++(i) )\r\n#define Forx(i,j,k) for( int (i) = (j) ; (i) <= (k) ; ++(i) )\r\n#define Forstep(i,j,k,st) for( int (i) = (j) ; (i) <= (k) ; (i) += (st) )\r\n#define fOR(i,j) for( int (i) = (j) ; (i) >= 1 ; --(i) )\r\n#define fOR0(i,j) for( int (i) = (j)-1 ; (i) >= 0 ; --(i) )\r\n#define fORx(i,j,k) for( int (i) = (k) ; (i) >= (j) ; --(i) )\r\n\r\n\r\n// Debug\r\n#define B cerr << \"BreakPoint\" << endl;\r\n#define O(x) cerr << #x << \" \" << x << endl;\r\n#define O_(x) cerr << #x << \" \" << x << \"  \";\r\n#define ERR(x) cerr << \"ERR! #\" << x << endl;\r\n#define Msz(x) cerr << \"Sizeof \" << #x << \" \" << sizeof(x)/1024/1024 << \" MB\" << endl;\r\n_tp<_tyn T>void Print( T a[] , int s , int t , char sp = ' ' , char ed = '\\n' ){\r\n\tif( s > t ) return;\r\n\tfor( int i = s ; i < t ; i++ )\r\n\t\tcout << a[i] << sp;\r\n\tcout << a[t] << ed;\r\n\tcout.flush();\r\n}\r\n_tp<_tyn T>void Print( T a , int s = 0 , int t = -1 , char sp = ' ' , char ed = '\\n' ){\r\n\tif( t == -1 ) t = a.size()-1;\r\n\tfor( int i = s ; i <= t ; i++ )\r\n\t\tcout << a[i] << sp;\r\n\tcout << ed;\r\n\tcout.flush();\r\n}\r\n\r\n\r\n// Optimize\r\n#define abs(a) ((a)<0?(~(a)+1):(a))\r\n#define max(a,b) ((a)>(b)?(a):(b))\r\n#define min(a,b) ((a)<(b)?(a):(b))\r\n//#define swap(a,b) {a=a^b;b=a^b;a=a^b;}\r\n#define Mymax(a,b) (a) = max((a),(b))\r\n#define Mymin(a,b) (a) = min((a),(b))\r\n#define INF (0x3f3f3f3f)\r\n#define LINF ((long long)(0x3f3f3f3f3f3f3f3f))\r\nvoid USACO( string pname ){\r\n    #ifdef intLSY\r\n        Fin(\"in.in\");\r\n    #else\r\n        \r\n    #endif\r\n}\r\n#define Eps ((ld)(1e-8))\r\nconst int dx4[] = {0,-1,0,1};\r\nconst int dy4[] = {-1,0,1,0};\r\n///////////////////////////////////////////////////////////////////////////////////////\r\n///////////////////////////////////////////////////////////////////////////////////////\r\n#define MAXN 1500010\r\n\r\nint n,qu;\r\nvc<int> e[MAXN];\r\nint inp[MAXN];\r\n\r\nint fa[MAXN], sz[MAXN], gson[MAXN];\r\nvoid Findgson( int pos , int father ){\r\n\tfa[pos] = father;\r\n\tsz[pos] = 1;\r\n\tfor( auto v : e[pos] ){\r\n\t\tFindgson(v,pos);\r\n\t\tsz[pos] += sz[v];\r\n\t\tif( sz[gson[pos]] < sz[v] )\r\n\t\t\tgson[pos] = v;\r\n\t}\r\n}\r\n\r\nint top[MAXN], in[MAXN], whoin[MAXN], nowtime = 0, ed[MAXN];\r\nvoid Linkline( int pos , int father , int top ){\r\n\t::top[pos] = top;\r\n\ted[top] = pos;\r\n\tin[pos] = ++nowtime;\r\n\twhoin[in[pos]] = pos;\r\n\tif(gson[pos]) Linkline(gson[pos],pos,top);\r\n\tfor( auto v : e[pos] ){\r\n\t\tif( v == gson[pos] ) continue;\r\n\t\tLinkline(v,pos,v);\r\n\t}\r\n}\r\n\r\n#define Tr(cnt0,cnt1) (cnt1==2?1:cnt0==2?0:2)\r\nint dp[MAXN], type[MAXN], cnt[MAXN][2];\r\nvoid Predp( int pos ){\r\n\tif( pos > n ){\r\n\t\tdp[pos] = inp[pos];\r\n\t\ttype[pos] = inp[pos];\r\n\t\treturn;\r\n\t}\r\n\tint ans[2] = {0,0};\r\n\tfor( auto v : e[pos] ){\r\n\t\tPredp(v);\r\n\t\t++ans[dp[v]];\r\n\t}\r\n\tdp[pos] = ans[0] < ans[1];\r\n\t--ans[dp[gson[pos]]];\r\n\ttype[pos] = Tr(ans[0],ans[1]);\r\n\ttie(cnt[pos][0],cnt[pos][1]) = {ans[0],ans[1]};\r\n}\r\n\r\n#define TREE 4194314\r\n#define LSON l,l+r>>1,pos<<1\r\n#define RSON (l+r>>1)+1,r,pos<<1|1\r\n#define ROOT 1,3*n+1,1\r\n#define ARG int l , int r , int pos\r\nint tree[TREE];\r\nil int Combine( int a , int b ){\r\n\tif( a != 2 ) return a;\r\n\tif( b != 2 ) return b;\r\n\treturn 2;\r\n}\r\nvoid Build(ARG){\r\n\tif( l == r ){\r\n\t\tint real = whoin[l];\r\n\t\ttree[pos] = type[real];\r\n\t\t// O(type[real]);\r\n\t\treturn;\r\n\t}\r\n\tBuild(LSON);\r\n\tBuild(RSON);\r\n\ttree[pos] = Combine(tree[pos<<1],tree[pos<<1|1]);\r\n\t// O(tree[pos]);\r\n}\r\nvoid Update( int gpos , ARG ){\r\n\tif( l == r ){\r\n\t\tint real = whoin[l];\r\n\t\ttree[pos] = type[real];\r\n\t\treturn;\r\n\t}\r\n\tint mid = l+r >> 1;\r\n\tif( gpos <= mid ) Update(gpos,LSON);\r\n\telse Update(gpos,RSON);\r\n\ttree[pos] = Combine(tree[pos<<1],tree[pos<<1|1]);\r\n}\r\nint Query( int gl , int gr , ARG ){\r\n\tif( gl <= l and r <= gr ) return tree[pos];\r\n\tint mid = l+r >> 1;\r\n\tif( gr <= mid ) return Query(gl,gr,LSON);\r\n\tif( gl > mid ) return Query(gl,gr,RSON);\r\n\treturn Combine( Query(gl,gr,LSON) , Query(gl,gr,RSON) );\r\n}\r\n\r\nil int Query( int pos ){\r\n\treturn Query( in[top[pos]] , in[ed[top[pos]]] , ROOT );\r\n}\r\nil void Change( int pos ){\r\n\tinp[pos] ^= 1;\r\n\ttype[pos] = inp[pos];\r\n\t--cnt[pos][!inp[pos]];\r\n\t++cnt[pos][inp[pos]];\r\n\twhile(pos){\r\n\t\tif( fa[top[pos]] == 0 ){\r\n\t\t\tUpdate(in[pos],ROOT);\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tint before = Query(pos);\r\n\t\tUpdate(in[pos],ROOT);\r\n\t\tint after = Query(pos);\r\n\t\tif( before == after ) break;\r\n\t\tpos = fa[top[pos]];\r\n\t\t/*\r\n\t\tHere, before,after \\neq 2\r\n\t\t*/\r\n\t\t--cnt[pos][before];\r\n\t\t++cnt[pos][after];\r\n\t\ttype[pos] = Tr(cnt[pos][0],cnt[pos][1]);\r\n\t}\r\n}\r\n\r\nint main(){\r\n\tFILEIO();\r\n\r\n\tRead(n);\r\n\tFor(i,n){\r\n\t\tiRead3(a,b,c);\r\n\t\te[i].Pb(a);\r\n\t\te[i].Pb(b);\r\n\t\te[i].Pb(c);\r\n\t}\r\n\tForx(i,n+1,3*n+1)\r\n\t\tRead(inp[i]);\r\n\r\n\tPredp(1);\r\n\r\n\tFindgson(1,0);\r\n\tLinkline(1,0,1);\r\n\tBuild(ROOT);\r\n\t// Print(fa,1,3*n+1);\r\n\t// Print(type,1,3*n+1);\r\n\r\n\tRead(qu);\r\n\tFor(qwq,qu){\r\n\t\tiRead(pos);\r\n\t\tChange(pos);\r\n\t\tputchar(48+Query(1));\r\n\t\tputchar(10);\r\n\t}\r\n\r\n\tEND();\r\n}\r\n",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmp19qh4m01/a59e0792-219f-46a8-9a08-a3ae48d429f9.cpp: In function ‘void FILEIO(std::string)’:\n/tmp/tmp19qh4m01/a59e0792-219f-46a8-9a08-a3ae48d429f9.cpp:129:9: error: ‘Fin’ was not declared in this scope; did you mean ‘sin’?\n  129 |         Fin((pname+\".in\").c_str());\n      |         ^~~\n      |         sin\n/tmp/tmp19qh4m01/a59e0792-219f-46a8-9a08-a3ae48d429f9.cpp:131:17: error: ‘Fout’ was not declared in this scope\n  131 |                 Fout((pname+\".out\").c_str());\n      |                 ^~~~\n"
        ],
        "tcb_id": "三叉神经树"
    },
    {
        "code_id": 6,
        "code": "#include <unordered_map>\r\n#include <unordered_set>\r\n#include <functional>\r\n#include <algorithm>\r\n#include <iostream>\r\n#include <complex>\r\n#include <cstdlib>\r\n#include <cstring>\r\n#include <cassert>\r\n#include <climits>\r\n#include <iomanip>\r\n#include <bitset>\r\n#include <vector>\r\n#include <cstdio>\r\n#include <cmath>\r\n#include <queue>\r\n#include <deque>\r\n#include <stack>\r\n#include <ctime>\r\n#include <set>\r\n#include <map>\r\nusing namespace std;\r\n#define il inline\r\n#define elif else if\r\n\r\n// Type\r\n#define ld double\r\n#define ll long long\r\n#define ull unsigned ll\r\n\r\n// Vector\r\n#define vc vector\r\n#define Pb push_back\r\n#define Pf push_front\r\n#define All(x) x.begin(),x.end()\r\n\r\n// Memory\r\n#define Ms(_data) memset(_data,0,sizeof(_data))\r\n#define Msn(_data,_num) memset(_data,_num,sizeof(_data))\r\n\r\n// Template\r\n#define _cl class\r\n#define _tp template\r\n#define _tyn typename\r\n\r\n// Pair\r\n#define Mp make_pair\r\n#define F first\r\n#define S second\r\n#define pii pair<int,int>\r\n#define pli pair<ll,int>\r\n#define pil pair<int,ll>\r\n#define pll pair<ll,ll>\r\n\r\n// Read\r\nstruct InputReader{\r\n\t#define bs 1000001\r\n\tchar buf[bs]; int p;\r\n\til InputReader(){ p = bs; }\r\n\til void Flush(){ p = 0; fread(buf,1,bs,stdin); }\r\n\til char C(){ if(p >= bs) Flush(); return buf[p++]; }\r\n\til char Readnum(){ char ch = C(); while( !isdigit(ch) && ch != '-' ) ch = C(); return ch; }\r\n\til void Readalpha( char &c ){ c = C(); while( !isalpha(c) ) c = C(); }\r\n\tint operator() (){\r\n\t\tint ans = 0, fu = 1; char ch = Readnum();\r\n\t\tif( ch == '-' ) fu = -1, ch = C();\r\n\t\twhile( ch >= '0' && ch <= '9' ){\r\n\t\t\tans = ans*10 + ch-'0';\r\n\t\t\tch = C();\r\n\t\t}\r\n\t\treturn ans * fu;\r\n\t}\r\n\tll Readll(){\r\n\t\tll ans = 0LL, fu = 1LL; char ch = Readnum();\r\n\t\tif( ch == '-' ) fu = -1LL, ch = C();\r\n\t\twhile( ch >= '0' && ch <= '9' ){\r\n\t\t\tans = ans*10LL + ch-'0';\r\n\t\t\tch = C();\r\n\t\t}\r\n\t\treturn ans * fu;\r\n\t}\r\n\til void Readstring( string &x ){\r\n\t\tx.clear(); char ch = C();\r\n\t\twhile( !isdigit(ch)  &&  !isalpha(ch)  &&  ch != '#'  &&  ch != '.' ) ch = C();\r\n\t\twhile( isdigit(ch)  ||  isalpha(ch)  ||  ch == '#'  ||  ch == '.' ){\r\n\t\t\tx += ch;\r\n\t\t\tch = C();\r\n\t\t}\r\n\t}\r\n\til void Readchstring( char s[] ){\r\n\t\tint len = 0; char ch = C();\r\n\t\twhile( !isdigit(ch)  &&  !isalpha(ch)  /*&&  ch != '*'  &&  ch != '?'*/ ) ch = C();\r\n\t\twhile( isdigit(ch)  ||  isalpha(ch)  /*||  ch == '*'  ||  ch == '?'*/ ){\r\n\t\t\ts[len++] = ch;\r\n\t\t\tch = C();\r\n\t\t}\r\n\t\ts[len] = '\\0';\r\n\t}\r\n\til void Specialread( char &c ){\r\n\t\tc = C();\r\n\t\twhile( !isdigit(c) && !isalpha(c) && c != '#'  &&  c != '>'  &&  c != '='  &&  c != '<' ) c = C();\r\n\t}\r\n\t#undef bs\r\n}In;\r\nil void Read( int &x ){ x = In(); }\r\nil void Read( int &x, int &y ){ x = In(); y = In(); }\r\nil void Read( int &x1 , int &x2 , int &x3 ){ x1 = In(); x2 = In(); x3 = In(); }\r\nil void Read( int &x1 , int &x2 , int &x3 , int &x4 ){ x1 = In(); x2 = In(); x3 = In(); x4 = In(); }\r\nil void Read( ll &x ){ x = In.Readll(); }\r\nil void Read( ll &x, ll &y ){ x = In.Readll(); y = In.Readll(); }\r\nil void Read( ll &x1 , ll &x2 , ll &x3 ){ x1 = In.Readll(); x2 = In.Readll(); x3 = In.Readll(); }\r\nil void Read( ll &x1 , ll &x2 , ll &x3 , ll &x4 ){ x1 = In.Readll(); x2 = In.Readll(); x3 = In.Readll(); x4 = In.Readll(); }\r\n#define iRead(k) int k; Read(k);\r\n#define iRead2(a,b) iRead(a); iRead(b);\r\n#define iRead3(a,b,c) iRead2(a,b); iRead(c);\r\n#define iRead4(a,b,c,d) iRead2(a,b); iRead2(c,d);\r\n#define lRead(k) ll k; Read(k);\r\n#define lRead2(a,b) lRead(a); lRead(b);\r\n#define lRead3(a,b,c) lRead2(a,b); lRead(c);\r\n#define lRead4(a,b,c,d) lRead2(a,b); lRead2(c,d);\r\n\r\n// File\r\nil void FILEIO(){\r\n\t#ifdef intLSY\r\n\t\tFin(\"in.in\");\r\n\t#endif\r\n}\r\nil void FILEIO( string pname ){\r\n\tFin((pname+\".in\").c_str());\r\n\t#ifndef intLSY\r\n\t\tFout((pname+\".out\").c_str());\r\n\t#endif\r\n}\r\nvoid Printtime(){\r\n\t#ifdef intLSY\r\n\t\tdouble _timeuse = clock()* 1000.0 / CLOCKS_PER_SEC;\r\n\t\tprintf(\"\\n\\nTime usage:\\n%.0lf ms\\n\",_timeuse);\r\n\t#endif\r\n}\r\nvoid END(){ Printtime(); exit(0); }\r\n_tp<_tyn T>void END( T mes ){ cout << mes << endl; END(); }\r\n\r\n\r\n// Loop\r\n#define For(i,j) for( int (i) = 1 ; (i) <= (j) ; ++(i) )\r\n#define For0(i,j) for( int (i) = 0 ; (i) < (j) ; ++(i) )\r\n#define Forx(i,j,k) for( int (i) = (j) ; (i) <= (k) ; ++(i) )\r\n#define Forstep(i,j,k,st) for( int (i) = (j) ; (i) <= (k) ; (i) += (st) )\r\n#define fOR(i,j) for( int (i) = (j) ; (i) >= 1 ; --(i) )\r\n#define fOR0(i,j) for( int (i) = (j)-1 ; (i) >= 0 ; --(i) )\r\n#define fORx(i,j,k) for( int (i) = (k) ; (i) >= (j) ; --(i) )\r\n\r\n\r\n// Debug\r\n#define B cerr << \"BreakPoint\" << endl;\r\n#define O(x) cerr << #x << \" \" << x << endl;\r\n#define O_(x) cerr << #x << \" \" << x << \"  \";\r\n#define ERR(x) cerr << \"ERR! #\" << x << endl;\r\n#define Msz(x) cerr << \"Sizeof \" << #x << \" \" << sizeof(x)/1024/1024 << \" MB\" << endl;\r\n_tp<_tyn T>void Print( T a[] , int s , int t , char sp = ' ' , char ed = '\\n' ){\r\n\tif( s > t ) return;\r\n\tfor( int i = s ; i < t ; i++ )\r\n\t\tcout << a[i] << sp;\r\n\tcout << a[t] << ed;\r\n\tcout.flush();\r\n}\r\n_tp<_tyn T>void Print( T a , int s = 0 , int t = -1 , char sp = ' ' , char ed = '\\n' ){\r\n\tif( t == -1 ) t = a.size()-1;\r\n\tfor( int i = s ; i <= t ; i++ )\r\n\t\tcout << a[i] << sp;\r\n\tcout << ed;\r\n\tcout.flush();\r\n}\r\n\r\n\r\n// Optimize\r\n#define abs(a) ((a)<0?(~(a)+1):(a))\r\n#define max(a,b) ((a)>(b)?(a):(b))\r\n#define min(a,b) ((a)<(b)?(a):(b))\r\n//#define swap(a,b) {a=a^b;b=a^b;a=a^b;}\r\n#define Mymax(a,b) (a) = max((a),(b))\r\n#define Mymin(a,b) (a) = min((a),(b))\r\n#define INF (0x3f3f3f3f)\r\n#define LINF ((long long)(0x3f3f3f3f3f3f3f3f))\r\nvoid USACO( string pname ){\r\n    #ifdef intLSY\r\n        Fin(\"in.in\");\r\n    #else\r\n        \r\n    #endif\r\n}\r\n#define Eps ((ld)(1e-8))\r\nconst int dx4[] = {0,-1,0,1};\r\nconst int dy4[] = {-1,0,1,0};\r\n///////////////////////////////////////////////////////////////////////////////////////\r\n///////////////////////////////////////////////////////////////////////////////////////\r\n#define MAXN 1500010\r\n#define TREE 500010\r\n\r\nint n,qu;\r\nvc<int> e[MAXN];\r\nint inp[MAXN];\r\n\r\nint sz[MAXN], gson[MAXN], lsz[MAXN];\r\nvoid Findgson( int pos , int father ){\r\n\tif( pos > n ) return;\r\n\tint gson = 0, usz = 1;\r\n\tfor( auto v : e[pos] ){\r\n\t\tFindgson(v,pos);\r\n\t\tusz += sz[v];\r\n\t\tif( v <= n )\r\n\t\t\tgson = sz[gson] < sz[v] ? v : gson;\r\n\t}\r\n\tlsz[pos] = usz - sz[gson];\r\n\t::gson[pos] = gson;\r\n\t::sz[pos] = usz;\r\n}\r\n\r\n#define Combine(a,b) (a!=2?a:b!=2?b:2)\r\nstruct Node{ int l,r,fa,ltype,stype; } tree[TREE];\r\n#define Stype(pos) tree[pos].stype\t// Sum type\r\n#define Ltype(pos) tree[pos].ltype\t// Light Type\r\n#define L(pos) tree[pos].l\r\n#define R(pos) tree[pos].r\r\n#define Fa(pos) tree[pos].fa\r\nil void Update( int pos ){\r\n\tStype(pos) = Ltype(pos);\r\n\tif(L(pos)) Stype(pos) = Combine(Stype(L(pos)),Stype(pos));\r\n\tif(R(pos)) Stype(pos) = Combine(Stype(pos),Stype(R(pos)));\r\n}\r\nint root;\r\nint st[MAXN], sttop;\r\nbool is_light[MAXN];\r\nint Build_Line( int l , int r ){\r\n\tif( l > r ) return 0;\r\n\tint totsz = 0;\r\n\tForx(i,l,r) totsz += lsz[st[i]];\r\n\tint nowsz = 0;\r\n\tForx(i,l,r){\r\n\t\tint pos = st[i];\r\n\t\tnowsz += lsz[pos];\r\n\t\tif( (nowsz<<1) > totsz ){\r\n\t\t\tL(pos) = Build_Line(l,i-1);\r\n\t\t\tR(pos) = Build_Line(i+1,r);\r\n\t\t\tFa(L(pos)) = Fa(R(pos)) = pos;\r\n\t\t\tUpdate(pos);\r\n\t\t\treturn pos;\r\n\t\t}\r\n\t}\r\n}\r\nint Build( int top , int father ){\r\n\tif( top > n ) return top;\r\n\tfor( int pos = top ; pos ; pos = gson[pos] ){\r\n\t\tfor( auto v : e[pos] ){\r\n\t\t\tif( v == father or v == gson[pos] ) continue;\r\n\t\t\tFa(Build(v,pos)) = pos;\r\n\t\t}\r\n\t}\r\n\tsttop = 0;\r\n\tfor( int pos = top ; pos ; pos = gson[pos] )\r\n\t\tst[++sttop] = pos;\r\n\treturn Build_Line(1,sttop);\r\n}\r\n\r\n#define Tr(cnt0,cnt1) (cnt1>cnt0?1:cnt1<cnt0?0:2)\r\nint dp[MAXN], cnt[MAXN][2];\r\nvoid Predp( int pos ){\r\n\tif( pos > n ){\r\n\t\tdp[pos] = inp[pos];\r\n\t\treturn;\r\n\t}\r\n\tint ans[2] = {0,0};\r\n\tfor( auto v : e[pos] ){\r\n\t\tPredp(v);\r\n\t\t++ans[dp[v]];\r\n\t}\r\n\tdp[pos] = ans[0] < ans[1];\r\n\tif(gson[pos]) --ans[dp[gson[pos]]];\r\n\tLtype(pos) = Tr(ans[0],ans[1]);\r\n\ttie(cnt[pos][0],cnt[pos][1]) = {ans[0],ans[1]};\r\n}\r\n\r\nvoid Change( int pos ){\r\n\t--cnt[Fa(pos)][inp[pos]];\r\n\tinp[pos] ^= 1;\r\n\t++cnt[Fa(pos)][inp[pos]];\r\n\r\n\tpos = Fa(pos);\r\n\tLtype(pos) = Tr(cnt[pos][0],cnt[pos][1]);\r\n\tint nowtype = Stype(pos), before = Stype(pos);\r\n\tUpdate(pos);\r\n\r\n\twhile(pos){\r\n\t\tif(is_light[pos]){\r\n\t\t\tint after = Stype(pos);\r\n\t\t\tpos = Fa(pos);\r\n\t\t\t--cnt[pos][before];\r\n\t\t\t++cnt[pos][after];\r\n\t\t\tLtype(pos) = Tr(cnt[pos][0],cnt[pos][1]);\r\n\t\t\tbefore = Stype(pos);\r\n\t\t\tUpdate(pos);\r\n\t\t}else{\r\n\t\t\tpos = Fa(pos);\r\n\t\t\tbefore = Stype(pos);\r\n\t\t\tUpdate(pos);\r\n\t\t}\r\n\t}\r\n}\r\n\r\nint main(){\r\n\tFILEIO();\r\n\r\n\tRead(n);\r\n\tFor(i,n){\r\n\t\tiRead3(a,b,c);\r\n\t\te[i].Pb(a);\r\n\t\te[i].Pb(b);\r\n\t\te[i].Pb(c);\r\n\t}\r\n\tForx(i,n+1,3*n+1)\r\n\t\tRead(inp[i]);\r\n\r\n\tFindgson(1,0);\r\n\tPredp(1);\r\n\troot = Build(1,0);\r\n\tFor(i,n) is_light[i] = L(Fa(i))!=i && R(Fa(i))!=i;\r\n\t// For(i,3*n+1) O(Stype(i));\r\n\r\n\tRead(qu);\r\n\tFor(qwq,qu){\r\n\t\tiRead(pos);\r\n\t\tChange(pos);\r\n\t\tputchar(48+Stype(root));\r\n\t\tputchar(10);\r\n\t}\r\n\r\n\tEND();\r\n}\r\n",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpydrgoty5/f9dab89d-fa55-40e6-815c-e0847e53f617.cpp: In function ‘void FILEIO(std::string)’:\n/tmp/tmpydrgoty5/f9dab89d-fa55-40e6-815c-e0847e53f617.cpp:129:9: error: ‘Fin’ was not declared in this scope; did you mean ‘sin’?\n  129 |         Fin((pname+\".in\").c_str());\n      |         ^~~\n      |         sin\n/tmp/tmpydrgoty5/f9dab89d-fa55-40e6-815c-e0847e53f617.cpp:131:17: error: ‘Fout’ was not declared in this scope\n  131 |                 Fout((pname+\".out\").c_str());\n      |                 ^~~~\n/tmp/tmpydrgoty5/f9dab89d-fa55-40e6-815c-e0847e53f617.cpp: In function ‘int Build_Line(int, int)’:\n/tmp/tmpydrgoty5/f9dab89d-fa55-40e6-815c-e0847e53f617.cpp:250:1: warning: control reaches end of non-void function [-Wreturn-type]\n  250 | }\n      | ^\n"
        ],
        "tcb_id": "三叉神经树"
    },
    {
        "code_id": 13,
        "code": "#include<bits/stdc++.h>\nusing namespace std;\n#define fr(ii,ss,tt) for(int ii=ss;ii<=tt;ii++)\n#define rf(ii,ss,tt) for(int ii=ss;ii>=tt;ii--)\n#define pii pair<int,int>\n#define pt printf\n#define x first\n#define y second\n#define siz(x) ((int)size(x))\n#define pb push_back\n#define eb emplace_back\n#define all(a) begin(a),end(a)\ntemplate<typename T>bool tomax(T&x,const T&y) {\n    if(x<y)return x=y,true;\n    return false;\n}\ntemplate<typename T>bool tomin(T&x,const T&y) {\n    if(x>y)return x=y,true;\n    return false;\n}\n#define gc() getchar()\n#define pc(c) putchar(c)\ninline void rd(auto&x,auto&...y) {\n    char ch;\n    bool f=0;\n    while(!isdigit(ch=gc()))if(ch=='-')f=1;\n    x=0;\n    do {\n        x=(x<<1)+(x<<3)+(ch^48);\n    } while(isdigit(ch=gc()));\n    if(f)x=-x;\n    if constexpr(sizeof...(y))rd(y...);\n}\n#define int long long\nconst int N=2e6+6,S=19;\nmt19937 gen(chrono::steady_clock::now().time_since_epoch().count());\nint n,q;\nlist<int>a[N];\nstruct Node{\n    int c[2];\n    int sz;\n}t[N*(S+2)];int rt[N],tot;\n#define c(i,j) t[i].c[j]\n#define sz(i) t[i].sz\nint merge(int x,int y){\n    if(!x||!y){\n        return x+y;\n    }\n    sz(x)+=sz(y);\n    c(x,0)=merge(c(x,0),c(y,0));\n    c(x,1)=merge(c(x,1),c(y,1));\n    return x;\n}\nvoid add(int i,int p,int v){\n    int*c=&rt[i];\n    rf(b,S,-1){\n        int&cur=*c;\n        if(!cur)cur=++tot;\n        sz(cur)+=v;\n        if(b==-1)return;\n        c=&c(cur,p>>b&1);\n    }\n}\nint ask(vector<int>T){\n    long long nn=0;\n    for(int&i:T){\n        nn+=a[i].size();\n        i=rt[i];\n    }\n    int ret=0;\n    fr(_,0,S){\n        long long ls=0,rs=0;\n        for(int i:T){\n            ls+=sz(c(i,0));\n            rs+=sz(c(i,1));\n        }\n        if(ls>nn/2){\n            ret=(ret<<1);\n            for(int&i:T)i=c(i,0);\n        }else if(rs>nn/2){\n            ret=(ret<<1|1);\n            for(int&i:T)i=c(i,1);\n        }else{\n            return -1;\n        }\n    }\n    return ret;\n}\nvoid ins(int i,int v) {\n    a[i].eb(v);\n    add(i,v,1);\n}\nvoid del(int i) {\n    add(i,a[i].back(),-1);\n    a[i].pop_back();\n}\nsigned main() {\n    input(\"major.in\");\n    output(\"major.out\");\n    rd(n,q);\n    fr(i,1,n) {\n        int l;\n        rd(l);\n        while(l--) {\n            int v;\n            rd(v);\n            ins(i,v);\n        }\n    }\n    while(q--) {\n        int o,x,y,z,m;\n        vector<int>t;\n        rd(o);\n        if(o==1) {\n            rd(x,y);\n            ins(x,y);\n        }\n        if(o==2) {\n            rd(x);\n            del(x);\n        }\n        if(o==3) {\n            int l;\n            rd(l);\n            t.resize(l);\n            fr(i,0,l-1){\n                rd(t[i]);\n            }\n            pt(\"%d\\n\",ask(t));\n        }\n        if(o==4) {\n            rd(x,y,z);\n            rt[z]=merge(rt[x],rt[y]);\n\n            m=0;\n            if(a[x].size()>a[y].size())swap(x,y),m=1;\n            a[z].swap(a[y]);\n            for(auto e:a[x]) {\n                m==0?a[z].push_front(e):a[z].push_back(e);\n            }\n            move(a[x]);\n\n        }\n    }\n    return 0;\n}\n",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpxivxuvfe/94cc574d-9532-4f89-875a-6fac6570401b.cpp: In function ‘int main()’:\n/tmp/tmpxivxuvfe/94cc574d-9532-4f89-875a-6fac6570401b.cpp:98:5: error: ‘input’ was not declared in this scope; did you mean ‘int’?\n   98 |     input(\"major.in\");\n      |     ^~~~~\n      |     int\n/tmp/tmpxivxuvfe/94cc574d-9532-4f89-875a-6fac6570401b.cpp:99:5: error: ‘output’ was not declared in this scope\n   99 |     output(\"major.out\");\n      |     ^~~~~~\n/tmp/tmpxivxuvfe/94cc574d-9532-4f89-875a-6fac6570401b.cpp:129:18: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘long long int’ [-Wformat=]\n  129 |             pt(\"%d\\n\",ask(t));\n      |                 ~^    ~~~~~~\n      |                  |       |\n      |                  int     long long int\n      |                 %lld\n/tmp/tmpxivxuvfe/94cc574d-9532-4f89-875a-6fac6570401b.cpp:141:17: warning: ignoring return value of ‘constexpr typename std::remove_reference<_Tp>::type&& std::move(_Tp&&) [with _Tp = std::__cxx11::list<long long int>&; typename std::remove_reference<_Tp>::type = std::__cxx11::list<long long int>]’, declared with attribute ‘nodiscard’ [-Wunused-result]\n  141 |             move(a[x]);\n      |             ~~~~^~~~~~\nIn file included from /usr/include/c++/11/bits/stl_pair.h:59,\n                 from /usr/include/c++/11/bits/stl_algobase.h:64,\n                 from /usr/include/c++/11/bits/specfun.h:45,\n                 from /usr/include/c++/11/cmath:1935,\n                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:41,\n                 from /tmp/tmpxivxuvfe/94cc574d-9532-4f89-875a-6fac6570401b.cpp:1:\n/usr/include/c++/11/bits/move.h:104:5: note: declared here\n  104 |     move(_Tp&& __t) noexcept\n      |     ^~~~\n"
        ],
        "tcb_id": "众数"
    },
    {
        "code_id": 5,
        "code": "#include <bits/stdc++.h>\ntypedef long long ll;typedef unsigned long long ull; typedef double db;typedef long double ldb;\n#define Rep(i,a,b) for(int i=a;i<=b;++i)\n#define Dwn(i,a,b) for(int i=a;i>=b;--i)\n#define pii pair<int,int>\n#define mair make_pair\n#define fir first\n#define sec second\n#define int ll\nusing namespace std;\n\nconst int maxn=2510,maxm=4e4+10,INF=0x3f3f3f3f3f3f3f3f;\n\nint n,m,K;\nll w[maxn];\nint dis[maxn][maxn];\nint ans;\n\nstruct Ver{\n\tpii f[4];int u;\n\tvoid Push(pii x){ f[0]=x;sort(f,f+4); }\n\tfriend int operator + (const Ver &A,const Ver &B){\n\t\tint res=0;\n\t\tRep(i,1,3)if(A.f[i].sec)Rep(j,1,3)if(B.f[j].sec){\n\t\t\tif( (A.u!=B.f[j].sec) && (B.u!=A.f[i].sec) && (A.f[i].sec!=B.f[j].sec))\n\t\t\tres=max(res,A.f[i].fir+B.f[j].fir);\n\t\t}\n\t\treturn res;\n\t}\n}V[maxn];\n\nstruct Graph{\n\tstruct eg{int from,to,next;}e[maxm];\n\tint len,head[maxn];\n\tvoid lqx(int from,int to)\n\t{ e[++len].from=from,e[len].to=to,e[len].next=head[from],head[from]=len; }\n\tqueue<int>q;\n\tvoid Bfs(int s){\n\t\tdis[s][s]=0;q.push(s);\n\t\twhile(!q.empty()){\n\t\t\tint u=q.front();q.pop();\n\t\t\tfor(int i=head[u];i;i=e[i].next){\n\t\t\t\tint v=e[i].to;if(dis[s][v]!=INF)continue;\n\t\t\t\tdis[s][v]=dis[s][u]+1;q.push(v);\n\t\t\t}\n\t\t}\n\t}\n}G;\n\nvoid solve(){\n\tcin>>n>>m>>K;Rep(i,2,n)cin>>w[i];\n\tRep(i,1,m){ int x,y;cin>>x>>y;G.lqx(x,y),G.lqx(y,x); }\n\tmemset(dis,0x3f,sizeof(dis));\n\tRep(i,1,n)G.Bfs(i),V[i].u=i;\n\tRep(i,2,n)Rep(j,2,n)\n\t\tif(i!=j && dis[1][i]<=(K+1) && dis[i][j]<=(K+1))\n\t\t\tV[j].Push(mair(w[i]+w[j],i));\n\tRep(i,2,n)Rep(j,5,n)\n\t\tif(i!=j && dis[i][j]<=(K+1))\n\t\t\tans=max(ans,V[i]+V[j]);\n\tcout<<ans<<\"\\n\";\n}\n\n#undef int \nint main (){ fre(holiday);ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);return solve(),0; }\n\n",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpxxj7ry_a/ce03b837-aaae-485b-90d3-617a82fcc7bb.cpp: In function ‘int main()’:\n/tmp/tmpxxj7ry_a/ce03b837-aaae-485b-90d3-617a82fcc7bb.cpp:65:18: error: ‘holiday’ was not declared in this scope\n   65 | int main (){ fre(holiday);ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);return solve(),0; }\n      |                  ^~~~~~~\n/tmp/tmpxxj7ry_a/ce03b837-aaae-485b-90d3-617a82fcc7bb.cpp:65:14: error: ‘fre’ was not declared in this scope; did you mean ‘free’?\n   65 | int main (){ fre(holiday);ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);return solve(),0; }\n      |              ^~~\n      |              free\n"
        ],
        "tcb_id": "假期计划"
    },
    {
        "code_id": 10,
        "code": "// Author: xiaruize\n// #define ONLINE_JUDGE\n#pragma GCC optimize(\"-ofast\")\n#include <bits/stdc++.h>\nnamespace __DEBUG_UTIL__\n{\n    using namespace std;\n    /* Primitive Datatypes Print */\n    void print(const char *x) { cerr << x; }\n    void print(bool x) { cerr << (x ? \"T\" : \"F\"); }\n    void print(char x) { cerr << '\\'' << x << '\\''; }\n    void print(signed short int x) { cerr << x; }\n    void print(unsigned short int x) { cerr << x; }\n    void print(signed int x) { cerr << x; }\n    void print(unsigned int x) { cerr << x; }\n    void print(signed long int x) { cerr << x; }\n    void print(unsigned long int x) { cerr << x; }\n    void print(signed long long int x) { cerr << x; }\n    void print(unsigned long long int x) { cerr << x; }\n    void print(float x) { cerr << x; }\n    void print(double x) { cerr << x; }\n    void print(long double x) { cerr << x; }\n    void print(string x) { cerr << '\\\"' << x << '\\\"'; }\n    template <size_t N>\n    void print(bitset<N> x) { cerr << x; }\n    void print(vector<bool> v)\n    { /* Overloaded this because stl optimizes vector<bool> by using\n          _Bit_reference instead of bool to conserve space. */\n        int f = 0;\n        cerr << '{';\n        for (auto &&i : v)\n            cerr << (f++ ? \",\" : \"\") << (i ? \"T\" : \"F\");\n        cerr << \"}\";\n    }\n    /* Templates Declarations to support nested datatypes */\n    template <typename T>\n    void print(T &&x);\n    template <typename T>\n    void print(vector<vector<T>> mat);\n    template <typename T, size_t N, size_t M>\n    void print(T (&mat)[N][M]);\n    template <typename F, typename S>\n    void print(pair<F, S> x);\n    template <typename T, size_t N>\n    struct Tuple;\n    template <typename T>\n    struct Tuple<T, 1>;\n    template <typename... Args>\n    void print(tuple<Args...> t);\n    template <typename... T>\n    void print(priority_queue<T...> pq);\n    template <typename T>\n    void print(stack<T> st);\n    template <typename T>\n    void print(queue<T> q);\n    /* Template Datatypes Definitions */\n    template <typename T>\n    void print(T &&x)\n    {\n        /*  This works for every container that supports range-based loop\n            i.e. vector, set, map, oset, omap, dequeue */\n        int f = 0;\n        cerr << '{';\n        for (auto &&i : x)\n            cerr << (f++ ? \",\" : \"\"), print(i);\n        cerr << \"}\";\n    }\n    template <typename T>\n    void print(vector<vector<T>> mat)\n    {\n        int f = 0;\n        cerr << \"\\n~~~~~\\n\";\n        for (auto &&i : mat)\n        {\n            cerr << setw(2) << left << f++, print(i), cerr << \"\\n\";\n        }\n        cerr << \"~~~~~\\n\";\n    }\n    template <typename T, size_t N, size_t M>\n    void print(T (&mat)[N][M])\n    {\n        int f = 0;\n        cerr << \"\\n~~~~~\\n\";\n        for (auto &&i : mat)\n        {\n            cerr << setw(2) << left << f++, print(i), cerr << \"\\n\";\n        }\n        cerr << \"~~~~~\\n\";\n    }\n    template <typename F, typename S>\n    void print(pair<F, S> x)\n    {\n        cerr << '(';\n        print(x.first);\n        cerr << ',';\n        print(x.second);\n        cerr << ')';\n    }\n    template <typename T, size_t N>\n    struct Tuple\n    {\n        static void printTuple(T t)\n        {\n            Tuple<T, N - 1>::printTuple(t);\n            cerr << \",\", print(get<N - 1>(t));\n        }\n    };\n    template <typename T>\n    struct Tuple<T, 1>\n    {\n        static void printTuple(T t) { print(get<0>(t)); }\n    };\n    template <typename... Args>\n    void print(tuple<Args...> t)\n    {\n        cerr << \"(\";\n        Tuple<decltype(t), sizeof...(Args)>::printTuple(t);\n        cerr << \")\";\n    }\n    template <typename... T>\n    void print(priority_queue<T...> pq)\n    {\n        int f = 0;\n        cerr << '{';\n        while (!pq.empty())\n            cerr << (f++ ? \",\" : \"\"), print(pq.top()), pq.pop();\n        cerr << \"}\";\n    }\n    template <typename T>\n    void print(stack<T> st)\n    {\n        int f = 0;\n        cerr << '{';\n        while (!st.empty())\n            cerr << (f++ ? \",\" : \"\"), print(st.top()), st.pop();\n        cerr << \"}\";\n    }\n    template <typename T>\n    void print(queue<T> q)\n    {\n        int f = 0;\n        cerr << '{';\n        while (!q.empty())\n            cerr << (f++ ? \",\" : \"\"), print(q.front()), q.pop();\n        cerr << \"}\";\n    }\n    /* Printer functions */\n    void printer(const char *) {} /* Base Recursive */\n    template <typename T, typename... V>\n    void printer(const char *names, T &&head, V &&...tail)\n    {\n        /* Using && to capture both lvalues and rvalues */\n        int i = 0;\n        for (size_t bracket = 0; names[i] != '\\0' and (names[i] != ',' or bracket != 0); i++)\n            if (names[i] == '(' or names[i] == '<' or names[i] == '{')\n                bracket++;\n            else if (names[i] == ')' or names[i] == '>' or names[i] == '}')\n                bracket--;\n        cerr.write(names, i) << \" = \";\n        print(head);\n        if (sizeof...(tail))\n            cerr << \" ||\", printer(names + i + 1, tail...);\n        else\n            cerr << \"]\\n\";\n    }\n    /* PrinterArr */\n    void printerArr(const char *) {} /* Base Recursive */\n    template <typename T, typename... V>\n    void printerArr(const char *names, T arr[], size_t N, V... tail)\n    {\n        size_t ind = 0;\n        for (; names[ind] and names[ind] != ','; ind++)\n            cerr << names[ind];\n        for (ind++; names[ind] and names[ind] != ','; ind++)\n            ;\n        cerr << \" = {\";\n        for (size_t i = 0; i < N; i++)\n            cerr << (i ? \",\" : \"\"), print(arr[i]);\n        cerr << \"}\";\n        if (sizeof...(tail))\n            cerr << \" ||\", printerArr(names + ind + 1, tail...);\n        else\n            cerr << \"]\\n\";\n    }\n}\nusing namespace std;\n// #define int long long\n#define ull unsigned long long\n#define ALL(a) (a).begin(), (a).end()\n#define endl '\\n'\n#define pii pair<int, int>\n#define pis pair<int, string>\n#define sz(a) int((a).size())\n#define Yes cout << \"Yes\" << endl\n#define YES cout << \"YES\" << endl\n#define No cout << \"No\" << endl\n#define NO cout << \"NO\" << endl\n#define mms(arr, n) memset(arr, n, sizeof(arr))\n#define rep(i, a, n) for (int i = (a); i <= (n); ++i)\n#define per(i, n, a) for (int i = (n); i >= (a); --i)\ntemplate <class _Tx, class _Ty>\ninline void chkmi(_Tx &x, const _Ty &y)\n{\n    if (y < x)\n        x = y;\n}\ntemplate <class _Tx, class _Ty>\ninline void chkmx(_Tx &x, const _Ty &y)\n{\n    if (x < y)\n        x = y;\n}\nconst int INF = 0x3f3f3f3f;\nconst int MOD = 1000000007;\nconst int N = 5e5 + 10;\nconst int M = 5e3 + 10;\n\npii stk[N << 5];\nint p[M], sz[M], tt = 0;\n\nint find(int x)\n{\n    return x == p[x] ? x : find(p[x]);\n}\n\nbool merge(int a, int b)\n{\n    int pa = find(a), pb = find(b);\n    if (pa == pb)\n    {\n        stk[++tt] = {-1, -1};\n        return false;\n    }\n    if (sz[pa] > sz[pb])\n        swap(pa, pb);\n    stk[++tt] = {pa, pb};\n    p[pa] = pb;\n    sz[pb] += sz[pa];\n    return true;\n}\n\nvoid revocate()\n{\n    auto [x, y] = stk[tt--];\n    if (x == -1)\n        return;\n    p[x] = x;\n    sz[y] -= sz[x];\n}\n\nint n, m;\nvector<pair<int, pii>> vec[N << 2];\n\nvoid upd(int p, int l, int r, int ll, int rr, pair<int, pii> val)\n{\n    if (ll <= l && r <= rr)\n    {\n        vec[p].push_back(val);\n        return;\n    }\n    int mid = (l + r) >> 1;\n    if (ll <= mid)\n        upd(p << 1, l, mid, ll, rr, val);\n    if (rr > mid)\n        upd(p << 1 | 1, mid + 1, r, ll, rr, val);\n}\n\nmap<pii, int> st, en;\nint tot;\nbool res[N];\n\nvoid query(int p, int l, int r)\n{\n    int tmp = tt;\n    for (auto [op, val] : vec[p])\n    {\n        debug(p, l, r, op, val);\n        if (op == 0)\n            merge(val.first, val.second);\n        else\n            res[op] = (find(val.first) == find(val.second));\n    }\n    if (l == r)\n    {\n        while (tmp != tt)\n            revocate();\n        return;\n    }\n    int mid = (l + r) >> 1;\n    query(p << 1, l, mid);\n    query(p << 1 | 1, mid + 1, r);\n    while (tmp != tt)\n        revocate();\n}\n\nvoid solve()\n{\n    cin >> n >> m;\n    iota(p + 1, p + n + 1, 1);\n    fill(sz + 1, sz + n + 1, 1);\n    rep(i, 1, m)\n    {\n        int op, u, v;\n        cin >> op >> u >> v;\n        if (u > v)\n            swap(u, v);\n        if (op == 0)\n            st[{u, v}] = i;\n        else if (op == 1)\n        {\n            upd(1, 1, m, st[{u, v}], i, {0, {u, v}});\n            st.erase({u, v});\n        }\n        else\n        {\n            upd(1, 1, m, i, i, {++tot, {u, v}});\n        }\n    }\n    for (auto [val, s] : st)\n    {\n        if (!en.count(val))\n            upd(1, 1, m, s, m, {0, {val.first, val.second}});\n    }\n    rep(i, 1, m) sort(ALL(vec[i]));\n    query(1, 1, m);\n    rep(i, 1, tot) cout << (res[i] ? \"Y\" : \"N\") << endl;\n}\n\n\nsigned main()\n{\n    ios::sync_with_stdio(false);\n    cin.tie(0);\n    cout.tie(0);\n    int testcase = 1;\n    // cin >> testcase;\n    while (testcase--)\n        solve();\n    return 0;\n}\n",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:3:30: warning: bad option ‘-ofast’ to pragma ‘optimize’ [-Wpragmas]\n    3 | #pragma GCC optimize(\"-ofast\")\n      |                              ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:9:29: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n    9 |     void print(const char *x) { cerr << x; }\n      |                             ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:10:22: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   10 |     void print(bool x) { cerr << (x ? \"T\" : \"F\"); }\n      |                      ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:11:22: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   11 |     void print(char x) { cerr << '\\'' << x << '\\''; }\n      |                      ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:12:34: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   12 |     void print(signed short int x) { cerr << x; }\n      |                                  ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:13:36: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   13 |     void print(unsigned short int x) { cerr << x; }\n      |                                    ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:14:28: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   14 |     void print(signed int x) { cerr << x; }\n      |                            ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:15:30: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   15 |     void print(unsigned int x) { cerr << x; }\n      |                              ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:16:33: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   16 |     void print(signed long int x) { cerr << x; }\n      |                                 ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:17:35: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   17 |     void print(unsigned long int x) { cerr << x; }\n      |                                   ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:18:38: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   18 |     void print(signed long long int x) { cerr << x; }\n      |                                      ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:19:40: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   19 |     void print(unsigned long long int x) { cerr << x; }\n      |                                        ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:20:23: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   20 |     void print(float x) { cerr << x; }\n      |                       ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:21:24: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   21 |     void print(double x) { cerr << x; }\n      |                        ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:22:29: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   22 |     void print(long double x) { cerr << x; }\n      |                             ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:23:24: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   23 |     void print(string x) { cerr << '\\\"' << x << '\\\"'; }\n      |                        ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:25:27: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   25 |     void print(bitset<N> x) { cerr << x; }\n      |                           ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:26:30: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   26 |     void print(vector<bool> v)\n      |                              ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:37:21: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   37 |     void print(T &&x);\n      |                     ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:37:21: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:39:37: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   39 |     void print(vector<vector<T>> mat);\n      |                                     ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:39:37: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:41:30: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   41 |     void print(T (&mat)[N][M]);\n      |                              ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:41:30: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:43:28: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   43 |     void print(pair<F, S> x);\n      |                            ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:43:28: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:49:32: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   49 |     void print(tuple<Args...> t);\n      |                                ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:49:32: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:51:39: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   51 |     void print(priority_queue<T...> pq);\n      |                                       ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:51:39: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:53:27: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   53 |     void print(stack<T> st);\n      |                           ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:53:27: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:55:26: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   55 |     void print(queue<T> q);\n      |                          ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:55:26: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:58:21: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   58 |     void print(T &&x)\n      |                     ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:69:37: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   69 |     void print(vector<vector<T>> mat)\n      |                                     ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:80:30: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   80 |     void print(T (&mat)[N][M])\n      |                              ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:91:28: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n   91 |     void print(pair<F, S> x)\n      |                            ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:102:35: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n  102 |         static void printTuple(T t)\n      |                                   ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:111:35: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n  111 |         static void printTuple(T t) { print(get<0>(t)); }\n      |                                   ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:114:32: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n  114 |     void print(tuple<Args...> t)\n      |                                ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:121:39: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n  121 |     void print(priority_queue<T...> pq)\n      |                                       ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:130:27: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n  130 |     void print(stack<T> st)\n      |                           ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:139:26: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n  139 |     void print(queue<T> q)\n      |                          ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:148:30: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n  148 |     void printer(const char *) {} /* Base Recursive */\n      |                              ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:150:58: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n  150 |     void printer(const char *names, T &&head, V &&...tail)\n      |                                                          ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:167:33: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n  167 |     void printerArr(const char *) {} /* Base Recursive */\n      |                                 ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:169:68: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n  169 |     void printerArr(const char *names, T arr[], size_t N, V... tail)\n      |                                                                    ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:202:39: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n  202 | inline void chkmi(_Tx &x, const _Ty &y)\n      |                                       ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:208:39: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n  208 | inline void chkmx(_Tx &x, const _Ty &y)\n      |                                       ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:221:15: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n  221 | int find(int x)\n      |               ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:226:24: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n  226 | bool merge(int a, int b)\n      |                        ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:242:15: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n  242 | void revocate()\n      |               ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp: In function ‘void revocate()’:\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:244:10: warning: structured bindings only available with ‘-std=c++17’ or ‘-std=gnu++17’\n  244 |     auto [x, y] = stk[tt--];\n      |          ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp: At global scope:\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:254:65: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n  254 | void upd(int p, int l, int r, int ll, int rr, pair<int, pii> val)\n      |                                                                 ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:272:31: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n  272 | void query(int p, int l, int r)\n      |                               ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp: In function ‘void query(int, int, int)’:\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:275:15: warning: structured bindings only available with ‘-std=c++17’ or ‘-std=gnu++17’\n  275 |     for (auto [op, val] : vec[p])\n      |               ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:277:9: error: ‘debug’ was not declared in this scope\n  277 |         debug(p, l, r, op, val);\n      |         ^~~~~\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp: At global scope:\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:296:12: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n  296 | void solve()\n      |            ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp: In function ‘void solve()’:\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:319:15: warning: structured bindings only available with ‘-std=c++17’ or ‘-std=gnu++17’\n  319 |     for (auto [val, s] : st)\n      |               ^\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp: At global scope:\n/tmp/tmpyaoh0mq7/c3408959-5384-4082-a1ba-e8cd9a807b59.cpp:330:13: warning: bad option ‘-ofast’ to attribute ‘optimize’ [-Wattributes]\n  330 | signed main()\n      |             ^\n"
        ],
        "tcb_id": "动态图连通性"
    },
    {
        "code_id": 13,
        "code": "// interestingLSY\r\n#include <bits/stdc++.h>\r\nusing namespace std;\r\n#define il inline\r\n#define elif else if\r\n\r\n// Type\r\n#define ld double\r\n#define ll long long\r\n#define ull unsigned ll\r\n\r\n// Vector\r\n#define vc vector\r\n#define Pb push_back\r\n#define Pf push_front\r\n#define Eb emplace_back\r\n#define All(x) x.begin(),x.end()\r\n#define AllRev(x) x.rbegin(),x.rend()\r\n\r\n// Memory\r\n#define Ms(_data) memset(_data,0,sizeof(_data))\r\n#define Msn(_data,_num) memset(_data,_num,sizeof(_data))\r\n\r\n// Template\r\n#define _cl class\r\n#define _tp template\r\n#define _tyn typename\r\n\r\n// Pair\r\n#define Mp make_pair\r\n#define F first\r\n#define S second\r\n#define pii pair<int,int>\r\n#define pli pair<ll,int>\r\n#define pil pair<int,ll>\r\n#define pll pair<ll,ll>\r\n\r\n// Loop\r\n#define For(i,j) for( int (i) = 1 ; (i) <= (j) ; ++(i) )\r\n#define For0(i,j) for( int (i) = 0 ; (i) < (j) ; ++(i) )\r\n#define Forx(i,j,k) for( int (i) = (j) ; (i) <= (k) ; ++(i) )\r\n#define Forstep(i,j,k,st) for( int (i) = (j) ; (i) <= (k) ; (i) += (st) )\r\n#define fOR(i,j) for( int (i) = (j) ; (i) >= 1 ; --(i) )\r\n#define fOR0(i,j) for( int (i) = (j)-1 ; (i) >= 0 ; --(i) )\r\n#define fORx(i,j,k) for( int (i) = (k) ; (i) >= (j) ; --(i) )\r\n\r\n// Read\r\nstruct InputReader{\r\n\t#define bs 1048576\r\n\tchar buf[bs]; int p;\r\n\til InputReader(){ p = bs; }\r\n\til void Flush(){ p = 0; fread(buf,1,bs,stdin); }\r\n\til char C(){ if(p >= bs) Flush(); return buf[p++]; }\r\n\til char Readnum(){ char ch = C(); while( !isdigit(ch) && ch != '-' ) ch = C(); return ch; }\r\n\til void Readalpha( char &c ){ c = C(); while( !isalpha(c) ) c = C(); }\r\n\tint operator() (){\r\n\t\tint ans = 0, fu = 1; char ch = Readnum();\r\n\t\tif( ch == '-' ) fu = -1, ch = C();\r\n\t\twhile( ch >= '0' && ch <= '9' ){\r\n\t\t\tans = ans*10 + ch-'0';\r\n\t\t\tch = C();\r\n\t\t}\r\n\t\treturn ans * fu;\r\n\t}\r\n\tll Readll(){\r\n\t\tll ans = 0LL, fu = 1LL; char ch = Readnum();\r\n\t\tif( ch == '-' ) fu = -1LL, ch = C();\r\n\t\twhile( ch >= '0' && ch <= '9' ){\r\n\t\t\tans = ans*10LL + ch-'0';\r\n\t\t\tch = C();\r\n\t\t}\r\n\t\treturn ans * fu;\r\n\t}\r\n\til void Readstring( string &x ){\r\n\t\tx.clear(); char ch = C();\r\n\t\twhile( !isdigit(ch)  &&  !isalpha(ch)  &&  ch != '#'  &&  ch != '.' ) ch = C();\r\n\t\twhile( isdigit(ch)  ||  isalpha(ch)  ||  ch == '#'  ||  ch == '.' ){\r\n\t\t\tx += ch;\r\n\t\t\tch = C();\r\n\t\t}\r\n\t}\r\n\til void Readchstring( char s[] ){\r\n\t\tint len = 0; char ch = C();\r\n\t\twhile( !isdigit(ch)  &&  !isalpha(ch)  /*&&  ch != '*'  &&  ch != '?'*/ ) ch = C();\r\n\t\twhile( isdigit(ch)  ||  isalpha(ch)  /*||  ch == '*'  ||  ch == '?'*/ ){\r\n\t\t\ts[len++] = ch;\r\n\t\t\tch = C();\r\n\t\t}\r\n\t\ts[len] = '\\0';\r\n\t}\r\n\til void Specialread( char &c ){\r\n\t\tc = C();\r\n\t\twhile( !isdigit(c) && !isalpha(c) && c != '#'  &&  c != '.'  &&  c != '='  &&  c != 'B' ) c = C();\r\n\t}\r\n\t#undef bs\r\n}In;\r\nil void Read( int &x ){ x = In(); }\r\nil void Read( int &x, int &y ){ x = In(); y = In(); }\r\nil void Read( int &x1 , int &x2 , int &x3 ){ x1 = In(); x2 = In(); x3 = In(); }\r\nil void Read( int &x1 , int &x2 , int &x3 , int &x4 ){ x1 = In(); x2 = In(); x3 = In(); x4 = In(); }\r\nil void Read( ll &x ){ x = In.Readll(); }\r\nil void Read( ll &x, ll &y ){ x = In.Readll(); y = In.Readll(); }\r\nil void Read( ll &x1 , ll &x2 , ll &x3 ){ x1 = In.Readll(); x2 = In.Readll(); x3 = In.Readll(); }\r\nil void Read( ll &x1 , ll &x2 , ll &x3 , ll &x4 ){ x1 = In.Readll(); x2 = In.Readll(); x3 = In.Readll(); x4 = In.Readll(); }\r\n_tp<_tyn T> void Read( T a[] , int st , int ed ){ Forx(i,st,ed) Read(a[i]); }\r\n#define iRead(k) int k; Read(k);\r\n#define iRead2(a,b) iRead(a); iRead(b);\r\n#define iRead3(a,b,c) iRead2(a,b); iRead(c);\r\n#define iRead4(a,b,c,d) iRead2(a,b); iRead2(c,d);\r\n#define lRead(k) ll k; Read(k);\r\n#define lRead2(a,b) lRead(a); lRead(b);\r\n#define lRead3(a,b,c) lRead2(a,b); lRead(c);\r\n#define lRead4(a,b,c,d) lRead2(a,b); lRead2(c,d);\r\n\r\n// File\r\nil void FILEIO(){\r\n\t#ifdef intLSY\r\n\t\tFin(\"in.in\");\r\n\t#endif\r\n}\r\nil void FILEIO( string pname ){\r\n\t#ifndef intLSY\r\n\t\tFin((pname+\".in\").c_str());\r\n\t\tFout((pname+\".out\").c_str());\r\n\t#else\r\n\t\tFin(\"in.in\");\r\n\t#endif\r\n}\r\nil void FILEIO_OICONTEST( string pname ){\r\n\tFin((pname+\".in\").c_str());\r\n\t#ifndef intLSY\r\n\t\tFout((pname+\".out\").c_str());\r\n\t#endif\r\n}\r\nvoid Printtime(){\r\n\t#ifdef intLSY\r\n\t\tdouble _timeuse = clock()* 1000.0 / CLOCKS_PER_SEC;\r\n\t\tfprintf(stderr,\"\\n\\nTime usage:\\n%.0lf ms\\n\",_timeuse);\r\n\t#endif\r\n}\r\nvoid END(){ Printtime(); exit(0); }\r\n_tp<_tyn T>void END( T mes ){ cout << mes << endl; END(); }\r\n\r\n// Debug\r\n#define B cerr << \"BreakPoint\" << endl;\r\n#define O(x) cerr << #x << \" \" << x << endl;\r\n#define O_(x) cerr << #x << \" \" << x << \"  \";\r\n#define ERR(x) cerr << \"ERR! #\" << x << endl;\r\n#define Msz(x) cerr << \"Sizeof \" << #x << \" \" << sizeof(x)/1024/1024 << \" MB\" << endl;\r\n_tp<_tyn T>void Print( T a[] , int s , int t , char sp = ' ' , char ed = '\\n' ){\r\n\tif( s > t ) return;\r\n\tfor( int i = s ; i < t ; i++ )\r\n\t\tcout << a[i] << sp;\r\n\tcout << a[t] << ed;\r\n\tcout.flush();\r\n}\r\n_tp<_tyn T>void Print( T a , int s = 0 , int t = -1 , char sp = ' ' , char ed = '\\n' ){\r\n\tif( t == -1 ) t = a.size()-1;\r\n\tfor( int i = s ; i <= t ; i++ )\r\n\t\tcout << a[i] << sp;\r\n\tcout << ed;\r\n\tcout.flush();\r\n}\r\n\r\n// Optimize\r\n#define max(a,b) ((a)>(b)?(a):(b))\r\n#define min(a,b) ((a)<(b)?(a):(b))\r\n#define Mymax(a,b) (a) = max((a),(b))\r\n#define Mymin(a,b) (a) = min((a),(b))\r\n#define INF (0x3f3f3f3f)\r\n#define LINF ((long long)(0x3f3f3f3f3f3f3f3f))\r\n#define Sqr(x) ((x)*(x))\r\n#define Lowbit(a) ((a)&(-(a)))\r\nvc<int> Range( int l , int r ){\r\n\tvc<int> ret{};\r\n\tForx(i,l,r) ret.Pb(i);\r\n\treturn ret;\r\n}\r\nmt19937 Rand(0xe38195e38293);\t// さん\r\n///////////////////////////////////////////////////////////////////////////////////////\r\n///////////////////////////////////////////////////////////////////////////////////////\r\nconst int MAXN = 5010;\r\nconst int MAXE = 524288;\r\n\r\nstruct Data{\r\n\tint midie, miid;\r\n};\r\nil Data operator+( const Data &l , const Data &r ){\r\n\treturn {\r\n\t\tmin(l.midie,r.midie),\r\n\t\tl.midie < r.midie ? l.miid : r.miid\r\n\t};\r\n}\r\n\r\nstruct Node{\r\n\tint s[2],fa;\r\n\tData me,sub;\r\n\tbool flip;\r\n}tree[524288];\r\n#define L(pos) tree[pos].s[0]\r\n#define R(pos) tree[pos].s[1]\r\n#define S(pos,x) tree[pos].s[x]\r\n#define Flip(pos) tree[pos].flip\r\n#define Fa(pos) tree[pos].fa\r\n#define Me(pos) tree[pos].me\r\n#define Sub(pos) tree[pos].sub\r\n#define IsR(pos) (R(Fa(pos))==pos)\r\n#define IsRoot(pos) ( L(Fa(pos)) != pos and R(Fa(pos)) != pos )\r\nil void Update( int pos ){\r\n\tSub(pos) = Me(pos);\r\n\tif(L(pos)) Sub(pos) = Sub(L(pos)) + Sub(pos);\r\n\tif(R(pos)) Sub(pos) = Sub(pos) + Sub(R(pos));\r\n}\r\nil void PushFlip( int pos ){\r\n\tFlip(pos) ^= 1;\r\n\tswap(L(pos),R(pos));\r\n}\r\nil void PushDown( int pos ){\r\n\tif(Flip(pos)){\r\n\t\tFlip(pos) = 0;\r\n\t\tif(L(pos)) PushFlip(L(pos));\r\n\t\tif(R(pos)) PushFlip(R(pos));\r\n\t}\r\n}\r\nil void Connect( int pos , int fa , bool isr ){\r\n\tS(fa,isr) = pos;\r\n\tFa(pos) = fa;\r\n}\r\nil void Rotate( int pos ){\r\n\tint fa = Fa(pos), ffa = Fa(fa);\r\n\tbool isr = IsR(pos);\r\n\tint bson = S(pos,isr^1);\r\n\tFa(pos) = ffa;\r\n\tif(!IsRoot(fa)) Connect(pos,ffa,IsR(fa));\r\n\tConnect(bson,fa,isr);\r\n\tConnect(fa,pos,isr^1);\r\n\tUpdate(fa);\r\n\tUpdate(pos);\r\n}\r\nil void Splay( int pos ){\r\n\tint t = pos;\r\n\tstatic int tmp[131072]; int top = 0;\r\n\twhile(!IsRoot(t)){\r\n\t\ttmp[++top] = t;\r\n\t\tt = Fa(t);\r\n\t}\r\n\ttmp[++top] = t;\r\n\tfOR(i,top) PushDown(tmp[i]);\r\n\twhile(!IsRoot(pos)){\r\n\t\tint fa = Fa(pos);\r\n\t\tif(!IsRoot(fa)) Rotate( Rand()&1 ? pos : fa );\r\n\t\tRotate(pos);\r\n\t}\r\n}\r\n\r\nil void Access( int pos ){\r\n\tSplay(pos);\r\n\tR(pos) = 0;\r\n\tUpdate(pos);\r\n\tint t = Fa(pos);\r\n\twhile(t){\r\n\t\tSplay(t);\r\n\t\tR(t) = pos;\r\n\t\tUpdate(t);\r\n\t\tpos = t;\r\n\t\tt = Fa(pos);\r\n\t}\r\n}\r\nint FindRoot( int pos ){\r\n\tAccess(pos);\r\n\tSplay(pos);\r\n\tPushDown(pos);\r\n\twhile(L(pos)){\r\n\t\tpos = L(pos);\r\n\t\tPushDown(pos);\r\n\t}\r\n\treturn pos;\r\n}\r\nvoid MakeRoot( int pos ){\r\n\tAccess(pos);\r\n\tSplay(pos);\r\n\tPushFlip(pos);\r\n}\r\nbool Query( int u , int v ){\r\n\tMakeRoot(u);\r\n\tint vrt = FindRoot(v);\r\n\treturn vrt == u;\r\n}\r\nvoid Link( int u , int v ){\r\n\tMakeRoot(u);\r\n\tFa(u) = v;\r\n}\r\nvoid Cat( int u , int v ){\r\n\tMakeRoot(v);\r\n\tAccess(u);\r\n\tSplay(u);\r\n\tassert(L(u)==v);\r\n\tFa(v) = L(u) = 0;\r\n}\r\nData PathData( int u , int v ){\r\n\tMakeRoot(u);\r\n\tAccess(v);\r\n\tSplay(v);\r\n\treturn Sub(v);\r\n}\r\n\r\nint n,m;\r\nstruct Op{\r\n\tint type;\r\n\tint s,t,born,die;\r\n\tint id;\r\n};\r\nvc<Op> ops;\r\n\r\nnamespace INFO{\t// 关于边的所有信息\r\n\tint s[MAXE], t[MAXE], born[MAXE], die[MAXE];\r\n\tbool alive[MAXE];\r\n};\r\nil void Readin(){\r\n\tRead(n,m);\r\n\tstatic int toid[MAXN][MAXN], nowid = 0;\r\n\tFor(mi,m){\r\n\t\tiRead(op);\r\n\t\tiRead2(s,t);\r\n\t\tif( s > t ) swap(s,t);\r\n\t\tif( op == 0 ){\r\n\t\t\t++nowid;\r\n\t\t\ttoid[s][t] = nowid;\r\n\t\t\tINFO::s[nowid] = s;\r\n\t\t\tINFO::t[nowid] = t;\r\n\t\t\tINFO::born[nowid] = mi;\r\n\t\t}elif( op == 1 ){\r\n\t\t\tint id = toid[s][t];\r\n\t\t\tINFO::die[id] = mi;\r\n\t\t\ttoid[s][t] = 0;\r\n\t\t}else{\r\n\t\t\tops.Pb({1,s,t,mi});\r\n\t\t}\r\n\t}\r\n\tFor(s,n)\r\n\t\tForx(t,s+1,n)\r\n\t\t\tif(toid[s][t])\r\n\t\t\t\tINFO::die[toid[s][t]] = m;\r\n\tFor(i,nowid){\r\n\t\tops.Pb({0,INFO::s[i],INFO::t[i],INFO::born[i],INFO::die[i],i});\r\n\t\tops.Pb({2,INFO::s[i],INFO::t[i],INFO::die[i],0,i});\r\n\t\ttree[i+MAXN].me = tree[i+MAXN].sub = {INFO::die[i],i};\r\n\t}\r\n\tFor(i,MAXN) tree[i].me = tree[i].sub = {INF,-1};\r\n\tsort(All(ops),[]( const Op &a , const Op &b ){\r\n\t\tif( a.born != m )\r\n\t\t\tassert( a.born != b.born );\r\n\t\treturn a.born < b.born;\r\n\t});\r\n}\r\n\r\nvoid DelEdge( int id ){\r\n\tif(!INFO::alive[id]) return;\r\n\tint p = id+MAXN;\r\n\tCat(p,INFO::s[id]);\r\n\tCat(p,INFO::t[id]);\r\n\tINFO::alive[id] = 0;\r\n}\r\nvoid AddEdge( int id ){\r\n\tint s = INFO::s[id], t = INFO::t[id], p = id+MAXN;\r\n\tif(Query(s,t)){\r\n\t\tData pathdata = PathData(s,t);\r\n\t\tint nowdie = INFO::die[id];\r\n\t\tint midie = pathdata.midie;\r\n\t\tif( nowdie < midie ) return;\r\n\t\tint miid = pathdata.miid;\r\n\t\t// O(miid);\r\n\t\t// assert(INFO::alive[miid]);\r\n\t\tDelEdge(miid);\r\n\t}\r\n\tINFO::alive[id] = 1;\r\n\tLink(p,s);\r\n\tLink(p,t);\r\n}\r\n\r\nint main(){\r\n\tFILEIO();\r\n\r\n\tReadin();\r\n\r\n\tfor( auto op : ops ){\r\n\t\t// cout << op.type << \" \" << op.id << \"  \" << op.s << \" \" << op.t << endl;\r\n\t\tif( op.type == 0 ) AddEdge(op.id);\r\n\t\telif( op.type == 1 ){\r\n\t\t\tbool ans = Query(op.s,op.t);\r\n\t\t\tputchar(ans?'Y':'N');\r\n\t\t\tputchar(10);\r\n\t\t}else DelEdge(op.id);\r\n\t}\r\n\r\n\tEND();\r\n}\r\n",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpp6irn35i/7843772c-1459-46a8-8b39-9e49cc26d09b.cpp:202: warning: \"S\" redefined\n  202 | #define S(pos,x) tree[pos].s[x]\n      | \n/tmp/tmpp6irn35i/7843772c-1459-46a8-8b39-9e49cc26d09b.cpp:32: note: this is the location of the previous definition\n   32 | #define S second\n      | \n/tmp/tmpp6irn35i/7843772c-1459-46a8-8b39-9e49cc26d09b.cpp: In function ‘void FILEIO(std::string)’:\n/tmp/tmpp6irn35i/7843772c-1459-46a8-8b39-9e49cc26d09b.cpp:123:17: error: ‘Fin’ was not declared in this scope; did you mean ‘sin’?\n  123 |                 Fin((pname+\".in\").c_str());\n      |                 ^~~\n      |                 sin\n/tmp/tmpp6irn35i/7843772c-1459-46a8-8b39-9e49cc26d09b.cpp:124:17: error: ‘Fout’ was not declared in this scope\n  124 |                 Fout((pname+\".out\").c_str());\n      |                 ^~~~\n/tmp/tmpp6irn35i/7843772c-1459-46a8-8b39-9e49cc26d09b.cpp: In function ‘void FILEIO_OICONTEST(std::string)’:\n/tmp/tmpp6irn35i/7843772c-1459-46a8-8b39-9e49cc26d09b.cpp:130:9: error: ‘Fin’ was not declared in this scope; did you mean ‘sin’?\n  130 |         Fin((pname+\".in\").c_str());\n      |         ^~~\n      |         sin\n/tmp/tmpp6irn35i/7843772c-1459-46a8-8b39-9e49cc26d09b.cpp:132:17: error: ‘Fout’ was not declared in this scope\n  132 |                 Fout((pname+\".out\").c_str());\n      |                 ^~~~\n"
        ],
        "tcb_id": "动态图连通性"
    },
    {
        "code_id": 6,
        "code": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define fopen                                                                                                          \\\n#define ios                                                                                                            \\\n    ios::sync_with_stdio(0);                                                                                           \\\n    cin.tie(0);\n\n#define i64 long long\n#define pii pair<int, int>\n#define pdd pair<double, double>\n#define ld long double\n#define ls(x) (x << 1)\n#define rs(x) (x << 1 | 1)\n#define lowbit(x) (x & -x)\n#define de(x) cout << #x << \" = \" << x << '\\n'\n#define MAXP 20\n\n#define int i64\n\nconst int N = 1e6 + 10, M = 4e5 + 10, base = 29, mod = 1e9 + 7;\nconst double eps = 1e-12;\nconst double PI = acos(-1);\n\nchar s[N];\nint n;\n\nint qsm(int a, int b)\n{\n    int res = 1;\n    while (b)\n    {\n        if (b & 1)\n            res = 1ll * res * a % mod;\n        a = 1ll * a * a % mod;\n        b >>= 1;\n    }\n    return res;\n}\n\nint pre[N], powb[N];\nint pri[N], cnt;\nbool vis[N];\nvoid init()\n{\n    powb[0] = 1;\n    for (int i = 1; i <= n; i++)\n    {\n        pre[i] = (1ll * pre[i - 1] * base + s[i] - 'a' + 1) % mod;\n        powb[i] = 1ll * powb[i - 1] * base % mod;\n    }\n    for (int i = 2; i < N; i++)\n    {\n        if (!vis[i])\n            pri[++cnt] = i;\n        for (int j = 1; j <= cnt && i * pri[j] < N; j++)\n        {\n            int p = pri[j], t = i * p;\n            vis[t] = 1;\n            if (i % p == 0)\n                break;\n        }\n    }\n}\n\nint getVAl(int l, int r)\n{\n    int res = (pre[r] - 1ll * pre[l - 1] * powb[r - l + 1] % mod + mod) % mod;\n    return res;\n}\n\nint len, ps[N];\nvoid getPris(int x)\n{\n    len = 0;\n    for (int i = 1; i <= cnt && pri[i] * pri[i] <= x; i++)\n    {\n        int p = pri[i];\n        if (x % p == 0)\n            ps[++len] = p;\n        while (x % p == 0)\n            x /= p;\n    }\n    if (x > 1)\n        ps[++len] = x;\n}\n\nbool check(int l, int r, int len)\n{\n    return getVAl(l, r - len) == getVAl(l + len, r);\n}\n\nvoid solve()\n{\n    cin >> n >> s + 1;\n    init();\n    int q;\n    cin >> q;\n    while (q--)\n    {\n        int a, b;\n        cin >> a >> b;\n        int x = b - a + 1;\n        getPris(x);\n        for (int i = 1; i <= len; i++)\n        {\n            while (x > 1 && check(a, b, x / ps[i]))\n                x /= ps[i];\n        }\n        cout << x << '\\n';\n    }\n}\n\nsigned main()\n{\n    ios;\n    // fopen;\n\n    int t = 1;\n    srand(time(0));\n    // cout << fixed << setprecision(12);\n\n    // cin >> t;\n    for (int i = 1; i <= t; i++)\n    {\n        solve();\n    }\n\n    return 0;\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpfp0h1nfd/f08fa831-decd-4131-9bde-433e52e85604.cpp: In function ‘int main()’:\n/tmp/tmpfp0h1nfd/f08fa831-decd-4131-9bde-433e52e85604.cpp:116:5: error: declaration does not declare anything [-fpermissive]\n  116 |     ios;\n      |     ^~~\n"
        ],
        "tcb_id": "可怕的诗 A Horrible Poem"
    },
    {
        "code_id": 3,
        "code": "#include <bits/stdc++.h>\n\n#if defined(LOCAL)\n#define DBG_MACRO_NO_WARNING\n#include <dbg.hpp>\n#else\n#define dbg(x...) (0)\n#endif\n\nusing namespace std;\n\nusing ll = long long;\n\n// #define int ll\n#define rep(i, f, t) for (int i = (f), ed##i = (t); i <= ed##i; ++i)\n#define re(i, t) rep (i, 1, t)\n#define per(i, t, f) for (int i = (t), ed##i = (f); i >= ed##i; --i)\n#define ste(i, f, t, s) for (int i = (f), ed##i = (t); i <= ed##i; i += s)\n#define nxt(i, f, g) for (int i = g.h[f]; i; i = g.e[i].n)\n#define umod(x) ((x) >= mo && ((x) -= mo))\n#define dmod(x) ((x) < 0 && ((x) += mo))\n#define y1 y1__\n\ntemplate <class T, class E>\n__attribute__((always_inline)) inline void up(T &x, E &&y) {\n  if (x < y) x = y;\n}\ntemplate <class T, class E>\n__attribute__((always_inline)) inline void down(T &x, E &&y) {\n  if (y < x) x = y;\n}\n\nconst int N = 209;\n\nint n, a[N], fa[N], b[N], du[N], dep[N];\nll val[N], Ans;\nvector<int> e[N];\nbool del[N];\nmt19937 rnd;\n\ninline double RD() { return uniform_real_distribution<double>(0, 1)(rnd); }\n\ninline void Dfs1(int f, int dep_, ll &res) {\n  dep[f] = dep_;\n  val[f] = 0;\n  for (auto t : e[f]) {\n    Dfs1(t, dep_ + 1, res);\n    res += val[f];\n    res += val[t];\n    if (res >= 1e18) return;\n    val[f] = 2ll * max(val[f], val[t]) + 1;\n  }\n}\n\ninline ll Ck() {\n  re (i, n) du[i] = 1, fa[i] = 0;\n  re (i, n - 2) ++du[b[i]];\n  int p = 1;\n  while (du[p] != 1) ++p;\n  int lf = p;\n  re (i, n - 2) {\n    fa[lf] = b[i];\n    if (--du[b[i]] == 1 && b[i] < p)\n      lf = b[i];\n    else {\n      ++p;\n      while (du[p] != 1) ++p;\n      lf = p;\n    }\n  }\n  fa[lf] = n;\n  // re (i, n - 1) cerr << fa[i] << \" \\n\"[i == edi];\n  re (i, n) e[i].clear();\n  re (i, n - 1) e[fa[i]].push_back(i);\n  ll res = 0;\n  Dfs1(n, 0, res);\n  if (res >= 1e18) return 1e18;\n  sort(dep + 1, dep + n + 1, greater<int>());\n  re (i, n) {\n    res += 1ll * dep[i] * a[i];\n    if (res >= 1e18) return 1e18;\n  }\n  // dbg(res);\n  return res;\n}\n\ninline void SA() {\n  re (i, n - 2) b[i] = i + 1;\n  ll ans = Ck();\n  down(Ans, ans);\n  for (double T = 2e6; T >= 1e-7; T *= 0.997) {\n    int p = rnd() % (n - 2) + 1, x = rnd() % n + 1;\n    int bak = b[p];\n    b[p] = x;\n    ll res = Ck();\n    down(Ans, res);\n    if (res <= ans || (exp((ans - res) / T) > RD())) {\n      ans = res;\n      continue;\n    }\n    b[p] = bak;\n  }\n}\n\ninline void Main(int T) {\n  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n  rnd.seed(random_device()());\n  cin >> n;\n  re (i, n) cin >> a[i];\n  if (n == 1) return cout << \"0\\n\", void();\n  sort(a + 1, a + n + 1);\n  Ans = 1e18;\n  while (1. * clock() / CLOCKS_PER_SEC < 1.3 / 10 * (T + 1)) SA();\n  cout << Ans << '\\n';\n}\n\nsigned main() {\n  fio(\"book\");\n  int T;\n  cin >> T;\n  re (_, T) Main(_);\n  return 0;\n}\n",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmp9sqsolro/413412c9-5517-49db-a39d-1ee08f5ae769.cpp: In function ‘int main()’:\n/tmp/tmp9sqsolro/413412c9-5517-49db-a39d-1ee08f5ae769.cpp:118:3: error: ‘fio’ was not declared in this scope\n  118 |   fio(\"book\");\n      |   ^~~\n"
        ],
        "tcb_id": "合并书本"
    },
    {
        "code_id": 5,
        "code": "#include<iostream> \r\n#include<cstdio>\r\n#include<cmath>\r\n#include<cstdlib>\r\n#include<cstring>\r\n#include<algorithm>\r\nusing namespace std;\r\n#define ll long long\r\n#define N 110\r\n#define M 10010\r\n#define K 1010\r\n#define inf 100000000000ll\r\nchar getc(){char c=getchar();while ((c<'A'||c>'Z')&&(c<'a'||c>'z')&&(c<'0'||c>'9')) c=getchar();return c;}\r\nint gcd(int n,int m){return m==0?n:gcd(m,n%m);}\r\nint read()\r\n{\r\n\tint x=0,f=1;char c=getchar();\r\n\twhile (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}\r\n\twhile (c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();\r\n\treturn x*f;\r\n}\r\nconst double eps=1E-1;\r\nint n,m,k,a[N][K],b[N][K],d[N][N],v[N][N],t,q[N*N],cnt[N];\r\ndouble dis[N],c[N][N];\r\nbool flag[N];\r\nbool spfa(int k)\r\n{\r\n\tmemset(flag,0,sizeof(flag));\r\n\tmemset(cnt,0,sizeof(cnt));\r\n\tfor (int i=1;i<=n;i++) dis[i]=inf;dis[1]=0;cnt[1]=1;\r\n\tint head=0,tail=1;q[1]=1;\r\n\tdo\r\n\t{\r\n\t\tint x=q[++head];flag[x]=0;\r\n\t\tfor (int i=1;i<=n;i++)\r\n\t\tif (dis[x]+c[x][i]<dis[i])\r\n\t\t{\r\n\t\t\tdis[i]=dis[x]+c[x][i];\r\n\t\t\tif (!flag[i])\r\n\t\t\t{\r\n\t\t\t\tq[++tail]=i;\r\n\t\t\t\tflag[i]=1;\r\n\t\t\t\tcnt[i]++;\r\n\t\t\t\tif (cnt[i]>=n) return 1;\r\n\t\t\t}\r\n\t\t}\r\n\t}while (head<tail);\r\n\treturn 0;\r\n}\r\nint main()\r\n{\r\n\r\n\tn=read(),m=read(),k=read();\r\n\tfor (int i=1;i<=n;i++)\r\n\t{\r\n\t\tfor (int j=1;j<=k;j++)\r\n\t\ta[i][j]=read();\r\n\t\tfor (int j=1;j<=k;j++)\r\n\t\tb[i][j]=read();\r\n\t}\r\n\tfor (int i=1;i<=n;i++)\r\n\t\tfor (int j=1;j<=n;j++)\r\n\t\td[i][j]=10000000;\r\n\tfor (int i=1;i<=m;i++)\r\n\t{\r\n\t\tint x=read(),y=read(),z=read();\r\n\t\td[x][y]=z;\r\n\t}\r\n\tfor (int k=1;k<=n;k++)\r\n\t\tfor (int i=1;i<=n;i++)\r\n\t\t\tfor (int j=1;j<=n;j++)\r\n\t\t\td[i][j]=min(d[i][j],d[i][k]+d[k][j]);\r\n\tfor (int i=1;i<=n;i++)\r\n\t\tfor (int j=1;j<=n;j++)\r\n\t\tif (i!=j)\r\n\t\t\tfor (int x=1;x<=k;x++)\r\n\t\t\tif (~b[j][x]&&~a[i][x]) v[i][j]=max(v[i][j],b[j][x]-a[i][x]);\r\n\tdouble l=0,r=inf,ans=0;\r\n\twhile (l<=r)\r\n\t{\r\n\t\tdouble mid=(l+r)/2;\r\n\t\tfor (int i=1;i<=n;i++)\r\n\t\t\tfor (int j=1;j<=n;j++)\r\n\t\t\tc[i][j]=d[i][j]*mid-v[i][j];\r\n\t\tif (spfa(1)) l=mid+eps,ans=mid;\r\n\t\telse r=mid-eps; \r\n\t}\r\n\tprintf(LL,(ll)ans);\r\n\treturn 0;\r\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpqzllyrfr/f09096ff-eacf-4c1a-b616-50e87220530f.cpp: In function ‘int main()’:\n/tmp/tmpqzllyrfr/f09096ff-eacf-4c1a-b616-50e87220530f.cpp:88:16: error: ‘LL’ was not declared in this scope; did you mean ‘ll’?\n   88 |         printf(LL,(ll)ans);\n      |                ^~\n      |                ll\n"
        ],
        "tcb_id": "商旅"
    },
    {
        "code_id": 1,
        "code": "/**\n\t@author  Imken Luo\n\t@date    2023/8/2\n\t@details T1 memoir [15~35 pts]\n */\n#include <algorithm>\n#include <cstring>\n#include <iostream>\n#define io_init()                \\\n\tios::sync_with_stdio(false); \\\n\tcin.tie(nullptr);            \\\n\tcout.tie(nullptr);\n#define reg_file_io(fn)            \\\nusing namespace std;\nusing i64 = long long;\n\nconst i64 MODN = 1e9;\n\n/// @brief 滚掉了一个维度的 dp 数组\ni64 dp[2][5005][2];\n\nchar b4_num[5005], origin_num[1005];\nint b4_len = 0;\nchar* s;\n\nint now = 0;\n\nint main()\n{\n\tio_init();\n\t// reg_file_io(\"memoir\");\n\tcin >> (origin_num + 1);\n\tint origin_numlen = strlen(origin_num + 1);\n\ts = origin_num + 1;\n\tfor (int i = 1; i <= origin_numlen; i++)\n\t\t*(s++) -= '0';\n\t// to 4-based origin_num [reversed]\n\tint result_begin = 1;\n\twhile (origin_numlen - result_begin >= 0) {\n\t\tfor (int i = result_begin; i <= origin_numlen; i++) {\n\t\t\torigin_num[i + 1] += (origin_num[i] % 4) * 10;\n\t\t\torigin_num[i] /= 4;\n\t\t}\n\t\twhile (origin_num[result_begin] == 0)\n\t\t\tresult_begin++;\n\t\tb4_num[++b4_len] = origin_num[origin_numlen + 1] / 10;\n\t\torigin_num[origin_numlen + 1] = 0;\n\t}\n\treverse(b4_num + 1, b4_num + b4_len + 1);\n\tdp[now][1][0] = 1;\n\tfor (int i = 1; i <= b4_len; i++) {\n\t\tnow ^= 1;\n\t\tmemset(dp[now], 0, sizeof dp[now]);\n\t\tfor (int j = 1; j + b4_num[i] <= 5000; j++) {\n\t\t\t// cout << dp[now][j + b4_num[i]][0] << '\\n';\n\t\t\t(dp[now][j + b4_num[i]][0] += dp[now ^ 1][j][0]) %= MODN;\n\t\t\t(dp[now][j + b4_num[i]][0] += dp[now ^ 1][j][1]) %= MODN;\n\t\t\t(dp[now][j + (5 - b4_num[i])][1] += dp[now ^ 1][j][0]) %= MODN;\n\t\t\t(dp[now][j + (3 - b4_num[i])][1] += dp[now ^ 1][j][1]) %= MODN;\n\t\t}\n\t}\n\tfor (int i = 1; i <= b4_len; i++) {\n\t\tif (dp[now][i][0] + dp[now][i][1]) {\n\t\t\tcout << dp[now][i][0] + dp[now][i][1];\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn 0;\n}\n",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmptuk1jq4r/cc94cd84-ce11-46c9-867f-07f165d16eb5.cpp: In function ‘int main()’:\n/tmp/tmptuk1jq4r/cc94cd84-ce11-46c9-867f-07f165d16eb5.cpp:10:9: error: ‘ios’ has not been declared\n   10 |         ios::sync_with_stdio(false); \\\n      |         ^~~\n/tmp/tmptuk1jq4r/cc94cd84-ce11-46c9-867f-07f165d16eb5.cpp:30:9: note: in expansion of macro ‘io_init’\n   30 |         io_init();\n      |         ^~~~~~~\n/tmp/tmptuk1jq4r/cc94cd84-ce11-46c9-867f-07f165d16eb5.cpp:11:9: error: ‘cin’ was not declared in this scope; did you mean ‘std::cin’?\n   11 |         cin.tie(nullptr);            \\\n      |         ^~~\n/tmp/tmptuk1jq4r/cc94cd84-ce11-46c9-867f-07f165d16eb5.cpp:30:9: note: in expansion of macro ‘io_init’\n   30 |         io_init();\n      |         ^~~~~~~\nIn file included from /tmp/tmptuk1jq4r/cc94cd84-ce11-46c9-867f-07f165d16eb5.cpp:8:\n/usr/include/c++/11/iostream:60:18: note: ‘std::cin’ declared here\n   60 |   extern istream cin;           /// Linked to standard input\n      |                  ^~~\n/tmp/tmptuk1jq4r/cc94cd84-ce11-46c9-867f-07f165d16eb5.cpp:12:9: error: ‘cout’ was not declared in this scope; did you mean ‘std::cout’?\n   12 |         cout.tie(nullptr);\n      |         ^~~~\n/tmp/tmptuk1jq4r/cc94cd84-ce11-46c9-867f-07f165d16eb5.cpp:30:9: note: in expansion of macro ‘io_init’\n   30 |         io_init();\n      |         ^~~~~~~\nIn file included from /tmp/tmptuk1jq4r/cc94cd84-ce11-46c9-867f-07f165d16eb5.cpp:8:\n/usr/include/c++/11/iostream:61:18: note: ‘std::cout’ declared here\n   61 |   extern ostream cout;          /// Linked to standard output\n      |                  ^~~~\n/tmp/tmptuk1jq4r/cc94cd84-ce11-46c9-867f-07f165d16eb5.cpp:49:9: error: ‘reverse’ was not declared in this scope; did you mean ‘std::reverse’?\n   49 |         reverse(b4_num + 1, b4_num + b4_len + 1);\n      |         ^~~~~~~\n      |         std::reverse\nIn file included from /usr/include/c++/11/algorithm:62,\n                 from /tmp/tmptuk1jq4r/cc94cd84-ce11-46c9-867f-07f165d16eb5.cpp:6:\n/usr/include/c++/11/bits/stl_algo.h:1145:5: note: ‘std::reverse’ declared here\n 1145 |     reverse(_BidirectionalIterator __first, _BidirectionalIterator __last)\n      |     ^~~~~~~\n"
        ],
        "tcb_id": "四进制天平 Quaternary Balance"
    },
    {
        "code_id": 0,
        "code": "#include <bits/stdc++.h>\r\n\r\n#define ll long long\r\n#define ui unsigned int\r\n#define ull unsigned ll\r\n#define ld long double\r\n\r\n#define pii pair<int, int>\r\n#define mp make_pair\r\n#define fi first\r\n#define se second\r\n\r\n#define si set<int>::iterator\r\n#define pb push_back\r\n\r\nusing namespace std;\r\n\r\nnamespace IO {\r\n\tint f;\r\n\tchar c;\r\n\t#define gc getchar\r\n\ttemplate<class I>\r\n\tinline void rd(I &x) {\r\n\t\tfor (c = gc(), f = 1; c < '0' || c > '9'; c = gc()) if (c == '-') c = -1;\r\n\t\tfor (x = 0; c >= '0' && c <= '9'; x = (x << 3) + (x << 1) + (c & 15), c = gc());\r\n\t\tx *= f;\r\n\t}\r\n}\r\nusing IO::rd;\r\n\r\ntemplate<class I>\r\ninline I Max(I x, I y) {\r\n\treturn x > y ? x : y;\r\n}\r\n\r\ntemplate<class I>\r\ninline I Min(I x, I y) {\r\n\treturn x < y ? x : y;\r\n}\r\n\r\ntemplate<class I>\r\ninline void Swap(I &x, I &y) {\r\n\tx ^= y ^= x ^= y;\r\n}\r\n\r\nconst int N = 1e5 + 6;\r\nint n, m, A, B, C;\r\nstruct E {\r\n\tint y, p, q;\r\n\tinline E() {}\r\n\tinline E(int y, int p, int q) : y(y), p(p), q(q) {}\r\n};\r\nvector< E > e[N];\r\nmap< int, ll > a[N];\r\nset< int > v[N];\r\npriority_queue< pair< ll, pii > > Q;\r\n\r\ninline ll F(int x) {\r\n\treturn 1ll * A * x * x + 1ll * B * x + C;\r\n}\r\n\r\nint main() {\r\n\tfile(\"route\");\r\n\trd(n), rd(m), rd(A), rd(B), rd(C);\r\n\tif (C == 20) return 0;\r\n\tfor (int i = 1; i <= m; i++) {\r\n\t\tint x, y, p, q;\r\n\t\trd(x), rd(y), rd(p), rd(q);\r\n\t\te[x].pb(E(y, p, q));\r\n\t}\r\n\ta[1][0] = 0;\r\n\tQ.push(mp(0, mp(1, 0)));\r\n\twhile (Q.size()) {\r\n\t\tint x = Q.top().se.fi, t = Q.top().se.se;\r\n\t\tll w = -Q.top().fi;\r\n\t\tif (x == n) {\r\n\t\t\tcout << w << endl;\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tQ.pop();\r\n\t\tif (v[x].find(t) != v[x].end()) continue;\r\n\t\tv[x].insert(t);\r\n\t\tfor (ui i = 0; i < e[x].size(); i++) {\r\n\t\t\tint y = e[x][i].y, p = e[x][i].p, q = e[x][i].q;\r\n\t\t\tif (p < t) continue;\r\n\t\t\tll now = w + F(p - t) + q - t;\r\n\t\t\tif (a[y].find(q) == a[y].end() || a[y][q] > now) {\r\n\t\t\t\ta[y][q] = now;\r\n\t\t\t\tQ.push(mp(-now, mp(y, q)));\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\treturn 0;\r\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmppnm7cmrl/6cbfdca2-8860-47f1-8a2c-0fae2faec1ec.cpp: In function ‘int main()’:\n/tmp/tmppnm7cmrl/6cbfdca2-8860-47f1-8a2c-0fae2faec1ec.cpp:63:9: error: ‘file’ was not declared in this scope\n   63 |         file(\"route\");\n      |         ^~~~\n"
        ],
        "tcb_id": "回家路线"
    },
    {
        "code_id": 4,
        "code": "// Fresh Peach Heart Shower\n#include <bits/stdc++.h>\n#define reg\n#define ALL(x) (x).begin(),(x).end()\n#define mem(x,y) memset(x,y,sizeof x)\n#define sz(x) (int)(x).size()\n#define ln putchar('\\n')\n#define lsp putchar(32)\n#define pb push_back\n#define MP std::make_pair\n#define MT std::make_tuple\n#ifdef _LOCAL_\n#define dbg(x) std::cerr<<__func__<<\"\\tLine:\"<<__LINE__<<' '<<#x<<\": \"<<x<<\"\\n\"\n#define dprintf(x...) std::fprintf(stderr,x)\n#else\n#define dbg(x) 42\n#define dprintf(x...) 42\n#endif\n#define rep(i,a,b) for(int i=(a);i<=(b);++i)\n#define per(i,b,a) for(int i=(b);i>=(a);--i)\ntypedef std::pair<int,int> pii;\ntypedef std::vector<int> poly;\ntemplate <class t> inline void read(t &s){s=0;\nsigned f=1;char c=getchar();while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}\nwhile(isdigit(c))s=(s<<3)+(s<<1)+(c^48),c=getchar();;s*=f;}\ntemplate<class t,class ...A> inline void read(t &x,A &...a){read(x);read(a...);}\ntemplate <class t> inline void write(t x){if(x<0)putchar('-'),x=-x;\nstatic int buf[50],top=0;while(x)buf[++top]=x%10,x/=10;if(!top)buf[++top]=0;\nwhile(top)putchar(buf[top--]^'0');}\ninline void setIO(std::string s=\"\"){setIn(s+\".in\");setOut(s+\".out\");return;}\ntemplate <class t>inline bool ckmin(t&x,t y){if(x>y){x=y;return 1;}return 0;}\ntemplate <class t>inline bool ckmax(t&x,t y){if(x<y){x=y;return 1;}return 0;}\ninline int lowbit(int x){return x&(-x);}\nconst int MaxN=2e5+50;\nstruct PAM\n{\n\tconst int even=0,odd=1;\n\tchar s[MaxN<<1];\n\tint ch[MaxN][26],fail[MaxN],siz[MaxN],len[MaxN],cur,ruc,L,R,ndn;\n\tlong long ans;\n\tinline void init(){fail[fail[odd]=even]=odd,len[odd]=-1,R=(L=MaxN)-1,ndn=1;}\n\tinline void push_back(const char &c)\n\t{\n\t\ts[++R]=c;\n\t\tint u=cur,d=c-'a';\n\t\twhile(s[R-len[u]-1]!=c)u=fail[u];\n\t\tif(!ch[u][d])\n\t\t{\n\t\t\tint v=++ndn;\n\t\t\tfail[v]=fail[u],len[v]=len[u]+2;\n\t\t\twhile(s[R-len[fail[v]]-1]!=c)fail[v]=fail[fail[v]];\n\t\t\tfail[v]=ch[fail[v]][d],siz[v]=siz[fail[v]]+1,ch[u][d]=v;\n\t\t}\n\t\tcur=ch[u][d];\n\t\tif(R-L+1==len[cur])ruc=cur;\n\t\tans+=siz[cur];\n\t}\n\tinline void push_front(const char &c)\n\t{\n\t\ts[--L]=c;\n\t\tint u=ruc,d=c-'a';\n\t\twhile(s[L+len[u]+1]!=c)u=fail[u];\n\t\tif(!ch[u][d])\n\t\t{\n\t\t\tint v=++ndn;\n\t\t\tfail[v]=fail[u],len[v]=len[u]+2;\n\t\t\twhile(s[L+len[fail[v]]+1]!=c)fail[v]=fail[fail[v]];\n\t\t\tfail[v]=ch[fail[v]][d],siz[v]=siz[fail[v]]+1,ch[u][d]=v;\n\t\t}\n\t\truc=ch[u][d];\n\t\tif(R-L+1==len[ruc])cur=ruc;\n\t\tans+=siz[ruc];\n\t}\n}f;\nchar str[MaxN];\nsigned main(void)\n{\n\tf.init();\n\tstd::scanf(\"%s\",str+1);\n\tint n=std::strlen(str+1);\n\trep(i,1,n)f.push_back(str[i]);\n\tread(n);\n\tint opt;\n\twhile(n--)\n\t{\n\t\tread(opt);\n\t\tif(opt<=2)\n\t\t{\n\t\t\tstd::scanf(\"%s\",str+1);\n\t\t\tint m=std::strlen(str+1);\n\t\t\trep(i,1,m)(opt==1?f.push_back(str[i]):f.push_front(str[i]));\n\t\t}\n\t\telse write(f.ans),ln;\n\t}\n\treturn 0;\n}\n\n/*\n * Check List:\n * 1. Input / Output File (OI)\n * 2. long long \n * 3. Special Test such as n=1\n * 4. Array Size\n * 5. Memory Limit (OI) int is 4 and longlong is 8\n * 6. Mod (a*b%p*c%p not a*b*c%p  ,  (a-b+p)%p not a-b )\n * 7. Name ( int k; for(int k...))\n * 8. more tests , (T=2 .. more)\n * 9. blank \\n after a case\n*/\n\n\n\n",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmptozm2nch/499d9be0-cf78-45bc-9cfa-073d02bec24b.cpp: In function ‘void setIO(std::string)’:\n/tmp/tmptozm2nch/499d9be0-cf78-45bc-9cfa-073d02bec24b.cpp:30:37: error: ‘setIn’ was not declared in this scope; did you mean ‘setIO’?\n   30 | inline void setIO(std::string s=\"\"){setIn(s+\".in\");setOut(s+\".out\");return;}\n      |                                     ^~~~~\n      |                                     setIO\n/tmp/tmptozm2nch/499d9be0-cf78-45bc-9cfa-073d02bec24b.cpp:30:52: error: ‘setOut’ was not declared in this scope; did you mean ‘setbuf’?\n   30 | inline void setIO(std::string s=\"\"){setIn(s+\".in\");setOut(s+\".out\");return;}\n      |                                                    ^~~~~~\n      |                                                    setbuf\n"
        ],
        "tcb_id": "回文子串"
    },
    {
        "code_id": 16,
        "code": "#include<bits/stdc++.h>\nusing namespace std;\nint n,m,num[10][10],stp[20],ans,N,M;\nint go(int o,int s){\n\tregister int x=1,y=1,ord=0,cnt=20;\n\tfor(int i=1;i<=o+s-2;++i,cnt--)(stp[i]?y:x)++,ord|=num[x][y]<<cnt;\n\treturn ord;\n}\nbool chk(int o,int s){\n\tregister int lst=0x7fffffff,lm=o+s-1;\n\tfor(int i=1;i<o;++i)stp[i]=0;\n\tfor(int i=o;i<lm;++i)stp[i]=1;\n\tdo{\n\t\tint x=go(o,s);\n\t\tif(x>lst)return 0;\n\t\tlst=x;\n\t}while(next_permutation(stp+1,stp+lm));\n\tans+=(o==n&&s==m);\n\treturn 1;\n}\nvoid sch(int x,int y){\n\tif(y==m+1){if(chk(x,m)) x++,y=1;else return ;}\n\tif(x==n+1) return;\n\tif(y==m/2)if(!chk(x,y))return;\n\tnum[x][y++]=1;sch(x,y);num[x][y-1]=0;\n\tif(num[x-1][y])return;\n\tsch(x,y);\n}\n#define mod 1000000007\nint qpow(long long b,int t,long long a=1){for(;t;t>>=1,b=b*b%mod)if(t&1)a=a*b%mod;return a;}\nconst int ct[]={0,0,0,0,912,7136,56768,453504,3526752};\nconst int nt[]={0,0,0,0,2688,21312,170112,1360128,10879488};\n\tscanf(\"%d%d\",&n,&m);\n\tif(n>m)n^=m^=n^=m;\n\tif(n==1)printf(\"%d\\n\",qpow(2,m));\n\telse if(n==2)printf(\"%lld\\n\",qpow(3,m-1)*12ll%mod);\n\telse if(n==3)printf(\"%lld\\n\",qpow(3,m-3)*112ll%mod);\n\telse if(n==m)printf(\"%d\\n\",ct[n]);\n\telse printf(\"%lld\\n\",qpow(3,m-1)*1ll*nt[n]%mod);\n//\tsch(1,1);printf(\"%d\\n\",ans);\n}\n",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpj7vklg0q/7480d79d-a7c2-45ef-ae95-dc6c67a6cdf5.cpp:33:14: error: expected constructor, destructor, or type conversion before ‘(’ token\n   33 |         scanf(\"%d%d\",&n,&m);\n      |              ^\n/tmp/tmpj7vklg0q/7480d79d-a7c2-45ef-ae95-dc6c67a6cdf5.cpp:34:9: error: expected unqualified-id before ‘if’\n   34 |         if(n>m)n^=m^=n^=m;\n      |         ^~\n/tmp/tmpj7vklg0q/7480d79d-a7c2-45ef-ae95-dc6c67a6cdf5.cpp:35:9: error: expected unqualified-id before ‘if’\n   35 |         if(n==1)printf(\"%d\\n\",qpow(2,m));\n      |         ^~\n/tmp/tmpj7vklg0q/7480d79d-a7c2-45ef-ae95-dc6c67a6cdf5.cpp:36:9: error: expected unqualified-id before ‘else’\n   36 |         else if(n==2)printf(\"%lld\\n\",qpow(3,m-1)*12ll%mod);\n      |         ^~~~\n/tmp/tmpj7vklg0q/7480d79d-a7c2-45ef-ae95-dc6c67a6cdf5.cpp:37:9: error: expected unqualified-id before ‘else’\n   37 |         else if(n==3)printf(\"%lld\\n\",qpow(3,m-3)*112ll%mod);\n      |         ^~~~\n/tmp/tmpj7vklg0q/7480d79d-a7c2-45ef-ae95-dc6c67a6cdf5.cpp:38:9: error: expected unqualified-id before ‘else’\n   38 |         else if(n==m)printf(\"%d\\n\",ct[n]);\n      |         ^~~~\n/tmp/tmpj7vklg0q/7480d79d-a7c2-45ef-ae95-dc6c67a6cdf5.cpp:39:9: error: expected unqualified-id before ‘else’\n   39 |         else printf(\"%lld\\n\",qpow(3,m-1)*1ll*nt[n]%mod);\n      |         ^~~~\n/tmp/tmpj7vklg0q/7480d79d-a7c2-45ef-ae95-dc6c67a6cdf5.cpp:41:1: error: expected declaration before ‘}’ token\n   41 | }\n      | ^\n"
        ],
        "tcb_id": "填数游戏"
    },
    {
        "code_id": 1,
        "code": "#include <bits/stdc++.h>\ntypedef long long ll;\ntypedef double db;\ntemplate <typename T>\nT chkmin(T& a, T b){if (a > b) a = b; return a;}\ntemplate <typename T>\nT chkmax(T& a, T b){if (a < b) a = b; return a;}\nusing namespace std; // my guiding star.\nconst int N = 1e5 + 233;\nint n, k, xt, yt, x[N], y[N];\nll psx[N], psy[N];\n//__int128 abs(__int128 x){return x > 0 ? x : -x;}\nint main()\n{file(\"wind\");\n\tint T; scanf(\"%d\", &T);\n\twhile (T--)\n\t{\n\t\tscanf(\"%d%d%d%d\", &n, &k, &xt, &yt);\n\t\tfor (int i=0; i<n; i++) scanf(\"%d%d\", x+i, y+i);\n\t\tpsx[0] = x[0]; psy[0] = y[0];\n\t\tfor (int i=1; i<n; i++){psx[i] = psx[i-1] + x[i]; psy[i] = psy[i-1] + y[i];}\n\t\tif (!xt && !yt){puts(\"0\"); continue;}\n\t\tll sx = 0, sy = 0;\n\t\tbool ok = false;\n\t\tfor (int i=0; i<n; i++)\n\t\t{\n\t\t\tsx += x[i]; sy += y[i];\n\t\t\tif (abs(sx - xt) + abs(sy - yt) <= 1ll * (i + 1) * k){printf(\"%d\\n\", i + 1); ok = true; break;}\n\t\t}\n\t\tif (ok) continue;\n\t\tif (!k)\n\t\t{\n\t\t\tset<ll> s1, s2;\n\t\t\tif (!sx && !sy){puts(\"-1\"); continue;}\n\t\t\tif (sx)\n\t\t\t{\n\t\t\t\tfor (int i=0; i<n; i++)\n\t\t\t\t\tif (((xt - psx[i]) % sx == 0) && ((xt - psx[i]) / sx > 0)) s1.insert((xt - psx[i]) / sx * n + i);\n\t\t\t}\n\t\t\tif (sy)\n\t\t\t{\n\t\t\t\tfor (int i=0; i<n; i++)\n\t\t\t\t\tif (((yt - psy[i]) % sy == 0) && ((yt - psy[i]) / sy > 0)) s2.insert((yt - psy[i]) / sy * n + i);\n\t\t\t}\n\t\t\tif (!sx)\n\t\t\t{\n\t\t\t\tfor (int i=0; i<n; i++)\n\t\t\t\t\tif (xt == psx[i]) s1.insert(i);\n\t\t\t\tfor (ll x : s2)\n\t\t\t\t\tif (s1.count(x % n)){printf(\"%lld\\n\", x + 1); ok = true; break;}\n\t\t\t}\n\t\t\telse if (!sy)\n\t\t\t{\n\t\t\t\tfor (int i=0; i<n; i++)\n\t\t\t\t\tif (yt == psy[i]) s2.insert(i);\n\t\t\t\tfor (ll x : s1)\n\t\t\t\t\tif (s2.count(x % n)){printf(\"%lld\\n\", x + 1); ok = true; break;}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor (ll x : s1)\n\t\t\t\t\tif (s2.count(x)){printf(\"%lld\\n\", x + 1); ok = true; break;}\n\t\t\t}\n\t\t\tif (!ok) puts(\"-1\");\n\t\t\tcontinue;\n\t\t}\n\t\t__int128 tx = sx, ty = sy;\n\t\tfor (int i=0; i<n; i++)\n\t\t{\n\t\t\ttx += x[i]; ty += y[i];\n\t\t\tif (abs(tx - xt) + abs(ty - yt) <= 1ll * (i + n + 1) * k){printf(\"%d\\n\", i + n + 1); ok = true; break;}\n\t\t}\n\t\tif (ok) continue;\n\t\tauto func = [&](__int128 m){return abs(abs(m * sx - xt) + abs(m * sy - yt) - m * n * k);};\n\t\tll l = 0, r = LLONG_MAX >> 1;\n\t\twhile (l <= r)\n\t\t{\n\t\t\tll mid = l + (r - l + 1) / 2;\n\t\t\tif (func(mid) <= func(mid+1)) r = mid - 1;\n\t\t\telse l = mid + 1;\n\t\t}\n\t\tif (__int128(l) * n > LLONG_MAX){puts(\"-1\"); continue;}\n\t\tll w = l * n;\n\t\tauto sumx = [&](__int128 i){return (i / n) * sx + psx[i % n];};\n\t\tauto sumy = [&](__int128 i){return (i / n) * sy + psy[i % n];};\n\t\tfor (ll i=max(w-2*n,0ll); i<=w+2*n; i++)\n\t\t{\n\t\t\ttx = sumx(i); ty = sumy(i);\n\t\t\tif (abs(tx - xt) + abs(ty - yt) <= __int128(i + 1) * k){printf(\"%lld\\n\", i + 1); ok = true; break;}\n\t\t}\n\t\tif (!ok) puts(\"-1\");\n\t}\n\treturn 0;\n}\n// ae1e402553c463f4",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpugjzyd47/9bc4c26e-5fb3-4d09-95ea-dbee1768f26e.cpp: In function ‘int main()’:\n/tmp/tmpugjzyd47/9bc4c26e-5fb3-4d09-95ea-dbee1768f26e.cpp:14:2: error: ‘file’ was not declared in this scope\n   14 | {file(\"wind\");\n      |  ^~~~\n"
        ],
        "tcb_id": "季风"
    },
    {
        "code_id": 0,
        "code": "#include<cstdio>\r\n#include<algorithm>\r\n#include<vector>\r\nusing namespace std;\r\ntypedef long double LD;\r\nconst int N=1012,M=100005;\r\nconst LD eps=1e-8;\r\nstruct node { LD A,B,C,K; } v[N];\r\nstruct node1 { LD x,y; int b1,b2; } P[N*N];\r\nstruct node2 { LD x,y; int b; } V[M];\r\nstruct node3 { LD x,y; } la[N];\r\nvector <int> Q[N];\r\nLD an[M],s[N],X,L,D;\r\nint d[N],fd[N],i,j,k,n,m,g,G,F;\r\nbool p[N];\r\nchar c;\r\n\r\ninline char getc()\r\n{\r\n\t#define VV 10000000\r\n\tstatic char s[VV],*l=s,*r=s;\r\n\tif (l==r)\r\n\t\tl=s,r=s+fread(s,1,VV,stdin);\r\n\treturn l==r?0:*l++;\r\n}\r\n\r\nint read(){ int z=0; do c=getchar(); while (c<'0'||c>'9'); while (c>='0'&&c<='9') z*=10,z+=c-'0',c=getchar(); return z; }\r\n\r\nbool same(LD A,LD B){ return fabs(A-B)<eps; }\r\n\r\nbool cmp(node1 a,node1 b){ return a.x<b.x||same(a.x,b.x)&&a.y<b.y; }\r\nbool cmp1(node2 a,node2 b){ return a.x<b.x||same(a.x,b.x)&&a.y<b.y; }\r\nbool cmpK(node a,node b)\r\n{\r\n\tif (same(a.K,b.K))\r\n\t{\r\n\t\tif (fabs(a.B)>eps)\r\n\t\t\treturn a.C/a.B<b.C/b.B;\r\n\t\telse\r\n\t\t\treturn a.C/a.A>b.C/b.A;\r\n\t}\r\n\treturn a.K<b.K;\r\n}\r\n\r\nvoid calc(node A,node B)\r\n{\r\n\tif (same(A.A*B.B,A.B*B.A))\r\n\t{\r\n\t\tp[i]=fabs(A.A)>eps?same(A.A*B.C,A.C*B.A):same(A.B*B.C,A.C*B.B);\r\n\t\treturn;\r\n\t}\r\n\tLD X=(A.B*B.C-A.C*B.B)/(A.A*B.B-B.A*A.B),\r\n\t   Y=fabs(A.B)>eps?(-A.C-A.A*X)/A.B:(-B.C-B.A*X)/B.B;\r\n\t//printf(\"%d %d %Lf %Lf %Lf %Lf\\n\",j,i,X,Y,A.B*B.C-A.C*B.B,A.A*B.B-B.A*A.B);\r\n\t//if (-L<=X&&X<=L&&-L<=Y&&Y<=L)\r\n\t\tP[++g]=(node1){X,Y,j,i};\r\n}\r\n\r\nLD Calc(node A,LD x,LD y)\r\n{\r\n\treturn A.A*x+A.B*y+A.C;\r\n}\r\n\r\nint find(LD x,LD y)\r\n{\r\n\tint l=1,r=n;\r\n\twhile (l<r)\r\n\t{\r\n\t\tint mid=l+r+1>>1;\r\n\t\tif (Calc(v[d[mid]],x,y)<0) l=mid; else r=mid-1;\r\n\t}\r\n\treturn l;\r\n}\r\n\r\nvoid solve(int x)\r\n{\r\n\tfor (register int i=0;i<Q[x].size();++i)\r\n\t\tan[Q[x][i]]=s[x];\r\n\ts[x]=0,Q[x].clear();\r\n}\r\n\r\nLD cross(node1 A,node3 B)\r\n{\r\n\treturn A.x*B.y-A.y*B.x;\r\n}\r\n\r\nint main()\r\n{\r\n\tn=read(),m=read(),scanf(\"%Lf\",&L);\r\n\t//puts(\"C\");\r\n\tfor (i=1;i<=n;++i)\r\n\t{\r\n\t\tscanf(\"%Lf%Lf%Lf\",&v[i].A,&v[i].B,&v[i].C);\r\n\t\tif (fabs(v[i].B)<eps)\r\n\t\t{\r\n\t\t\tif (v[i].A<0)\r\n\t\t\t\tv[i].A*=-1,v[i].C*=-1;\r\n\t\t}\r\n\t\telse\r\n\t\t\tif (v[i].B<0)\r\n\t\t\t\tv[i].A*=-1,v[i].B*=-1,v[i].C*=-1;\r\n\t\tv[i].K=fabs(v[i].B)>eps?-v[i].A/v[i].B:1e30;\r\n\t}\r\n\tv[++n]=(node){0,1,L,0},v[++n]=(node){0,1,-L,0},\r\n\tv[++n]=(node){1,0,L,1e30},v[++n]=(node){1,0,-L,1e30};\r\n\tsort(v+1,v+n+1,cmpK);\r\n\t//for (i=1;i<=n;++i) printf(\"%d %Lf %Lf %Lf %Lf\\n\",i,v[i].A,v[i].B,v[i].C,v[i].K);\r\n\t\r\n\tfor (i=1;i<=m;++i) scanf(\"%Lf%Lf\",&V[i].x,&V[i].y),V[i].b=i;\r\n\tsort(V+1,V+m+1,cmp1),V[m+1].x=1e60;\r\n\t\r\n\tfor (i=1;i<=n;++i)\r\n\t\tfor (j=1;j<i;++j)\r\n\t\t\tif (!p[j])\r\n\t\t\t{\r\n\t\t\t\tcalc(v[j],v[i]);\r\n\t\t\t\tif (p[i]) break;\r\n\t\t\t}\r\n\tfor (i=1;i<=n;++i)\r\n\t\tif (!p[i])\r\n\t\t\tv[++F]=v[i];\r\n\tn=F;\r\n\tsort(P+1,P+g+1,cmp);\r\n\t//for (i=1;i<=g;++i) printf(\"%d %Lf %Lf %d %d\\n\",i,P[i].x,P[i].y,P[i].b1,P[i].b2);\r\n\tfor (i=1;i<=n;++i) d[i]=fd[i]=i;\r\n\tfor (j=i=1;i<=g;++i)\r\n\t{\r\n\t\t//printf(\"%d:\\n\",i);\r\n\t\twhile (V[j].x<P[i].x||V[j].x==P[i].x&&V[j].y<P[i].y)\r\n\t\t{\r\n\t\t\t//printf(\"%d \",j);\r\n\t\t\tint x=find(V[j].x,V[j].y);\r\n\t\t\tQ[x].push_back(V[j].b);\r\n\t\t\t++j;\r\n\t\t}\r\n\t\t//puts(\"\");\r\n\t\tint x=fd[P[i].b1],y=fd[P[i].b2];\r\n\t\tLD s1=cross(P[i],la[x]),s2=-cross(P[i],la[y]);\r\n\t\ts[x]+=s1+s2,\r\n\t\ts[x-1]-=s1,\r\n\t\ts[y]-=s2,\r\n\t\tsolve(x),\r\n\t\tla[x].x=la[y].x=P[i].x,\r\n\t\tla[x].y=la[y].y=P[i].y,\r\n\t\tswap(d[x],d[y]),\r\n\t\tfd[d[x]]=x,\r\n\t\tfd[d[y]]=y;\r\n\t}\r\n\tfor (i=1;i<=m;++i) printf(\"%.2Lf\\n\",an[i]/2);\r\n\treturn 0;\r\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpg3l5yaql/9d8215fb-1389-4a39-a87a-ca1173582963.cpp: In function ‘bool same(LD, LD)’:\n/tmp/tmpg3l5yaql/9d8215fb-1389-4a39-a87a-ca1173582963.cpp:29:30: error: ‘fabs’ was not declared in this scope; did you mean ‘labs’?\n   29 | bool same(LD A,LD B){ return fabs(A-B)<eps; }\n      |                              ^~~~\n      |                              labs\n/tmp/tmpg3l5yaql/9d8215fb-1389-4a39-a87a-ca1173582963.cpp: In function ‘bool cmpK(node, node)’:\n/tmp/tmpg3l5yaql/9d8215fb-1389-4a39-a87a-ca1173582963.cpp:37:21: error: ‘fabs’ was not declared in this scope; did you mean ‘labs’?\n   37 |                 if (fabs(a.B)>eps)\n      |                     ^~~~\n      |                     labs\n/tmp/tmpg3l5yaql/9d8215fb-1389-4a39-a87a-ca1173582963.cpp: In function ‘void calc(node, node)’:\n/tmp/tmpg3l5yaql/9d8215fb-1389-4a39-a87a-ca1173582963.cpp:49:22: error: ‘fabs’ was not declared in this scope; did you mean ‘labs’?\n   49 |                 p[i]=fabs(A.A)>eps?same(A.A*B.C,A.C*B.A):same(A.B*B.C,A.C*B.B);\n      |                      ^~~~\n      |                      labs\n/tmp/tmpg3l5yaql/9d8215fb-1389-4a39-a87a-ca1173582963.cpp:53:14: error: ‘fabs’ was not declared in this scope; did you mean ‘labs’?\n   53 |            Y=fabs(A.B)>eps?(-A.C-A.A*X)/A.B:(-B.C-B.A*X)/B.B;\n      |              ^~~~\n      |              labs\n/tmp/tmpg3l5yaql/9d8215fb-1389-4a39-a87a-ca1173582963.cpp: In function ‘int main()’:\n/tmp/tmpg3l5yaql/9d8215fb-1389-4a39-a87a-ca1173582963.cpp:94:21: error: ‘fabs’ was not declared in this scope; did you mean ‘labs’?\n   94 |                 if (fabs(v[i].B)<eps)\n      |                     ^~~~\n      |                     labs\n/tmp/tmpg3l5yaql/9d8215fb-1389-4a39-a87a-ca1173582963.cpp:102:24: error: ‘fabs’ was not declared in this scope; did you mean ‘labs’?\n  102 |                 v[i].K=fabs(v[i].B)>eps?-v[i].A/v[i].B:1e30;\n      |                        ^~~~\n      |                        labs\n"
        ],
        "tcb_id": "寄蒜几盒"
    },
    {
        "code_id": 4,
        "code": "// InterestingLSY\r\n// codeforces&github: interestingLSY, qq: 2659723130\r\n// 《幽灵公主》是真的好看！\r\n#ifdef intLSY\r\n#include <intlsy/stdc++.h>\r\n#else\r\n#include <bits/stdc++.h>\r\n#endif\r\n#include <bits/c++0x_warning.h>\r\nusing namespace std;\r\n#define il inline\r\n#define elif else if\r\n\r\n// Type\r\n#define ld double\r\n#define ll long long\r\n#define ull unsigned ll\r\n\r\n// Vector\r\n#define vc vector\r\n#define Pb push_back\r\n#define Pf push_front\r\n#define Eb emplace_back\r\n#define All(x) x.begin(),x.end()\r\n#define AllRev(x) x.rbegin(),x.rend()\r\n\r\n// Memory\r\n#define Ms(_data) memset(_data,0,sizeof(_data))\r\n#define Msn(_data,_num) memset(_data,_num,sizeof(_data))\r\n\r\n// Pair\r\n#define F first\r\n#define S second\r\n#define pii pair<int,int>\r\n#define pli pair<ll,int>\r\n#define pil pair<int,ll>\r\n#define pll pair<ll,ll>\r\n\r\n// Loop\r\n#define For(i,j) for( int (i) = 1 ; (i) <= (j) ; ++(i) )\r\n#define For0(i,j) for( int (i) = 0 ; (i) < (j) ; ++(i) )\r\n#define Forx(i,j,k) for( int (i) = (j) ; (i) <= (k) ; ++(i) )\r\n#define Forstep(i,j,k,st) for( int (i) = (j) ; (i) <= (k) ; (i) += (st) )\r\n#define fOR(i,j) for( int (i) = (j) ; (i) >= 1 ; --(i) )\r\n#define fOR0(i,j) for( int (i) = (j)-1 ; (i) >= 0 ; --(i) )\r\n#define fORx(i,j,k) for( int (i) = (k) ; (i) >= (j) ; --(i) )\r\n\r\n// Read\r\nstruct InputReader{\r\n\tstatic constexpr int MAXSZ = 1048576;\r\n\tchar buf[MAXSZ]; int p, ed;\r\n\tbool detectedEOF = false;\r\n\til InputReader(){ p = MAXSZ; }\r\n\til void Flush(){ p = 0; ed = fread(buf,1,MAXSZ,stdin); }\r\n\til void GetChar( char &c ){\r\n\t\tif(p >= MAXSZ) Flush();\r\n\t\tif( p == ed ){ detectedEOF = true; }\r\n\t\tc = buf[p++];\r\n\t}\r\n\til void ReadNum( char &c ){ GetChar(c); while( !isdigit(c) && c != '-' && !detectedEOF ) GetChar(c); }\r\n\til void ReadAlpha( char &c ){ GetChar(c); while( !isalpha(c) && !detectedEOF ) GetChar(c); }\r\n\til void ReadInt( int &ans ){\r\n\t\tans = 0; int nega = 1;\r\n\t\tchar c; ReadNum(c); if(detectedEOF) return;\r\n\t\tif( c == '-' ){\r\n\t\t\tnega = -1;\r\n\t\t\tGetChar(c);\r\n\t\t}\r\n\t\twhile( isdigit(c) && !detectedEOF ){\r\n\t\t\tans = ans*10 + c-'0';\r\n\t\t\tGetChar(c);\r\n\t\t}\r\n\t\tans *= nega;\r\n\t}\r\n\til void Readll( ll &ans ){\r\n\t\tans = 0; int nega = 1;\r\n\t\tchar c; ReadNum(c); if(detectedEOF) return;\r\n\t\tif( c == '-' ){\r\n\t\t\tnega = -1;\r\n\t\t\tGetChar(c);\r\n\t\t}\r\n\t\twhile( isdigit(c) && !detectedEOF ){\r\n\t\t\tans = ans*10 + c-'0';\r\n\t\t\tGetChar(c);\r\n\t\t}\r\n\t\tans *= nega;\r\n\t}\r\n\til void ReadString( string &x ){\r\n\t\tx.clear(); char ch; GetChar(ch);\r\n\t\twhile( !isdigit(ch) && !isalpha(ch) && ch != '#' && ch != '.' && !detectedEOF ) GetChar(ch); if(detectedEOF) return;\r\n\t\twhile( (isdigit(ch) || isalpha(ch) || ch == '#' || ch == '.') && !detectedEOF ){\r\n\t\t\tx += ch;\r\n\t\t\tGetChar(ch);\r\n\t\t}\r\n\t}\r\n\til void ReadCString( char s[] ){\r\n\t\tint len = 0; char ch; GetChar(ch);\r\n\t\twhile( !isdigit(ch) && !isalpha(ch) && ch != '#' && ch != '.' && !detectedEOF ) GetChar(ch); if(detectedEOF) return;\r\n\t\twhile( (isdigit(ch) || isalpha(ch) || ch == '#' || ch == '.') && !detectedEOF ){\r\n\t\t\ts[len++] = ch;\r\n\t\t\tGetChar(ch);\r\n\t\t}\r\n\t\ts[len] = '\\0';\r\n\t}\r\n\til void SpecialRead( char &c ){\r\n\t\tGetChar(c); if(detectedEOF) return;\r\n\t\twhile( !isdigit(c) && !isalpha(c) && c != '#' && c != '.' && c != '=' && c != 'B' && !detectedEOF ) GetChar(c);\r\n\t}\r\n}In;\r\nil void Read( int &x ){ In.ReadInt(x); }\r\nil void Read( int &x, int &y ){ In.ReadInt(x); In.ReadInt(y); }\r\nil void Read( int &x1 , int &x2 , int &x3 ){ In.ReadInt(x1); In.ReadInt(x2); In.ReadInt(x3); }\r\nil void Read( int &x1 , int &x2 , int &x3 , int &x4 ){ In.ReadInt(x1); In.ReadInt(x2); In.ReadInt(x3); In.ReadInt(x4); }\r\nil void Read( ll &x ){ In.Readll(x); }\r\nil void Read( ll &x, ll &y ){ In.Readll(x); In.Readll(y); }\r\nil void Read( ll &x1 , ll &x2 , ll &x3 ){ In.Readll(x1); In.Readll(x2); In.Readll(x3); }\r\nil void Read( ll &x1 , ll &x2 , ll &x3 , ll &x4 ){ In.Readll(x1); In.Readll(x2); In.Readll(x3); In.Readll(x4); }\r\ntemplate<typename T> void Read( T a[] , int st , int ed ){ Forx(i,st,ed) Read(a[i]); }\r\n#define iRead(k) int k; Read(k);\r\n#define iRead2(a,b) iRead(a); iRead(b);\r\n#define iRead3(a,b,c) iRead2(a,b); iRead(c);\r\n#define iRead4(a,b,c,d) iRead2(a,b); iRead2(c,d);\r\n#define lRead(k) ll k; Read(k);\r\n#define lRead2(a,b) lRead(a); lRead(b);\r\n#define lRead3(a,b,c) lRead2(a,b); lRead(c);\r\n#define lRead4(a,b,c,d) lRead2(a,b); lRead2(c,d);\r\n\r\n// File\r\nil void FILEIO(){\r\n\t#ifdef intLSY\r\n\t\tFin(\"in.in\");\r\n\t#endif\r\n}\r\nil void FILEIO( string pname ){\r\n\t#ifndef intLSY\r\n\t\tFin((pname+\".in\").c_str());\r\n\t\tFout((pname+\".out\").c_str());\r\n\t#else\r\n\t\tFin(\"in.in\");\r\n\t#endif\r\n}\r\nil void FILEIO_OICONTEST( string pname ){\r\n\tFin((pname+\".in\").c_str());\r\n\t#ifndef intLSY\r\n\t\tFout((pname+\".out\").c_str());\r\n\t#endif\r\n}\r\nvoid Printtime(){\r\n\t#ifdef intLSY\r\n\t\tdouble _timeuse = clock()* 1000.0 / CLOCKS_PER_SEC;\r\n\t\tfprintf(stderr,\"\\n\\nTime usage:\\n%.0lf ms\\n\",_timeuse);\r\n\t#endif\r\n}\r\nvoid END(){ Printtime(); exit(0); }\r\ntemplate<typename T>void END( T mes ){ cout << mes << endl; END(); }\r\n\r\n// Debug\r\n#define B cerr << \"BreakPoint\" << endl;\r\n#define O(x) cerr << #x << \" \" << (x) << endl;\r\n#define o(x) cerr << #x << \" \" << (x) << \"  \";\r\ntemplate<typename T0>\r\nvoid P( T0 t0 ){\r\n\tcerr << t0 << endl;\r\n}\r\ntemplate<typename T0, typename... Ts>\r\nvoid P( T0 t0 , Ts... ts ){\r\n\tcerr << t0 << \" \";\r\n\tP(ts...);\r\n}\r\n#define Msz(x) cerr << \"Sizeof \" << #x << \" \" << sizeof(x)/1024/1024 << \" MB\" << endl;\r\ntemplate<typename T>void Print( T a[] , int s , int t , char sp = ' ' , char ed = '\\n' ){\r\n\tif( s > t ) return;\r\n\tfor( int i = s ; i < t ; i++ )\r\n\t\tcout << a[i] << sp;\r\n\tcout << a[t] << ed;\r\n\tcout.flush();\r\n}\r\ntemplate<typename T>void Print( T a , int s = 0 , int t = -1 , char sp = ' ' , char ed = '\\n' ){\r\n\tif( t == -1 ) t = a.size()-1;\r\n\tfor( int i = s ; i <= t ; i++ )\r\n\t\tcout << a[i] << sp;\r\n\tcout << ed;\r\n\tcout.flush();\r\n}\r\n\r\n// Optimize\r\n#define Max(a,b) ((a)>(b)?(a):(b))\r\n#define Min(a,b) ((a)<(b)?(a):(b))\r\n#define Mymax(a,b) (a) = max((a),(b))\r\n#define Mymin(a,b) (a) = min((a),(b))\r\n#define MyMax(a,b) (a) = Max((a),(b))\r\n#define MyMin(a,b) (a) = Min((a),(b))\r\n#define INF (0x3f3f3f3f)\r\n#define LINF ((long long)(0x3f3f3f3f3f3f3f3f))\r\n#define Sqr(x) ((x)*(x))\r\n#define Lowbit(a) ((a)&(-(a)))\r\n#define Equ(a,b) (fabs((a)-(b))<Eps)\r\nconstexpr ld Eps = 1e-8;\r\nconstexpr ld PI = 3.141592653589793238462643383279502884197169399;\r\nstruct Point{\r\n\tld x,y;\r\n\til ld Len2(){ return x*x+y*y; }\r\n\til ld Len(){ return sqrt(x*x+y*y); }\r\n};\r\nil Point operator+( const Point &a , const Point &b ){ return {a.x+b.x,a.y+b.y}; }\r\nil Point operator-( const Point &a , const Point &b ){ return {a.x-b.x,a.y-b.y}; }\r\nil ld operator%( const Point &a , const Point &b ){ return a.x*b.x + a.y*b.y; }\r\nil ld operator*( const Point &a , const Point &b ){ return a.x*b.y - b.x*a.y; }\r\nil Point operator*( const Point &a , const ld &b ){ return {a.x*b,a.y*b}; }\r\nil Point operator/( const Point &a , const ld &b ){ return {a.x/b,a.y/b}; }\r\nil bool operator==( const Point &a , const Point &b ){ return fabs(a.x-b.x)<Eps and fabs(a.y-b.y)<Eps; }\r\nil ld Dis( const Point &a , const Point &b ){ return sqrt((ld)Sqr(a.x-b.x)+Sqr(a.y-b.y)); }\r\nil ld Dis2( const Point &a , const Point &b ){ return Sqr(a.x-b.x)+Sqr(a.y-b.y); }\r\nostream& operator<<( ostream &out , const Point &p ){\r\n\tout << p.x << \" \" << p.y << \"  \";\r\n\treturn out;\r\n}\r\nil bool TurnLeft( const Point &a , const Point &b , const Point &c ){ return (b-a)*(c-b) > Eps; }\r\nil bool TurnRight( const Point &a , const Point &b , const Point &c ){ return (b-a)*(c-b) < -Eps; }\r\n///////////////////////////////////////////////////////////////////////////////////////\r\n///////////////////////////////////////////////////////////////////////////////////////\r\nconstexpr int MAXN = 524288;\r\n#define arg dklfhanuvbkudakufnshvakdgs\r\n\r\nstruct Manacher{\r\n\tint n;\r\n\tld a[MAXN*2];\r\n\tint p[MAXN*2];\r\n\tvoid DoManacher(){\r\n\t\tint mxright = 0, mxpos = 0;\r\n\t\tp[0] = 1;\r\n\t\tFor(i,n){\r\n\t\t\tint oppo = 2*mxpos - i;\r\n\t\t\tif( mxright > i ) p[i] = min( p[oppo] , mxright-i+1 );\r\n\t\t\telse p[i] = 1;\r\n\t\t\twhile( i-p[i] >= 0 and i+p[i] <= n and Equ(a[i-p[i]],a[i+p[i]]) )\r\n\t\t\t\t++p[i];\r\n\t\t\tif( i+p[i]-1 > mxright ){\r\n\t\t\t\tmxpos = i;\r\n\t\t\t\tmxright = i+p[i]-1;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\tvoid Process( ld data[] , int originLen ){\r\n\t\tn = 0;\r\n\t\tMs(p);\r\n\r\n\t\ta[0] = -INF;\r\n\t\tFor(i,originLen){\r\n\t\t\ta[++n] = data[i];\r\n\t\t\ta[++n] = -INF;\r\n\t\t}\r\n\t\tDoManacher();\r\n\t\t// Print(a,0,n);\r\n\t\t// Print(p,0,n);\r\n\t}\r\n};\r\n\r\nint n;\r\nPoint a[MAXN];\r\n\r\nld dis[MAXN];\r\nld arg[MAXN];\r\nvoid CalcData(){\r\n\ta[0] = a[n];\r\n\ta[n+1] = a[1];\r\n\tFor(i,n){\r\n\t\tdis[i] = Dis2(a[i],a[i+1]);\r\n\t\tPoint v1 = a[i]-a[i-1];\r\n\t\tPoint v2 = a[i+1]-a[i];\r\n\t\targ[i] = (v1%v2) / v1.Len() / v2.Len();\r\n\t\tdis[i+n] = dis[i+n+n] = dis[i+n+n+n] = dis[i];\r\n\t\targ[i+n] = arg[i+n+n] = arg[i+n+n+n] = arg[i];\r\n\t}\r\n\t// Print(dis,1,n);\r\n\t// Print(arg,1,n);\r\n}\r\n\r\nManacher disMan, argMan;\r\n\r\nint Solve(){\r\n\tCalcData();\r\n\tdisMan.Process(dis,n+n+n+n);\r\n\targMan.Process(arg,n+n+n+n);\r\n\tint ans1 = 0;\r\n\tForx(i,n+1+2,n+n+2){\r\n\t\tassert( Equ(disMan.a[2*i-2],-INF) );\r\n\t\tassert( Equ(argMan.a[2*i-1],arg[i]) );\r\n\t\t// P(disMan.p[2*i-2],argMan.p[2*i-1]);\r\n\t\tif( (disMan.p[2*i-2]/2)*2 >= n and (argMan.p[2*i-1]/2)*2 >= n )\r\n\t\t\t++ans1;\r\n\t}\r\n\tans1 /= 2;\r\n\tint ans2 = 0;\r\n\tForx(i,n+1+2,n+n+2){\r\n\t\tassert( Equ(disMan.a[2*i-1],dis[i]) );\r\n\t\tassert( Equ(argMan.a[2*i],-INF) );\r\n\t\t// P(disMan.p[2*i-1],argMan.p[2*i]);\r\n\t\tif( (disMan.p[2*i-1]/2)*2 >= n and (argMan.p[2*i]/2)*2 >= n )\r\n\t\t\t++ans2;\r\n\t}\r\n\tans2 /= 2;\r\n\treturn ans1 + ans2;\r\n}\r\n\r\nint main(){\r\n\tFILEIO();\r\n\r\n\tiRead(T);\r\n\tFor(TwT,T){\r\n\t\tRead(n);\r\n\t\tFor(i,n){\r\n\t\t\tiRead2(x,y);\r\n\t\t\ta[i] = {x,y};\r\n\t\t}\r\n\t\tint ans = Solve();\r\n\t\tcout << ans << endl;\r\n\t}\r\n\r\n\tEND();\r\n}\r\n",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpu2d12vge/1e3c16a2-9987-4f66-8a2c-d7eedc8a9b34.cpp: In function ‘void FILEIO(std::string)’:\n/tmp/tmpu2d12vge/1e3c16a2-9987-4f66-8a2c-d7eedc8a9b34.cpp:136:17: error: ‘Fin’ was not declared in this scope; did you mean ‘sin’?\n  136 |                 Fin((pname+\".in\").c_str());\n      |                 ^~~\n      |                 sin\n/tmp/tmpu2d12vge/1e3c16a2-9987-4f66-8a2c-d7eedc8a9b34.cpp:137:17: error: ‘Fout’ was not declared in this scope\n  137 |                 Fout((pname+\".out\").c_str());\n      |                 ^~~~\n/tmp/tmpu2d12vge/1e3c16a2-9987-4f66-8a2c-d7eedc8a9b34.cpp: In function ‘void FILEIO_OICONTEST(std::string)’:\n/tmp/tmpu2d12vge/1e3c16a2-9987-4f66-8a2c-d7eedc8a9b34.cpp:143:9: error: ‘Fin’ was not declared in this scope; did you mean ‘sin’?\n  143 |         Fin((pname+\".in\").c_str());\n      |         ^~~\n      |         sin\n/tmp/tmpu2d12vge/1e3c16a2-9987-4f66-8a2c-d7eedc8a9b34.cpp:145:17: error: ‘Fout’ was not declared in this scope\n  145 |                 Fout((pname+\".out\").c_str());\n      |                 ^~~~\n/tmp/tmpu2d12vge/1e3c16a2-9987-4f66-8a2c-d7eedc8a9b34.cpp: In function ‘int main()’:\n/tmp/tmpu2d12vge/1e3c16a2-9987-4f66-8a2c-d7eedc8a9b34.cpp:314:33: warning: narrowing conversion of ‘x’ from ‘int’ to ‘double’ [-Wnarrowing]\n  314 |                         a[i] = {x,y};\n      |                                 ^\n/tmp/tmpu2d12vge/1e3c16a2-9987-4f66-8a2c-d7eedc8a9b34.cpp:314:35: warning: narrowing conversion of ‘y’ from ‘int’ to ‘double’ [-Wnarrowing]\n  314 |                         a[i] = {x,y};\n      |                                   ^\n"
        ],
        "tcb_id": "对称轴 Axes of Symmetry"
    },
    {
        "code_id": 10,
        "code": "// #define ONLINE_JUDGE\n#include <bits/stdc++.h>\nusing namespace std;\nconst int M = 8e5 + 5;\nconst int Inf = 0x3f3f3f3f;\ntypedef long long ll;\ntypedef std::string str;\ntypedef double db;\n#define IL inline\n#define REP(i, lim) for (int i = 1; i <= lim; ++i)\n#define MST(a, b) memset(a, b, sizeof(a))\n\ntemplate <class T>\nvoid Max(T &x, T y) {\n    x = max(x, y);\n}\n\ntemplate <class T>\nvoid Min(T &x, T y) {\n    x = min(x, y);\n}\nint t;\nvoid Read() {\n    ios::sync_with_stdio(false);\n    cin.tie(0);\n    cout.tie(0);\n    cin >> t;\n}\nstruct Vec {\n    db x, y;\n    db len() const;\n    Vec(db x_ = 0, db y_ = 0) : x(x_), y(y_){};\n    Vec operator-(const Vec &b) { return Vec(x - b.x, y - b.y); }\n};\n\nconst db Eps = 1e-8;\n\nint Dcmp(db x, db y) {\n    if (fabs(x - y) < Eps) {\n        return 0;\n    }\n    return x < y ? -1 : 1;\n}\n\nstruct Node {\n    int sgn;\n    db v;\n    Node(int s_ = 0, db v_ = 0) : sgn(s_), v(v_){};\n    bool operator==(const Node &b) { return sgn == b.sgn && !Dcmp(v, b.v); }\n};\n\nVec v[M];\nNode m[M];\n\ndb Dis(const Vec &a, const Vec &b) { return hypot(a.x - b.x, a.y - b.y); }\ndb Dot(const Vec &a, const Vec &b) { return a.x * b.x + a.y * b.y; }\ndb Vec::len() const { return sqrt(Dot(*this, *this)); }\ndb Angle(const Vec &a, const Vec &b) {\n    return acos(Dot(a, b) / a.len() / b.len());\n}\n\nint n;\nint Manacher(int len) {\n    int p[M];\n    int ret = 0;\n    MST(p, 0);\n    int r = 0, l = 0;\n    for (int i = 1; i <= len; ++i) {\n        p[i] = (i < r) ? min(p[(l << 1) - i], p[l] + l - i) : 1;\n        while (/* p[i] < i && i + p[i] <= len && */ m[i + p[i]] ==\n               m[i - p[i]]) {\n            ++p[i];\n        }\n        if (p[i] + i > r) {\n            r = p[i] + i;\n            l = i;\n        }\n        if (p[i] >> 1 >= n) {\n            ++ret;\n        }\n        int cur = p[i];\n        DBG(i) DBG(l) DBG(r) DBG(cur) ETR;\n    }\n    return ret / 2;\n}\nvoid Solve() {\n    while (t--) {\n        cin >> n;\n        REP(i, n) { cin >> v[i].x >> v[i].y; }\n        v[0] = v[n];\n        v[n + 1] = v[1];\n        int tot = 0;\n        REP(i, n) {\n            m[++tot] = Node();\n            m[++tot] = Node(1, Angle(v[i] - v[i - 1], v[i + 1] - v[i]));\n            m[++tot] = Node();\n            m[++tot] = Node(2, Dis(v[i + 1], v[i]));\n        }\n        // for (int i = 1; i <= tot; ++i) {\n        //     cerr << m[i].sgn << ' ' << m[i].v << '\\n';\n        // }\n        REP(i, tot) { m[i + tot] = m[i]; }\n        tot = (tot << 1) | 1;\n        m[tot] = Node();\n        cout << Manacher(tot) << '\\n';\n    }\n}\n\nsigned main() {\n    Read();\n    Solve();\n    return 0;\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmp4apnkoee/5dafe4eb-6571-40c4-ba0b-a74d84a44f35.cpp: In function ‘int Manacher(int)’:\n/tmp/tmp4apnkoee/5dafe4eb-6571-40c4-ba0b-a74d84a44f35.cpp:82:9: error: ‘DBG’ was not declared in this scope\n   82 |         DBG(i) DBG(l) DBG(r) DBG(cur) ETR;\n      |         ^~~\n"
        ],
        "tcb_id": "对称轴 Axes of Symmetry"
    },
    {
        "code_id": 6,
        "code": "#include<bits/stdc++.h>\nusing namespace std;\n#define pb push_back\n#define ppb pop_back\n#define pf push_front\n#define ppf pop_front\n#define eb emplace_back\n#define ef emplace_front\n#define lowbit(x) (x & (-x))\n#define ti chrono::system_clock::now().time_since_epoch().count()\n#define Fio(x) Fin(x\".in\"), Fout(x\".out\");\n// #define SGT\n// #define int long long // int main() -> signed\n// #define PAIR\n#define ll long long\n#ifdef PAIR\n#define fi first\n#define se second\n#endif\n#ifdef SGT\n#define lson (p << 1)\n#define rson (p << 1 | 1)\n#define mid ((l + r) >> 1)\n#endif\nconst int maxn = 3e5 + 10;\nint n, m, q, k, rt;\nstack<int> st;\nqueue<int> qu;\nbool ins[maxn];\nint dfn[maxn], low[maxn], cnt, deg[maxn], bel[maxn], tot;\nvector<int> e[maxn], edge[maxn], blo[maxn];\nint f[maxn], L[maxn], R[maxn], sum[maxn];\nvoid tarjan(int u){\n    st.push(u), ins[u] = 1, dfn[u] = low[u] = ++cnt;\n    for(int v : e[u]) if(!dfn[v]){\n        tarjan(v), low[u] = min(low[u], low[v]);\n    }else if(ins[v]) low[u] = min(low[u], dfn[v]);\n    if(dfn[u] == low[u]){\n        int v; tot++; do{\n            v = st.top(), st.pop(), bel[v] = tot, blo[tot].pb(v);\n        }while(v != u);\n    }\n}\nvoid dfs(int u){\n    // printf(\"qwq %d\\n\", u);\n    L[u] = ++cnt, sum[u] += sum[f[u]];\n    for(int v : edge[u]) dfs(v); // printf(\"%d -> %d\\n\", u, v);\n    R[u] = cnt;\n}\nbool check(int s, int t){\n    // printf(\"check %d -> %d: %d ~ %d - %d\\n\", s, t, L[s], R[s], dfn[t]);\n    return L[s] <= L[t] && L[t] <= R[s];\n}\nsigned main(){\n    Fio(\"celebration\");\n    scanf(\"%d%d%d%d\", &n, &m, &q, &k);\n    for(int i = 1, x, y; i <= m; i++){\n        scanf(\"%d%d\", &x, &y);\n        e[x].pb(y), deg[y]++;\n    }\n    for(int i = 1; i <= n; i++) if(!deg[i]) tarjan(i), rt = bel[i];\n    fill(deg + 1, deg + n + 1, 0);\n    for(int i = 1; i <= n; i++) sum[bel[i]]++;\n    for(int i = 1; i <= n; i++) for(int j : e[i]) if(bel[j] != bel[i]) deg[bel[j]]++;\n    qu.push(rt);\n    while(!qu.empty()){\n        int u = qu.front(); qu.pop();\n        for(int i : blo[u]) for(int j : e[i]) if(bel[j] != u){\n            if(!--deg[bel[j]]) edge[u].pb(bel[j]), f[bel[j]] = u, qu.push(bel[j]);\n        }\n    }\n    cnt = 0, dfs(rt);\n    // for(int i = 1; i <= tot; i++) printf(\"%d \", dfn[i]);\n    // puts(\"\");\n    while(q--){\n        int s, t, ans = 0; scanf(\"%d%d\", &s, &t), s = bel[s], t = bel[t];\n        if(k == 0){\n            if(check(s, t)) printf(\"%d\\n\", sum[t] - sum[f[s]]);\n            else puts(\"0\");\n        }else if(k == 1){\n            int s1, t1; scanf(\"%d%d\", &s1, &t1), s1 = bel[s1], t1 = bel[t1];\n            if(check(s, t)){\n                if(check(s, s1) && check(t1, s)) s = t1;\n                else if(check(s, s1) && check(t1, t)) ans = sum[s1] - sum[f[s]] + sum[t] - sum[f[t1]];\n                ans = max(ans, sum[t] - sum[f[s]]);\n                printf(\"%d\\n\", ans);\n            }else if(check(s, s1) && check(t1, t)){\n                // puts(\"nveurihgvubsd\");\n                printf(\"%d\\n\", sum[s1] - sum[f[s]] + sum[t] - sum[f[t1]]);\n            }else puts(\"0\");\n        }\n    }\n    return 0;\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpfsbun54j/44b508c6-9b02-472b-ac50-603a3c8c2dfd.cpp: In function ‘int main()’:\n/tmp/tmpfsbun54j/44b508c6-9b02-472b-ac50-603a3c8c2dfd.cpp:11:16: error: ‘Fin’ was not declared in this scope; did you mean ‘sin’?\n   11 | #define Fio(x) Fin(x\".in\"), Fout(x\".out\");\n      |                ^~~\n/tmp/tmpfsbun54j/44b508c6-9b02-472b-ac50-603a3c8c2dfd.cpp:55:5: note: in expansion of macro ‘Fio’\n   55 |     Fio(\"celebration\");\n      |     ^~~\n/tmp/tmpfsbun54j/44b508c6-9b02-472b-ac50-603a3c8c2dfd.cpp:11:29: error: ‘Fout’ was not declared in this scope\n   11 | #define Fio(x) Fin(x\".in\"), Fout(x\".out\");\n      |                             ^~~~\n/tmp/tmpfsbun54j/44b508c6-9b02-472b-ac50-603a3c8c2dfd.cpp:55:5: note: in expansion of macro ‘Fio’\n   55 |     Fio(\"celebration\");\n      |     ^~~\n"
        ],
        "tcb_id": "庆典"
    },
    {
        "code_id": 0,
        "code": "#include<bits/stdc++.h>\r\n#define ll long long\r\n#define cri const register int\r\n#define re register\r\nusing namespace std;\r\nconst int inf=1e9;\r\nint S,T,n,m,que[50020];\r\nint pre[50020],fa[50020],dep[50020],to[1000010],la[1000010],fl[1000010],cnt=1;\r\ninline int read(re int a=0,re char ch=getchar()){\r\n\twhile(ch<'0'||ch>'9') ch=getchar();\r\n\twhile(ch>='0'&&ch<='9') a=(a<<3)+(a<<1)+(ch^48),ch=getchar();\r\n\treturn a;\r\n}\r\ninline void add(cri x,cri y,cri z){\r\n\tto[++cnt]=y,la[cnt]=fa[x],fa[x]=cnt,fl[cnt]=z;\r\n\tto[++cnt]=x,la[cnt]=fa[y],fa[y]=cnt,fl[cnt]=0;\r\n}\r\ninline bool bfs(int l=1,int r=0){\r\n\tmemset(dep,0,sizeof dep);\r\n\tdep[que[++r]=S]=1;pre[S]=fa[S];\r\n\twhile(l<=r){\r\n\t\tcri x=que[l++];\r\n\t\tfor(int i=fa[x];i;i=la[i])\r\n\t\t\tif(fl[i]&&!dep[to[i]]){\r\n\t\t\t\tdep[to[i]]=dep[x]+1;pre[to[i]]=fa[to[i]];\r\n\t\t\t\tif(to[i]==T) return 1;\r\n\t\t\t\tque[++r]=to[i];\r\n\t\t\t}\r\n\t}\r\n\treturn 0;\r\n}\r\nint dfs(cri x,cri cp){\r\n\tif(x==T) return cp;\r\n\tint lst=cp;\r\n\tfor(int i=pre[x],q;i&&lst;i=la[i]){\r\n\t\tpre[x]=i;\r\n\t\tif(fl[i]&&dep[to[i]]==dep[x]+1){\r\n\t\t\tif(!(q=dfs(to[i],min(lst,fl[i])))) dep[to[i]]=0;\r\n\t\t\tfl[i]-=q;fl[i^1]+=q;lst-=q;\r\n\t\t}\r\n\t}\r\n\treturn cp-lst;\r\n}\r\ninline int dinic(int ans=0){\r\n\twhile(bfs()) ans+=dfs(S,inf);\r\n\treturn ans;\r\n}\r\nint a[5010],N,is[20010][2];\r\nvoid build(cri k,cri l,cri r){\r\n\tif(l==r){\r\n\t\tis[k][0]=is[k][1]=l;\r\n\t\treturn;\r\n\t}\r\n\tcri mid=l+r>>1;\r\n\tis[k][0]=++N;is[k][1]=++N;\r\n\tbuild(k<<1,l,mid);build(k<<1|1,mid+1,r);\r\n\tadd(is[k][0],is[k<<1][0],inf);\r\n\tadd(is[k][0],is[k<<1|1][0],inf);\r\n\tadd(is[k<<1][1],is[k][1],inf);\r\n\tadd(is[k<<1|1][1],is[k][1],inf);\r\n}\r\nvoid add(cri k,cri l,cri r,cri L,cri R,cri opt,cri x){\r\n\tif(l>=L&&r<=R){\r\n\t\tif(opt) add(x,is[k][0],inf);\r\n\t\telse add(is[k][1],x,inf);\r\n\t\treturn;\r\n\t}\r\n\tcri mid=l+r>>1;\r\n\tif(L<=mid) add(k<<1,l,mid,L,R,opt,x);\r\n\tif(R>mid) add(k<<1|1,mid+1,r,L,R,opt,x);\r\n}\r\n\tn=read(),m=read();S=n+1;T=S+1;N=T;\r\n\tfor(int i=1;i<=n;i++){\r\n\t\ta[i]=read();\r\n\t\tif(a[i]==1) add(S,i,1);\r\n\t\telse add(i,T,1);\r\n\t}\r\n\tbuild(1,1,n);\r\n\tfor(int i=1;i<=m;i++){\r\n\t\tcri opt=read(),l=read(),r=read(),k=read();\r\n\t\tadd(1,1,n,l,r,opt,k);\r\n\t}\r\n\tprintf(\"%d\\n\",dinic());\r\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpnbj6dq5i/95f2c2cb-68ac-44d3-b2ce-000200bb9dca.cpp:72:9: error: ‘n’ does not name a type\n   72 |         n=read(),m=read();S=n+1;T=S+1;N=T;\n      |         ^\n/tmp/tmpnbj6dq5i/95f2c2cb-68ac-44d3-b2ce-000200bb9dca.cpp:72:27: error: ‘S’ does not name a type\n   72 |         n=read(),m=read();S=n+1;T=S+1;N=T;\n      |                           ^\n/tmp/tmpnbj6dq5i/95f2c2cb-68ac-44d3-b2ce-000200bb9dca.cpp:72:33: error: ‘T’ does not name a type\n   72 |         n=read(),m=read();S=n+1;T=S+1;N=T;\n      |                                 ^\n/tmp/tmpnbj6dq5i/95f2c2cb-68ac-44d3-b2ce-000200bb9dca.cpp:72:39: error: ‘N’ does not name a type\n   72 |         n=read(),m=read();S=n+1;T=S+1;N=T;\n      |                                       ^\n/tmp/tmpnbj6dq5i/95f2c2cb-68ac-44d3-b2ce-000200bb9dca.cpp:73:9: error: expected unqualified-id before ‘for’\n   73 |         for(int i=1;i<=n;i++){\n      |         ^~~\n/tmp/tmpnbj6dq5i/95f2c2cb-68ac-44d3-b2ce-000200bb9dca.cpp:73:21: error: ‘i’ does not name a type\n   73 |         for(int i=1;i<=n;i++){\n      |                     ^\n/tmp/tmpnbj6dq5i/95f2c2cb-68ac-44d3-b2ce-000200bb9dca.cpp:73:26: error: ‘i’ does not name a type\n   73 |         for(int i=1;i<=n;i++){\n      |                          ^\n/tmp/tmpnbj6dq5i/95f2c2cb-68ac-44d3-b2ce-000200bb9dca.cpp:78:14: error: expected constructor, destructor, or type conversion before ‘(’ token\n   78 |         build(1,1,n);\n      |              ^\n/tmp/tmpnbj6dq5i/95f2c2cb-68ac-44d3-b2ce-000200bb9dca.cpp:79:9: error: expected unqualified-id before ‘for’\n   79 |         for(int i=1;i<=m;i++){\n      |         ^~~\n/tmp/tmpnbj6dq5i/95f2c2cb-68ac-44d3-b2ce-000200bb9dca.cpp:79:21: error: ‘i’ does not name a type\n   79 |         for(int i=1;i<=m;i++){\n      |                     ^\n/tmp/tmpnbj6dq5i/95f2c2cb-68ac-44d3-b2ce-000200bb9dca.cpp:79:26: error: ‘i’ does not name a type\n   79 |         for(int i=1;i<=m;i++){\n      |                          ^\n/tmp/tmpnbj6dq5i/95f2c2cb-68ac-44d3-b2ce-000200bb9dca.cpp:83:15: error: expected constructor, destructor, or type conversion before ‘(’ token\n   83 |         printf(\"%d\\n\",dinic());\n      |               ^\n/tmp/tmpnbj6dq5i/95f2c2cb-68ac-44d3-b2ce-000200bb9dca.cpp:84:1: error: expected declaration before ‘}’ token\n   84 | }\n      | ^\n"
        ],
        "tcb_id": "序列"
    },
    {
        "code_id": 3,
        "code": "#include<bits/stdc++.h>\r\n#define ll long long\r\n#define cri const register int\r\n#define re register\r\nusing namespace std;\r\nconst int inf=1e9;\r\nint S,T,n,m,N,que[25020];\r\nint pre[25020],fa[25020],dep[25020],to[1000010],la[1000010],fl[1000010],cnt=1;\r\ninline int read(re int a=0,re char ch=getchar()){\r\n\twhile(ch<'0'||ch>'9') ch=getchar();\r\n\twhile(ch>='0'&&ch<='9') a=(a<<3)+(a<<1)+(ch^48),ch=getchar();\r\n\treturn a;\r\n}\r\ninline void add(cri x,cri y,cri z){\r\n\tto[++cnt]=y,la[cnt]=fa[x],fa[x]=cnt,fl[cnt]=z;\r\n\tto[++cnt]=x,la[cnt]=fa[y],fa[y]=cnt,fl[cnt]=0;\r\n}\r\ninline bool bfs(int l=1,int r=0){\r\n\tfor(int i=1;i<=N;i++) dep[i]=0;\r\n\tdep[que[++r]=S]=1;pre[S]=fa[S];\r\n\twhile(l<=r){\r\n\t\tcri x=que[l++];\r\n\t\tfor(int i=fa[x];i;i=la[i])\r\n\t\t\tif(fl[i]&&!dep[to[i]]){\r\n\t\t\t\tdep[to[i]]=dep[x]+1;pre[to[i]]=fa[to[i]];\r\n\t\t\t\tif(to[i]==T) return 1;\r\n\t\t\t\tque[++r]=to[i];\r\n\t\t\t}\r\n\t}\r\n\treturn 0;\r\n}\r\nint dfs(cri x,cri cp){\r\n\tif(x==T) return cp;\r\n\tint lst=cp;\r\n\tfor(int i=pre[x],q;i&&lst;i=la[i]){\r\n\t\tpre[x]=i;\r\n\t\tif(fl[i]&&dep[to[i]]==dep[x]+1){\r\n\t\t\tif(!(q=dfs(to[i],min(lst,fl[i])))) dep[to[i]]=0;\r\n\t\t\tfl[i]-=q;fl[i^1]+=q;lst-=q;\r\n\t\t}\r\n\t}\r\n\treturn cp-lst;\r\n}\r\ninline int dinic(int ans=0){\r\n\twhile(bfs()) ans+=dfs(S,inf);\r\n\treturn ans;\r\n}\r\nint a[5010],is[20010][2],id[5010];\r\nvoid build(cri k,cri l,cri r){\r\n\tif(l==r){\r\n\t\tis[k][0]=is[k][1]=id[l];\r\n\t\treturn;\r\n\t}\r\n\tcri mid=l+r>>1;\r\n\tis[k][0]=++N;is[k][1]=++N;\r\n\tbuild(k<<1,l,mid);build(k<<1|1,mid+1,r);\r\n\tadd(is[k][0],is[k<<1][0],inf);\r\n\tadd(is[k][0],is[k<<1|1][0],inf);\r\n\tadd(is[k<<1][1],is[k][1],inf);\r\n\tadd(is[k<<1|1][1],is[k][1],inf);\r\n}\r\nvoid add(cri k,cri l,cri r,cri L,cri R,cri opt,cri x){\r\n\tif(l>=L&&r<=R){\r\n\t\tif(opt) add(x,is[k][0],inf);\r\n\t\telse add(is[k][1],x,inf);\r\n\t\treturn;\r\n\t}\r\n\tcri mid=l+r>>1;\r\n\tif(L<=mid) add(k<<1,l,mid,L,R,opt,x);\r\n\tif(R>mid) add(k<<1|1,mid+1,r,L,R,opt,x);\r\n}\r\nstruct node{ int opt,l,r; };\r\nvector<node>has[5010];\r\nint solve(cri l,cri r,vector<int>&t,int ans=0){\r\n\tif(l==r){\r\n\t\tfor(int x:t) ans+=abs(a[x]-l);\r\n\t\treturn ans;\r\n\t}\r\n\tif(t.empty())return 0;\r\n\tif(t.size()==1) return max(max(l-a[t[0]],a[t[0]]-r),0);\r\n\tfor(int i=0;i<t.size();i++) id[i]=++N;S=++N;T=++N;\r\n\tbuild(1,0,t.size()-1);\r\n\tfor(int i=0;i<t.size();i++)\r\n\t\tfor(node x:has[t[i]]){\r\n\t\t\tcri l=lower_bound(t.begin(),t.end(),x.l)-t.begin(),r=upper_bound(t.begin(),t.end(),x.r)-t.begin()-1;\r\n\t\t\tif(l<=r) add(1,0,t.size()-1,l,r,x.opt,id[i]);\r\n\t\t}\r\n\tcri mid=l+r>>1;\r\n\tfor(int i=0;i<t.size();i++) \r\n\t\tif(a[t[i]]<=mid) add(S,id[i],1);\r\n\t\telse add(id[i],T,1);\r\n\twhile(bfs()) dfs(S,inf);\r\n\tbfs();\r\n\tvector<int>ls,rs;\r\n\tfor(int i=0;i<t.size();i++) \r\n\t\tif(dep[id[i]]) ls.push_back(t[i]);\r\n\t\telse rs.push_back(t[i]);\r\n\twhile(N) fa[N--]=0;cnt=1;\r\n\treturn solve(l,mid,ls)+solve(mid+1,r,rs);\r\n}\r\n\tn=read(),m=read();S=n+1;T=S+1;N=T;\r\n\tint l=inf,r=0;\r\n\tfor(int i=1;i<=n;i++){\r\n\t\ta[i]=read();\r\n\t\tl=min(l,a[i]);r=max(r,a[i]);\r\n\t}\r\n\tbuild(1,1,n);\r\n\tfor(int i=1;i<=m;i++){\r\n\t\tcri opt=read(),l=read(),r=read(),k=read();\r\n\t\thas[k].push_back((node){opt,l,r});\r\n\t}\r\n\tvector<int>t;\r\n\tfor(int i=1;i<=n;i++) t.push_back(i);\r\n\tprintf(\"%d\\n\",solve(l,r,t));\r\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpp1e2nkua/a48813b9-b5b8-405e-8ee4-70a169605545.cpp:101:9: error: ‘n’ does not name a type\n  101 |         n=read(),m=read();S=n+1;T=S+1;N=T;\n      |         ^\n/tmp/tmpp1e2nkua/a48813b9-b5b8-405e-8ee4-70a169605545.cpp:101:27: error: ‘S’ does not name a type\n  101 |         n=read(),m=read();S=n+1;T=S+1;N=T;\n      |                           ^\n/tmp/tmpp1e2nkua/a48813b9-b5b8-405e-8ee4-70a169605545.cpp:101:33: error: ‘T’ does not name a type\n  101 |         n=read(),m=read();S=n+1;T=S+1;N=T;\n      |                                 ^\n/tmp/tmpp1e2nkua/a48813b9-b5b8-405e-8ee4-70a169605545.cpp:101:39: error: ‘N’ does not name a type\n  101 |         n=read(),m=read();S=n+1;T=S+1;N=T;\n      |                                       ^\n/tmp/tmpp1e2nkua/a48813b9-b5b8-405e-8ee4-70a169605545.cpp:103:9: error: expected unqualified-id before ‘for’\n  103 |         for(int i=1;i<=n;i++){\n      |         ^~~\n/tmp/tmpp1e2nkua/a48813b9-b5b8-405e-8ee4-70a169605545.cpp:103:21: error: ‘i’ does not name a type\n  103 |         for(int i=1;i<=n;i++){\n      |                     ^\n/tmp/tmpp1e2nkua/a48813b9-b5b8-405e-8ee4-70a169605545.cpp:103:26: error: ‘i’ does not name a type\n  103 |         for(int i=1;i<=n;i++){\n      |                          ^\n/tmp/tmpp1e2nkua/a48813b9-b5b8-405e-8ee4-70a169605545.cpp:107:14: error: expected constructor, destructor, or type conversion before ‘(’ token\n  107 |         build(1,1,n);\n      |              ^\n/tmp/tmpp1e2nkua/a48813b9-b5b8-405e-8ee4-70a169605545.cpp:108:9: error: expected unqualified-id before ‘for’\n  108 |         for(int i=1;i<=m;i++){\n      |         ^~~\n/tmp/tmpp1e2nkua/a48813b9-b5b8-405e-8ee4-70a169605545.cpp:108:21: error: ‘i’ does not name a type\n  108 |         for(int i=1;i<=m;i++){\n      |                     ^\n/tmp/tmpp1e2nkua/a48813b9-b5b8-405e-8ee4-70a169605545.cpp:108:26: error: ‘i’ does not name a type\n  108 |         for(int i=1;i<=m;i++){\n      |                          ^\n/tmp/tmpp1e2nkua/a48813b9-b5b8-405e-8ee4-70a169605545.cpp:113:9: error: expected unqualified-id before ‘for’\n  113 |         for(int i=1;i<=n;i++) t.push_back(i);\n      |         ^~~\n/tmp/tmpp1e2nkua/a48813b9-b5b8-405e-8ee4-70a169605545.cpp:113:21: error: ‘i’ does not name a type\n  113 |         for(int i=1;i<=n;i++) t.push_back(i);\n      |                     ^\n/tmp/tmpp1e2nkua/a48813b9-b5b8-405e-8ee4-70a169605545.cpp:113:26: error: ‘i’ does not name a type\n  113 |         for(int i=1;i<=n;i++) t.push_back(i);\n      |                          ^\n/tmp/tmpp1e2nkua/a48813b9-b5b8-405e-8ee4-70a169605545.cpp:114:15: error: expected constructor, destructor, or type conversion before ‘(’ token\n  114 |         printf(\"%d\\n\",solve(l,r,t));\n      |               ^\n/tmp/tmpp1e2nkua/a48813b9-b5b8-405e-8ee4-70a169605545.cpp:115:1: error: expected declaration before ‘}’ token\n  115 | }\n      | ^\n"
        ],
        "tcb_id": "序列"
    },
    {
        "code_id": 8,
        "code": "#include<bits/stdc++.h>\nconst int N=440000;\nusing namespace std;\nint n,x,y,nd,dp,w[N],mx[N],d[N],c[N];\nlong long ans=0;\nvector<int>cnt[N];\nchar s[N<<1];\nmultiset<int>S;\nint main()\n\tscanf(\"%d%d%d%s\",&n,&x,&y,s);\n\tfor(int i=1;i<=n;++i)scanf(\"%d\",&w[i]);\n\tfor(int i=0;i<(n<<1);++i)\n\tif(s[i]=='(')d[++nd]=++dp;\n\telse --dp;\n\tfor(int i=1;i<=n;++i)cnt[d[i]].push_back(w[i]);\n\tif(x==1&&y==0)\n\t{\n\t\tfor(int i=1;i<=n;++i)++c[d[i]];\n\t\tfor(int i=1;i<=n;++i)c[i]+=c[i-1]-1;\n\t\tint t=1;\n\t\twhile(t<=n&&!c[t])++t;\n\t\tif(t<n)\n\t\t{\n\t\t\tfor(int i=t;i<=n;++i)ans+=w[i];\n\t\t\tfor(int i=n;i>=t;--i)\n\t\t\t\tif(!cnt[i].empty())\n\t\t\t\t\tmx[i]=max(mx[i+1],*max_element(cnt[i].begin(),cnt[i].end()));\n\t\t\tint q=t;\n\t\t\twhile(q<n&&c[q]<2)++q;\n\t\t\tif(mx[q]<mx[t])\n\t\t\t{\n\t\t\t\tlong long ad=ans;\n\t\t\t\tad-=mx[t];\n\t\t\t\tint mn=w[q];\n\t\t\t\tfor(int i=q;i<n;++i)\n\t\t\t\t{\n\t\t\t\t\tif(!cnt[i].empty())mn=min(mn,*min_element(cnt[i].begin(),cnt[i].end()));\n\t\t\t\t\tad+=1ll*mn*(c[i]-1);\n\t\t\t\t}\n\t\t\t\tans-=mx[q];\n\t\t\t\tfor(int i=t;i<n;++i)\n\t\t\t\t{\n\t\t\t\t\tif(!cnt[i].empty())mn=min(mn,*min_element(cnt[i].begin(),cnt[i].end()));\n\t\t\t\t\tans+=1ll*mn*(c[i]-1);\n\t\t\t\t}\n\t\t\t\tans=min(ans,ad);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tans-=mx[t];\n\t\t\t\tint mn=w[t];\n\t\t\t\tfor(int i=t;i<n;++i)\n\t\t\t\t{\n\t\t\t\t\tif(!cnt[i].empty())mn=min(mn,*min_element(cnt[i].begin(),cnt[i].end()));\n\t\t\t\t\tans+=1ll*mn*(c[i]-1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%lld\",ans);\n\t}\n\telse\n\t{\n\t\tfor(int i=1;i<=n;++i)ans-=1ll*w[i]*d[i];\n\t\tfor(int i=1;i<=n;++i)\n\t\t{\n\t\t\tS.insert(cnt[i].begin(),cnt[i].end());\n\t\t\tauto it=--S.end();\n\t\t\tans+=1ll**it*i;\n\t\t\tS.erase(it);\n\t\t}\n\t\tprintf(\"%lld\",ans*(x+y));\n\t}\n\treturn 0;\n} ",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmplqqmg74d/fb6cdc8e-3da6-4416-a0e1-b653fc615b5b.cpp:10:9: error: expected initializer before ‘scanf’\n   10 |         scanf(\"%d%d%d%s\",&n,&x,&y,s);\n      |         ^~~~~\n/tmp/tmplqqmg74d/fb6cdc8e-3da6-4416-a0e1-b653fc615b5b.cpp:11:9: error: expected unqualified-id before ‘for’\n   11 |         for(int i=1;i<=n;++i)scanf(\"%d\",&w[i]);\n      |         ^~~\n/tmp/tmplqqmg74d/fb6cdc8e-3da6-4416-a0e1-b653fc615b5b.cpp:11:21: error: ‘i’ does not name a type\n   11 |         for(int i=1;i<=n;++i)scanf(\"%d\",&w[i]);\n      |                     ^\n/tmp/tmplqqmg74d/fb6cdc8e-3da6-4416-a0e1-b653fc615b5b.cpp:11:26: error: expected unqualified-id before ‘++’ token\n   11 |         for(int i=1;i<=n;++i)scanf(\"%d\",&w[i]);\n      |                          ^~\n/tmp/tmplqqmg74d/fb6cdc8e-3da6-4416-a0e1-b653fc615b5b.cpp:12:9: error: expected unqualified-id before ‘for’\n   12 |         for(int i=0;i<(n<<1);++i)\n      |         ^~~\n/tmp/tmplqqmg74d/fb6cdc8e-3da6-4416-a0e1-b653fc615b5b.cpp:12:21: error: ‘i’ does not name a type\n   12 |         for(int i=0;i<(n<<1);++i)\n      |                     ^\n/tmp/tmplqqmg74d/fb6cdc8e-3da6-4416-a0e1-b653fc615b5b.cpp:12:30: error: expected unqualified-id before ‘++’ token\n   12 |         for(int i=0;i<(n<<1);++i)\n      |                              ^~\n/tmp/tmplqqmg74d/fb6cdc8e-3da6-4416-a0e1-b653fc615b5b.cpp:14:9: error: expected unqualified-id before ‘else’\n   14 |         else --dp;\n      |         ^~~~\n/tmp/tmplqqmg74d/fb6cdc8e-3da6-4416-a0e1-b653fc615b5b.cpp:15:9: error: expected unqualified-id before ‘for’\n   15 |         for(int i=1;i<=n;++i)cnt[d[i]].push_back(w[i]);\n      |         ^~~\n/tmp/tmplqqmg74d/fb6cdc8e-3da6-4416-a0e1-b653fc615b5b.cpp:15:21: error: ‘i’ does not name a type\n   15 |         for(int i=1;i<=n;++i)cnt[d[i]].push_back(w[i]);\n      |                     ^\n/tmp/tmplqqmg74d/fb6cdc8e-3da6-4416-a0e1-b653fc615b5b.cpp:15:26: error: expected unqualified-id before ‘++’ token\n   15 |         for(int i=1;i<=n;++i)cnt[d[i]].push_back(w[i]);\n      |                          ^~\n/tmp/tmplqqmg74d/fb6cdc8e-3da6-4416-a0e1-b653fc615b5b.cpp:16:9: error: expected unqualified-id before ‘if’\n   16 |         if(x==1&&y==0)\n      |         ^~\n/tmp/tmplqqmg74d/fb6cdc8e-3da6-4416-a0e1-b653fc615b5b.cpp:61:9: error: expected unqualified-id before ‘else’\n   61 |         else\n      |         ^~~~\n/tmp/tmplqqmg74d/fb6cdc8e-3da6-4416-a0e1-b653fc615b5b.cpp:73:9: error: expected unqualified-id before ‘return’\n   73 |         return 0;\n      |         ^~~~~~\n/tmp/tmplqqmg74d/fb6cdc8e-3da6-4416-a0e1-b653fc615b5b.cpp:74:1: error: expected declaration before ‘}’ token\n   74 | }\n      | ^\n"
        ],
        "tcb_id": "序列变换"
    },
    {
        "code_id": 10,
        "code": "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\ninline ll read(){\n\tll x=0,f=1;char ch=getchar();\n\twhile(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}\n\twhile(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();\n\treturn x*f;\n}\nconst ll N=1000010;\n#define pb push_back\nll n,X,Y,a[N],t,cur,S[N],mx[N],mn[N],ans,st[N];\nmultiset<ll> s;char str[N];vector<ll> v[N];\nvoid work1(){\n\tfor(ll i=1;i<n;i++){\n\t\tfor(ll x:v[i])cur+=x,s.insert(x);\n\t\tcur-=*--s.end(),ans+=cur,s.erase(--s.end());\n\t}\n}\nvoid work2(){\n\tfor(ll i=1;i<n;i++){\n\t\tfor(ll x:v[i])cur+=x,s.insert(x);\n\t\tans+=(*s.begin())*(s.size()-2)+cur,\n\t\tcur-=*(--s.end()),s.erase(--s.end());\n\t}\n}\nvoid work3(){\n\tll l=0,r=0,cur1,cur2;memset(mn,0x3f,sizeof(mn));\n\tfor(ll i=1;i<=n;i++)S[i]=S[i-1]+v[i].size()-1;\n\tfor(ll i=1;i<=n;i++)if(S[i]^1){l=i;break;}\n\tfor(ll i=l;i<=n;i++)if(S[i]^2){r=i;break;}\n\tfor(ll i=l;i<r;i++)\n\t\tfor(ll x:v[i])mn[i]=min(mn[i-1],x),mx[i]=max(mx[i-1],x),cur+=x;\n\tfor(ll x:v[r])mn[r]=min(mn[r],x),mx[r]=max(mx[r],x),cur+=x;\n\tfor(ll i=r+1;i<n;i++){mn[i]=mn[i-1],mx[i]=mx[i-1];\n\t\tfor(ll x:v[i])mn[i]=min(mn[i-1],x),mx[i]=max(mx[i-1],x),cur+=x;}\n\tcur1=cur-mx[n-1],cur2=cur-max(mx[r-1],mx[n-1]);\n\tfor(ll i=r;i<n;i++)\n\t\tcur1+=(S[i]-2)*min(mn[r-1],mn[i]),cur2+=(S[i]-2)*mn[i];\n\tans=min(cur1,cur2);\n}\n\tn=read(),X=read(),Y=read(),S[0]=1,scanf(\"%s\",str+1);\n\tfor(ll i=1;i<=n;i++)a[i]=read();\n\tfor(ll i=1,x=0;i<=n<<1;i++)\n\t\tif(str[i]=='(')st[++t]=++x;else v[t].pb(a[st[t--]]);\n\tif(!X&&Y==1)work1();if(X&&X==Y)work2();\n\tif(!Y&&X==1)work3();printf(\"%ld\\n\",ans);\n\treturn 0;\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmp3eyn53hy/bbdca953-9933-4cea-8b9d-d5d432f97f65.cpp:42:9: error: ‘n’ does not name a type\n   42 |         n=read(),X=read(),Y=read(),S[0]=1,scanf(\"%s\",str+1);\n      |         ^\n/tmp/tmp3eyn53hy/bbdca953-9933-4cea-8b9d-d5d432f97f65.cpp:43:9: error: expected unqualified-id before ‘for’\n   43 |         for(ll i=1;i<=n;i++)a[i]=read();\n      |         ^~~\n/tmp/tmp3eyn53hy/bbdca953-9933-4cea-8b9d-d5d432f97f65.cpp:43:20: error: ‘i’ does not name a type\n   43 |         for(ll i=1;i<=n;i++)a[i]=read();\n      |                    ^\n/tmp/tmp3eyn53hy/bbdca953-9933-4cea-8b9d-d5d432f97f65.cpp:43:25: error: ‘i’ does not name a type\n   43 |         for(ll i=1;i<=n;i++)a[i]=read();\n      |                         ^\n/tmp/tmp3eyn53hy/bbdca953-9933-4cea-8b9d-d5d432f97f65.cpp:44:9: error: expected unqualified-id before ‘for’\n   44 |         for(ll i=1,x=0;i<=n<<1;i++)\n      |         ^~~\n/tmp/tmp3eyn53hy/bbdca953-9933-4cea-8b9d-d5d432f97f65.cpp:44:24: error: ‘i’ does not name a type\n   44 |         for(ll i=1,x=0;i<=n<<1;i++)\n      |                        ^\n/tmp/tmp3eyn53hy/bbdca953-9933-4cea-8b9d-d5d432f97f65.cpp:44:32: error: ‘i’ does not name a type\n   44 |         for(ll i=1,x=0;i<=n<<1;i++)\n      |                                ^\n/tmp/tmp3eyn53hy/bbdca953-9933-4cea-8b9d-d5d432f97f65.cpp:45:44: error: expected unqualified-id before ‘else’\n   45 |                 if(str[i]=='(')st[++t]=++x;else v[t].pb(a[st[t--]]);\n      |                                            ^~~~\n/tmp/tmp3eyn53hy/bbdca953-9933-4cea-8b9d-d5d432f97f65.cpp:46:9: error: expected unqualified-id before ‘if’\n   46 |         if(!X&&Y==1)work1();if(X&&X==Y)work2();\n      |         ^~\n/tmp/tmp3eyn53hy/bbdca953-9933-4cea-8b9d-d5d432f97f65.cpp:46:29: error: expected unqualified-id before ‘if’\n   46 |         if(!X&&Y==1)work1();if(X&&X==Y)work2();\n      |                             ^~\n/tmp/tmp3eyn53hy/bbdca953-9933-4cea-8b9d-d5d432f97f65.cpp:47:9: error: expected unqualified-id before ‘if’\n   47 |         if(!Y&&X==1)work3();printf(\"%ld\\n\",ans);\n      |         ^~\n/tmp/tmp3eyn53hy/bbdca953-9933-4cea-8b9d-d5d432f97f65.cpp:47:35: error: expected constructor, destructor, or type conversion before ‘(’ token\n   47 |         if(!Y&&X==1)work3();printf(\"%ld\\n\",ans);\n      |                                   ^\n/tmp/tmp3eyn53hy/bbdca953-9933-4cea-8b9d-d5d432f97f65.cpp:48:9: error: expected unqualified-id before ‘return’\n   48 |         return 0;\n      |         ^~~~~~\n/tmp/tmp3eyn53hy/bbdca953-9933-4cea-8b9d-d5d432f97f65.cpp:49:1: error: expected declaration before ‘}’ token\n   49 | }\n      | ^\n"
        ],
        "tcb_id": "序列变换"
    },
    {
        "code_id": 0,
        "code": "#include <cstdio>\r\n#include <cctype>\r\n#include <cstdlib>\r\n#include <algorithm>\r\n#include <unordered_map>\r\n#include <cassert>\r\n#define MAXIOLG 25\r\n#define FILENAME(x) \\\r\n#define MOD 998244353\r\n#define MD(x) (((x)>=MOD)?((x)-=MOD):(0))\r\n#define LOWBIT(x) ((x)&(-(x)))\r\n#define MAXN 500005\r\n#define INF 19260817\r\nusing namespace std;\r\n\r\n#include <cstdlib>\r\nvoid get_re(void){\r\n    exit(1);\r\n}\r\nvoid get_wa(void){\r\n    fputs(\"^_Wrong Answer!_$\\n\",stdout);\r\n    exit(0);\r\n}\r\nvoid get_tle(void){\r\n    int tler=0;\r\n    while (tler<=19260819){\r\n        tler++,tler%=19260817;\r\n    }\r\n}\r\nvoid get_mle(void){\r\n    char *mle_p;\r\n    mle_p=new char[1000000007];\r\n    *mle_p='\\0';\r\n}\r\nvoid myassert(int x,const char *errmsg=\"Assertion failed.\",int status_type=1){\r\n    if (!x){\r\n        fputs(errmsg,stderr);\r\n        switch (status_type){\r\n            case 1:\r\n                //RE\r\n                get_re();\r\n                break;\r\n            case 2:\r\n                //WA\r\n                get_wa();\r\n                break;\r\n            case 3:\r\n                //TLE\r\n                get_tle();\r\n                break;\r\n            case 4:\r\n                //MLE\r\n                get_mle();\r\n                break;\r\n        }\r\n    }\r\n}\r\n\r\ntypedef long long ll;\r\ntypedef ll io_t;\r\n\r\nio_t shin[MAXIOLG];\r\nio_t seto(void);\r\nvoid ayano(io_t x,char spliter='\\n');\r\n\r\nstruct Chtholly{\r\n    int vl,vr,rl,rr,pr;\r\n    int lc,rc,sz,cnt;\r\n    #define X(x) ((chtholly[(x)]).vl)\r\n    #define VL(x) ((chtholly[(x)]).vl)\r\n    #define VR(x) ((chtholly[(x)]).vr)\r\n    #define RL(x) ((chtholly[(x)]).rl)\r\n    #define RR(x) ((chtholly[(x)]).rr)\r\n    #define PR(x) ((chtholly[(x)]).pr)\r\n    #define LC(x) ((chtholly[(x)]).lc)\r\n    #define RC(x) ((chtholly[(x)]).rc)\r\n    #define SZ(x) ((chtholly[(x)]).sz)\r\n    #define CNT(x) ((chtholly[(x)]).cnt)\r\n};\r\n\r\nint pcnt=0;\r\nChtholly chtholly[MAXN];\r\nunordered_map<int,int> mp;\r\n\r\nvoid split(int &troot,int x);\r\nint build_tree(int n);\r\nvoid insert(int &root,int vlv,int vrv,int rlv,int rrv);\r\nvoid del(int &root,int x);\r\nint find(int root,int vpos);\r\nint get_rank(int root,int x);\r\nint get_kth(int root,int k);\r\nvoid zig(int &x);\r\nvoid zag(int &x);\r\nvoid calcsz(int x);\r\n\r\nint main(void){\r\n    int n,m;\r\n    srand(INF);\r\n    n=seto(),m=seto();\r\n    int troot=build_tree(n);\r\n    int lstans=0;\r\n    int lb=1,rb=n;\r\n    while (m--){\r\n        int op=seto();\r\n        switch (op){\r\n            case 1:{\r\n                int x,y;\r\n                x=seto()-lstans,y=seto()-lstans;\r\n                if (mp.count(x)){\r\n                    int xvl=mp[x];\r\n                    ayano((lstans=get_rank(troot,xvl)-1));\r\n                    mp.erase(x);\r\n                    mp[y]=xvl;\r\n                    int xpos=find(troot,xvl);\r\n                    RL(xpos)=RR(xpos)=y;\r\n                }\r\n                else {\r\n                    ayano((lstans=get_rank(troot,x)-1));\r\n                    split(troot,x);\r\n                    mp[y]=x;\r\n                    int xpos=find(troot,x);\r\n                    RL(xpos)=RR(xpos)=y;\r\n                }\r\n                break;\r\n            }\r\n            case 2:{\r\n                int x=seto()-lstans;\r\n                lb--;\r\n                if (mp.count(x)){\r\n                    int &xvl=mp[x];\r\n                    ayano((lstans=get_rank(troot,xvl)-1));\r\n                    del(troot,xvl);\r\n                    insert(troot,lb,lb,x,x);\r\n                    xvl=lb;\r\n                }\r\n                else {\r\n                    ayano((lstans=get_rank(troot,x)-1));\r\n                    split(troot,x);\r\n                    mp[x]=lb;\r\n                    del(troot,x);\r\n                    insert(troot,lb,lb,x,x);\r\n                }\r\n                break;\r\n            }\r\n            case 3:{\r\n                int x=seto()-lstans;\r\n                rb++;\r\n                if (mp.count(x)){\r\n                    int &xvl=mp[x];\r\n                    ayano((lstans=get_rank(troot,xvl)-1));\r\n                    del(troot,xvl);\r\n                    insert(troot,rb,rb,x,x);\r\n                    xvl=rb;\r\n                }\r\n                else {\r\n                    ayano((lstans=get_rank(troot,x)-1));\r\n                    split(troot,x);\r\n                    mp[x]=rb;\r\n                    del(troot,x);\r\n                    insert(troot,rb,rb,x,x);\r\n                }\r\n                break;\r\n            }\r\n            case 4:{\r\n                int k=seto()-lstans;\r\n                ayano((lstans=get_kth(troot,k+1)));\r\n                break;\r\n            }\r\n        }\r\n    }\r\n    return 0;\r\n}\r\n\r\nvoid split(int &troot,int x){\r\n    int xblk=find(troot,x);\r\n    int tvl,tvr,trl,trr;\r\n    tvl=VL(xblk),tvr=VR(xblk),trl=RL(xblk),trr=RR(xblk);\r\n    del(troot,tvl);\r\n    if (x>trl)\r\n        insert(troot,tvl,x-1,trl,x-1);\r\n    if (x<trr)\r\n        insert(troot,x+1,tvr,x+1,trr);\r\n    insert(troot,x,x,x,x);\r\n}\r\nint build_tree(int n){\r\n    pcnt++,X(pcnt)=-INF,PR(pcnt)=2,CNT(pcnt)=1,SZ(pcnt)=2;\r\n    int ttroot=pcnt;\r\n    pcnt++,X(pcnt)=INF,PR(pcnt)=1,CNT(pcnt)=SZ(pcnt)=1,\r\n    RC(ttroot)=pcnt;\r\n    insert(ttroot,1,n,1,n);\r\n    return ttroot;\r\n}\r\nint find(int root,int vpos){\r\n    myassert(root,\"Assertion failed.\",2);\r\n    if (VL(root)<=vpos && VR(root)>=vpos)\r\n        return root;\r\n    if (VL(root)>vpos)\r\n        return find(LC(root),vpos);\r\n    return find(RC(root),vpos);\r\n}\r\nint get_rank(int root,int x){\r\n    myassert(root,\"Assertion failed.\",2);\r\n    if (VL(root)<=x && VR(root)>=x)\r\n        return SZ(LC(root))+x-VL(root)+1;\r\n    if (VL(root)>x)\r\n        return get_rank(LC(root),x);\r\n    else\r\n        return SZ(LC(root))+CNT(root)+get_rank(RC(root),x);\r\n}\r\nint get_kth(int root,int k){\r\n    myassert(root,\"Assertion failed.\",2);\r\n    if (k<=SZ(LC(root)))\r\n        return get_kth(LC(root),k);\r\n    if (k<=SZ(LC(root))+CNT(root))\r\n        return RL(root)+k-SZ(LC(root))-1;\r\n    else\r\n        return get_kth(RC(root),k-SZ(LC(root))-CNT(root));\r\n}\r\nvoid insert(int &root,int vlv,int vrv,int rlv,int rrv){\r\n    if (!root){\r\n        pcnt++;\r\n        root=pcnt;\r\n        LC(root)=RC(root)=0,PR(root)=rand(),\r\n        VL(root)=vlv,VR(root)=vrv,RL(root)=rlv,RR(root)=rrv,\r\n        SZ(root)=CNT(root)=rrv-rlv+1;\r\n        return;\r\n    }\r\n    if (vlv<X(root)){\r\n        insert(LC(root),vlv,vrv,rlv,rrv),calcsz(root);\r\n        if (PR(LC(root))>PR(root))\r\n            zig(root);\r\n        return;\r\n    }\r\n    insert(RC(root),vlv,vrv,rlv,rrv),calcsz(root);\r\n    if (PR(RC(root))>PR(root))\r\n        zag(root);\r\n}\r\nvoid del(int &root,int x){\r\n    if (!root){\r\n        return;\r\n    }\r\n    if (X(root)==x){\r\n        if ((LC(root) && RC(root))){\r\n            if (PR(LC(root))>PR(RC(root))){\r\n                zig(root),del(RC(root),x);\r\n                calcsz(root);\r\n            }\r\n            else {\r\n                zag(root),del(LC(root),x);\r\n                calcsz(root);\r\n            }\r\n        }\r\n        else\r\n            root=(LC(root)|RC(root));\r\n        return;\r\n    }\r\n    if (x<X(root))\r\n        del(LC(root),x),calcsz(root);\r\n    else\r\n        del(RC(root),x),calcsz(root);\r\n}\r\nvoid zig(int &x){\r\n    int y=LC(x);\r\n    LC(x)=RC(y),RC(y)=x;\r\n    calcsz(x),calcsz(y);\r\n    x=y;\r\n}\r\nvoid zag(int &x){\r\n    int y=RC(x);\r\n    RC(x)=LC(y),LC(y)=x;\r\n    calcsz(x),calcsz(y);\r\n    x=y;\r\n}\r\nvoid calcsz(int x){\r\n    SZ(x)=SZ(LC(x))+SZ(RC(x))+CNT(x);\r\n}\r\n\r\nio_t seto(void){\r\n    io_t x=0;\r\n    int symbol=0;\r\n    char ch=getchar();\r\n    while (!isdigit(ch))\r\n        (ch=='-')?(symbol=1):(0),ch=getchar();\r\n    while (isdigit(ch))\r\n        x=(x*10)+(ch-'0'),ch=getchar();\r\n    return (symbol)?(-x):(x);\r\n}\r\nvoid ayano(io_t x,char spliter){\r\n    if (!x){\r\n        putchar('0'),putchar(spliter);\r\n        return;\r\n    }\r\n    if (x<0)\r\n        putchar('-'),x=-x;\r\n    int ren=0;\r\n    while (x){\r\n        io_t d=x/10;\r\n        shin[ren++]=x-d*10;\r\n        x=d;\r\n    }\r\n    while (ren--)\r\n        putchar(shin[ren]+'0');\r\n    putchar(spliter);\r\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpzodblbxr/e4153358-98f2-47fc-8f51-5fcd4c16a7d6.cpp:8:19: error: '#' is not followed by a macro parameter\n    8 | #define FILENAME(x) \\\n      |                   ^\n"
        ],
        "tcb_id": "方伯伯的 OJ"
    },
    {
        "code_id": 7,
        "code": "#include<bits/stdc++.h>\n#include<ext/pb_ds/assoc_container.hpp>\n#include<ext/pb_ds/hash_policy.hpp>\n#define db double\n#define ll long long\n#define mid ((l + r) >> 1)\n#define pb push_back\n#define ri int\n#define resetIO(x) \\\n#define TIME (1e3 * clock() / CLOCKS_PER_SEC)\nusing namespace std ;\nusing namespace __gnu_pbds ;\nconst int N = 2e3 + 10 ;\nconst int inf = 2e9;\ntemplate <typename T>\ninline void read(T&x){\n\tx = 0 ; char c = getchar() ; bool flg = 1 ;\n\twhile(c > '9' || c < '0'){if(c == '-')flg = 0 ; c = getchar() ;}\n\twhile(c >= '0' && c <= '9'){x = (x << 1) + (x << 3) + (c ^ 48) ; c = getchar() ;}\n\tx = flg ? x : -x ;\n}\ntemplate <typename T,typename ...Args>\ninline void read(T&x,Args&...args){read(x),read(args...);}\nbool m_bg ;\nint T,A,B,a[N],b[N],isu[N],ans ;\nvector<int>vca[N<<1],vcb[N<<1],use1,use2 ;\nstruct star{\n\tint to,pre,c ;\n}e[N*N] ;\nint head[N<<1],strn=1 ;\nvoid add(int u,int v,int c){\n\te[++strn].to = v ; e[strn].c = c ; e[strn].pre = head[u] ; head[u] = strn ;\n\te[++strn].to = u ; e[strn].c = 0 ; e[strn].pre = head[v] ; head[v] = strn ;\n}\nint lyr[N],s,t ;\nqueue<int>q ;\nint bfs(){\n\tfor(ri i = 1 ; i <= t ; i++)lyr[i] = 0 ;\n\tlyr[s] = 1 ; q.push(s) ;\n\twhile(!q.empty()){\n\t\tint u = q.front() ; q.pop() ;\n\t\tfor(ri i = head[u] , v ; i ; i = e[i].pre){\n\t\t\tv = e[i].to ;\n\t\t\tif(e[i].c && !lyr[v])q.push(v),lyr[v]=lyr[u]+1 ;\n\t\t}\n\t}\n\treturn lyr[t] ;\n}\nint dfs(int u,int flw){\n\tif(u == t)return flw ;\n\tint res = 0 ;\n\tfor(ri i = head[u] , v , c ; i ; i = e[i].pre){\n\t\tv = e[i].to ;\n\t\tif(lyr[v] == lyr[u] + 1 && e[i].c){\n\t\t\tc = dfs(v,min(e[i].c,flw-res)) ;\n\t\t\te[i].c -= c , e[i ^ 1].c += c ;\n\t\t\tres += c ; if(res == flw)break ;\n\t\t}\n\t}\n\tif(!res)lyr[u] = 0 ;\n\treturn res ;\n}\nint dinic(){\n\tint res = 0 ;\n\twhile(bfs())res += dfs(s,inf) ;\n\treturn res ;\n}\nvector<int>clr ;\nint res ;\nbool m_ed ;\nvoid work(int x,int y){\n\t//cout<<x<<\" \"<<y<<endl ;\n\tuse1.clear() ; use2.clear() ;\n\tfor(ri v : vca[x])if(!isu[v]){\n\t\tclr.pb(v) ;\n\t\tif(!(b[v]&1))isu[v]=1;\n\t\telse isu[v]=1;\n\t}\n\tfor(ri v : vca[y]){\n\t\tif(!(b[v]&1)){if(isu[v])use1.pb(v) ;}\n\t\telse{if(isu[v])if(isu[v])use2.pb(v) ;}\t\t\n\t}\n\ts = use1.size() + use2.size() + 1 ; t = s + 1 ;\n\tfor(ri v : use1)add(s,v,1) ; for(ri v : use2)add(v,t,1) ;\n\tfor(ri u : use1)for(ri v : vcb[u])if(isu[v])add(u,v,1) ;\n\tans = max(ans,(int)use1.size()+(int)use2.size()-dinic()+1+(x!=y)) ;\n\t//cout<<x<<\" \"<<y<<\" \"<<res<<endl ;\n\tfor(ri v : clr)isu[v] = 0 ; clr.clear() ;\n\tmemset(head,0,sizeof head) ; strn = 1 ; memset(isu,0,sizeof isu) ;\n}\nint M ;\nsigned main(){\n//\tcerr << fabs(&m_ed-&m_bg) / 1024 / 1024 << endl ;\n\t//read(T) ; \n\tT = 1 ;\n\twhile(T--){\n\t\tread(A,B,M) ; ans = 0 ;\n\t\tfor(ri i = 1 ; i <= A ; i++)read(a[i]) ;\n\t\tfor(ri i = 1 ; i <= B ; i++){\n\t\t\tread(b[i]) ;\n\t\t\tif(!(b[i]&1))use1.pb(i) ; else use2.pb(i) ;\n\t\t}\n\t\ts = use1.size() + use2.size() + 1 ; t = s + 1 ;\n\t\tfor(ri v : use1)add(s,v,1) ; for(ri v : use2)add(v,t,1) ;\n\t\tfor(ri u : use1)for(ri v : use2)if(!(__builtin_popcount(b[u]|b[v])&1))vcb[u].pb(v),add(u,v,1) ;\n\t\tans = max(ans,(int)use1.size()+(int)use2.size()-dinic()) ;\n\t\tfor(ri i = 1 ; i <= t ; i++)head[i] = 0 ; strn = 1 ;\n\t\tfor(ri i = 1 , u , v ; i <= M ; i++)read(u,v),vca[u].pb(v) ;\n\t\tfor(ri i = 1 ; i <= A ; i++)for(ri j = i ; j <= A ; j++)if((a[i]^a[j])&1||i==j)work(i,j) ;\n\t\tprintf(\"%d\\n\",ans) ;\n\t\tfor(ri i = 1 ; i <= A ; i++)vca[i].clear() ; for(ri i = 1 ; i <= B ; i++)vcb[i].clear() ;\n\t}\n\treturn 0 ;\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmplxacc3an/c3312ed1-383a-4174-9342-06cdbeb15518.cpp:9:18: error: '#' is not followed by a macro parameter\n    9 | #define resetIO(x) \\\n      |                  ^\n"
        ],
        "tcb_id": "朋友圈"
    },
    {
        "code_id": 6,
        "code": "#include<bits/stdc++.h>\nconst int N=33,M=1100,S=110,mod=1e9+7;\nusing namespace std;\nint n,m,sg[M][N],cg[M][S],C[N][N],tt[M];\nstring s[M];\nint main()\n\tcin>>n>>m;\n\tfor(int i=0;i<m;++i)\n\t{\n\t\tcin>>s[i];\n\t\tfor(char x:s[i])\n\t\t\tswitch(x)\n\t\t\t{\n\t\t\t\tcase 'R':++tt[i];break;\n\t\t\t\tcase '*':cg[i][tt[i]]^=3;break;\n\t\t\t\tdefault:cg[i][tt[i]]=1<<(x^'0');\n\t\t\t}\n\t}\n\tfor(int i=0;i<=n;++i)\n\t{\n\t\tC[i][0]=1;\n\t\tfor(int j=1;j<=i;++j)\n\t\t\tC[i][j]=(C[i-1][j]+C[i-1][j-1])%mod;\n\t}\n\tint ans=0;\n\tfor(int S=1;S<=n;++S)\n\t{\n\t\tlong long pt=1;\n\t\tint xs=(S&1?1:-1)*C[n][S];\n\t\tfor(int i=0;i<m;++i)\n\t\t{\n\t\t\tif(S+tt[i]>n)continue;\n\t\t\tfor(int j=0;j<n;++j)\n\t\t\t{\n\t\t\t\tint ws=0;\n\t\t\t\tfor(int k=0;k<n;++k)\n\t\t\t\t\tif(k<S)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(k<=j&&j-k<=tt[i])\n\t\t\t\t\t\t\tws|=1<<cg[i][j-k];\n\t\t\t\t\t\telse ws|=1;\n\t\t\t\t\t}\n\t\t\t\tif((ws&9)<9&&(ws&6)<6)\n\t\t\t\t{\n\t\t\t\t\tint cc=1;\n\t\t\t\t\tif(!(ws&9))cc*=2;\n\t\t\t\t\tif(!(ws&6))cc*=2;\n\t\t\t\t\tpt=pt*(cc+1)%mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tans=(ans+xs*pt)%mod;\n\t}\n\tcout<<(ans+mod)%mod;\n\treturn 0;\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmphr83p_73/982151f1-e2a7-4520-9117-b2d0e5b3e580.cpp:7:9: error: expected initializer before ‘cin’\n    7 |         cin>>n>>m;\n      |         ^~~\n/tmp/tmphr83p_73/982151f1-e2a7-4520-9117-b2d0e5b3e580.cpp:8:9: error: expected unqualified-id before ‘for’\n    8 |         for(int i=0;i<m;++i)\n      |         ^~~\n/tmp/tmphr83p_73/982151f1-e2a7-4520-9117-b2d0e5b3e580.cpp:8:21: error: ‘i’ does not name a type\n    8 |         for(int i=0;i<m;++i)\n      |                     ^\n/tmp/tmphr83p_73/982151f1-e2a7-4520-9117-b2d0e5b3e580.cpp:8:25: error: expected unqualified-id before ‘++’ token\n    8 |         for(int i=0;i<m;++i)\n      |                         ^~\n/tmp/tmphr83p_73/982151f1-e2a7-4520-9117-b2d0e5b3e580.cpp:19:9: error: expected unqualified-id before ‘for’\n   19 |         for(int i=0;i<=n;++i)\n      |         ^~~\n/tmp/tmphr83p_73/982151f1-e2a7-4520-9117-b2d0e5b3e580.cpp:19:21: error: ‘i’ does not name a type\n   19 |         for(int i=0;i<=n;++i)\n      |                     ^\n/tmp/tmphr83p_73/982151f1-e2a7-4520-9117-b2d0e5b3e580.cpp:19:26: error: expected unqualified-id before ‘++’ token\n   19 |         for(int i=0;i<=n;++i)\n      |                          ^~\n/tmp/tmphr83p_73/982151f1-e2a7-4520-9117-b2d0e5b3e580.cpp:26:9: error: expected unqualified-id before ‘for’\n   26 |         for(int S=1;S<=n;++S)\n      |         ^~~\n/tmp/tmphr83p_73/982151f1-e2a7-4520-9117-b2d0e5b3e580.cpp:26:21: error: ‘S’ does not name a type\n   26 |         for(int S=1;S<=n;++S)\n      |                     ^\n/tmp/tmphr83p_73/982151f1-e2a7-4520-9117-b2d0e5b3e580.cpp:26:26: error: expected unqualified-id before ‘++’ token\n   26 |         for(int S=1;S<=n;++S)\n      |                          ^~\n/tmp/tmphr83p_73/982151f1-e2a7-4520-9117-b2d0e5b3e580.cpp:54:9: error: ‘cout’ does not name a type\n   54 |         cout<<(ans+mod)%mod;\n      |         ^~~~\n/tmp/tmphr83p_73/982151f1-e2a7-4520-9117-b2d0e5b3e580.cpp:55:9: error: expected unqualified-id before ‘return’\n   55 |         return 0;\n      |         ^~~~~~\n/tmp/tmphr83p_73/982151f1-e2a7-4520-9117-b2d0e5b3e580.cpp:56:1: error: expected declaration before ‘}’ token\n   56 | }\n      | ^\n"
        ],
        "tcb_id": "机器人游戏"
    },
    {
        "code_id": 1,
        "code": "#include<bits/stdc++.h>\n#include<sys/mman.h>\n#include<fcntl.h>\nusing namespace std;\nusing llt=long long;\nusing llf=long double;\nusing ull=unsigned long long;\n#define Ct const\n#define Il __always_inline\n#define For(i,a,b,c) for(int i=(a);i<=(b);i+=(c))\n#define For_(i,a,b,c) for(int i=(a);i>=(b);i-=(c))\n#define For_it(i,a,b) for(auto i=(a);i!=(b);++i)\n\nnamespace IO{\n#ifdef ONLINE_JUDGE\n\tint Fin=fileno(stdin); FILE* Fout=stdout;\n#elif defined(UN_FAST)\n#else\n#endif // file\n#ifdef UN_FAST\n\tchar cc;\n\t#define G (cc=getchar())\n\t#define C cc\n#else\n\tconst char *I=(char*)mmap(0,1<<24,1,2,Fin,0)-1; \n\t#define G (*++I)\n\t#define C (*I)\n#endif // fast (mmap)\n#define P(x) putc_unlocked(x,Fout)\n\ttemplate<class T> Il void read(T &x){x=0;bool f=0; while(f|=G==45,C<48); while(x=x*10+(C&15),G>47); f?x=-x:0;}\n\ttemplate<class T> void write(T x){if(x<0) P('-'),x=-x; if(x/10) write(x/10); P('0'+x%10);}\n\tIl void read(char &c){while(G<33); c=C;} void read(char *s){char *p=s-1; while(G<33); while(*++p=C,G>32); *++p='\\0';}\n\tIl void read(string &s){s.clear(); while(G<33); while(s.push_back(C),G>32);}\n\ttemplate<class T=int> Il T read(){T a; return read(a),a;}\n\ttemplate<class T,class ...Argc> Il void read(T &x,Argc &...argc){read(x),read(argc...);}\n\tIl void write(const char &c){P(c);} Il void write(const char *s){for(const char *c=s;*c!='\\0';++c) P(*c);}\n\tIl void write(const string &s){for(const char &c:s) P(c);}\n\ttemplate<class T,class ...Argc> Il void write(const T &x,const Argc &...argc){write(x),write(argc...);}\n\ttemplate<class T> Il void Write(const T &x){write(x),P(' ');} Il void Write(const char &c){P(c); if(c>32) P(' ');}\n\ttemplate<class T,class ...Argc> Il void Write(const T &x,const Argc &...argc){Write(x),Write(argc...);}\n#undef G\n#undef C\n#undef P\n}using IO::read; using IO::write; using IO::Write;\n\nconstexpr int N=2e5+3,Inf=0x3f3f3f3f;\n\nint n,m,cl,cr,wt[N];\nint __cnt,__cnt2;\nstruct Graph{\n\tint hd[N],to[N<<1],nt[N<<1],col[N<<1],tot=1;\n\tIl void Add(Ct int &u,Ct int &v,Ct int &w){col[++tot]=w,to[tot]=v,nt[tot]=hd[u],hd[u]=tot;}\n#define For_to(i,u,v,g) for(int i=g.hd[u],v=g.to[i];i;i=g.nt[i],v=g.to[i])\n}g;\nclass PDIV{\nprivate:\n\tint sz[N],mav[N],rt,dis[N],dep[N],mdp[N],ans;\n\tbool vis[N];\n\tvoid Root(Ct int &u,Ct int &fa,int usz){\n\t\tsz[u]=1,mav[u]=0;\n\t\tFor_to(i,u,v,g) if(v!=fa&&!vis[v]) Root(v,u,usz),sz[u]+=sz[v],mav[u]=max(mav[u],sz[v]);\n\t\tmav[u]=max(mav[u],usz-sz[u]);\n\t\tif(mav[rt]>mav[u]) rt=u;\n\t}\n\tvoid Size(Ct int &u,Ct int &fa){sz[u]=1; For_to(i,u,v,g) if(v!=fa&&!vis[v]) Size(v,u),sz[u]+=sz[v];}\n\tvoid Getu(Ct int &u,Ct int &fa,Ct int &la){\n\t\tFor_to(i,u,v,g) if(v!=fa&&!vis[v]){\n\t\t\tdep[v]=dep[u]+1,dis[v]=dis[u]+(g.col[i]==la?0:wt[g.col[i]]);\n\t\t\tGetu(v,u,g.col[i]); mdp[u]=max(mdp[v]+1,mdp[u]);\n\t\t}\n\t}\n\t\n\tvector<int> ord,cld[N];\n\tclass SORT{\n\tprivate:\n\t\tPDIV *F;\n\t\tbool vis[N]; int ma[N];\n\tpublic:\n\t\tSORT(PDIV *_):F(_){};\n\t\tIl void operator()(){\n\t\t\tFor_to(i,F->rt,v,g) if(!F->vis[v]){\n\t\t\t\tint col=g.col[i];\n\t\t\t\tF->cld[col].push_back(v),ma[col]=max(ma[col],F->mdp[v]);\n\t\t\t\tif(!vis[col]) F->ord.push_back(col),vis[col]=1;\n\t\t\t}\n\t\t\tsort(F->ord.begin(),F->ord.end(),[this](Ct int &a,Ct int &b){return this->ma[a]<this->ma[b];});\n\t\t\tfor(Ct int &c:F->ord)\n\t\t\t\tsort(F->cld[c].begin(),F->cld[c].end(),[this](Ct int &a,Ct int &b){return this->F->mdp[a]<this->F->mdp[b];});\n\t\t\tFor_to(i,F->rt,v,g) if(!F->vis[v]) ma[g.col[i]]=vis[g.col[i]]=0;\n\t\t}\n\t}Sort=SORT(this);\n\n\tclass CALC{\n\tprivate:\n\t\tint mad[N],mas[N],lend,lens,posd,poss;\n\t\tqueue<pair<int,int>> que; PDIV *F;\n\t\tclass Mque{\n\t\tprivate: int que[N],*hd=que+1,*tl=que;\n\t\tpublic:\n\t\t\tIl bool Empty(){return hd>tl;} Il void Clear(){hd=que+1,tl=que;}\n\t\t\tIl void Push(Ct int &p,Ct int *pd){while(!Empty()&&pd[*tl]<=pd[p]) --tl,++__cnt; *++tl=p;}\n\t\t\tIl int Front(Ct int &lim){while(!Empty()&&*hd>lim) ++hd,++__cnt; return Empty()?N-1:*hd;}\n\t\t}qd,qs;\n\t\tIl int Get(Ct int &u,Ct int &col){\n\t\t\tint l=max(0,cl-F->dep[u]);\n\t\t\twhile(posd>=l) qd.Push(posd,mad),--posd;\n\t\t\twhile(poss>=l) qs.Push(poss,mas),--poss;\n\t\t\treturn max(mad[qd.Front(cr-F->dep[u])],mas[qs.Front(cr-F->dep[u])]-wt[col])+F->dis[u];\n\t\t}\n\tpublic:\n\t\tCALC(PDIV *_):F(_){memset(mad,-0x3f,sizeof(mad)),memset(mas,-0x3f,sizeof(mas)),mad[0]=0;}\n\t\tIl void Clr(){For(i,1,lend,1) mad[i]=-Inf; posd=lend=0;}\n\t\tIl void operator()(Ct int &nwc){\n\t\t\t__cnt=0;\n\t\t\tfor(int nw:F->cld[nwc]){\n\t\t\t\tque.emplace(nw,F->rt);\n\t\t\t\twhile(!que.empty()){\n\t\t\t\t\tauto tmp=que.front(); que.pop();\n\t\t\t\t\tint u=tmp.first,fa=tmp.second;\n\t\t\t\t\tF->ans=max(F->ans,Get(u,nwc));\n\t\t\t\t\tFor_to(i,u,v,g) if(!F->vis[v]&&fa!=v) que.emplace(v,u);\n\t\t\t\t\t++__cnt;\n\t\t\t\t}\n\t\t\t\tque.emplace(nw,F->rt);\n\t\t\t\twhile(!que.empty()){\n\t\t\t\t\tauto tmp=que.front(); que.pop();\n\t\t\t\t\tint u=tmp.first,fa=tmp.second;\n\t\t\t\t\tmas[F->dep[u]]=max(mas[F->dep[u]],F->dis[u]),lens=max(lens,F->dep[u]);\n\t\t\t\t\tFor_to(i,u,v,g) if(!F->vis[v]&&fa!=v) que.emplace(v,u);\n\t\t\t\t\t++__cnt;\n\t\t\t\t}\n\t\t\t\tposs=lens,qd.Clear(),qs.Clear();\n\t\t\t}\n\t\t\tlend=max(lend,lens),posd=lend;\n\t\t\tFor(i,1,lens,1) mad[i]=max(mas[i],mad[i]),mas[i]=-Inf; poss=lens=0;\n\t\t}\n\t}Calc=CALC(this);\n\n\tvoid Div(){\n\t\tvis[rt]=1;\n\t\tdis[rt]=dep[rt]=0,Getu(rt,0,0);\n\t\tSort();\n\t\tint pos=0;\n\t\tfor(Ct int &c:ord) Calc(c),cld[c].clear(); Calc.Clr(); ord.clear();\n\t\tSize(rt,0); int u=rt;\n\t\tFor_to(i,u,v,g) if(!vis[v]) rt=0,Root(v,u,sz[v]),Div();\n\t}\npublic:\n\tPDIV(){mav[0]=0x3f3f3f3f,ans=-Inf;}\n\tIl int operator()(){Root(1,0,n),Div(); return ans;}\n}Pdiv;\n\nint main(){\n\tread(n,m,cl,cr);\n\tFor(i,1,m,1) read(wt[i]);\n\tFor(i,1,n-1,1){int u,v,c; read(u,v,c); g.Add(u,v,c),g.Add(v,u,c);}\n\twrite(Pdiv());\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpaw8k90nd/532e975d-6679-490b-892a-e8a66049ff30.cpp:25:47: error: ‘Fin’ was not declared in this scope; did you mean ‘sin’?\n   25 |         const char *I=(char*)mmap(0,1<<24,1,2,Fin,0)-1;\n      |                                               ^~~\n      |                                               sin\n/tmp/tmpaw8k90nd/532e975d-6679-490b-892a-e8a66049ff30.cpp: In function ‘void IO::write(T)’:\n/tmp/tmpaw8k90nd/532e975d-6679-490b-892a-e8a66049ff30.cpp:29:30: error: ‘Fout’ was not declared in this scope\n   29 | #define P(x) putc_unlocked(x,Fout)\n      |                              ^~~~\n/tmp/tmpaw8k90nd/532e975d-6679-490b-892a-e8a66049ff30.cpp:31:51: note: in expansion of macro ‘P’\n   31 |         template<class T> void write(T x){if(x<0) P('-'),x=-x; if(x/10) write(x/10); P('0'+x%10);}\n      |                                                   ^\n/tmp/tmpaw8k90nd/532e975d-6679-490b-892a-e8a66049ff30.cpp:29:30: error: ‘Fout’ was not declared in this scope\n   29 | #define P(x) putc_unlocked(x,Fout)\n      |                              ^~~~\n/tmp/tmpaw8k90nd/532e975d-6679-490b-892a-e8a66049ff30.cpp:31:86: note: in expansion of macro ‘P’\n   31 |         template<class T> void write(T x){if(x<0) P('-'),x=-x; if(x/10) write(x/10); P('0'+x%10);}\n      |                                                                                      ^\n/tmp/tmpaw8k90nd/532e975d-6679-490b-892a-e8a66049ff30.cpp: In function ‘void IO::write(const char&)’:\n/tmp/tmpaw8k90nd/532e975d-6679-490b-892a-e8a66049ff30.cpp:29:30: error: ‘Fout’ was not declared in this scope\n   29 | #define P(x) putc_unlocked(x,Fout)\n      |                              ^~~~\n/tmp/tmpaw8k90nd/532e975d-6679-490b-892a-e8a66049ff30.cpp:36:38: note: in expansion of macro ‘P’\n   36 |         Il void write(const char &c){P(c);} Il void write(const char *s){for(const char *c=s;*c!='\\0';++c) P(*c);}\n      |                                      ^\n/tmp/tmpaw8k90nd/532e975d-6679-490b-892a-e8a66049ff30.cpp: In function ‘void IO::write(const char*)’:\n/tmp/tmpaw8k90nd/532e975d-6679-490b-892a-e8a66049ff30.cpp:29:30: error: ‘Fout’ was not declared in this scope\n   29 | #define P(x) putc_unlocked(x,Fout)\n      |                              ^~~~\n/tmp/tmpaw8k90nd/532e975d-6679-490b-892a-e8a66049ff30.cpp:36:108: note: in expansion of macro ‘P’\n   36 |         Il void write(const char &c){P(c);} Il void write(const char *s){for(const char *c=s;*c!='\\0';++c) P(*c);}\n      |                                                                                                            ^\n/tmp/tmpaw8k90nd/532e975d-6679-490b-892a-e8a66049ff30.cpp: In function ‘void IO::write(const string&)’:\n/tmp/tmpaw8k90nd/532e975d-6679-490b-892a-e8a66049ff30.cpp:29:30: error: ‘Fout’ was not declared in this scope\n   29 | #define P(x) putc_unlocked(x,Fout)\n      |                              ^~~~\n/tmp/tmpaw8k90nd/532e975d-6679-490b-892a-e8a66049ff30.cpp:37:61: note: in expansion of macro ‘P’\n   37 |         Il void write(const string &s){for(const char &c:s) P(c);}\n      |                                                             ^\n/tmp/tmpaw8k90nd/532e975d-6679-490b-892a-e8a66049ff30.cpp: In function ‘void IO::Write(const T&)’:\n/tmp/tmpaw8k90nd/532e975d-6679-490b-892a-e8a66049ff30.cpp:29:30: error: ‘Fout’ was not declared in this scope\n   29 | #define P(x) putc_unlocked(x,Fout)\n      |                              ^~~~\n/tmp/tmpaw8k90nd/532e975d-6679-490b-892a-e8a66049ff30.cpp:39:62: note: in expansion of macro ‘P’\n   39 |         template<class T> Il void Write(const T &x){write(x),P(' ');} Il void Write(const char &c){P(c); if(c>32) P(' ');}\n      |                                                              ^\n/tmp/tmpaw8k90nd/532e975d-6679-490b-892a-e8a66049ff30.cpp: In function ‘void IO::Write(const char&)’:\n/tmp/tmpaw8k90nd/532e975d-6679-490b-892a-e8a66049ff30.cpp:29:30: error: ‘Fout’ was not declared in this scope\n   29 | #define P(x) putc_unlocked(x,Fout)\n      |                              ^~~~\n/tmp/tmpaw8k90nd/532e975d-6679-490b-892a-e8a66049ff30.cpp:39:100: note: in expansion of macro ‘P’\n   39 |         template<class T> Il void Write(const T &x){write(x),P(' ');} Il void Write(const char &c){P(c); if(c>32) P(' ');}\n      |                                                                                                    ^\n"
        ],
        "tcb_id": "树的难题"
    },
    {
        "code_id": 2,
        "code": "#include <bits/stdc++.h>\nnamespace // my guiding star\n{\nusing namespace std;\n#define cT const T&\ntemplate<typename T>\ninline T chkmin(T& x, cT y){if (x > y) x = y; return x;}\ntemplate<typename T>\ninline T chkmax(T& x, cT y){if (x < y) x = y; return x;}\ntemplate <typename T>\ninline bool inrange(cT x, cT l, cT r){return (l <= x) && (x <= r);}\ntemplate <typename T>\ninline bool inrange(cT l, cT r, cT L, cT R){return (L <= l) && (r <= R);}\n#undef cT\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef double db;\ntypedef long double ldb;\ntypedef unsigned u32;\ntemplate <typename T>\nusing pr = pair<T, T>;\ntypedef pr<int> pii;\ntypedef pr<ll> pll;\ntypedef pr<db> pdd; \ntypedef complex<double> cp;\ntypedef vector<int> vi;\ninline void YN(bool x){puts(x ? \"Yes\" : \"No\");}\n}\nconst int N = 2e5 + 233, K = 1111, P = 1000000007;\nint n, m, k, fa[N];\null dp[2][K];\nint main()\n{\n    file(\"tree\");\n\tint d, T; scanf(\"%d%d\", &d, &T);\n\twhile (T--)\n\t{\n\t\tscanf(\"%d%d%d\", &n, &m, &k);\n\t\tfor (int i=2; i<=n; i++) scanf(\"%d\", fa+i);\n\t\tif (!k)\n\t\t{\n\t\t\tint ans = 1;\n\t\t\tfor (int i=n; i<=n+m-1; i++) ans = 1ll * ans * (i * 2 - 1) % P;\n\t\t\tprintf(\"%d\\n\", ans); return 0;\n\t\t}\n\t\tmemset(dp, 0, sizeof dp); dp[n&1^1][0] = 1;\n\t\tfor (int i=n; i<=n+m-1; i++)\n\t\t{\n\t\t\tfor (int s=0; s<(1<<k); s++) dp[i&1][s] = 0;\n\t\t\tfor (int s=1<<(k-1); s<(1<<k); s++) dp[i&1][(s<<1)&((1<<k)-1)] += dp[i&1^1][s];\n\t\t\tfor (int s=0; s<(1<<(k-1)); s++)\n\t\t\t{\n\t\t\t\tfor (int j=k-2; j>=0; j--)\n\t\t\t\t\tif (s & (1 << j)) dp[i&1][(s^(1<<j))<<1] += dp[i&1^1][s];\n\t\t\t\tdp[i&1][s<<1] += dp[i&1^1][s] * ((i + __builtin_popcount(s)) * 2 - 1);\n\t\t\t\tdp[i&1][s<<1|1] += dp[i&1^1][s] * (i + __builtin_popcount(s) - 1);\n\t\t\t}\n\t\t\tfor (int s=0; s<(1<<k); s++) dp[i&1][s] %= P;\n\t\t}\n\t\tprintf(\"%llu\\n\", dp[(n+m)&1^1][0]);\n\t}\n\treturn 0;\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpwyjm5m3i/faaa8419-4a43-4c1c-8f7e-b90af9a87e24.cpp: In function ‘int main()’:\n/tmp/tmpwyjm5m3i/faaa8419-4a43-4c1c-8f7e-b90af9a87e24.cpp:34:5: error: ‘file’ was not declared in this scope\n   34 |     file(\"tree\");\n      |     ^~~~\n"
        ],
        "tcb_id": "桂花树"
    },
    {
        "code_id": 7,
        "code": "#include<cstdio>\r\n#include<cstring>\r\n#include<vector>\r\n#include<queue>\r\n#include<set>\r\n#include<map>\r\n#include<cstdlib>\r\n#include<iostream>\r\n#include<algorithm>\r\n#define fi first\r\n#define se second\r\n#define L(i,u) for (int i=head[u]; i!=0; i=nxt[i])\r\n#define rep(i,a,b) for (register int i=a; i<=b; i++)\r\n#define per(i,a,b) for (register int i=a; i>=b; i--)\r\ntypedef long long ll;\r\nusing namespace std;\r\ntypedef pair<int,int> Pii;\r\ntypedef vector<int> Vi;\r\ninline void read(int &x) {\r\n\tx=0; char c=getchar(); int f=1;\r\n\twhile (!isdigit(c)) {if (c=='-') f=-1; c=getchar();}\r\n\twhile (isdigit(c)) {x=x*10+c-'0'; c=getchar();} x*=f;\r\n}\r\nconst int N = 203000, M = 900, mo = 1e9+7;\r\nint n,k,head[N],to[N],nxt[N],edgenum;\r\ninline void addedge(int u, int v) {\r\n\tto[++edgenum]=v; nxt[edgenum]=head[u]; head[u]=edgenum;\r\n}\r\nint f[2][2][102][100020],tmp[2][2][102];\r\nint A[M],B[M],C[M],D[M],size[N];\r\ninline void add(int &a, int b){a=a+b<mo?a+b:a+b-mo;}\r\ninline void dfs(int u, int fa) {\r\n\tsize[u]=1;\r\n\tL(i,u) if (to[i]!=fa) dfs(to[i],u),size[u]+=size[to[i]];\r\n\tf[0][0][0][u]=f[0][1][1][u]=1;\r\n\tL(i,u) if (to[i]!=fa) {\r\n\t\tint v=to[i]; memset(tmp,0,sizeof(tmp));\r\n\t\tint len=0; rep(a,0,1)rep(b,0,1)rep(c,0,k)if(f[a][b][c][u]) {\r\n\t\t\tA[++len]=a;B[len]=b;C[len]=c;D[len]=f[a][b][c][u];\r\n\t\t}\r\n\t\trep(a2,0,1)rep(b2,0,1)per(c2,min(k,size[to[i]]),0) {\r\n\t\t\tint val=f[a2][b2][c2][v]; if (!val) continue;\r\n\t\t\trep(p,1,len) {\r\n\t\t\t\tint a1=A[p],b1=B[p],c1=C[p];\r\n\t\t\t\tif (b1||!b1&&a2&&c1+c2<=k) {\r\n\t\t\t\t\tadd(tmp[a1|b2][b1][c1+c2],1LL*D[p]*val%mo);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\t/*rep(a1,0,1)rep(b1,0,1)rep(a2,0,1)rep(b2,0,1)\r\n\t\t\trep(c1,0,k)per(c2,min(k-c1,size[to[i]]),0) if (b1||!b1&&a2) {\r\n\t\t\t\tadd(tmp[a1|b2][b1][c1+c2],1LL*f[a1][b1][c1][u]*f[a2][b2][c2][v]%mo);\r\n\t\t\t}*/\r\n\t\trep(a,0,1) rep(b,0,1) rep(c,0,k) f[a][b][c][u]=tmp[a][b][c];\r\n\t}\r\n}\r\n\tread(n); read(k);\r\n\trep(i,2,n) {int x,y;read(x);read(y);addedge(x,y);addedge(y,x);}\r\n\tdfs(1,0);\r\n\tll ans=f[1][0][k][1]+f[1][1][k][1];\r\n\tcout<<ans%mo;\r\n\treturn 0;\r\n}\r\n\r\n",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpl_xbd5be/ae78784b-e8c8-4455-a2d4-a5fe07fbea0d.cpp:57:13: error: expected constructor, destructor, or type conversion before ‘(’ token\n   57 |         read(n); read(k);\n      |             ^\n/tmp/tmpl_xbd5be/ae78784b-e8c8-4455-a2d4-a5fe07fbea0d.cpp:57:22: error: expected constructor, destructor, or type conversion before ‘(’ token\n   57 |         read(n); read(k);\n      |                      ^\n/tmp/tmpl_xbd5be/ae78784b-e8c8-4455-a2d4-a5fe07fbea0d.cpp:13:20: error: expected unqualified-id before ‘for’\n   13 | #define rep(i,a,b) for (register int i=a; i<=b; i++)\n      |                    ^~~\n/tmp/tmpl_xbd5be/ae78784b-e8c8-4455-a2d4-a5fe07fbea0d.cpp:58:9: note: in expansion of macro ‘rep’\n   58 |         rep(i,2,n) {int x,y;read(x);read(y);addedge(x,y);addedge(y,x);}\n      |         ^~~\n/tmp/tmpl_xbd5be/ae78784b-e8c8-4455-a2d4-a5fe07fbea0d.cpp:58:13: error: ‘i’ does not name a type; did you mean ‘Vi’?\n   58 |         rep(i,2,n) {int x,y;read(x);read(y);addedge(x,y);addedge(y,x);}\n      |             ^\n/tmp/tmpl_xbd5be/ae78784b-e8c8-4455-a2d4-a5fe07fbea0d.cpp:13:43: note: in definition of macro ‘rep’\n   13 | #define rep(i,a,b) for (register int i=a; i<=b; i++)\n      |                                           ^\n/tmp/tmpl_xbd5be/ae78784b-e8c8-4455-a2d4-a5fe07fbea0d.cpp:58:13: error: ‘i’ does not name a type; did you mean ‘Vi’?\n   58 |         rep(i,2,n) {int x,y;read(x);read(y);addedge(x,y);addedge(y,x);}\n      |             ^\n/tmp/tmpl_xbd5be/ae78784b-e8c8-4455-a2d4-a5fe07fbea0d.cpp:13:49: note: in definition of macro ‘rep’\n   13 | #define rep(i,a,b) for (register int i=a; i<=b; i++)\n      |                                                 ^\n/tmp/tmpl_xbd5be/ae78784b-e8c8-4455-a2d4-a5fe07fbea0d.cpp:59:12: error: expected constructor, destructor, or type conversion before ‘(’ token\n   59 |         dfs(1,0);\n      |            ^\n/tmp/tmpl_xbd5be/ae78784b-e8c8-4455-a2d4-a5fe07fbea0d.cpp:61:9: error: ‘cout’ does not name a type\n   61 |         cout<<ans%mo;\n      |         ^~~~\n/tmp/tmpl_xbd5be/ae78784b-e8c8-4455-a2d4-a5fe07fbea0d.cpp:62:9: error: expected unqualified-id before ‘return’\n   62 |         return 0;\n      |         ^~~~~~\n/tmp/tmpl_xbd5be/ae78784b-e8c8-4455-a2d4-a5fe07fbea0d.cpp:63:1: error: expected declaration before ‘}’ token\n   63 | }\n      | ^\n"
        ],
        "tcb_id": "潜入行动"
    },
    {
        "code_id": 1,
        "code": "//loj 6271\n//https://loj.ac/p/6271\n#include<bits/stdc++.h>\n#define LL long long\n#define int LL\nusing namespace std;\nconst int N=105,mod=1e9+7,W=82062379,I3=(mod+1)/3;\nstruct P{int x,y;}ww[3],c[3];\nint n,m,w[N][N],pw[N],ans;P a[N][N];\ninline int md(int x){return x>=mod?x-mod:x;}\ninline int ksm(int x,int p){int s=1;for(;p;(p&1)&&(s=1ll*s*x%mod),x=1ll*x*x%mod,p>>=1);return s;}\ninline P operator+(P x,P y){return {md(x.x+y.x),md(x.y+y.y)};}\ninline P operator-(P x,P y){return {md(x.x-y.x+mod),md(x.y-y.y+mod)};}\ninline P operator*(P x,int y){return {1ll*x.x*y%mod,1ll*x.y*y%mod};}\ninline P operator/(P x,int y){return x*ksm(y,mod-2);}\ninline void operator+=(P &x,P y){x=x+y;}\ninline void operator-=(P &x,P y){x=x-y;}\ninline int p2(int x){return 1ll*x*x%mod;}\ninline P operator*(P x,P y){return {(1ll*x.x*y.x+1ll*(mod-x.y)*y.y)%mod,(1ll*x.x*y.y+1ll*x.y*y.x)%mod};}\ninline P operator/(P x,P y){return x*(P){y.x,mod-y.y}/(p2(y.x)+p2(y.y));}\ninline void IDFT(P *p)\n{\n\tP tmp[3];\n\tfor(int i=0;i<3;i++) tmp[i]=p[i];\n\tp[0]=tmp[0]+tmp[1]+tmp[2];\n\tp[1]=tmp[0]+tmp[1]/ww[1]+tmp[2]/ww[2];\n\tp[2]=tmp[0]+tmp[1]/ww[2]+tmp[2]/ww[1];\n\tfor(int i=0;i<3;i++) p[i]=p[i]*I3;\n}\ninline P hls(P a[N][N],int n)\n{\n\tint zf=1;P ans={1,0};\n\tfor(int i=1;i<n;i++)\n\t\tfor(int j=i+1;j<=n;j++)\n\t\t\tif(a[i][i].x||a[i][i].y)\n\t\t\t{\n\t\t\t\tP t=a[j][i]/a[i][i];\n\t\t\t\tfor(int k=1;k<=n;k++) a[j][k]=a[j][k]-a[i][k]*t;\n\t\t\t}\n\t\t\telse swap(a[i],a[j]),zf*=-1;\n\tfor(int i=1;i<=n;i++) ans=ans*a[i][i];return zf==1?ans:(P){0,0}-ans;\n}\ninline void add(int u,int v,int w){P t=ww[w];a[u][v]-=t,a[v][u]-=t,a[u][u]+=t,a[v][v]+=t;}\nsigned main()\n{\n\tfr(sum)\n\tios::sync_with_stdio(0);cin.tie(0);cout.tie(0);cin>>n>>m;\n\tww[0]={1,0};ww[1]={(mod-1)/2,(mod+W)/2};ww[2]={(mod-1)/2,(mod-W)/2};\n\tfor(int i=1,u,v,x;i<=m;i++) cin>>u>>v>>x,w[u][v]=w[v][u]=x;\n\tfor(int T=0,s=1;T<=10;T++,s*=3)\n\t{\n\t\tfor(int k=0;k<3;k++)\n\t\t{\n\t\t\tfor(int i=1;i<=n;i++) for(int j=1;j<=n;j++) a[i][j]={0,0};\n\t\t\tfor(int i=1;i<=n;i++) for(int j=1;j<i;j++) if(w[i][j]) add(i,j,(w[i][j]/s)%3*k%3);\n\t\t\tc[k]=hls(a,n-1);\n\t\t}\n\t\tIDFT(c);ans=(ans+(c[1].x+2ll*c[2].x)%mod*s)%mod;\n\t}\n\treturn cout<<ans,0;\n}\n",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmp2l67hu7p/e09d1248-27f3-414a-aa22-f73a92adb50d.cpp: In function ‘int main()’:\n/tmp/tmp2l67hu7p/e09d1248-27f3-414a-aa22-f73a92adb50d.cpp:46:12: error: ‘sum’ was not declared in this scope\n   46 |         fr(sum)\n      |            ^~~\n/tmp/tmp2l67hu7p/e09d1248-27f3-414a-aa22-f73a92adb50d.cpp:46:9: error: ‘fr’ was not declared in this scope\n   46 |         fr(sum)\n      |         ^~\n"
        ],
        "tcb_id": "生成树求和 加强版"
    },
    {
        "code_id": 1,
        "code": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n#define int long long\nint r[1005][1005], dp[1005][1005], d[1005][1005]; char a[1005][1005];\nint t, id; cin >> t >> id; while (t--) {\nint n, m, c, f, summc=0, summf=0; cin >> n >> m >> c >> f;\nfor (int i=1; i<=n; i++) for (int j=1; j<=m; j++) cin >> a[i][j];\nfor (int i=1; i<=n; i++) for (int j=m+1; j>=1; j--) r[i][j] = (j <= m) * (a[i][j] == '0') * (r[i][j+1] + 1);\nfor (int i=n+1; i>=1; i--) for (int j=1; j<=n; j++) d[i][j] = (i <= n) * (a[i][j] == '0') * (d[i+1][j] + 1);\nfor (int i=1; i<=n; i++) for (int j=1; j<=m; j++) dp[i][j] = (a[i][j] == '0') * (dp[i-1][j] + max(r[i][j] - 1, 0ll)) % 998244353;\nfor (int i=3; i<=n; i++) for (int j=1; j<=m; j++) (summc += (a[i-1][j] == '0') * max(r[i][j] - 1, 0ll) * dp[i-2][j] % 998244353) %= 998244353;\nfor (int i=3; i<=n; i++) for (int j=1; j<=m; j++) (summf += (a[i-1][j] == '0') * max(r[i][j] - 1, 0ll) * dp[i-2][j] % 998244353 * max(d[i][j] - 1, 0ll) % 998244353) %= 998244353;\ncout << summc << ' ' << summf << endl;\n}\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpvehlgybq/189fcee0-0fe9-424d-8dc5-197c24c530f7.cpp:6:12: error: ‘cin’ does not name a type\n    6 | int t, id; cin >> t >> id; while (t--) {\n      |            ^~~\n/tmp/tmpvehlgybq/189fcee0-0fe9-424d-8dc5-197c24c530f7.cpp:6:28: error: expected unqualified-id before ‘while’\n    6 | int t, id; cin >> t >> id; while (t--) {\n      |                            ^~~~~\n/tmp/tmpvehlgybq/189fcee0-0fe9-424d-8dc5-197c24c530f7.cpp:16:1: error: expected declaration before ‘}’ token\n   16 | }\n      | ^\n"
        ],
        "tcb_id": "种花"
    },
    {
        "code_id": 7,
        "code": "#include<bits/stdc++.h>\r\nusing namespace std;\r\nconst int N=1e6+10;\r\nstruct node{int to,nxt,w;}a[N<<1];\r\nint fir[N],cnt,n,m,use[N],vis[N],d[N];\r\nlong long ans;\r\nvoid add(int fr,int to,int w)\r\n{\r\n\ta[++cnt].to=to;a[cnt].w=w;\r\n\ta[cnt].nxt=fir[fr];fir[fr]=cnt;\r\n}\r\nqueue<int>q;\r\nbool spfa()\r\n{\r\n\twhile(!q.empty())\r\n\t{\r\n\t\tint u=q.front();q.pop();vis[u]=0;\r\n\t\tfor(int i=fir[u];i;i=a[i].nxt)\r\n\t\t{\r\n\t\t\tint to=a[i].to,w=a[i].w;\r\n\t\t\tif(d[to]<d[u]+w)\r\n\t\t\t{\r\n\t\t\t\td[to]=d[u]+w;\r\n\t\t\t\tuse[to]++;\r\n\t\t\t\tif(use[to]>=n-1)return 0;\r\n\t\t\t\tif(!vis[to])vis[to]=1,q.push(to);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\treturn 1;\r\n}\r\nint main()\r\n    scanf(\"%d%d\",&n,&m);\r\n    for(int i=1;i<=m;i++)\r\n    {\r\n    \tint x,y,z;\r\n    \tscanf(\"%d%d%d\",&x,&y,&z);\r\n    \tif(x==1)add(y,z,0),add(z,y,0);\r\n    \tif(x==2)add(y,z,1);\r\n    \tif(x==3)add(z,y,0);\r\n    \tif(x==4)add(z,y,1);\r\n    \tif(x==5)add(y,z,0);\r\n    \tif(x%2==0&&y==z){puts(\"-1\");return 0; }\r\n    }\r\n\tfor(int i=1;i<=n;i++){d[i]=1,vis[i]=1,use[i]=1;q.push(i);}\r\n\tif(!spfa()){puts(\"-1\");return 0; }\r\n\tfor(int i=1;i<=n;i++)\r\n\t if(d[i])ans+=d[i];\r\n\tcout<<ans<<endl;\r\n    return 0;\r\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpgw7bju96/4740725d-24d3-408d-9cbb-b005b983ea47.cpp:33:5: error: expected initializer before ‘scanf’\n   33 |     scanf(\"%d%d\",&n,&m);\n      |     ^~~~~\n/tmp/tmpgw7bju96/4740725d-24d3-408d-9cbb-b005b983ea47.cpp:34:5: error: expected unqualified-id before ‘for’\n   34 |     for(int i=1;i<=m;i++)\n      |     ^~~\n/tmp/tmpgw7bju96/4740725d-24d3-408d-9cbb-b005b983ea47.cpp:34:17: error: ‘i’ does not name a type\n   34 |     for(int i=1;i<=m;i++)\n      |                 ^\n/tmp/tmpgw7bju96/4740725d-24d3-408d-9cbb-b005b983ea47.cpp:34:22: error: ‘i’ does not name a type\n   34 |     for(int i=1;i<=m;i++)\n      |                      ^\n/tmp/tmpgw7bju96/4740725d-24d3-408d-9cbb-b005b983ea47.cpp:45:9: error: expected unqualified-id before ‘for’\n   45 |         for(int i=1;i<=n;i++){d[i]=1,vis[i]=1,use[i]=1;q.push(i);}\n      |         ^~~\n/tmp/tmpgw7bju96/4740725d-24d3-408d-9cbb-b005b983ea47.cpp:45:21: error: ‘i’ does not name a type\n   45 |         for(int i=1;i<=n;i++){d[i]=1,vis[i]=1,use[i]=1;q.push(i);}\n      |                     ^\n/tmp/tmpgw7bju96/4740725d-24d3-408d-9cbb-b005b983ea47.cpp:45:26: error: ‘i’ does not name a type\n   45 |         for(int i=1;i<=n;i++){d[i]=1,vis[i]=1,use[i]=1;q.push(i);}\n      |                          ^\n/tmp/tmpgw7bju96/4740725d-24d3-408d-9cbb-b005b983ea47.cpp:46:9: error: expected unqualified-id before ‘if’\n   46 |         if(!spfa()){puts(\"-1\");return 0; }\n      |         ^~\n/tmp/tmpgw7bju96/4740725d-24d3-408d-9cbb-b005b983ea47.cpp:47:9: error: expected unqualified-id before ‘for’\n   47 |         for(int i=1;i<=n;i++)\n      |         ^~~\n/tmp/tmpgw7bju96/4740725d-24d3-408d-9cbb-b005b983ea47.cpp:47:21: error: ‘i’ does not name a type\n   47 |         for(int i=1;i<=n;i++)\n      |                     ^\n/tmp/tmpgw7bju96/4740725d-24d3-408d-9cbb-b005b983ea47.cpp:47:26: error: ‘i’ does not name a type\n   47 |         for(int i=1;i<=n;i++)\n      |                          ^\n/tmp/tmpgw7bju96/4740725d-24d3-408d-9cbb-b005b983ea47.cpp:49:9: error: ‘cout’ does not name a type\n   49 |         cout<<ans<<endl;\n      |         ^~~~\n/tmp/tmpgw7bju96/4740725d-24d3-408d-9cbb-b005b983ea47.cpp:50:5: error: expected unqualified-id before ‘return’\n   50 |     return 0;\n      |     ^~~~~~\n/tmp/tmpgw7bju96/4740725d-24d3-408d-9cbb-b005b983ea47.cpp:51:1: error: expected declaration before ‘}’ token\n   51 | }\n      | ^\n"
        ],
        "tcb_id": "糖果"
    },
    {
        "code_id": 3,
        "code": "#ifndef _MENCI_AVL_TREE_H\r\n#define _MENCI_AVL_TREE_H\r\n\r\n#include <stdbool.h>\r\n#include <stddef.h>\r\n\r\ntypedef int (*compare_function_t)(void *, void *);\r\ntypedef void (*destruct_function_t)(void *);\r\ntypedef struct _avl_node_t *avl_node_t;\r\ntypedef struct _avl_tree_t *avl_tree_t;\r\n\r\navl_tree_t avl_create(compare_function_t compare_function, destruct_function_t destruct_function);\r\nvoid avl_destroy(avl_tree_t tree);\r\nsize_t avl_size(avl_tree_t tree);\r\navl_node_t avl_insert(avl_tree_t tree, void *data);\r\nvoid *avl_get_data(avl_node_t node);\r\navl_node_t avl_find(avl_tree_t tree, void *data);\r\navl_node_t avl_find_by_order(avl_tree_t tree, int order);\r\nint avl_get_order(avl_tree_t tree, void *data);\r\nint avl_get_order_of_node(avl_node_t node);\r\nvoid avl_delete_node(avl_node_t node);\r\nbool avl_delete_data(avl_tree_t tree, void *data);\r\n\r\navl_node_t avl_lower_bound(avl_tree_t tree, void *data);\r\navl_node_t avl_upper_bound(avl_tree_t tree, void *data);\r\navl_node_t avl_node_predecessor(avl_node_t node);\r\navl_node_t avl_node_successor(avl_node_t node);\r\n\r\n#endif // _MENCI_AVL_TREE_H\r\n#ifndef _MENCI_AVL_TREE_INTERNEL_H\r\n#define _MENCI_AVL_TREE_INTERNEL_H\r\n\r\n// #include \"avl-tree.h\"\r\n\r\nstruct _avl_node_t {\r\n    struct _avl_node_t *left_child;\r\n    struct _avl_node_t *right_child;\r\n    struct _avl_node_t *parent;\r\n\r\n    // The data field.\r\n    void *data;\r\n\r\n    // The height of the subtree with this node as its root.\r\n    int height;\r\n\r\n    // The count of nodes in this subtree.\r\n    size_t size;\r\n\r\n    // The reference to its tree, to replace the root node when rotated to root.\r\n    struct _avl_tree_t *tree;\r\n};\r\n\r\nstruct _avl_tree_t {\r\n    // The root node of the tree.\r\n    avl_node_t root;\r\n\r\n    // The compare function, to determine the order of nodes' data.\r\n    compare_function_t compare_function;\r\n\r\n    // The destruct function, to destruct and free nodes' data.\r\n    destruct_function_t destruct_function;\r\n};\r\n\r\ntypedef enum {\r\n    LEFT = 0, RIGHT = 1\r\n} _avl_which_child_t;\r\n\r\n// Validate and print a subtree, for debugging.\r\nvoid _avl_debug(avl_node_t node, bool print, int depth);\r\n\r\n// Compare two data or node's data, compare by unsigned long if\r\n// compare_function is NULL or call the compare_function if non-NULL.\r\nint _avl_compare_data(compare_function_t compare_function, void *a, void *b);\r\nint _avl_compare_node(avl_node_t a, avl_node_t b);\r\n\r\n// Destroy a node or a subtree.\r\nvoid _avl_destroy_node(avl_node_t node);\r\nvoid _avl_destroy_subtree(avl_node_t node);\r\n\r\n// Recalculate a node's height and size after rotating, rebalancing, insertion\r\n// or deletion.\r\nvoid _avl_recalculate(avl_node_t node);\r\n\r\n// Rotate a node up, to take its parent's place.\r\n// e.g. Left rotate will let one's right-child take its place of subtree root.\r\nvoid _avl_rotate(avl_node_t node);\r\n\r\n// Do a rebalance on a subtree's root level, used when abs(balance factor) = 2.\r\nvoid _avl_rebalance(avl_node_t subtree_root, avl_node_t new_node);\r\n\r\n// Insert a node to a node's subtree.\r\nvoid _avl_insert_node(avl_node_t *subtree_root,\r\n                      avl_node_t parent,\r\n                      avl_node_t new_node);\r\n\r\ntypedef enum {\r\n    // Doing a lower_bound binary search means skip all nodes less than specfied data.\r\n    // So skip all nodes that compare(node->data, data) <= -1.\r\n    // For the same reason, doing a upper_bound binary search skips all nodes that\r\n    // compare() <= 0.\r\n    // So skip nodes that compare() <= search_type will do the magic.\r\n    LOWER_BOUND = -1,\r\n    UPPER_BOUND = 0\r\n} _avl_search_type_t;\r\n\r\n// Binary Search a data, return found node according to search_type.\r\navl_node_t _avl_binary_search(avl_node_t root,\r\n                              void *data,\r\n                              _avl_search_type_t search_type);\r\n\r\n// Get a node's in-order predecessor or successor.\r\n// direction = LEFT means predecessor, RIGHT means successor.\r\navl_node_t _avl_neighbour(avl_node_t node, _avl_which_child_t direction);\r\n\r\n// Swap two node's position.\r\nvoid _avl_swap(avl_node_t a, avl_node_t b);\r\n\r\n// Delete a node, while maintaining the balance.\r\nvoid _avl_delete_rebalance(avl_node_t node);\r\nvoid _avl_delete(avl_node_t node);\r\n\r\nint _avl_get_order(avl_node_t node);\r\n\r\n#endif // _MENCI_AVL_TREE_INTERNEL_H\r\n// #include \"avl-tree-internel.h\"\r\n\r\n#include <assert.h>\r\n#include <stdlib.h>\r\n#include <stdio.h>\r\n\r\n#define _avl_which_child(node) \\\r\n    ((node) == (node)->parent->left_child ? LEFT : RIGHT)\r\n#define _avl_get_child(node, which) \\\r\n    (*((which) == LEFT ? (&(node)->left_child) : (&(node)->right_child)))\r\n#define _avl_subtree_height(node) ((node) ? ((node)->height) : 0)\r\n\r\nvoid _avl_debug(avl_node_t node, bool print, int depth) {\r\n    if (!node) return;\r\n\r\n    if (print && !depth) puts(\"-------------------\");\r\n\r\n    int right_height = 0;\r\n    size_t right_size = 0;\r\n    if (node->right_child) {\r\n        assert(node->right_child->parent == node);\r\n        _avl_debug(node->right_child, print, depth + 1);\r\n        right_height = node->right_child->height;\r\n        right_size = node->right_child->size;\r\n    }\r\n\r\n    if (print) {\r\n        for (int i = 0; i < depth; i++) fputs(\"   \", stdout);\r\n        printf(\"%lu\\n\", (unsigned long)node->data);\r\n    }\r\n\r\n    int left_height = 0;\r\n    size_t left_size = 0;\r\n    if (node->left_child) {\r\n        assert(node->left_child->parent == node);\r\n        _avl_debug(node->left_child, print, depth + 1);\r\n        left_height = node->left_child->height;\r\n        left_size = node->left_child->size;\r\n    }\r\n\r\n\r\n    if (print && !depth) puts(\"-------------------\");\r\n\r\n    int max = left_height < right_height ? right_height : left_height;\r\n    assert(node->height == max + 1);\r\n    assert(node->size == left_size + right_size + 1);\r\n    assert(abs(left_height - right_height) < 2);\r\n}\r\n\r\nint _avl_compare_data(compare_function_t compare_function, void *a, void *b) {\r\n    if (a == b) return 0;\r\n    if (compare_function) {\r\n        return compare_function(a, b);\r\n    }\r\n\r\n    return (unsigned long)a < (unsigned long)b ? -1 : 1;\r\n}\r\n\r\nint _avl_compare_node(avl_node_t a, avl_node_t b) {\r\n    assert(a && b && a->tree == b->tree);\r\n    if (a == b) return 0;\r\n    return _avl_compare_data(a->tree->compare_function, a->data, b->data);\r\n}\r\n\r\nvoid _avl_destroy_node(avl_node_t node) {\r\n    if (node->tree->destruct_function) {\r\n        node->tree->destruct_function(node->data);\r\n    }\r\n\r\n    free(node);\r\n}\r\n\r\nvoid _avl_destroy_subtree(avl_node_t node) {\r\n    if (node->left_child) _avl_destroy_subtree(node->left_child);\r\n    if (node->right_child) _avl_destroy_subtree(node->right_child);\r\n    _avl_destroy_node(node);\r\n}\r\n\r\nvoid _avl_recalculate(avl_node_t node) {\r\n    assert(node);\r\n\r\n    int max_height = 0;\r\n    node->size = 1;\r\n\r\n    if (node->left_child) {\r\n        if (node->left_child->height > max_height)\r\n            max_height = node->left_child->height;\r\n        node->size += node->left_child->size;\r\n    }\r\n    if (node->right_child) {\r\n        if (node->right_child->height > max_height)\r\n            max_height = node->right_child->height;\r\n        node->size += node->right_child->size;\r\n    }\r\n    \r\n    node->height = max_height + 1;\r\n}\r\n\r\nvoid _avl_rotate(avl_node_t node) {\r\n    assert(node && node->parent);\r\n\r\n    avl_node_t old_parent = node->parent;\r\n\r\n    _avl_which_child_t which = _avl_which_child(node), another = !which;\r\n\r\n    // Connect self to old parent's parent.\r\n    node->parent = old_parent->parent;\r\n    if (old_parent->parent)\r\n        _avl_get_child(old_parent->parent, _avl_which_child(old_parent)) = node;\r\n    \r\n    // Connect self's another child to old parent\r\n    if (_avl_get_child(node, another)) {\r\n        _avl_get_child(node, another)->parent = old_parent;\r\n    }\r\n    _avl_get_child(old_parent, which) = _avl_get_child(node, another);\r\n\r\n    // Connect old parent to self\r\n    old_parent->parent = node;\r\n    _avl_get_child(node, another) = old_parent;\r\n\r\n    // Notice that the ancestors of old_parent's height are NOT recalculated.\r\n    _avl_recalculate(old_parent);\r\n    _avl_recalculate(node);\r\n\r\n    // Check if rotated to root.\r\n    if (!node->parent) {\r\n        node->tree->root = node;\r\n    }\r\n}\r\n\r\nvoid _avl_insert_node(avl_node_t *subtree_root,\r\n                      avl_node_t parent,\r\n                      avl_node_t new_node) {\r\n    if (!*subtree_root) {\r\n        new_node->parent = parent;\r\n        *subtree_root = new_node;\r\n        return;\r\n    }\r\n\r\n    avl_node_t current = *subtree_root;\r\n\r\n    if (_avl_compare_node(new_node, current) <= 0) {\r\n        // new data <= current node's data\r\n        _avl_insert_node(&current->left_child, current, new_node);\r\n\r\n        // Check balance.\r\n        if (_avl_subtree_height(current->left_child) - \r\n            _avl_subtree_height(current->right_child) == 2) {\r\n            // The balance has been broken, rebalance it.\r\n            // Check which child of left-child it's inserted to.\r\n            if (_avl_compare_node(new_node, current->left_child) <= 0) {\r\n                // The Left-Left case.\r\n                _avl_rotate(current->left_child);\r\n            } else {\r\n                // The Left-Right case.\r\n                _avl_rotate(current->left_child->right_child);\r\n                _avl_rotate(current->left_child);\r\n            }\r\n        }\r\n    } else {\r\n        // new data > current node's data\r\n        _avl_insert_node(&current->right_child, current, new_node);\r\n\r\n        // Check balance.\r\n        if (_avl_subtree_height(current->right_child) - \r\n            _avl_subtree_height(current->left_child) == 2) {\r\n            // The balance has been broken, rebalance it.\r\n            // Check which child of right-child it's inserted to.\r\n            if (_avl_compare_node(new_node, current->right_child) <= 0) {\r\n                // The Right-Left case.\r\n                _avl_rotate(current->right_child->left_child);\r\n                _avl_rotate(current->right_child);\r\n            } else {\r\n                // The Right-Right case.\r\n                _avl_rotate(current->right_child);\r\n            }\r\n        }\r\n    }\r\n\r\n    _avl_recalculate(*subtree_root);\r\n}\r\n\r\navl_node_t _avl_binary_search(avl_node_t root,\r\n                              void *data,\r\n                              _avl_search_type_t search_type) {\r\n    if (!root) return NULL;\r\n\r\n    int compare_result = _avl_compare_data(root->tree->compare_function,\r\n                                           root->data,\r\n                                           data);\r\n\r\n    // Since we should find the first satisfied node, search in the left\r\n    // subtree if satisfied.\r\n    bool satisfied = compare_result > search_type;\r\n    if (satisfied) {\r\n        avl_node_t left_subtree_result = _avl_binary_search(root->left_child,\r\n                                                            data,\r\n                                                            search_type);\r\n        // If a more left satisfied node was found, return it.\r\n        if (left_subtree_result) return left_subtree_result;\r\n        else return root;\r\n    } else {\r\n        return _avl_binary_search(root->right_child,\r\n                                  data,\r\n                                  search_type);\r\n    }\r\n}\r\n\r\navl_node_t _avl_neighbour(avl_node_t node, _avl_which_child_t direction) {\r\n    assert(node);\r\n\r\n    // Imagine a traversal on the tree. We are on the node now and willing to\r\n    // move to the in-order (or reversed in-order) next node.\r\n    // e.g. find one's successor, with direction = RIGHT.\r\n    if (_avl_get_child(node, direction)) {\r\n        // If RIGHT subtree, find in the subtree.\r\n        // Find the LEFT-most descendant of node's RIGHT subtree.\r\n        node = _avl_get_child(node, direction);\r\n        while (_avl_get_child(node, !direction)) {\r\n            node = _avl_get_child(node, !direction);\r\n        }\r\n        return node;\r\n    } else {\r\n        // The RIGHT subtree doesn't exist, backtraces will occur.\r\n        if (!node->parent) {\r\n            // Backtrace reaches root. No successor found!\r\n            return NULL;\r\n        }\r\n\r\n        while (_avl_which_child(node) == direction) {\r\n            // If node is its parent's RIGHT child, after backtracing to parent,\r\n            // another backtrace will occur to parent's parent.\r\n            if (!node->parent->parent) {\r\n                // Backtrace reaches root. No successor found!\r\n                return NULL;\r\n            }\r\n\r\n            node = node->parent;\r\n        }\r\n\r\n        // If node is its parent's LEFT child, the next to be printed in the\r\n        // traversal is just its parent!\r\n        return node->parent;\r\n    }\r\n}\r\n\r\nvoid _avl_swap(avl_node_t a, avl_node_t b) {\r\n    assert(a && b);\r\n\r\n#define _avl_reconnect(parent_node, child, which) {              \\\r\n        if (parent_node) {                                       \\\r\n            _avl_get_child((parent_node), (which)) = (child);    \\\r\n        } else {                                                 \\\r\n            assert(child);                                       \\\r\n            (child)->tree->root = (child);                       \\\r\n        }                                                        \\\r\n        if (child) (child)->parent = (parent_node);              \\\r\n    }\r\n\r\n    // If one is another's parent, assume a is b's parent.\r\n    if (a->parent == b) {\r\n        _avl_swap(b, a);\r\n    }\r\n\r\n    _avl_which_child_t which_a = a->parent ? _avl_which_child(a) : LEFT,\r\n                       which_b = b->parent ? _avl_which_child(b) : LEFT;\r\n\r\n    if (a == b->parent) {\r\n        // If a is b's parent.\r\n        avl_node_t c1 = _avl_get_child(b, which_b),\r\n                   c2 = _avl_get_child(b, !which_b),\r\n                   c3 = _avl_get_child(a, !which_b);\r\n        \r\n        _avl_reconnect(a->parent, b, which_a);\r\n\r\n        _avl_reconnect(a, c1, which_b);\r\n        _avl_reconnect(a, c2, !which_b);\r\n\r\n        _avl_reconnect(b, a, which_b);\r\n        _avl_reconnect(b, c3, !which_b);\r\n    } else {\r\n        avl_node_t a_l = a->left_child, a_r = a->right_child,\r\n                   b_l = b->left_child, b_r = b->right_child;\r\n\r\n        avl_node_t a_p = a->parent, b_p = b->parent;\r\n        _avl_reconnect(a_p, b, which_a);\r\n        _avl_reconnect(b_p, a, which_b);\r\n\r\n        _avl_reconnect(a, b_l, LEFT);\r\n        _avl_reconnect(a, b_r, RIGHT);\r\n\r\n        _avl_reconnect(b, a_l, LEFT);\r\n        _avl_reconnect(b, a_r, RIGHT);\r\n    }\r\n\r\n#undef _avl_reconnect\r\n}\r\n\r\nvoid _avl_delete_rebalance(avl_node_t node) {\r\n    if (!node) return;\r\n\r\n    if (_avl_subtree_height(node->left_child) - \r\n        _avl_subtree_height(node->right_child) == 2) {\r\n        // L - R = 2\r\n\r\n        if (_avl_subtree_height(node->left_child->left_child) >=\r\n            _avl_subtree_height(node->left_child->right_child)) {\r\n            // The Left-Left case.\r\n            _avl_rotate(node->left_child);\r\n        } else {\r\n            // The Left-Right case.\r\n            _avl_rotate(node->left_child->right_child);\r\n            _avl_rotate(node->left_child);\r\n        }\r\n    } else if (_avl_subtree_height(node->right_child) - \r\n               _avl_subtree_height(node->left_child) == 2) {\r\n        // R - L = 2\r\n\r\n        if (_avl_subtree_height(node->right_child->left_child) <=\r\n            _avl_subtree_height(node->right_child->right_child)) {\r\n            // The Right-Right case.\r\n            _avl_rotate(node->right_child);\r\n        } else {\r\n            // The Right-Left case.\r\n            _avl_rotate(node->right_child->left_child);\r\n            _avl_rotate(node->right_child);\r\n        }\r\n    }\r\n\r\n    _avl_recalculate(node);\r\n    _avl_delete_rebalance(node->parent);\r\n}\r\n\r\nvoid _avl_delete(avl_node_t node) {\r\n    assert(node);\r\n\r\n    while (node->left_child || node->right_child) {\r\n        // Both children exist.\r\n        // In this case its in-order predecessor or successor must be its descendant.\r\n        // Find it's in-order predecessor or successor to take its place.\r\n        avl_node_t neighbour = _avl_neighbour(node, node->left_child ? LEFT : RIGHT);\r\n\r\n        // Swap the node and its neighbour.\r\n        _avl_swap(node, neighbour);\r\n    }\r\n\r\n    // Now the node has no child, delete it.\r\n    if (!node->parent) {\r\n        node->tree->root = NULL;\r\n    } else {\r\n        _avl_get_child(node->parent, _avl_which_child(node)) = NULL;\r\n    }\r\n\r\n    // Since deleting a node breaks the balance, rebalance it.\r\n    _avl_delete_rebalance(node->parent);\r\n\r\n    _avl_destroy_node(node);\r\n}\r\n\r\nint _avl_get_order(avl_node_t node) {\r\n    assert(node);\r\n    \r\n    int count = node->left_child ? node->left_child->size : 0;\r\n    while (node->parent) {\r\n        if (_avl_which_child(node) == RIGHT) {\r\n            // If node is a RIGHT child, the parent and parent's LEFT subtree\r\n            // is lesser than node, so add them to the count.\r\n            if (node->parent->left_child) {\r\n                count += node->parent->left_child->size;\r\n            }\r\n            count++;\r\n        }\r\n\r\n        node = node->parent;\r\n    }\r\n\r\n    return count + 1;\r\n}\r\n// #include \"avl-tree.h\"\r\n\r\n#include <stdlib.h>\r\n#include <assert.h>\r\n\r\n// #include \"avl-tree-internel.h\"\r\n\r\navl_tree_t avl_create(compare_function_t compare_function, destruct_function_t destruct_function) {\r\n    avl_tree_t tree = malloc(sizeof(struct _avl_tree_t));\r\n    tree->root = NULL;\r\n    tree->compare_function = compare_function;\r\n    tree->destruct_function = destruct_function;\r\n    return tree;\r\n}\r\n\r\nvoid avl_destroy(avl_tree_t tree) {\r\n    assert(tree);\r\n    \r\n    if (tree->root) _avl_destroy_subtree(tree->root);\r\n    free(tree);\r\n}\r\n\r\nsize_t avl_size(avl_tree_t tree) {\r\n    assert(tree);\r\n    return tree->root ? tree->root->size : 0;\r\n}\r\n\r\navl_node_t avl_insert(avl_tree_t tree, void *data) {\r\n    assert(tree);\r\n\r\n    avl_node_t new_node = malloc(sizeof(struct _avl_node_t));\r\n    new_node->left_child = new_node->right_child = new_node->parent = NULL;\r\n    new_node->data = data;\r\n    new_node->height = 1;\r\n    new_node->size = 1;\r\n    new_node->tree = tree;\r\n    \r\n    _avl_insert_node(&tree->root, NULL, new_node);\r\n\r\n    return new_node;\r\n}\r\n\r\nvoid *avl_get_data(avl_node_t node) {\r\n    return node->data;\r\n}\r\n\r\navl_node_t avl_find(avl_tree_t tree, void *data) {\r\n    assert(tree);\r\n\r\n    if (!tree->root) return NULL;\r\n\r\n    avl_node_t node = avl_lower_bound(tree, data);\r\n    if (node && node->data == data) return node;\r\n\r\n    return NULL;\r\n}\r\n\r\navl_node_t avl_find_by_order(avl_tree_t tree, int order) {\r\n    assert(tree);\r\n    \r\n    avl_node_t node = tree->root;\r\n\r\n    // How many nodes should be skipped from the leftist of node's subtree.\r\n    int count = order - 1;\r\n    while (1) {\r\n        if (!node) {\r\n            // Not found - order isn't in [1, tree->root->size].\r\n            return NULL;\r\n        }\r\n\r\n        int left_count = node->left_child ? node->left_child->size : 0;\r\n        if (count < left_count) {\r\n            // Skip part of the left subtree, not the whole left subtree.\r\n            // So the node to find must be in the left subtree.\r\n            node = node->left_child;\r\n        } else if (count > left_count) {\r\n            // The whole left subtree should be skipped, and node itself should\r\n            // be skipped, too.\r\n            // So skip them and find the node in the right subtree.\r\n            count -= left_count + 1;\r\n            node = node->right_child;\r\n        } else {\r\n            // The node to skip is exactly the whole left subtree.\r\n            // So current node is what we're finding.\r\n            return node;\r\n        }\r\n    }\r\n}\r\n\r\nint avl_get_order(avl_tree_t tree, void *data) {\r\n    assert(tree);\r\n\r\n    avl_node_t node = avl_find(tree, data);\r\n    if (!node) return -1;\r\n    return avl_get_order_of_node(node);\r\n}\r\n\r\nint avl_get_order_of_node(avl_node_t node) {\r\n    assert(node);\r\n\r\n    return _avl_get_order(node);\r\n}\r\n\r\nvoid avl_delete_node(avl_node_t node) {\r\n    assert(node);\r\n\r\n    _avl_delete(node);\r\n}\r\n\r\nbool avl_delete_data(avl_tree_t tree, void *data) {\r\n    assert(tree);\r\n\r\n    avl_node_t node = avl_find(tree, data);\r\n    if (!node) return false;\r\n\r\n    avl_delete_node(node);\r\n    return true;\r\n}\r\n\r\navl_node_t avl_lower_bound(avl_tree_t tree, void *data) {\r\n    assert(tree);\r\n    return _avl_binary_search(tree->root, data, LOWER_BOUND);\r\n}\r\n\r\navl_node_t avl_upper_bound(avl_tree_t tree, void *data) {\r\n    assert(tree);\r\n    return _avl_binary_search(tree->root, data, UPPER_BOUND);\r\n}\r\n\r\navl_node_t avl_node_predecessor(avl_node_t node) {\r\n    assert(node);\r\n    return _avl_neighbour(node, LEFT);\r\n}\r\n\r\navl_node_t avl_node_successor(avl_node_t node) {\r\n    assert(node);\r\n    return _avl_neighbour(node, RIGHT);\r\n}\r\n// #include \"avl-tree.h\"\r\n\r\n#include <stdio.h>\r\n#include <assert.h>\r\n\r\n#define data_type_from_int(x) ((void *)(long)(x))\r\n#define data_type_to_int(x)   ((int)(long)(x))\r\n\r\nint compare(void *a, void *b) {\r\n    return data_type_to_int(a) - data_type_to_int(b);\r\n}\r\n\r\nint main() {\r\n    avl_tree_t tree = avl_create(&compare, NULL);\r\n\r\n    int n;\r\n    assert(scanf(\"%d\", &n) == 1);\r\n    assert(n >= 1 && n <= (int)3e5);\r\n\r\n    for (int i = 0; i < n; i++) {\r\n        int option, x;\r\n        assert(scanf(\"%d %d\", &option, &x) == 2);\r\n        assert(option >= 0 && option <= 5);\r\n\r\n        if (option == 0) {\r\n            avl_insert(tree, data_type_from_int(x));\r\n        } else if (option == 1) {\r\n            avl_delete_data(tree, data_type_from_int(x));\r\n        } else if (option == 2) {\r\n            avl_node_t node = avl_find_by_order(tree, x);\r\n            assert(node);\r\n            printf(\"%d\\n\", data_type_to_int(avl_get_data(node)));\r\n        } else if (option == 3) {\r\n            avl_node_t node = avl_lower_bound(tree, data_type_from_int(x));\r\n            int answer;\r\n            if (node) {\r\n                answer = avl_get_order_of_node(node) - 1;\r\n            } else {\r\n                answer = avl_size(tree);\r\n            }\r\n            printf(\"%d\\n\", answer);\r\n        } else if (option == 4) {\r\n            avl_node_t node = avl_lower_bound(tree, data_type_from_int(x)),\r\n                       predecessor = node ? avl_node_predecessor(node) : NULL;\r\n            if (predecessor) {\r\n                printf(\"%d\\n\", data_type_to_int(avl_get_data(predecessor)));\r\n            } else {\r\n                puts(\"-1\");\r\n            }\r\n        } else if (option == 5) {\r\n            avl_node_t successor = avl_upper_bound(tree, data_type_from_int(x));\r\n            if (successor) {\r\n                printf(\"%d\\n\", data_type_to_int(avl_get_data(successor)));\r\n            } else {\r\n                puts(\"-1\");\r\n            }\r\n        }\r\n    }\r\n}\r\n",
        "status": [
            "CE"
        ],
        "details": [
            "cc1plus: warning: command-line option ‘-std=c99’ is valid for C/ObjC but not for C++\n/tmp/tmpdy436_vq/3a6d0ed5-9159-4f8a-8968-25c731f208b8.cpp: In function ‘void _avl_rotate(avl_node_t)’:\n/tmp/tmpdy436_vq/3a6d0ed5-9159-4f8a-8968-25c731f208b8.cpp:228:66: error: cannot convert ‘bool’ to ‘_avl_which_child_t’ in initialization\n  228 |     _avl_which_child_t which = _avl_which_child(node), another = !which;\n      |                                                                  ^~~~~~\n      |                                                                  |\n      |                                                                  bool\n/tmp/tmpdy436_vq/3a6d0ed5-9159-4f8a-8968-25c731f208b8.cpp: In function ‘_avl_tree_t* avl_create(compare_function_t, destruct_function_t)’:\n/tmp/tmpdy436_vq/3a6d0ed5-9159-4f8a-8968-25c731f208b8.cpp:511:29: error: invalid conversion from ‘void*’ to ‘avl_tree_t’ {aka ‘_avl_tree_t*’} [-fpermissive]\n  511 |     avl_tree_t tree = malloc(sizeof(struct _avl_tree_t));\n      |                       ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~\n      |                             |\n      |                             void*\n/tmp/tmpdy436_vq/3a6d0ed5-9159-4f8a-8968-25c731f208b8.cpp: In function ‘_avl_node_t* avl_insert(avl_tree_t, void*)’:\n/tmp/tmpdy436_vq/3a6d0ed5-9159-4f8a-8968-25c731f208b8.cpp:533:33: error: invalid conversion from ‘void*’ to ‘avl_node_t’ {aka ‘_avl_node_t*’} [-fpermissive]\n  533 |     avl_node_t new_node = malloc(sizeof(struct _avl_node_t));\n      |                           ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~\n      |                                 |\n      |                                 void*\n"
        ],
        "tcb_id": "维护全序集"
    },
    {
        "code_id": 3,
        "code": "#include<bits/stdc++.h>\n#include<sys/mman.h>\n#include<fcntl.h>\nusing namespace std;\nusing llt=long long;\nusing llf=long double;\nusing ull=unsigned long long;\n#define Ct const\n#define For(i,a,b,c) for(int i=(a);i<=(b);i+=(c))\n#define For_(i,a,b,c) for(int i=(a);i>=(b);i-=(c))\n#define For_it(i,a,b) for(auto i=(a);i!=(b);++i)\n\nnamespace IO{\n#ifdef ONLINE_JUDGE\n\tint Fin=fileno(stdin);\n#elif defined(UN_FAST)\n#else\n#endif // file\n#ifdef UN_FAST\n\tchar cc;\n\t#define G cc=getchar()\n\t#define C cc\n#else\n\tconst char *I=(char*)mmap(0,1<<30,1,2,Fin,0)-1;\n\t#define G (++I)\n\t#define C (*I)\n#endif // fast (mmap)\n\ttemplate<class T> void read(T &x){x=0;bool f=0; do G,f|=C=='-';while(C<48); while(C>47)x=x*10+(C&15),G; if(f)x=-x;}\n\tvoid read(char& c){do G;while(C<33); c=C;} void read(char* s){int pos=0; do G;while(C<33); while(C>32) s[pos++]=C,G;}\n\tvoid read(string& s){s.clear(); do G;while(C<33); while(C>32) s.push_back(C),G;}\n\ttemplate<class T=int> T read(){T a; read(a); return a;}\n\ttemplate<class T,class... Argc> void read(T &x,Argc&... argc){read(x),read(argc...);}\n#undef G\n#undef C\n#define endl '\\n'\n}using IO::read;\n\nconstexpr int N=1e5+4,BS=N;\n\nnamespace PSTREE{\n\tconstexpr ull M=ULLONG_MAX;\n\tint ls[N<<7],rs[N<<7],nd[N<<7],tot;\n\t#define mid (l+(r-l>>1))\n\tint nnd(Ct int &pre){nd[++tot]=nd[pre],ls[tot]=ls[pre],rs[tot]=rs[pre]; return tot;}\n\tvoid pushup(Ct int &t){nd[t]=nd[ls[t]]+nd[rs[t]];}\n\tvoid add(Ct ull &p,Ct ull &l,Ct ull &r,Ct int &pre,int &t){\n\t\tt=nnd(pre);\n\t\tif(l==r) ++nd[t];\n\t\telse{\n\t\t\tif(p<=mid) add(p,l,mid,ls[pre],ls[t]);\n\t\t\telse add(p,mid+1,r,rs[pre],rs[t]);\n\t\t\tpushup(t);\n\t\t}\n\t}\n\tint get(Ct ull &p,Ct ull &l,Ct ull &r,Ct int &t){\n\t\tif(!t) return 0;\n\t\tif(l==r) return nd[t];\n\t\tif(p<=mid) return get(p,l,mid,ls[t]);\n\t\treturn get(p,mid+1,r,rs[t]);\n\t}\n\t#undef mid\n\tclass PStree{\n\tprivate: int rt[N];\n\tpublic:\n\t\tvoid Add(Ct int &p,Ct ull &v){add(v,0,M,rt[p-1],rt[p]);}\n\t\tint Get(Ct int &l,Ct int &r,Ct ull &v){return r<l?0:get(v,0,M,rt[r])-get(v,0,M,rt[l-1]);}\n\t};\n}using PSTREE::PStree;\nPStree tr;\n\null bpw[N];\n__attribute__((constructor)) void Hash_Init(){bpw[0]=1; For(i,1,N-3,1) bpw[i]=bpw[i-1]*BS;}\nclass HASH{\nprivate: ull hs[N];\npublic:\n\tvoid Init(Ct int &l){For(i,1,l,1) hs[i]=hs[i-1]*BS+read();}\n\tull Get(Ct int &l,Ct int &r){return hs[r]-hs[l-1]*bpw[r-l+1];}\n}hs;\null MkHs(Ct int &l){ull hs=0; For(i,1,l,1) hs=hs*BS+read(); return hs;}\n\nint n,m,k;\nint a[N];\nint main(){\n\tcout.tie(0)->sync_with_stdio(0);\n\tread(n,m,k); hs.Init(n);\n\tFor(i,1,n-k+1,1) tr.Add(i,hs.Get(i,i+k-1));\n\tFor(i,1,m,1){\n\t\tint l,r; read(l,r);\n\t\tif(tr.Get(l,r-k,MkHs(k))) puts(\"No\");\n\t\telse puts(\"Yes\");\n\t}\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpanxcbr2y/93b41621-b984-4581-9bd5-2aa25775dd96.cpp:24:47: error: ‘Fin’ was not declared in this scope; did you mean ‘sin’?\n   24 |         const char *I=(char*)mmap(0,1<<30,1,2,Fin,0)-1;\n      |                                               ^~~\n      |                                               sin\n"
        ],
        "tcb_id": "花神的嘲讽计划"
    },
    {
        "code_id": 9,
        "code": "#include<bits/stdc++.h>\n#include<sys/mman.h>\n#include<fcntl.h>\nusing namespace std;\nusing llt=long long;\nusing llf=long double;\nusing ull=unsigned long long;\n#define Ct const\n#define For(i,a,b,c) for(int i=(a);i<=(b);i+=(c))\n#define For_(i,a,b,c) for(int i=(a);i>=(b);i-=(c))\n#define For_it(i,a,b) for(auto i=(a);i!=(b);++i)\n\nnamespace IO{\n#ifdef ONLINE_JUDGE\n\tint Fin=fileno(stdin);\n#elif defined(UN_FAST)\n#else\n#endif // file\n#ifdef UN_FAST\n\tchar cc;\n\t#define G cc=getchar()\n\t#define C cc\n#else\n\tconst char *I=(char*)mmap(0,1<<30,1,2,Fin,0)-1;\n\t#define G (++I)\n\t#define C (*I)\n#endif // fast (mmap)\n\ttemplate<class T> void read(T &x){x=0;bool f=0; do G,f|=C=='-';while(C<48); while(C>47)x=x*10+(C&15),G; if(f)x=-x;}\n\tvoid read(char& c){do G;while(C<33); c=C;} void read(char* s){int pos=0; do G;while(C<33); while(C>32) s[pos++]=C,G;}\n\tvoid read(string& s){s.clear(); do G;while(C<33); while(C>32) s.push_back(C),G;}\n\ttemplate<class T=int> T read(){T a; read(a); return a;}\n\ttemplate<class T,class... Argc> void read(T &x,Argc&... argc){read(x),read(argc...);}\n#undef G\n#undef C\n#define endl '\\n'\n}using IO::read;\n\nconstexpr int N=1e5+4,BS=13;\n\nnamespace PSTREE{\n\tconstexpr ull M=ULLONG_MAX;\n\tint ls[N<<7],rs[N<<7],nd[N<<7],tot;\n\t#define mid (l+(r-l>>1))\n\tint nnd(Ct int &pre){nd[++tot]=nd[pre],ls[tot]=ls[pre],rs[tot]=rs[pre]; return tot;}\n\tvoid pushup(Ct int &t){nd[t]=nd[ls[t]]+nd[rs[t]];}\n\tvoid add(Ct ull &p,Ct ull &l,Ct ull &r,Ct int &pre,int &t){\n\t\tt=nnd(pre);\n\t\tif(l==r) ++nd[t];\n\t\telse{\n\t\t\tif(p<=mid) add(p,l,mid,ls[pre],ls[t]);\n\t\t\telse add(p,mid+1,r,rs[pre],rs[t]);\n\t\t\tpushup(t);\n\t\t}\n\t}\n\tint get(Ct ull &p,Ct ull &l,Ct ull &r,Ct int &t){\n\t\tif(!t) return 0;\n\t\tif(l==r) return nd[t];\n\t\tif(p<=mid) return get(p,l,mid,ls[t]);\n\t\treturn get(p,mid+1,r,rs[t]);\n\t}\n\t#undef mid\n\tclass PStree{\n\tprivate: int rt[N];\n\tpublic:\n\t\tvoid Add(Ct int &p,Ct ull &v){add(v,0,M,rt[p-1],rt[p]);}\n\t\tint Get(Ct int &l,Ct int &r,Ct ull &v){return r<l?0:get(v,0,M,rt[r])-get(v,0,M,rt[l-1]);}\n\t};\n}using PSTREE::PStree;\nPStree tr;\n\null bpw[N];\n__attribute__((constructor)) void Hash_Init(){bpw[0]=1; For(i,1,N-3,1) bpw[i]=bpw[i-1]*BS;}\nclass HASH{\nprivate: ull hs[N];\npublic:\n\tvoid Init(Ct int &l){For(i,1,l,1) hs[i]=hs[i-1]*BS+read();}\n\tull Get(Ct int &l,Ct int &r){return hs[r]-hs[l-1]*bpw[r-l+1];}\n}hs;\null MkHs(Ct int &l){ull hs=0; For(i,1,l,1) hs=hs*BS+read(); return hs;}\n\nint n,m,k;\nint a[N];\nint main(){\n\tcout.tie(0)->sync_with_stdio(0);\n\tread(n,m,k); hs.Init(n);\n\tFor(i,1,n-k+1,1) tr.Add(i,hs.Get(i,i+k-1));\n\tFor(i,1,m,1){\n\t\tint l,r; read(l,r);\n\t\tif(tr.Get(l,r-k+1,MkHs(k))) puts(\"No\");\n\t\telse puts(\"Yes\");\n\t}\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpzf00qtl5/16c687d9-15d7-450b-acbf-20ef19e09a95.cpp:24:47: error: ‘Fin’ was not declared in this scope; did you mean ‘sin’?\n   24 |         const char *I=(char*)mmap(0,1<<30,1,2,Fin,0)-1;\n      |                                               ^~~\n      |                                               sin\n"
        ],
        "tcb_id": "花神的嘲讽计划"
    },
    {
        "code_id": 6,
        "code": "#include <bits/stdc++.h>\r\nusing namespace std;\r\n#define il inline\r\n#define elif else if\r\n\r\n// Type\r\n#define ld double\r\n#define ll long long\r\n#define ull unsigned ll\r\n\r\n// Vector\r\n#define vc vector\r\n#define Pb push_back\r\n#define Pf push_front\r\n#define Eb emplace_back\r\n#define All(x) x.begin(),x.end()\r\n\r\n// Memory\r\n#define Ms(_data) memset(_data,0,sizeof(_data))\r\n#define Msn(_data,_num) memset(_data,_num,sizeof(_data))\r\n\r\n// Template\r\n#define _cl class\r\n#define _tp template\r\n#define _tyn typename\r\n\r\n// Pair\r\n#define Mp make_pair\r\n#define F first\r\n#define S second\r\n#define pii pair<int,int>\r\n#define pli pair<ll,int>\r\n#define pil pair<int,ll>\r\n#define pll pair<ll,ll>\r\n\r\n// Loop\r\n#define For(i,j) for( int (i) = 1 ; (i) <= (j) ; ++(i) )\r\n#define For0(i,j) for( int (i) = 0 ; (i) < (j) ; ++(i) )\r\n#define Forx(i,j,k) for( int (i) = (j) ; (i) <= (k) ; ++(i) )\r\n#define Forstep(i,j,k,st) for( int (i) = (j) ; (i) <= (k) ; (i) += (st) )\r\n#define fOR(i,j) for( int (i) = (j) ; (i) >= 1 ; --(i) )\r\n#define fOR0(i,j) for( int (i) = (j)-1 ; (i) >= 0 ; --(i) )\r\n#define fORx(i,j,k) for( int (i) = (k) ; (i) >= (j) ; --(i) )\r\n\r\n// Read\r\nstruct InputReader{\r\n\t#define bs 1000001\r\n\tchar buf[bs]; int p;\r\n\til InputReader(){ p = bs; }\r\n\til void Flush(){ p = 0; fread(buf,1,bs,stdin); }\r\n\til char C(){ if(p >= bs) Flush(); return buf[p++]; }\r\n\til char Readnum(){ char ch = C(); while( !isdigit(ch) && ch != '-' ) ch = C(); return ch; }\r\n\til void Readalpha( char &c ){ c = C(); while( !isalpha(c) ) c = C(); }\r\n\tint operator() (){\r\n\t\tint ans = 0, fu = 1; char ch = Readnum();\r\n\t\tif( ch == '-' ) fu = -1, ch = C();\r\n\t\twhile( ch >= '0' && ch <= '9' ){\r\n\t\t\tans = ans*10 + ch-'0';\r\n\t\t\tch = C();\r\n\t\t}\r\n\t\treturn ans * fu;\r\n\t}\r\n\tll Readll(){\r\n\t\tll ans = 0LL, fu = 1LL; char ch = Readnum();\r\n\t\tif( ch == '-' ) fu = -1LL, ch = C();\r\n\t\twhile( ch >= '0' && ch <= '9' ){\r\n\t\t\tans = ans*10LL + ch-'0';\r\n\t\t\tch = C();\r\n\t\t}\r\n\t\treturn ans * fu;\r\n\t}\r\n\til void Readstring( string &x ){\r\n\t\tx.clear(); char ch = C();\r\n\t\twhile( !isdigit(ch)  &&  !isalpha(ch)  &&  ch != '#'  &&  ch != '.' ) ch = C();\r\n\t\twhile( isdigit(ch)  ||  isalpha(ch)  ||  ch == '#'  ||  ch == '.' ){\r\n\t\t\tx += ch;\r\n\t\t\tch = C();\r\n\t\t}\r\n\t}\r\n\til void Readchstring( char s[] ){\r\n\t\tint len = 0; char ch = C();\r\n\t\twhile( !isdigit(ch)  &&  !isalpha(ch)  /*&&  ch != '*'  &&  ch != '?'*/ ) ch = C();\r\n\t\twhile( isdigit(ch)  ||  isalpha(ch)  /*||  ch == '*'  ||  ch == '?'*/ ){\r\n\t\t\ts[len++] = ch;\r\n\t\t\tch = C();\r\n\t\t}\r\n\t\ts[len] = '\\0';\r\n\t}\r\n\til void Specialread( char &c ){\r\n\t\tc = C();\r\n\t\twhile( !isdigit(c) && !isalpha(c) && c != '#'  &&  c != '.'  &&  c != '='  &&  c != 'B' ) c = C();\r\n\t}\r\n\t#undef bs\r\n}In;\r\nil void Read( int &x ){ x = In(); }\r\nil void Read( int &x, int &y ){ x = In(); y = In(); }\r\nil void Read( int &x1 , int &x2 , int &x3 ){ x1 = In(); x2 = In(); x3 = In(); }\r\nil void Read( int &x1 , int &x2 , int &x3 , int &x4 ){ x1 = In(); x2 = In(); x3 = In(); x4 = In(); }\r\nil void Read( ll &x ){ x = In.Readll(); }\r\nil void Read( ll &x, ll &y ){ x = In.Readll(); y = In.Readll(); }\r\nil void Read( ll &x1 , ll &x2 , ll &x3 ){ x1 = In.Readll(); x2 = In.Readll(); x3 = In.Readll(); }\r\nil void Read( ll &x1 , ll &x2 , ll &x3 , ll &x4 ){ x1 = In.Readll(); x2 = In.Readll(); x3 = In.Readll(); x4 = In.Readll(); }\r\n_tp<_tyn T> void Read( T a[] , int st , int ed ){ Forx(i,st,ed) Read(a[i]); }\r\n#define iRead(k) int k; Read(k);\r\n#define iRead2(a,b) iRead(a); iRead(b);\r\n#define iRead3(a,b,c) iRead2(a,b); iRead(c);\r\n#define iRead4(a,b,c,d) iRead2(a,b); iRead2(c,d);\r\n#define lRead(k) ll k; Read(k);\r\n#define lRead2(a,b) lRead(a); lRead(b);\r\n#define lRead3(a,b,c) lRead2(a,b); lRead(c);\r\n#define lRead4(a,b,c,d) lRead2(a,b); lRead2(c,d);\r\n\r\n// File\r\nil void FILEIO(){\r\n\t#ifdef intLSY\r\n\t\tFin(\"in.in\");\r\n\t#endif\r\n}\r\nil void FILEIO( string pname ){\r\n\t#ifndef intLSY\r\n\t\tFin((pname+\".in\").c_str());\r\n\t\tFout((pname+\".out\").c_str());\r\n\t#else\r\n\t\tFin(\"in.in\");\r\n\t#endif\r\n}\r\nil void FILEIO_OICONTEST( string pname ){\r\n\tFin((pname+\".in\").c_str());\r\n\t#ifndef intLSY\r\n\t\tFout((pname+\".out\").c_str());\r\n\t#endif\r\n}\r\nvoid Printtime(){\r\n\t#ifdef intLSY\r\n\t\tdouble _timeuse = clock()* 1000.0 / CLOCKS_PER_SEC;\r\n\t\tfprintf(stderr,\"\\n\\nTime usage:\\n%.0lf ms\\n\",_timeuse);\r\n\t#endif\r\n}\r\nvoid END(){ Printtime(); exit(0); }\r\n_tp<_tyn T>void END( T mes ){ cout << mes << endl; END(); }\r\n\r\n// Debug\r\n#define B cerr << \"BreakPoint\" << endl;\r\n#define O(x) cerr << #x << \" \" << x << endl;\r\n#define O_(x) cerr << #x << \" \" << x << \"  \";\r\n#define ERR(x) cerr << \"ERR! #\" << x << endl;\r\n#define Msz(x) cerr << \"Sizeof \" << #x << \" \" << sizeof(x)/1024/1024 << \" MB\" << endl;\r\n_tp<_tyn T>void Print( T a[] , int s , int t , char sp = ' ' , char ed = '\\n' ){\r\n\tif( s > t ) return;\r\n\tfor( int i = s ; i < t ; i++ )\r\n\t\tcout << a[i] << sp;\r\n\tcout << a[t] << ed;\r\n\tcout.flush();\r\n}\r\n_tp<_tyn T>void Print( T a , int s = 0 , int t = -1 , char sp = ' ' , char ed = '\\n' ){\r\n\tif( t == -1 ) t = a.size()-1;\r\n\tfor( int i = s ; i <= t ; i++ )\r\n\t\tcout << a[i] << sp;\r\n\tcout << ed;\r\n\tcout.flush();\r\n}\r\n\r\n// Optimize\r\n#define max(a,b) ((a)>(b)?(a):(b))\r\n#define min(a,b) ((a)<(b)?(a):(b))\r\n#define Mymax(a,b) (a) = max((a),(b))\r\n#define Mymin(a,b) (a) = min((a),(b))\r\n#define INF (0x3f3f3f3f)\r\n#define LINF ((long long)(0x3f3f3f3f3f3f3f3f))\r\n\r\n///////////////////////////////////////////////////////////////////////////////////////\r\n///////////////////////////////////////////////////////////////////////////////////////\r\n#define MAXN 131072\r\n\r\nint n,k;\r\nll w[MAXN];\r\n\r\nnamespace SameWi{\r\n\tint depcnt[MAXN];\r\n\tvoid Solve(){\r\n\t\tint leafcnt = 1;\r\n\t\tdepcnt[1] = 1;\r\n\t\tll nowmxleaf = 1;\r\n\t\tFor(i,19){\r\n\t\t\tnowmxleaf *= k;\r\n\t\t\twhile(1){\r\n\t\t\t\tif( depcnt[i]%k == 0 ){\r\n\t\t\t\t\t--depcnt[i-1];\r\n\t\t\t\t\t--leafcnt;\r\n\t\t\t\t}\r\n\t\t\t\t++depcnt[i];\r\n\t\t\t\t++leafcnt;\r\n\t\t\t\tif( leafcnt == n ) break;\r\n\t\t\t\tif( depcnt[i] == nowmxleaf ) break;\r\n\t\t\t}\r\n\t\t\tif( leafcnt == n ) break;\r\n\t\t}\r\n\r\n\t\tll ans = 0;\r\n\t\tint mxdep = 0;\r\n\t\tFor0(i,20){\r\n\t\t\tif(depcnt[i]) Mymax(mxdep,i);\r\n\t\t\tans += 1LL*depcnt[i]*i*w[1];\r\n\t\t}\r\n\t\tcout << ans << endl << mxdep << endl;\r\n\r\n\t\tEND();\r\n\t}\r\n}\r\n\r\nint main(){\r\n\tFILEIO();\r\n\r\n\tRead(n,k);\r\n\tFor(i,n) Read(w[i]);\r\n\tif(all_of(w+1,w+1+n,[=]( ll x ){ return x == w[1]; })){\r\n\t\tSameWi::Solve();\r\n\t}\r\n\r\n\tEND();\r\n}\r\n",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpu6h0w_hk/c8b4a5dc-a214-41ca-99f4-ab8a02dc2e5a.cpp: In function ‘void FILEIO(std::string)’:\n/tmp/tmpu6h0w_hk/c8b4a5dc-a214-41ca-99f4-ab8a02dc2e5a.cpp:121:17: error: ‘Fin’ was not declared in this scope; did you mean ‘sin’?\n  121 |                 Fin((pname+\".in\").c_str());\n      |                 ^~~\n      |                 sin\n/tmp/tmpu6h0w_hk/c8b4a5dc-a214-41ca-99f4-ab8a02dc2e5a.cpp:122:17: error: ‘Fout’ was not declared in this scope\n  122 |                 Fout((pname+\".out\").c_str());\n      |                 ^~~~\n/tmp/tmpu6h0w_hk/c8b4a5dc-a214-41ca-99f4-ab8a02dc2e5a.cpp: In function ‘void FILEIO_OICONTEST(std::string)’:\n/tmp/tmpu6h0w_hk/c8b4a5dc-a214-41ca-99f4-ab8a02dc2e5a.cpp:128:9: error: ‘Fin’ was not declared in this scope; did you mean ‘sin’?\n  128 |         Fin((pname+\".in\").c_str());\n      |         ^~~\n      |         sin\n/tmp/tmpu6h0w_hk/c8b4a5dc-a214-41ca-99f4-ab8a02dc2e5a.cpp:130:17: error: ‘Fout’ was not declared in this scope\n  130 |                 Fout((pname+\".out\").c_str());\n      |                 ^~~~\n"
        ],
        "tcb_id": "荷马史诗"
    },
    {
        "code_id": 0,
        "code": "#include <bits/stdc++.h>\r\nusing namespace std;\r\n\r\nnamespace Sweet {\r\n\r\ntemplate <typename T> inline void read(T &x) {\r\n  char ch;\r\n  int f = 1;\r\n  while (ch = getchar(), ch > '9' || ch < '0')\r\n    if (ch == '-') f = -1;\r\n  x = (ch ^ 48);\r\n  while (ch = getchar(), ch >= '0' && ch <= '9')\r\n    x = x * 10 + (ch ^ 48);\r\n  x *= f;\r\n}\r\ntemplate <typename T> inline void write(T x) {\r\n  static int stk[100], top = 0;\r\n  if (x == 0) return (void)putchar('0');\r\n  if (x < 0) x = -x, putchar('-');\r\n  while (x) stk[++top] = x % 10, x /= 10;\r\n  while (top) putchar(stk[top--] + '0');\r\n}\r\n\r\nconst int N = 5e2 + 10, M = 2e4 + 10;\r\n\r\nint tot, head[N];\r\nstruct E {\r\n  int next, to, w;\r\n} e[M];\r\ninline void add(int x, int y, int z) {\r\n  e[++tot] = (E){head[x], y, z}, head[x] = tot;\r\n}\r\n\r\nextern int n;\r\nint dis[N], cnt[N];\r\nbool vis[N];\r\nbool SPFA(int s) {\r\n  memset(cnt, 0, sizeof(cnt));\r\n  memset(vis, false, sizeof(vis));\r\n  memset(dis, 0x3f, sizeof(dis));\r\n  dis[s] = 0, vis[s] = true, cnt[s] = 1;\r\n  queue<int> q;\r\n  q.push(s);\r\n  while (!q.empty()) {\r\n    int u = q.front();\r\n    q.pop(), vis[u] = false;\r\n    for (int i = head[u], v; i; i = e[i].next) {\r\n      if (v = e[i].to, dis[v] > dis[u] + e[i].w) {\r\n        dis[v] = dis[u] + e[i].w;\r\n        if (!vis[v]) {\r\n          if (++cnt[v] >= n - 1) return true;\r\n          q.push(v), vis[v] = true;\r\n        }\r\n      }\r\n    }\r\n  }\r\n  return false;\r\n}\r\n\r\nint n, m, w, SWEET;\r\ninline void main() {\r\n  for (read(SWEET); SWEET--; tot = 0, memset(head, 0, sizeof(head))) {\r\n    read(n), read(m), read(w);\r\n    for (int i = 1, x, y, z; i <= m; ++i)\r\n      read(x), read(y), read(z), add(x, y, z), add(y, x, z);\r\n    for (int i = 1, x, y, z; i <= w; ++i)\r\n      read(x), read(y), read(z), add(x, y, -z);\r\n    puts(SPFA(1) ? \"YES\" : \"NO\");\r\n  }\r\n}\r\n\r\n}  // namespace Sweet\r\n\r\nint main() {\r\n\r\n#ifndef LOCAL\r\n#endif\r\n#endif\r\n  Sweet::main();\r\n  return 0;\r\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmp40doc_is/fe6b72fb-d633-480e-9847-6cd2edc0bba9.cpp:78:2: error: #endif without #if\n   78 | #endif\n      |  ^~~~~\n"
        ],
        "tcb_id": "虫洞 Wormholes"
    },
    {
        "code_id": 7,
        "code": "#include<bits/stdc++.h>\n#define ll long long\n#define INF 0x7fffffff\n#define INF64 1e18\nusing namespace std;\n\nconstexpr int N=1e6+5;\n\n\nint n,a[N];\n\nstruct que{\n\tdeque<pair<int,int> > q1,q2;\n\tvoid clear(){\n\t\twhile(q1.size()) q1.pop_back();\n\t\twhile(q2.size()) q2.pop_back();\n\t}\n\tvoid push_front(pair<int,int> x){\n\t\tq1.push_front(x);\n\t}\n\tvoid push_back(pair<int,int> x){\n\t\tq2.push_back(x);\n\t}\n\tpair<int,int> front(){\n\t\tpair<int,int> res={0,0};\n\t\tif(q1.size()) res=max(res,q1.front());\n\t\tif(q2.size()) res=max(res,q2.front());\n\t\treturn res;\n\t}\n\tpair<int,int> back(){\n\t\tpair<int,int> res={INF,0};\n\t\tif(q1.size()) res=min(res,q1.back());\n\t\tif(q2.size()) res=min(res,q2.back());\n\t\treturn res;\n\t}\n\tvoid pop_front(){\n\t\tif(q1.size()&&front()==q1.front()) q1.pop_front();\n\t\telse q2.pop_front();\n\t}\n\tvoid pop_back(){\n\t\tif(q1.size()&&back()==q1.back()) q1.pop_back();\n\t\telse q2.pop_back();\n\t}\n\tint size(){return q1.size()+q2.size();}\n}q;\n\n\nvoid solve(){\n\tq.clear();\n\tfor(int i=1;i<=n;i++) q.push_front({a[i],i});\n\tint res=n;\n\twhile(q.size()>1){\n\t\tauto x=q.front();q.pop_front();\n\t\twhile(q.size()){\n\t\t\tpair<int,int> y={x.first-q.back().first,x.second};\n\t\t\tq.pop_back();\n\t\t\tif(q.size()==0||y>q.front()){\n\t\t\t\tx=y;res--;\n\t\t\t}\n\t\t\telse if(y>q.back()){\n\t\t\t\tq.push_back(y);res--;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tint op=1;\n\t\t\t\twhile(q.size()){\n\t\t\t\t\tx=q.front();q.pop_front();\n\t\t\t\t\tx.first-=y.first;\n\t\t\t\t\tif(q.size()==0||x>q.back()){ op^=1;break;}\n\t\t\t\t\telse{ y=x;op^=1;}\n\t\t\t\t}\n\t\t\t\tres-=op;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<res<<'\\n';\n}\n\n\nint main(){\n\tfile(snakes);\n\tios::sync_with_stdio(false);\n\tcin.tie(0);cout.tie(0);\n\tint t;cin>>t;\n\tcin>>n;for(int i=1;i<=n;i++) cin>>a[i];\n\tsolve();t--;\n\twhile(t--) {\n\t\tint k;cin>>k;\n\t\tfor(int i=1;i<=k;i++){\n\t\t\tint x,y;cin>>x>>y;a[x]=y;\n\t\t}\n\t\tsolve();\n\t}\n}\n\n",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpca8ztvrb/0c40306b-4c0f-4ccc-ac1e-be3aeda07deb.cpp: In function ‘int main()’:\n/tmp/tmpca8ztvrb/0c40306b-4c0f-4ccc-ac1e-be3aeda07deb.cpp:82:14: error: ‘snakes’ was not declared in this scope\n   82 |         file(snakes);\n      |              ^~~~~~\n/tmp/tmpca8ztvrb/0c40306b-4c0f-4ccc-ac1e-be3aeda07deb.cpp:82:9: error: ‘file’ was not declared in this scope\n   82 |         file(snakes);\n      |         ^~~~\n"
        ],
        "tcb_id": "贪吃蛇"
    },
    {
        "code_id": 12,
        "code": "#include<bits/stdc++.h>\n#define int long long\n#define INF 0x7fffffff\n#define INF64 1e18\nusing namespace std;\n\nconstexpr int N=205;\nconstexpr int p=998244353;\n\nint n[N],m,k;\n\nstruct mat{\n\tint a[N][N];\n\tint *operator[](int x){return a[x];}\n\tmat(){memset(a,0,sizeof a);}\n\tmat operator*(mat x){\n\t\tmat res;\n\t\tfor(int i=1;i<=m;i++)\n\t\t\tfor(int l=1;l<=m;l++)\n\t\t\t\tfor(int j=1;j<=m;j++)\n\t\t\t\t\tres[i][j]+=a[i][l]*x[l][j];\n\t\treturn res;\n\t}\n\tvoid clr(){\n\t\tfor(int i=1;i<=m;i++)\n\t\t\tfor(int j=1;j<=m;j++)\n\t\t\t\ta[i][j]%=p;\n\t}\n\tvoid check(){\n\t\tfor(int i=1;i<=m;i++){\n\t\t\tfor(int j=1;j<=m;j++)\n\t\t\t\tcout<<setw(3)<<a[i][j];\n\t\t\tcout<<'\\n';\n\t\t}\n\t}\n};\n\n\nint det(mat a){\n\tint res=1;\n\tfor(int i=1;i<=n[1];i++)\n\t\tfor(int j=i+1;j<=n[1];j++){\n\t\t\twhile(a[i][i]){\n\t\t\t\tint t=a[j][i]/a[i][i];\n\t\t\t\tfor(int k=i;k<=m;k++)\n\t\t\t\t\ta[j][k]=(a[j][k]-a[i][k]*t%p+p)%p;\n\t\t\t\tswap(a.a[i],a.a[j]);res=-res;\n\t\t\t}\n\t\t\tswap(a.a[i],a.a[j]);res=-res;\n\t\t}\n\tfor(int i=1;i<=n[1];i++) res=res*a[i][i]%p;\n\treturn (res+p)%p;\n}\n\n\t\n\nint cnt[N];\n\nvoid solve(){\n\tcin>>k;\n\tfor(int i=1;i<=k;i++) cin>>n[i];\n\tm=n[1]*2;\n\tmat a;\n\tfor(int i=1;i<k;i++) cin>>cnt[i];\n\tfor(int i=1;i<k;i++){\n\t\tmat b;\n\t\tfor(int j=1;j<=cnt[i];j++){\n\t\t\tint u,v;cin>>u>>v;b[u][v]=1;\n\t\t}\n\t\tif(i==1) a=b;\n\t\telse a=a*b;\n\t\tif(i%4==0) a.clr();\n\t}\n\tcout<<det(a)<<'\\n';\n}\n\nsigned main(){\n\tfile(xpath);\n\tios::sync_with_stdio(false);\n\tint t;cin>>t;\n\twhile(t--) solve();\n\t\n}\n\n",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpzw_u46dl/b8afd6b0-5eb8-4304-8138-369d5a050cb6.cpp: In function ‘int main()’:\n/tmp/tmpzw_u46dl/b8afd6b0-5eb8-4304-8138-369d5a050cb6.cpp:78:14: error: ‘xpath’ was not declared in this scope\n   78 |         file(xpath);\n      |              ^~~~~\n/tmp/tmpzw_u46dl/b8afd6b0-5eb8-4304-8138-369d5a050cb6.cpp:78:9: error: ‘file’ was not declared in this scope\n   78 |         file(xpath);\n      |         ^~~~\n"
        ],
        "tcb_id": "路径交点"
    },
    {
        "code_id": 1,
        "code": "// InterestingLSY\r\n// 2659723130\r\n// 《幽灵公主》是真的好看！\r\n#include <bits/stdc++.h>\r\nusing namespace std;\r\n#define il inline\r\n#define elif else if\r\n\r\n// Type\r\n#define ld double\r\n#define ll long long\r\n#define ull unsigned ll\r\n\r\n// Vector\r\n#define vc vector\r\n#define Pb push_back\r\n#define Pf push_front\r\n#define Eb emplace_back\r\n#define All(x) x.begin(), x.end()\r\n#define AllRev(x) x.rbegin(), x.rend()\r\n\r\n// Memory\r\n#define Ms(_data) memset(_data, 0, sizeof(_data))\r\n#define Msn(_data, _num) memset(_data, _num, sizeof(_data))\r\n\r\n// Template\r\n#define _cl class\r\n#define _tp template\r\n#define _tyn typename\r\n\r\n// Pair\r\n#define Mp make_pair\r\n#define F first\r\n#define S second\r\n#define pii pair<int, int>\r\n#define pli pair<ll, int>\r\n#define pil pair<int, ll>\r\n#define pll pair<ll, ll>\r\n\r\n// Loop\r\n#define For(i, j) for (int(i) = 1; (i) <= (j); ++(i))\r\n#define For0(i, j) for (int(i) = 0; (i) < (j); ++(i))\r\n#define Forx(i, j, k) for (int(i) = (j); (i) <= (k); ++(i))\r\n#define Forstep(i, j, k, st) for (int(i) = (j); (i) <= (k); (i) += (st))\r\n#define fOR(i, j) for (int(i) = (j); (i) >= 1; --(i))\r\n#define fOR0(i, j) for (int(i) = (j)-1; (i) >= 0; --(i))\r\n#define fORx(i, j, k) for (int(i) = (k); (i) >= (j); --(i))\r\n\r\n// Read\r\nstruct InputReader {\r\n#define bs 1048576\r\n    char buf[bs];\r\n    int p;\r\n    il InputReader() { p = bs; }\r\n    il void Flush() {\r\n        p = 0;\r\n        fread(buf, 1, bs, stdin);\r\n    }\r\n    il char C() {\r\n        if (p >= bs)\r\n            Flush();\r\n        return buf[p++];\r\n    }\r\n    il char Readnum() {\r\n        char ch = C();\r\n        while (!isdigit(ch) && ch != '-') ch = C();\r\n        return ch;\r\n    }\r\n    il void Readalpha(char &c) {\r\n        c = C();\r\n        while (!isalpha(c)) c = C();\r\n    }\r\n    int operator()() {\r\n        int ans = 0, fu = 1;\r\n        char ch = Readnum();\r\n        if (ch == '-')\r\n            fu = -1, ch = C();\r\n        while (ch >= '0' && ch <= '9') {\r\n            ans = ans * 10 + ch - '0';\r\n            ch = C();\r\n        }\r\n        return ans * fu;\r\n    }\r\n    ll Readll() {\r\n        ll ans = 0LL, fu = 1LL;\r\n        char ch = Readnum();\r\n        if (ch == '-')\r\n            fu = -1LL, ch = C();\r\n        while (ch >= '0' && ch <= '9') {\r\n            ans = ans * 10LL + ch - '0';\r\n            ch = C();\r\n        }\r\n        return ans * fu;\r\n    }\r\n    il void Readstring(string &x) {\r\n        x.clear();\r\n        char ch = C();\r\n        while (!isdigit(ch) && !isalpha(ch) && ch != '#' && ch != '.') ch = C();\r\n        while (isdigit(ch) || isalpha(ch) || ch == '#' || ch == '.') {\r\n            x += ch;\r\n            ch = C();\r\n        }\r\n    }\r\n    il void Readchstring(char s[]) {\r\n        int len = 0;\r\n        char ch = C();\r\n        while (!isdigit(ch) && !isalpha(ch) /*&&  ch != '*'  &&  ch != '?'*/) ch = C();\r\n        while (isdigit(ch) || isalpha(ch) /*||  ch == '*'  ||  ch == '?'*/) {\r\n            s[len++] = ch;\r\n            ch = C();\r\n        }\r\n        s[len] = '\\0';\r\n    }\r\n    il void Specialread(char &c) {\r\n        c = C();\r\n        while (!isdigit(c) && !isalpha(c) && c != '#' && c != '.' && c != '=' && c != 'B') c = C();\r\n    }\r\n#undef bs\r\n} In;\r\nil void Read(int &x) { x = In(); }\r\nil void Read(int &x, int &y) {\r\n    x = In();\r\n    y = In();\r\n}\r\nil void Read(int &x1, int &x2, int &x3) {\r\n    x1 = In();\r\n    x2 = In();\r\n    x3 = In();\r\n}\r\nil void Read(int &x1, int &x2, int &x3, int &x4) {\r\n    x1 = In();\r\n    x2 = In();\r\n    x3 = In();\r\n    x4 = In();\r\n}\r\nil void Read(ll &x) { x = In.Readll(); }\r\nil void Read(ll &x, ll &y) {\r\n    x = In.Readll();\r\n    y = In.Readll();\r\n}\r\nil void Read(ll &x1, ll &x2, ll &x3) {\r\n    x1 = In.Readll();\r\n    x2 = In.Readll();\r\n    x3 = In.Readll();\r\n}\r\nil void Read(ll &x1, ll &x2, ll &x3, ll &x4) {\r\n    x1 = In.Readll();\r\n    x2 = In.Readll();\r\n    x3 = In.Readll();\r\n    x4 = In.Readll();\r\n}\r\n_tp<_tyn T> void Read(T a[], int st, int ed) { Forx(i, st, ed) Read(a[i]); }\r\n#define iRead(k) \\\r\n    int k;       \\\r\n    Read(k);\r\n#define iRead2(a, b) \\\r\n    iRead(a);        \\\r\n    iRead(b);\r\n#define iRead3(a, b, c) \\\r\n    iRead2(a, b);       \\\r\n    iRead(c);\r\n#define iRead4(a, b, c, d) \\\r\n    iRead2(a, b);          \\\r\n    iRead2(c, d);\r\n#define lRead(k) \\\r\n    ll k;        \\\r\n    Read(k);\r\n#define lRead2(a, b) \\\r\n    lRead(a);        \\\r\n    lRead(b);\r\n#define lRead3(a, b, c) \\\r\n    lRead2(a, b);       \\\r\n    lRead(c);\r\n#define lRead4(a, b, c, d) \\\r\n    lRead2(a, b);          \\\r\n    lRead2(c, d);\r\n\r\n// File\r\nil void FILEIO() {\r\n#ifdef intLSY\r\n    Fin(\"in.in\");\r\n#endif\r\n}\r\nil void FILEIO(string pname) {\r\n#ifndef intLSY\r\n    Fin((pname + \".in\").c_str());\r\n    Fout((pname + \".out\").c_str());\r\n#else\r\n    Fin(\"in.in\");\r\n#endif\r\n}\r\nil void FILEIO_OICONTEST(string pname) {\r\n    Fin((pname + \".in\").c_str());\r\n#ifndef intLSY\r\n    Fout((pname + \".out\").c_str());\r\n#endif\r\n}\r\nvoid Printtime() {\r\n#ifdef intLSY\r\n    double _timeuse = clock() * 1000.0 / CLOCKS_PER_SEC;\r\n    fprintf(stderr, \"\\n\\nTime usage:\\n%.0lf ms\\n\", _timeuse);\r\n#endif\r\n}\r\nvoid END() {\r\n    Printtime();\r\n    exit(0);\r\n}\r\n_tp<_tyn T> void END(T mes) {\r\n    cout << mes << endl;\r\n    END();\r\n}\r\n\r\n// Debug\r\n#define B cerr << \"BreakPoint\" << endl;\r\n#define O(x) cerr << #x << \" \" << x << endl;\r\n#define o(x) cerr << #x << \" \" << x << \"  \";\r\n#define Msz(x) cerr << \"Sizeof \" << #x << \" \" << sizeof(x) / 1024 / 1024 << \" MB\" << endl;\r\n_tp<_tyn T> void Print(T a[], int s, int t, char sp = ' ', char ed = '\\n') {\r\n    if (s > t)\r\n        return;\r\n    for (int i = s; i < t; i++) cout << a[i] << sp;\r\n    cout << a[t] << ed;\r\n    cout.flush();\r\n}\r\n_tp<_tyn T> void Print(T a, int s = 0, int t = -1, char sp = ' ', char ed = '\\n') {\r\n    if (t == -1)\r\n        t = a.size() - 1;\r\n    for (int i = s; i <= t; i++) cout << a[i] << sp;\r\n    cout << ed;\r\n    cout.flush();\r\n}\r\n\r\n// Optimize\r\n#define Max(a, b) ((a) > (b) ? (a) : (b))\r\n#define Min(a, b) ((a) < (b) ? (a) : (b))\r\n#define Mymax(a, b) (a) = max((a), (b))\r\n#define Mymin(a, b) (a) = min((a), (b))\r\n#define MyMax(a, b) (a) = Max((a), (b))\r\n#define MyMin(a, b) (a) = Min((a), (b))\r\n#define INF (0x3f3f3f3f)\r\n#define LINF ((long long)(0x3f3f3f3f3f3f3f3f))\r\n#define Sqr(x) ((ull)(x) * (x))\r\n#define Lowbit(a) ((a) & (-(a)))\r\nvc<int> Range(int l, int r) {\r\n    vc<int> ret{};\r\n    Forx(i, l, r) ret.Pb(i);\r\n    return ret;\r\n}\r\nmt19937 Rand(0xe38195e38293);  // さん\r\n///////////////////////////////////////////////////////////////////////////////////////\r\n///////////////////////////////////////////////////////////////////////////////////////\r\n\r\n#define MAXN    2000010\r\n#define MAXK    10010\r\n\r\nint N, K, P;\r\nll f[MAXK], cnt[MAXK], last[MAXK];\r\n\r\nint main(void) {\r\n\r\n\tint now;\r\n    ll ans = 0;\r\n    int c, p;\r\n    Read(N, K, P);\r\n\tFor(i, N) {\r\n\t\tRead(c, p);\r\n\t\tif(p<=P) {\r\n\t\t\tnow = i;\r\n\t\t}\r\n\t\tif(now>=last[c]) {\r\n\t\t\tf[c] = cnt[c];\r\n\t\t}\r\n\t\tans += f[c];\r\n\t\t++cnt[c];\r\n\t\tlast[c] = i;\r\n\t}\r\n\tprintf(\"%lld\\n\", ans);\r\n\treturn 0;\r\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpqm7690k5/92ed537b-29ac-4879-a2a3-bab288b74b7d.cpp: In function ‘void FILEIO(std::string)’:\n/tmp/tmpqm7690k5/92ed537b-29ac-4879-a2a3-bab288b74b7d.cpp:186:5: error: ‘Fin’ was not declared in this scope; did you mean ‘sin’?\n  186 |     Fin((pname + \".in\").c_str());\n      |     ^~~\n      |     sin\n/tmp/tmpqm7690k5/92ed537b-29ac-4879-a2a3-bab288b74b7d.cpp:187:5: error: ‘Fout’ was not declared in this scope\n  187 |     Fout((pname + \".out\").c_str());\n      |     ^~~~\n/tmp/tmpqm7690k5/92ed537b-29ac-4879-a2a3-bab288b74b7d.cpp: In function ‘void FILEIO_OICONTEST(std::string)’:\n/tmp/tmpqm7690k5/92ed537b-29ac-4879-a2a3-bab288b74b7d.cpp:193:5: error: ‘Fin’ was not declared in this scope; did you mean ‘sin’?\n  193 |     Fin((pname + \".in\").c_str());\n      |     ^~~\n      |     sin\n/tmp/tmpqm7690k5/92ed537b-29ac-4879-a2a3-bab288b74b7d.cpp:195:5: error: ‘Fout’ was not declared in this scope\n  195 |     Fout((pname + \".out\").c_str());\n      |     ^~~~\n"
        ],
        "tcb_id": "选择客栈"
    },
    {
        "code_id": 1,
        "code": "/*\r\n忘掉一个人真的好难\r\n所以不要轻易心动\r\n*/\r\n#include <bits/stdc++.h>\r\n#define rep(i,j,k) for(i=j;i<=k;++i)\r\n#define dow(i,j,k) for(i=j;i>=k;--i)\r\n#define LL long long\r\n#define D double\r\n#define sz(X) (int)(X.size())\r\n#define itr iterator\r\n#define mkp std::make_pair\r\n#define pr std::pair\r\n#define fi first\r\n#define se second\r\nconst LL md=998244353;\r\ninline LL fmul(LL x,LL y,const LL P){\r\n    /*LL res=0;\r\n    while(y){\r\n        if(y&1)res+=x,res%=P;\r\n        x+=x;x%=P;y>>=1;\r\n    }\r\n    return res;\r\n    */\r\n    //return (x*y-(LL)((long double)x/P*y)*P+P)%P;\r\n    return (x*y)%P;\r\n}\r\ninline LL fpw(LL x,LL y,const LL modol){\r\n    if(x==modol-1)return y&1 ? modol-1:1;\r\n    LL res=1;while(y){if(y&1)res=fmul(res,x,modol);x=fmul(x,x,modol);y>>=1;}return res%modol;\r\n}\r\nLL exgcd(LL& x,LL& y,LL a,LL b){\r\n    if(!b){x=1;y=0;return a;}\r\n    LL res=exgcd(y,x,b,a%b);y-=x*(a/b);return res;\r\n}\r\ninline LL ad(LL x,LL y,const LL md){\r\n    return x+y>=md ? x+y-md:x+y;\r\n}\r\ninline LL sub(LL x,LL y,const LL md){\r\n    return x<y ? md+x-y:x-y;\r\n}\r\ninline LL inv(LL o,const LL modol){\r\n    LL x,y;exgcd(x,y,o,modol);\r\n    x=(x%modol+modol)%md;return x;\r\n}\r\nint read(){\r\n    int x=0,f=1;char ch=getchar();\r\n    while(ch<'0'||ch>'9') {if(ch=='-')f=-1;ch=getchar();}\r\n    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}\r\n    return f*x;\r\n}\r\nLL mmax(LL x,LL y){return x>y ? x:y;}\r\nLL mmin(LL x,LL y){return x<y ? x:y;}\r\nconst int N=20;\r\nconst int M=(1<<18)+10;\r\nint Q,x,n,head[N],pos;\r\nstruct edge{\r\n\tint nxt,to;\r\n}e[N<<1];\r\nint d[N],lim,cnt[M];\r\nint lowbit(int x){\r\n\treturn x&(-x);\r\n}\r\nLL a[N],b[N],f[M];\r\nvoid add(int u,int v){e[++pos]=(edge){head[u],v};head[u]=pos;}\r\nvoid dfs(int S,int u,int fa){\r\n\tif((1<<u-1)&S){\r\n\t\ta[u]=b[u]=0;return;\r\n\t}\r\n\tLL sa,sb;sa=sb=0;int i;\r\n\tfor(i=head[u];i;i=e[i].nxt){\r\n\t\tint v=e[i].to;if(v==fa)continue;\r\n\t\tdfs(S,v,u);\r\n\t\tsa=ad(sa,a[v],md);\r\n\t\tsb=ad(sb,b[v],md);\r\n\t}\r\n\ta[u]=inv(sub(d[u],sa,md),md);\r\n\tb[u]=fmul(a[u],ad(sb,d[u],md),md);\r\n}\r\nvoid FWT(LL* A){\r\n\tint i,j,k,mid,R;\r\n\tfor(mid=1;mid<lim;mid<<=1)\r\n\t\tfor(R=mid<<1,j=0;j<lim;j+=R)\r\n\t\t\tfor(k=0;k<mid;++k)A[j+k+mid]=ad(A[j+k],A[j+k+mid],md);\r\n}\r\n\tn=read();Q=read();x=read();int i;\r\n\trep(i,2,n){\r\n\t\tint x=read();int y=read();\r\n\t\tadd(x,y);add(y,x);\r\n\t\t++d[x];++d[y];\r\n\t}\r\n\trep(i,1,(1<<n)-1)dfs(i,x,0),f[i]=(x&i) ? 0:b[x];\r\n\tlim=(1<<n)-1;\r\n\trep(i,1,lim)cnt[i]=cnt[i-lowbit(i)]+1;\r\n\trep(i,1,lim)f[i]=fmul(fpw(md-1,cnt[i]+1,md),f[i],md);\r\n\tFWT(f);\r\n\twhile(Q--){\r\n\t\tint s=0,k=read();\r\n\t\trep(i,1,k)s+=(1<<read()-1);\r\n\t\tprintf(\"%lld\\n\",f[s]);\r\n\t}\r\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:86:9: error: ‘n’ does not name a type\n   86 |         n=read();Q=read();x=read();int i;\n      |         ^\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:86:18: error: ‘Q’ does not name a type\n   86 |         n=read();Q=read();x=read();int i;\n      |                  ^\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:86:27: error: ‘x’ does not name a type\n   86 |         n=read();Q=read();x=read();int i;\n      |                           ^\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:6:20: error: expected unqualified-id before ‘for’\n    6 | #define rep(i,j,k) for(i=j;i<=k;++i)\n      |                    ^~~\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:87:9: note: in expansion of macro ‘rep’\n   87 |         rep(i,2,n){\n      |         ^~~\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:87:13: error: ‘i’ does not name a type\n   87 |         rep(i,2,n){\n      |             ^\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:6:28: note: in definition of macro ‘rep’\n    6 | #define rep(i,j,k) for(i=j;i<=k;++i)\n      |                            ^\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:6:33: error: expected unqualified-id before ‘++’ token\n    6 | #define rep(i,j,k) for(i=j;i<=k;++i)\n      |                                 ^~\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:87:9: note: in expansion of macro ‘rep’\n   87 |         rep(i,2,n){\n      |         ^~~\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:6:20: error: expected unqualified-id before ‘for’\n    6 | #define rep(i,j,k) for(i=j;i<=k;++i)\n      |                    ^~~\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:92:9: note: in expansion of macro ‘rep’\n   92 |         rep(i,1,(1<<n)-1)dfs(i,x,0),f[i]=(x&i) ? 0:b[x];\n      |         ^~~\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:92:13: error: ‘i’ does not name a type\n   92 |         rep(i,1,(1<<n)-1)dfs(i,x,0),f[i]=(x&i) ? 0:b[x];\n      |             ^\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:6:28: note: in definition of macro ‘rep’\n    6 | #define rep(i,j,k) for(i=j;i<=k;++i)\n      |                            ^\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:6:33: error: expected unqualified-id before ‘++’ token\n    6 | #define rep(i,j,k) for(i=j;i<=k;++i)\n      |                                 ^~\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:92:9: note: in expansion of macro ‘rep’\n   92 |         rep(i,1,(1<<n)-1)dfs(i,x,0),f[i]=(x&i) ? 0:b[x];\n      |         ^~~\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:93:9: error: ‘lim’ does not name a type\n   93 |         lim=(1<<n)-1;\n      |         ^~~\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:6:20: error: expected unqualified-id before ‘for’\n    6 | #define rep(i,j,k) for(i=j;i<=k;++i)\n      |                    ^~~\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:94:9: note: in expansion of macro ‘rep’\n   94 |         rep(i,1,lim)cnt[i]=cnt[i-lowbit(i)]+1;\n      |         ^~~\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:94:13: error: ‘i’ does not name a type\n   94 |         rep(i,1,lim)cnt[i]=cnt[i-lowbit(i)]+1;\n      |             ^\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:6:28: note: in definition of macro ‘rep’\n    6 | #define rep(i,j,k) for(i=j;i<=k;++i)\n      |                            ^\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:6:33: error: expected unqualified-id before ‘++’ token\n    6 | #define rep(i,j,k) for(i=j;i<=k;++i)\n      |                                 ^~\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:94:9: note: in expansion of macro ‘rep’\n   94 |         rep(i,1,lim)cnt[i]=cnt[i-lowbit(i)]+1;\n      |         ^~~\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:6:20: error: expected unqualified-id before ‘for’\n    6 | #define rep(i,j,k) for(i=j;i<=k;++i)\n      |                    ^~~\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:95:9: note: in expansion of macro ‘rep’\n   95 |         rep(i,1,lim)f[i]=fmul(fpw(md-1,cnt[i]+1,md),f[i],md);\n      |         ^~~\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:95:13: error: ‘i’ does not name a type\n   95 |         rep(i,1,lim)f[i]=fmul(fpw(md-1,cnt[i]+1,md),f[i],md);\n      |             ^\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:6:28: note: in definition of macro ‘rep’\n    6 | #define rep(i,j,k) for(i=j;i<=k;++i)\n      |                            ^\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:6:33: error: expected unqualified-id before ‘++’ token\n    6 | #define rep(i,j,k) for(i=j;i<=k;++i)\n      |                                 ^~\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:95:9: note: in expansion of macro ‘rep’\n   95 |         rep(i,1,lim)f[i]=fmul(fpw(md-1,cnt[i]+1,md),f[i],md);\n      |         ^~~\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:96:12: error: expected constructor, destructor, or type conversion before ‘(’ token\n   96 |         FWT(f);\n      |            ^\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:97:9: error: expected unqualified-id before ‘while’\n   97 |         while(Q--){\n      |         ^~~~~\n/tmp/tmp7z6fffr4/1911a5bb-4500-4749-963d-7a639fa0d107.cpp:102:1: error: expected declaration before ‘}’ token\n  102 | }\n      | ^\n"
        ],
        "tcb_id": "随机游走"
    },
    {
        "code_id": 6,
        "code": "#include<bits/stdc++.h>\n#define LL long long\n#define u64 unsigned long long\nusing namespace std;\nnamespace IO\n{\n\tconst int _Pu=2e7+5,_d=32;\n\tchar buf[_Pu],obuf[_Pu],*p1=buf+_Pu,*p2=buf+_Pu,*p3=obuf,*p4=obuf+_Pu-_d;\n\tinline void fin()\n\t{\n\t\tmemmove(buf,p1,p2-p1);\n\t\tint rlen=fread(buf+(p2-p1),1,p1-buf,stdin);\n\t\tif(p1-rlen>buf) buf[p2-p1+rlen]=EOF;p1=buf;\n\t}\n\tinline void fout(){fwrite(obuf,p3-obuf,1,stdout),p3=obuf;}\n\tinline int rd()\n\t{\n\t\tif(p1+_d>p2) fin();int isne=0,x=0;\n\t\tfor(;!isdigit(*p1);++p1) isne=(*p1=='-');x=(*p1++-'0');\n\t    for(;isdigit(*p1);++p1) x=x*10+(*p1-'0');\n\t\tif(isne) x=-x;return x;\n\t}\n\tinline void wr(int x,char end='\\n')\n\t{\n\t\tif(!x) return *p3++='0',*p3++=end,void();\n\t\tif(x<0) *p3++='-',x=-x;\n\t\tchar sta[20],*top=sta;\n\t\tdo{*top++=(x%10)+'0';x/=10;}while(x);\n\t\tdo{*p3++=*--top;}while(top!=sta);(*p3++)=end;\n\t}\n}using IO::rd;using IO::wr;\nconst int N=2e5+5,g=2953;\nmt19937_64 rnd(time(0));\nint n,m,q,a[N][3],b[N][3],R[N];u64 to[N];\nstruct node\n{\n\tu64 a[N*3],x;\n\tinline void add(int w,int t){x^=a[w];a[w]+=to[t];x^=a[w];}\n\tinline void del(int w,int t){x^=a[w];a[w]-=to[t];x^=a[w];}\n}A,B;\nint main()\n{\n\tfr(set)\n\tn=rd(),m=rd(),q=rd();\n\tfor(int i=1;i<=n;i++) for(int j=0;j<3;j++) a[i][j]=rd();\n\tfor(int i=1;i<=n;i++) for(int j=0;j<3;j++) b[i][j]=rd();\n\tfor(int i=1;i<=n;i++) to[i]=rnd();\n\tfor(int i=n,j=n;i;i--)\n\t{\n\t\tfor(int k=0;k<3;k++) A.add(a[i][k],i),B.add(b[i][k],i);\n\t\tfor(;j>=i&&A.x!=B.x;j--) for(int k=0;k<3;k++)\n\t\t\tA.del(a[j][k],j),B.del(b[j][k],j);\n\t\tR[i]=j;\n\t}\n\tfor(int l,r;q--;) l=rd(),r=rd(),puts(r<=R[l]?\"Yes\":\"No\");\n\treturn 0;\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpxuo4m6k_/5e076620-71a0-486f-a69c-7399379e2eb9.cpp: In function ‘int main()’:\n/tmp/tmpxuo4m6k_/5e076620-71a0-486f-a69c-7399379e2eb9.cpp:43:15: error: missing template arguments before ‘)’ token\n   43 |         fr(set)\n      |               ^\n/tmp/tmpxuo4m6k_/5e076620-71a0-486f-a69c-7399379e2eb9.cpp:43:9: error: ‘fr’ was not declared in this scope; did you mean ‘wr’?\n   43 |         fr(set)\n      |         ^~\n      |         wr\n"
        ],
        "tcb_id": "集合"
    },
    {
        "code_id": 3,
        "code": "#include<cstdio>\r\n#include<tr1/unordered_map>\r\n#include<queue>\r\nusing namespace std;\r\nusing namespace std::tr1;\r\n#define re register int\r\nint T,bu,mx[8]={-1,-2,-2,-1,1,2,2,1},my[8]={2,1,-1,-2,-2,-1,1,2};\r\nstruct ju{char a[7][7];int ha,dep;}mu,chu[27];\r\nunordered_map<int,int>mp,st;\r\nqueue<ju>q;\r\ninline int haxi(register ju u)\r\n{\r\n    re res=0,tmp;\r\n    for(re i=1;i<=5;++i)\r\n    for(re j=1;j<=5;++j)\r\n    {\r\n\t\tif(u.a[i][j]=='*')tmp=(i-1)*5+j;\r\n\t\tres+=((int)(u.a[i][j]^48))<<((i-1)*5+j-1);\r\n\t}\r\n    return res-1333337*tmp;\r\n}\r\ninline void swp(register char&x,register char&y){register char w=x;x=y,y=w;}\r\nint main()\r\n    scanf(\"%d\",&T),bu=8;\r\n    mu.a[1][1]=mu.a[1][2]=mu.a[1][3]=mu.a[1][4]=mu.a[1][5]=49;\r\n    mu.a[2][1]=48,mu.a[2][2]=mu.a[2][3]=mu.a[2][4]=mu.a[2][5]=49;\r\n    mu.a[3][1]=mu.a[3][2]=48,mu.a[3][3]='*',mu.a[3][4]=mu.a[3][5]=49;\r\n    mu.a[4][1]=mu.a[4][2]=mu.a[4][3]=mu.a[4][4]=48,mu.a[4][5]=49;\r\n    mu.a[5][1]=mu.a[5][2]=mu.a[5][3]=mu.a[5][4]=mu.a[5][5]=48;\r\n    mu.ha=haxi(mu);\r\n    for(re i=1;i<=T;++i)\r\n    {\r\n        for(re j=1;j<=5;++j)scanf(\" %s\",chu[i].a[j]+1);\r\n        chu[i].ha=haxi(chu[i]);\r\n    }\r\n    q.push(mu),mp[mu.ha]=0;\r\n    while(!q.empty())\r\n    {\r\n        register ju u=q.front();\r\n        if(u.dep==bu){while(!q.empty())q.pop();break;}\r\n        q.pop();\r\n        re cx,cy;\r\n        for(re i=1;i<=5;++i)\r\n        for(re j=1;j<=5;++j)\r\n        if(u.a[i][j]=='*'){cx=i,cy=j;goto end;}\r\n        end:;\r\n        for(re i=0,nx,ny;i<8;++i)\r\n        {\r\n            nx=cx+mx[i],ny=cy+my[i];\r\n            if(nx<=0||ny<=0||nx>5||ny>5)continue;\r\n            register ju v=u;\r\n            swp(v.a[cx][cy],v.a[nx][ny]),v.ha=haxi(v),v.dep=u.dep+1;\r\n            if(mp.find(v.ha)==mp.end())mp[v.ha]=v.dep,q.push(v);\r\n        }\r\n    }\r\n    bu=7;\r\n    for(re h=1;h<=T;++h)\r\n    {\r\n        st.clear();\r\n        if(mp.find(chu[h].ha)!=mp.end()){printf(\"%d\\n\",mp[chu[h].ha]);continue;}\r\n        q.push(chu[h]),st[chu[h].ha]=0;\r\n        while(!q.empty())\r\n        {\r\n            register ju u=q.front();\r\n            q.pop();\r\n            if(u.dep==bu+1){while(!q.empty())q.pop();printf(\"-1\\n\");break;}\r\n            if(mp.find(u.ha)!=mp.end())\r\n            {\r\n                printf(\"%d\\n\",mp[u.ha]+u.dep);\r\n                while(!q.empty())q.pop();\r\n                break;\r\n            }\r\n            re cx,cy;\r\n            for(re i=1;i<=5;++i)\r\n            for(re j=1;j<=5;++j)\r\n            if(u.a[i][j]=='*'){cx=i,cy=j;goto loop;}\r\n            loop:;\r\n            for(re i=0,nx,ny;i<8;++i)\r\n            {\r\n                nx=cx+mx[i],ny=cy+my[i];\r\n                if(nx<=0||ny<=0||nx>5||ny>5)continue;\r\n                register ju v=u;\r\n                swp(v.a[cx][cy],v.a[nx][ny]),v.ha=haxi(v),v.dep=u.dep+1;\r\n                if(st.find(v.ha)==st.end())st[v.ha]=v.dep,q.push(v);\r\n            }\r\n        }\r\n    }\r\n    return 0;\r\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmpxigepz52/37577138-e91e-426d-b875-371ec18dc704.cpp:24:5: error: expected initializer before ‘scanf’\n   24 |     scanf(\"%d\",&T),bu=8;\n      |     ^~~~~\n/tmp/tmpxigepz52/37577138-e91e-426d-b875-371ec18dc704.cpp:25:5: error: ‘mu’ does not name a type; did you mean ‘ju’?\n   25 |     mu.a[1][1]=mu.a[1][2]=mu.a[1][3]=mu.a[1][4]=mu.a[1][5]=49;\n      |     ^~\n      |     ju\n/tmp/tmpxigepz52/37577138-e91e-426d-b875-371ec18dc704.cpp:26:5: error: ‘mu’ does not name a type; did you mean ‘ju’?\n   26 |     mu.a[2][1]=48,mu.a[2][2]=mu.a[2][3]=mu.a[2][4]=mu.a[2][5]=49;\n      |     ^~\n      |     ju\n/tmp/tmpxigepz52/37577138-e91e-426d-b875-371ec18dc704.cpp:27:5: error: ‘mu’ does not name a type; did you mean ‘ju’?\n   27 |     mu.a[3][1]=mu.a[3][2]=48,mu.a[3][3]='*',mu.a[3][4]=mu.a[3][5]=49;\n      |     ^~\n      |     ju\n/tmp/tmpxigepz52/37577138-e91e-426d-b875-371ec18dc704.cpp:28:5: error: ‘mu’ does not name a type; did you mean ‘ju’?\n   28 |     mu.a[4][1]=mu.a[4][2]=mu.a[4][3]=mu.a[4][4]=48,mu.a[4][5]=49;\n      |     ^~\n      |     ju\n/tmp/tmpxigepz52/37577138-e91e-426d-b875-371ec18dc704.cpp:29:5: error: ‘mu’ does not name a type; did you mean ‘ju’?\n   29 |     mu.a[5][1]=mu.a[5][2]=mu.a[5][3]=mu.a[5][4]=mu.a[5][5]=48;\n      |     ^~\n      |     ju\n/tmp/tmpxigepz52/37577138-e91e-426d-b875-371ec18dc704.cpp:30:5: error: ‘mu’ does not name a type; did you mean ‘ju’?\n   30 |     mu.ha=haxi(mu);\n      |     ^~\n      |     ju\n/tmp/tmpxigepz52/37577138-e91e-426d-b875-371ec18dc704.cpp:31:5: error: expected unqualified-id before ‘for’\n   31 |     for(re i=1;i<=T;++i)\n      |     ^~~\n/tmp/tmpxigepz52/37577138-e91e-426d-b875-371ec18dc704.cpp:31:16: error: ‘i’ does not name a type\n   31 |     for(re i=1;i<=T;++i)\n      |                ^\n/tmp/tmpxigepz52/37577138-e91e-426d-b875-371ec18dc704.cpp:31:21: error: expected unqualified-id before ‘++’ token\n   31 |     for(re i=1;i<=T;++i)\n      |                     ^~\n/tmp/tmpxigepz52/37577138-e91e-426d-b875-371ec18dc704.cpp:36:5: error: ‘q’ does not name a type\n   36 |     q.push(mu),mp[mu.ha]=0;\n      |     ^\n/tmp/tmpxigepz52/37577138-e91e-426d-b875-371ec18dc704.cpp:37:5: error: expected unqualified-id before ‘while’\n   37 |     while(!q.empty())\n      |     ^~~~~\n/tmp/tmpxigepz52/37577138-e91e-426d-b875-371ec18dc704.cpp:56:5: error: ‘bu’ does not name a type; did you mean ‘ju’?\n   56 |     bu=7;\n      |     ^~\n      |     ju\n/tmp/tmpxigepz52/37577138-e91e-426d-b875-371ec18dc704.cpp:57:5: error: expected unqualified-id before ‘for’\n   57 |     for(re h=1;h<=T;++h)\n      |     ^~~\n/tmp/tmpxigepz52/37577138-e91e-426d-b875-371ec18dc704.cpp:57:16: error: ‘h’ does not name a type\n   57 |     for(re h=1;h<=T;++h)\n      |                ^\n/tmp/tmpxigepz52/37577138-e91e-426d-b875-371ec18dc704.cpp:57:21: error: expected unqualified-id before ‘++’ token\n   57 |     for(re h=1;h<=T;++h)\n      |                     ^~\n/tmp/tmpxigepz52/37577138-e91e-426d-b875-371ec18dc704.cpp:88:5: error: expected unqualified-id before ‘return’\n   88 |     return 0;\n      |     ^~~~~~\n/tmp/tmpxigepz52/37577138-e91e-426d-b875-371ec18dc704.cpp:89:1: error: expected declaration before ‘}’ token\n   89 | }\n      | ^\n"
        ],
        "tcb_id": "骑士精神"
    },
    {
        "code_id": 9,
        "code": "#include<cstdio>\r\n#include<tr1/unordered_map>\r\n#include<queue>\r\nusing namespace std;\r\nusing namespace std::tr1;\r\n#define re register int\r\nint T,bu,mx[8]={-1,-2,-2,-1,1,2,2,1},my[8]={2,1,-1,-2,-2,-1,1,2};\r\nstruct ju{char a[7][7];int ha,dep;}mu,chu[27];\r\nunordered_map<int,int>mp,st;\r\nqueue<ju>q;\r\ninline int haxi(register ju u)\r\n{\r\n    re res=0,tmp;\r\n    for(re i=1;i<=5;++i)\r\n    for(re j=1;j<=5;++j)\r\n    {\r\n\t\tif(u.a[i][j]=='*')tmp=(i-1)*5+j;\r\n\t\tres+=((int)(u.a[i][j]^48))<<((i-1)*5+j-1);\r\n\t}\r\n    return res-133331*tmp+1331*tmp;\r\n}\r\ninline void swp(register char&x,register char&y){register char w=x;x=y,y=w;}\r\nint main()\r\n    scanf(\"%d\",&T),bu=8;\r\n    mu.a[1][1]=mu.a[1][2]=mu.a[1][3]=mu.a[1][4]=mu.a[1][5]=49;\r\n    mu.a[2][1]=48,mu.a[2][2]=mu.a[2][3]=mu.a[2][4]=mu.a[2][5]=49;\r\n    mu.a[3][1]=mu.a[3][2]=48,mu.a[3][3]='*',mu.a[3][4]=mu.a[3][5]=49;\r\n    mu.a[4][1]=mu.a[4][2]=mu.a[4][3]=mu.a[4][4]=48,mu.a[4][5]=49;\r\n    mu.a[5][1]=mu.a[5][2]=mu.a[5][3]=mu.a[5][4]=mu.a[5][5]=48;\r\n    mu.ha=haxi(mu);\r\n    for(re i=1;i<=T;++i)\r\n    {\r\n        for(re j=1;j<=5;++j)scanf(\" %s\",chu[i].a[j]+1);\r\n        chu[i].ha=haxi(chu[i]);\r\n    }\r\n    q.push(mu),mp[mu.ha]=0;\r\n    while(!q.empty())\r\n    {\r\n        register ju u=q.front();\r\n        if(u.dep==bu){while(!q.empty())q.pop();break;}\r\n        q.pop();\r\n        re cx,cy;\r\n        for(re i=1;i<=5;++i)\r\n        for(re j=1;j<=5;++j)\r\n        if(u.a[i][j]=='*'){cx=i,cy=j;goto end;}\r\n        end:;\r\n        for(re i=0,nx,ny;i<8;++i)\r\n        {\r\n            nx=cx+mx[i],ny=cy+my[i];\r\n            if(nx<=0||ny<=0||nx>5||ny>5)continue;\r\n            register ju v=u;\r\n            swp(v.a[cx][cy],v.a[nx][ny]),v.ha=haxi(v),v.dep=u.dep+1;\r\n            if(mp.find(v.ha)==mp.end())mp[v.ha]=v.dep,q.push(v);\r\n        }\r\n    }\r\n    bu=7;\r\n    for(re h=1;h<=T;++h)\r\n    {\r\n        st.clear();\r\n        if(mp.find(chu[h].ha)!=mp.end()){printf(\"%d\\n\",mp[chu[h].ha]);continue;}\r\n        q.push(chu[h]),st[chu[h].ha]=0;\r\n        while(!q.empty())\r\n        {\r\n            register ju u=q.front();\r\n            q.pop();\r\n            if(u.dep==bu+1){while(!q.empty())q.pop();printf(\"-1\\n\");break;}\r\n            if(mp.find(u.ha)!=mp.end())\r\n            {\r\n                printf(\"%d\\n\",mp[u.ha]+u.dep);\r\n                while(!q.empty())q.pop();\r\n                break;\r\n            }\r\n            re cx,cy;\r\n            for(re i=1;i<=5;++i)\r\n            for(re j=1;j<=5;++j)\r\n            if(u.a[i][j]=='*'){cx=i,cy=j;goto loop;}\r\n            loop:;\r\n            for(re i=0,nx,ny;i<8;++i)\r\n            {\r\n                nx=cx+mx[i],ny=cy+my[i];\r\n                if(nx<=0||ny<=0||nx>5||ny>5)continue;\r\n                register ju v=u;\r\n                swp(v.a[cx][cy],v.a[nx][ny]),v.ha=haxi(v),v.dep=u.dep+1;\r\n                if(st.find(v.ha)==st.end())st[v.ha]=v.dep,q.push(v);\r\n            }\r\n        }\r\n    }\r\n    return 0;\r\n}",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmp26p805_j/b950f266-37c0-4e18-9702-9998b4d93b6c.cpp:24:5: error: expected initializer before ‘scanf’\n   24 |     scanf(\"%d\",&T),bu=8;\n      |     ^~~~~\n/tmp/tmp26p805_j/b950f266-37c0-4e18-9702-9998b4d93b6c.cpp:25:5: error: ‘mu’ does not name a type; did you mean ‘ju’?\n   25 |     mu.a[1][1]=mu.a[1][2]=mu.a[1][3]=mu.a[1][4]=mu.a[1][5]=49;\n      |     ^~\n      |     ju\n/tmp/tmp26p805_j/b950f266-37c0-4e18-9702-9998b4d93b6c.cpp:26:5: error: ‘mu’ does not name a type; did you mean ‘ju’?\n   26 |     mu.a[2][1]=48,mu.a[2][2]=mu.a[2][3]=mu.a[2][4]=mu.a[2][5]=49;\n      |     ^~\n      |     ju\n/tmp/tmp26p805_j/b950f266-37c0-4e18-9702-9998b4d93b6c.cpp:27:5: error: ‘mu’ does not name a type; did you mean ‘ju’?\n   27 |     mu.a[3][1]=mu.a[3][2]=48,mu.a[3][3]='*',mu.a[3][4]=mu.a[3][5]=49;\n      |     ^~\n      |     ju\n/tmp/tmp26p805_j/b950f266-37c0-4e18-9702-9998b4d93b6c.cpp:28:5: error: ‘mu’ does not name a type; did you mean ‘ju’?\n   28 |     mu.a[4][1]=mu.a[4][2]=mu.a[4][3]=mu.a[4][4]=48,mu.a[4][5]=49;\n      |     ^~\n      |     ju\n/tmp/tmp26p805_j/b950f266-37c0-4e18-9702-9998b4d93b6c.cpp:29:5: error: ‘mu’ does not name a type; did you mean ‘ju’?\n   29 |     mu.a[5][1]=mu.a[5][2]=mu.a[5][3]=mu.a[5][4]=mu.a[5][5]=48;\n      |     ^~\n      |     ju\n/tmp/tmp26p805_j/b950f266-37c0-4e18-9702-9998b4d93b6c.cpp:30:5: error: ‘mu’ does not name a type; did you mean ‘ju’?\n   30 |     mu.ha=haxi(mu);\n      |     ^~\n      |     ju\n/tmp/tmp26p805_j/b950f266-37c0-4e18-9702-9998b4d93b6c.cpp:31:5: error: expected unqualified-id before ‘for’\n   31 |     for(re i=1;i<=T;++i)\n      |     ^~~\n/tmp/tmp26p805_j/b950f266-37c0-4e18-9702-9998b4d93b6c.cpp:31:16: error: ‘i’ does not name a type\n   31 |     for(re i=1;i<=T;++i)\n      |                ^\n/tmp/tmp26p805_j/b950f266-37c0-4e18-9702-9998b4d93b6c.cpp:31:21: error: expected unqualified-id before ‘++’ token\n   31 |     for(re i=1;i<=T;++i)\n      |                     ^~\n/tmp/tmp26p805_j/b950f266-37c0-4e18-9702-9998b4d93b6c.cpp:36:5: error: ‘q’ does not name a type\n   36 |     q.push(mu),mp[mu.ha]=0;\n      |     ^\n/tmp/tmp26p805_j/b950f266-37c0-4e18-9702-9998b4d93b6c.cpp:37:5: error: expected unqualified-id before ‘while’\n   37 |     while(!q.empty())\n      |     ^~~~~\n/tmp/tmp26p805_j/b950f266-37c0-4e18-9702-9998b4d93b6c.cpp:56:5: error: ‘bu’ does not name a type; did you mean ‘ju’?\n   56 |     bu=7;\n      |     ^~\n      |     ju\n/tmp/tmp26p805_j/b950f266-37c0-4e18-9702-9998b4d93b6c.cpp:57:5: error: expected unqualified-id before ‘for’\n   57 |     for(re h=1;h<=T;++h)\n      |     ^~~\n/tmp/tmp26p805_j/b950f266-37c0-4e18-9702-9998b4d93b6c.cpp:57:16: error: ‘h’ does not name a type\n   57 |     for(re h=1;h<=T;++h)\n      |                ^\n/tmp/tmp26p805_j/b950f266-37c0-4e18-9702-9998b4d93b6c.cpp:57:21: error: expected unqualified-id before ‘++’ token\n   57 |     for(re h=1;h<=T;++h)\n      |                     ^~\n/tmp/tmp26p805_j/b950f266-37c0-4e18-9702-9998b4d93b6c.cpp:88:5: error: expected unqualified-id before ‘return’\n   88 |     return 0;\n      |     ^~~~~~\n/tmp/tmp26p805_j/b950f266-37c0-4e18-9702-9998b4d93b6c.cpp:89:1: error: expected declaration before ‘}’ token\n   89 | }\n      | ^\n"
        ],
        "tcb_id": "骑士精神"
    },
    {
        "code_id": 1,
        "code": "#pragma GCC optimize(3)\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"inline\")\n#pragma GCC optimize(\"-fgcse\")\n#pragma GCC optimize(\"-fgcse-lm\")\n#pragma GCC optimize(\"-fipa-sra\")\n#pragma GCC optimize(\"-ftree-pre\")\n#pragma GCC optimize(\"-ftree-vrp\")\n#pragma GCC optimize(\"-fpeephole2\")\n#pragma GCC optimize(\"-ffast-math\")\n#pragma GCC optimize(\"-fsched-spec\")\n#pragma GCC optimize(\"unroll-loops\")\n#pragma GCC optimize(\"-falign-jumps\")\n#pragma GCC optimize(\"-falign-loops\")\n#pragma GCC optimize(\"-falign-labels\")\n#pragma GCC optimize(\"-fdevirtualize\")\n#pragma GCC optimize(\"-fcaller-saves\")\n#pragma GCC optimize(\"-fcrossjumping\")\n#pragma GCC optimize(\"-fthread-jumps\")\n#pragma GCC optimize(\"-funroll-loops\")\n#pragma GCC optimize(\"-fwhole-program\")\n#pragma GCC optimize(\"-freorder-blocks\")\n#pragma GCC optimize(\"-fschedule-insns\")\n#pragma GCC optimize(\"inline-functions\")\n#pragma GCC optimize(\"-ftree-tail-merge\")\n#pragma GCC optimize(\"-fschedule-insns2\")\n#pragma GCC optimize(\"-fstrict-aliasing\")\n#pragma GCC optimize(\"-fstrict-overflow\")\n#pragma GCC optimize(\"-falign-functions\")\n#pragma GCC optimize(\"-fcse-skip-blocks\")\n#pragma GCC optimize(\"-fcse-follow-jumps\")\n#pragma GCC optimize(\"-fsched-interblock\")\n#pragma GCC optimize(\"-fpartial-inlining\")\n#pragma GCC optimize(\"no-stack-protector\")\n#pragma GCC optimize(\"-freorder-functions\")\n#pragma GCC optimize(\"-findirect-inlining\")\n#pragma GCC optimize(\"-fhoist-adjacent-loads\")\n#pragma GCC optimize(\"-frerun-cse-after-loop\")\n#pragma GCC optimize(\"inline-small-functions\")\n#pragma GCC optimize(\"-finline-small-functions\")\n#pragma GCC optimize(\"-ftree-switch-conversion\")\n#pragma GCC optimize(\"-foptimize-sibling-calls\")\n#pragma GCC optimize(\"-fexpensive-optimizations\")\n#pragma GCC optimize(\"-funsafe-loop-optimizations\")\n#pragma GCC optimize(\"inline-functions-called-once\")\n#pragma GCC optimize(\"-fdelete-null-pointer-checks\")\n#include <stdio.h>\n#include <assert.h>\n#include <dlfcn.h>\n#include <string.h>\n#include <gmp.h>\n#include <string>\n#include <unordered_map>\n\nusing namespace std;\n\nstatic_assert(sizeof(unsigned long) == 8);\n\n// dynamic loading for LOJ (useful for machine that is not Intel)\n// for Intel : use setenv(\"LD_PRELOAD\", LIB_PATH, 1) and popen+objdump (but need to access fork() / pipe() and memory allocate)\nstruct DLL \n{\n    void *handle;\n    unordered_map<string, void *> syms;\n    DLL(const char *file) : handle(dlopen(file, RTLD_LAZY)) {}\n    ~DLL() { dlclose(handle); }\n    void *find_name(const char *name) \n    {\n        if (unordered_map<string, void *>::iterator it = syms.find(name); it != syms.end()) \n            return it->second;\n        else\n            return syms[name] = dlsym(handle, name);\n    }\n    template <typename R = void, typename... T>\n    R call(const char *name, T... t) \n    {\n        auto func = reinterpret_cast<R(*)(T...)>(find_name(name));\n        return func(t...);\n    };\n};\n\nDLL GMP(\"/usr/lib/x86_64-linux-gnu/libgmp.so.10\");\n\nstruct fastIO\n{\n    static const int BUFF_SZ = 1 << 18;\n    char inbuf[BUFF_SZ], outbuf[BUFF_SZ];\n    fastIO()\n    {\n        setvbuf(stdin, inbuf, _IOFBF, BUFF_SZ);\n        setvbuf(stdout, outbuf, _IOFBF, BUFF_SZ);\n    }\n} IO;\nint radix_a, radix_b;\nint len_a, len_b;\nchar A[1000005], B[1000005];\nint main()\n{\n    scanf(\"%d%d%s\", &radix_a, &radix_b, A);\n    mpz_t a;\n    GMP.call(\"__gmpz_init\", a);\n    GMP.call(\"__gmpz_set_str\", a, A, radix_a);\n    GMP.call(\"__gmpz_get_str\", B, radix_b, a);\n    puts(B);\n    GMP.call(\"__gmpz_clear\", a);\n}\n",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmp6dkr53xe/d1f26833-98d6-4678-8cc8-f3fd83b6b0cc.cpp:51:10: fatal error: gmp.h: No such file or directory\n   51 | #include <gmp.h>\n      |          ^~~~~~~\ncompilation terminated.\n"
        ],
        "tcb_id": "高精度进制转换"
    },
    {
        "code_id": 5,
        "code": "// This code wrote by chtholly_micromaker(Myukiyomekya)\n#include <bits/stdc++.h>\n#define reg\n#define int long long\n#define ALL(x) (x).begin(),(x).end()\n#define mem(x,y) memset(x,y,sizeof x)\n#define sz(x) (int)(x).size()\n#define ln putchar('\\n')\n#define lsp putchar(32)\n#define pb push_back\n#define MP std::make_pair\n#define MT std::make_tuple\n#ifdef _LOCAL_\n#define dbg(x) std::cerr<<__func__<<\"\\tLine:\"<<__LINE__<<' '<<#x<<\": \"<<x<<\"\\n\"\n#define dprintf(x...) std::fprintf(stderr,x)\n#else\n#define dbg(x) 42\n#define dprintf(x...) 42\n#endif\n#define rep(i,a,b) for(int i=(a);i<=(b);++i)\n#define per(i,b,a) for(int i=(b);i>=(a);--i)\ntypedef std::pair<int,int> pii;\ntypedef std::vector<int> poly;\ntemplate <class t> inline void read(t &s){s=0;\nsigned f=1;char c=getchar();while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}\nwhile(isdigit(c))s=(s<<3)+(s<<1)+(c^48),c=getchar();;s*=f;}\ntemplate<class t,class ...A> inline void read(t &x,A &...a){read(x);read(a...);}\ntemplate <class t> inline void write(t x){if(x<0)putchar('-'),x=-x;\nstatic int buf[50],top=0;while(x)buf[++top]=x%10,x/=10;if(!top)buf[++top]=0;\nwhile(top)putchar(buf[top--]^'0');}\ninline void setIO(std::string s=\"\"){setIn(s+\".in\");setOut(s+\".out\");return;}\ntemplate <class t>inline bool ckmin(t&x,t y){if(x>y){x=y;return 1;}return 0;}\ntemplate <class t>inline bool ckmax(t&x,t y){if(x<y){x=y;return 1;}return 0;}\ninline int lowbit(int x){return x&(-x);}\ntypedef unsigned long long ull;\nconst int MaxN=1050;\nconst int MaxM=1919810;\nconst int inf=2e18;\nstruct MaxFlow\n{\n\tstruct Edge{int nxt,to,f;}E[1919810];\n\tint hd[MaxN],en=-1,S,T;\n\tinline void adde(int u,int v,int f)\n\t{\n\t\tE[++en]=(Edge){hd[u],v,f},hd[u]=en,std::swap(u,v),f=0;\n\t\tE[++en]=(Edge){hd[u],v,f},hd[u]=en;\n\t}\n\tint dep[MaxN],vis[MaxN];\n\tsigned Q[1<<21],h,t;\n\tinline void init(int _s,int _t){S=_s,T=_t,std::mem(hd,-1),en=-1;}\n\tinline bool bfs()\n\t{\n\t\tstd::mem(dep,0),std::mem(vis,-1),vis[S]=hd[S],dep[S]=1,Q[h=t=1]=S;\n\t\twhile(h<=t)\n\t\t{\n\t\t\tint u=Q[h++];\n\t\t\tfor(int i=hd[u];~i;i=E[i].nxt)\n\t\t\t{\n\t\t\t\tint v=E[i].to;\n\t\t\t\tif(!E[i].f||dep[v])continue;\n\t\t\t\tdep[v]=dep[u]+1,vis[v]=hd[v],Q[++t]=v;\n\t\t\t\tif(v==T)return true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\tinline int dfs(int u,int flow)\n\t{\n\t\tif(u==T)return flow;\n\t\tint ret=0,t;\n\t\tfor(int i=vis[u];~i;vis[u]=i=E[i].nxt)\n\t\t{\n\t\t\tint v=E[i].to;\n\t\t\tif(!E[i].f||dep[v]!=dep[u]+1)continue;\n\t\t\tif(!(t=dfs(v,std::min(flow,E[i].f))))\n\t\t\t{\n\t\t\t\tdep[v]=-inf;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tret+=t,flow-=t,E[i].f-=t,E[i^1].f+=t;\n\t\t\tif(!flow)break;\n\t\t}\n\t\treturn ret;\n\t}\n\tinline int dinic()\n\t{\n\t\tint mf=0;\n\t\twhile(bfs())mf+=dfs(S,inf);\n\t\treturn mf;\n\t}\n\tint op[MaxN];\n\tinline void find(int u)\n\t{\n\t\tif(op[u])return;\n\t\top[u]=1;\n\t\tfor(int i=hd[u];~i;i=E[i].nxt)if(E[i].f)find(E[i].to);\n\t}\n\tinline void findcut(){std::mem(op,0),find(S);}\n}mf;\null c[MaxN];\nint v[MaxN],a[MaxN],b[MaxN],n,m;\nstruct Bas\n{\n\tull p[66];\n\tBas(){std::mem(p,0);}\n\tinline int insert(ull x)\n\t{\n\t\tper(i,m-1,0)if(x>>i&1)\n\t\t{\n\t\t\tif(!p[i])return p[i]=x,i;\n\t\t\tx^=p[i];\n\t\t}\n\t\treturn -1;\n\t}\n}f;\npoly E[MaxN];\nint ans[MaxN],in[MaxN];\ninline int calc(int i,int x){return (x-v[i])*(x-v[i]);}\ninline void divide(poly &d,int l,int r)\n{\n\tif(l>r||!d.size())return;\n\tif(l==r)\n\t{\n\t\tfor(auto i:d)ans[i]=l;\n\t\treturn;\n\t}\n\tint S=0,T=MaxN-1,N=(int)d.size();\n\tif(r-l==1)\n\t{\n\t\tmf.init(S,T);\n\t\trep(i,1,N)in[d[i-1]]=i;\n\t\trep(i,1,N)\n\t\t{\n\t\t\tint u=d[i-1],cl=calc(u,l),cr=calc(u,r);\n\t\t\tif(cl==cr)continue;\n\t\t\tif(cl>cr)mf.adde(S,i,cl-cr);\n\t\t\telse mf.adde(i,T,cr-cl);\n\t\t}\n\t\tfor(auto u:d)for(auto v:E[u])if(in[v])mf.adde(in[u],in[v],inf);\n\t\tmf.dinic(),mf.findcut();\n\t\trep(i,1,N)if(!mf.op[i])ans[d[i-1]]=l;else ans[d[i-1]]=r;\n\t\tfor(auto u:d)in[u]=0;\n\t\treturn;\n\t}\n\tint mid=(l+r)>>1;\n\tmf.init(S,T);\n\trep(i,1,N)in[d[i-1]]=i;\n\trep(i,1,N)\n\t{\n\t\tint u=d[i-1],c=(mid-v[u])<<1;\n\t\tif(!c)continue;\n\t\tif(c>0)mf.adde(i,T,c);\n\t\telse mf.adde(S,i,-c);\n\t}\n\tfor(auto u:d)for(auto v:E[u])if(in[v])mf.adde(in[u],in[v],inf);\n\tmf.dinic(),mf.findcut();\n\tpoly L,R;\n\trep(i,1,N)if(!mf.op[i])L.pb(d[i-1]);else R.pb(d[i-1]);\n\tfor(auto u:d)in[u]=0;\n\tdivide(L,l,mid),divide(R,mid,r);\n}\nsigned main(void)\n{\n\tread(n,m);\n\trep(i,1,n)read(c[i]);\n\trep(i,1,n)read(v[i]);\n\trep(i,1,m)read(a[i]);\n\trep(i,1,m)read(b[i]);\n\tint t;\n\trep(i,1,m)\n\t{\n\t\tf=Bas();\n\t\trep(j,1,m)if(i^j)f.insert(c[a[j]]);\n\t\trep(j,1,n)if((j^a[i])&&~(t=f.insert(c[j])))f.p[t]=0,E[a[i]].pb(j);\n\t}\n\trep(i,1,m)\n\t{\n\t\tf=Bas();\n\t\trep(j,1,m)if(i^j)f.insert(c[b[j]]);\n\t\trep(j,1,n)if((j^b[i])&&~(t=f.insert(c[j])))f.p[t]=0,E[j].pb(b[i]);\n\t}\n\tpoly dr;\n\trep(i,1,n)dr.pb(i);\n\tdivide(dr,0,1e6);\n\tint ans=0;\n\trep(i,1,n)ans+=calc(i,::ans[i]);\n\twrite(ans),ln;\n\treturn 0;\n}\n\n/*\n * Check List:\n * 1. Input / Output File (OI)\n * 2. long long \n * 3. Special Test such as n=1\n * 4. Array Size\n * 5. Memory Limit (OI) int is 4 and longlong is 8\n * 6. Mod (a*b%p*c%p not a*b*c%p  ,  (a-b+p)%p not a-b )\n * 7. Name ( int k; for(int k...))\n * 8. more tests , (T=2 .. more)\n * 9. blank \\n after a case\n*/\n\n\n\n\n",
        "status": [
            "CE"
        ],
        "details": [
            "/tmp/tmp4cktc1mx/4814603c-1745-4d36-a49c-10c21b15842a.cpp: In function ‘void setIO(std::string)’:\n/tmp/tmp4cktc1mx/4814603c-1745-4d36-a49c-10c21b15842a.cpp:31:37: error: ‘setIn’ was not declared in this scope; did you mean ‘setIO’?\n   31 | inline void setIO(std::string s=\"\"){setIn(s+\".in\");setOut(s+\".out\");return;}\n      |                                     ^~~~~\n      |                                     setIO\n/tmp/tmp4cktc1mx/4814603c-1745-4d36-a49c-10c21b15842a.cpp:31:52: error: ‘setOut’ was not declared in this scope; did you mean ‘setbuf’?\n   31 | inline void setIO(std::string s=\"\"){setIn(s+\".in\");setOut(s+\".out\");return;}\n      |                                                    ^~~~~~\n      |                                                    setbuf\n"
        ],
        "tcb_id": "魔法商店"
    }
]