![\"\"](\"https:\/\/bytew.net\/wp-content\/uploads\/2020\/10\/\u622a\u5c4f2020-10-17-\u4e0b\u53485.20.06-1024x678.png\")
<\/figure>\n\n\n\n\n\n\n\n\u6bd4\u8d5b\u4f53\u9a8c\u4e00\u822c\u3002\u6ca1\u4eba\u56de\u7b54\u95ee\u9898\uff0c\u8bc4\u6d4bqueue\u957f\u8fbe15\u5206\u949f\u3002<\/p>\n\n\n\n <\/p>\n\n\n\n \u53ef\u80fd\u8d62\u4e86 \u53ef\u80fd\u6ca1\u8d62 UPD:\u8d62\u4e86\uff0c\u723d\u554a\u3002\u3002\u8c01\u77e5\u9053\u7b2c\u4e8c\u540d\u591a\u5c11\u5206\uff1f<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"_links":{"self":[{"href":"https:\/\/bytew.net\/index.php?rest_route=\/wp\/v2\/posts\/545"}],"collection":[{"href":"https:\/\/bytew.net\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/bytew.net\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/bytew.net\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/bytew.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=545"}],"version-history":[{"count":2,"href":"https:\/\/bytew.net\/index.php?rest_route=\/wp\/v2\/posts\/545\/revisions"}],"predecessor-version":[{"id":549,"href":"https:\/\/bytew.net\/index.php?rest_route=\/wp\/v2\/posts\/545\/revisions\/549"}],"wp:attachment":[{"href":"https:\/\/bytew.net\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=545"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/bytew.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=545"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/bytew.net\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=545"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}![\"\"](\"https:\/\/bytew.net\/wp-content\/uploads\/2020\/10\/\u622a\u5c4f2020-10-17-\u4e0b\u53485.20.50-1024x670.png\")
<\/figure>\n\n\n\n#include <bits\/stdc++.h>\nusing namespace std;\n\ntemplate <typename A, typename B>string to_string(pair<A, B> p);template <typename A, typename B, typename C>string to_string(tuple<A, B, C> p);template <typename A, typename B, typename C, typename D>string to_string(tuple<A, B, C, D> p);string to_string(const string& s) { return '\"' + s + '\"';}string to_string(const char* s) { return to_string((string) s);}string to_string(bool b) { return (b ? \"true\" : \"false\");}string to_string(vector<bool> v) { bool first = true; string res = \"{\"; for (int i = 0; i < static_cast<int>(v.size()); i++) { if (!first) { res += \", \"; } first = false; res += to_string(v[i]); } res += \"}\"; return res;}template <size_t N>string to_string(bitset<N> v) { string res = \"\"; for (size_t i = 0; i < N; i++) { res += static_cast<char>('0' + v[i]); } return res;}template <typename A>string to_string(A v) { bool first = true; string res = \"{\"; for (const auto &x : v) { if (!first) { res += \", \"; } first = false; res += to_string(x); } res += \"}\"; return res;}template <typename A, typename B>string to_string(pair<A, B> p) { return \"(\" + to_string(p.first) + \", \" + to_string(p.second) + \")\";}template <typename A, typename B, typename C>string to_string(tuple<A, B, C> p) { return \"(\" + to_string(get<0>(p)) + \", \" + to_string(get<1>(p)) + \", \" + to_string(get<2>(p)) + \")\";}template <typename A, typename B, typename C, typename D>string to_string(tuple<A, B, C, D> p) { return \"(\" + to_string(get<0>(p)) + \", \" + to_string(get<1>(p)) + \", \" + to_string(get<2>(p)) + \", \" + to_string(get<3>(p)) + \")\";}void debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) { cerr << \" \" << to_string(H); debug_out(T...);}\n\n#ifdef LOCAL\n#define debug(...) cerr << \"[\" << #__VA_ARGS__ << \"]:\", debug_out(__VA_ARGS__)\n#else\n#define debug(...) 42\n#endif\n\n#define set0(x) memset(x,0,sizeof(x))\n#define F first\n#define S second\n#define PB push_back\n#define MP make_pair\n#define rep(i, a, b) for(int i = a; i < (b); ++i)\n#define trav(a, x) for(auto& a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\ntypedef pair<double,int> pdi;\ntemplate<typename T> void read(T &x){\n x = 0;char ch = getchar();ll f = 1;\n while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}\n while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;\n}\ntemplate<typename T, typename... Args> void read(T &first, Args& ... args) {\n read(first);\n read(args...);\n}\n\nint n,l,m,cap,vc[2020];\nstruct edge{\n int to,tc;\n double cost;\n};\nvector<edge> edges[2020];\n\ndouble md[10000010];\nint fr[10000010];\n\nint main() {\n read(n,l,m,cap);\n cout<<setprecision(6)<<fixed;\n for(int i=1;i<=l;i++){\n read(vc[i]);\n }\n for(int i=1;i<=m;i++){\n int fr,to,co;\n double prob;\n scanf(\"%d%d%lf%d\",&fr,&to,&prob,&co);\n if(prob!=1) edges[fr].PB({to,co,-log(1-prob)});\n else edges[fr].PB({to,co,1e8});\n }\n for(int i=0;i<10000010;i++)md[i] = 1e18;\n priority_queue<pdi,vector<pdi>,greater<pdi>> Pq;\n Pq.push(MP(0.0,0));\n md[0] = 0;\n while(!Pq.empty()){\n pdi C = Pq.top();Pq.pop();\n if(C.F>md[C.S])continue;\n int a = (C.S>5000000),b = C.S-(a?5000000:0),c = b%2001,d = b\/2001;\n if(a && d == 0){\n vector<int> V;\n int ct = C.S;\n int id = 0;\n while(ct!=0){\n int C = (ct%5000000)\/2001;\n if(V.size() && V.back() == C){\n id = C;\n }else{\n V.PB(C);\n }\n ct = fr[ct];\n }\n V.PB(ct);\n reverse(all(V));\n cout<<id<<endl;\n cout<<c<<endl;\n cout<<1.0-exp(-C.F)<<endl;\n for(int i=0;i<V.size();i++){\n cout<<V[i]<<\" \\n\"[i == V.size()-1]; \n }\n return 0;\n }\n if(!a && d<=l && d>=1 && c+vc[d]<=cap){\n int tgt = C.S+5000000+vc[d];\n if(md[tgt]>C.F){\n md[tgt] = C.F;\n fr[tgt] = C.S;\n Pq.push(MP(C.F,tgt));\n }\n }\n for(auto ct:edges[d]){\n if(c+ct.tc>cap)continue;\n int tgt = ct.to*2001+c+ct.tc+(a?5000000:0);\n if(md[tgt]>C.F+ct.cost){\n md[tgt] = C.F+ct.cost;\n fr[tgt] = C.S;\n Pq.push(MP(C.F+ct.cost,tgt));\n }\n }\n }\n return 0;\n}<\/code><\/pre>\n\n\n\n#include <bits\/stdc++.h>\n#include <stdio.h>\nusing namespace std;\n\ntemplate <typename A, typename B>string to_string(pair<A, B> p);template <typename A, typename B, typename C>string to_string(tuple<A, B, C> p);template <typename A, typename B, typename C, typename D>string to_string(tuple<A, B, C, D> p);string to_string(const string& s) { return '\"' + s + '\"';}string to_string(const char* s) { return to_string((string) s);}string to_string(bool b) { return (b ? \"true\" : \"false\");}string to_string(vector<bool> v) { bool first = true; string res = \"{\"; for (int i = 0; i < static_cast<int>(v.size()); i++) { if (!first) { res += \", \"; } first = false; res += to_string(v[i]); } res += \"}\"; return res;}template <size_t N>string to_string(bitset<N> v) { string res = \"\"; for (size_t i = 0; i < N; i++) { res += static_cast<char>('0' + v[i]); } return res;}template <typename A>string to_string(A v) { bool first = true; string res = \"{\"; for (const auto &x : v) { if (!first) { res += \", \"; } first = false; res += to_string(x); } res += \"}\"; return res;}template <typename A, typename B>string to_string(pair<A, B> p) { return \"(\" + to_string(p.first) + \", \" + to_string(p.second) + \")\";}template <typename A, typename B, typename C>string to_string(tuple<A, B, C> p) { return \"(\" + to_string(get<0>(p)) + \", \" + to_string(get<1>(p)) + \", \" + to_string(get<2>(p)) + \")\";}template <typename A, typename B, typename C, typename D>string to_string(tuple<A, B, C, D> p) { return \"(\" + to_string(get<0>(p)) + \", \" + to_string(get<1>(p)) + \", \" + to_string(get<2>(p)) + \", \" + to_string(get<3>(p)) + \")\";}void debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) { cerr << \" \" << to_string(H); debug_out(T...);}\n\n#ifdef LOCAL\n#define debug(...) cerr << \"[\" << #__VA_ARGS__ << \"]:\", debug_out(__VA_ARGS__)\n#else\n#define debug(...) 42\n#endif\n\n#define set0(x) memset(x,0,sizeof(x))\n#define F first\n#define S second\n#define PB push_back\n#define MP make_pair\n#define rep(i, a, b) for(int i = a; i < (b); ++i)\n#define trav(a, x) for(auto& a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\ntemplate<typename T> void read(T &x){\n x = 0;char ch = getchar();ll f = 1;\n while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}\n while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;\n}\ntemplate<typename T, typename... Args> void read(T &first, Args& ... args) {\n read(first);\n read(args...);\n}\n\nstring Fsys[18000000];\n\nint Fcnt = 0;\nint filemp[5050][5050];\nbool fileown[5050][5050];\nbool cmp[5050][5050];\n\nmap<string,int> Files,Commits;\nstring Fname[5050];\n\nchar op[150],name[150],name1[150],name2[150],File[400];\n\nint N,offset,len;\nint wcmt = 0,wcac = 1,cac_emp = 1;\n\nvoid Mgtline(char *Tgt){\n while(1){\n char ch= getchar();\n if(ch == '\\n'){\n *Tgt = 0;\n return;\n }else{\n *Tgt = ch;\n Tgt++;\n }\n }\n}\n\nvoid make_cac(){\n if(!cac_emp)return;\n cac_emp = 0;\n int T = Files.size();\n for(int i=1;i<=T;i++){\n filemp[wcac][i] = filemp[wcmt][i];\n }\n}\n\nint main() {\n read(N);\n for(int opn = 1;opn<=N;opn++){\n scanf(\"%s\",op);\n if(op[0] == 'w'){\n make_cac();\n scanf(\"%s\",name);\n read(offset,len);\n string Sname(name);\n if(!Files.count(Sname)){\n int cnid = Files.size()+1;\n Files[Sname] = cnid;\n Fname[cnid] = Sname;\n for(int j=1;j<cnid;j++){\n cmp[j][cnid] = Fname[j]>Fname[cnid];\n cmp[cnid][j] = !cmp[j][cnid];\n }\n }\n int FNid = Files[Sname];\n int Fid = filemp[wcac][FNid];\n \n if(Fid<=0){\n Fid = ++Fcnt;\n filemp[wcac][FNid] = Fid;\n fileown[wcac][FNid] = 1;\n }\n if(!fileown[wcac][FNid]){\n Fid = ++Fcnt;\n Fsys[Fid] = Fsys[filemp[wcac][FNid]];\n filemp[wcac][FNid] = Fid;\n fileown[wcac][FNid] = 1;\n }\n if(Fsys[Fid].length()<offset+len)Fsys[Fid].resize(offset+len,'.');\n Mgtline(File);\n for(int i=0;i<len;i++)Fsys[Fid][offset+i] = File[i];\n }\n if(op[0] == 'r'){\n scanf(\"%s\",name);\n read(offset,len);\n string Sname(name);\n if(!Files.count(Sname)){\n for(int i=0;i<len;i++)putchar('.');\n putchar('\\n');\n continue;\n }\n int FNid = Files[Sname];\n int Fid = filemp[wcac][FNid]?filemp[wcac][FNid]:filemp[wcmt][FNid];\n if(Fid<=0){\n for(int i=0;i<len;i++)putchar('.');\n putchar('\\n');\n continue;\n }\n for(int i=0;i<len;i++)putchar((offset+i)<Fsys[Fid].size()?Fsys[Fid][offset+i]:'.');\n putchar('\\n');\n }\n if(op[0] == 'u'){\n scanf(\"%s\",name);\n string Sname(name);\n if(!Files.count(Sname)){\n continue;\n }\n int FNid = Files[Sname];\n int Fid = filemp[wcac][FNid]?filemp[wcac][FNid]:filemp[wcmt][FNid];\n if(Fid<=0) continue;\n make_cac();\n ++Fcnt;\n filemp[wcac][FNid] = -Fcnt;\n }\n if(op[0] == 'l'){\n int t = Files.size();\n int cnt = 0,mi,mx;\n for(int i=1;i<=t;i++){\n int Fid = filemp[wcac][i]?filemp[wcac][i]:filemp[wcmt][i];\n if(Fid<=0) continue;\n cnt+=1;\n if(cnt == 1){\n mi = mx = i;\n }else{\n if(cmp[mi][i])mi = i;\n if(cmp[i][mx])mx = i;\n }\n }\n if(cnt == 0)cout<<\"0\\n\";\n else{\n cout<<cnt<<' '<<Fname[mi]<<' '<<Fname[mx]<<\"\\n\";\n }\n }\n if(op[0] == 'c' && op[1] == 'o'){\n scanf(\"%s\",name);\n string Sname(name);\n if(Commits.count(Sname) || cac_emp){\n debug(\"Commit Skipped\");\n continue;\n }\n Commits[Sname] = wcac;\n wcmt = wcac;\n wcac = Commits.size()+1;\n cac_emp = 1;\n }\n if(op[0] == 'c' && op[1] == 'h'){\n scanf(\"%s\",name);\n string Sname(name);\n if(!Commits.count(Sname) || !cac_emp){\n debug(\"Checkout Skipped\");\n continue;\n }\n wcmt = Commits[Sname];\n }\n if(op[0] == 'm'){\n scanf(\"%s%s\",name1,name2);\n string S1(name1),S2(name2);\n if(Commits.count(S2) || !Commits.count(S1) || Commits[S1] == wcmt || !cac_emp){\n debug(\"Merge Skipped\");\n continue;\n }\n int wcmt2 = Commits[S1];\n int T = Files.size();\n for(int i=1;i<=T;i++){\n if(abs(filemp[wcmt][i])>abs(filemp[wcmt2][i])) filemp[wcac][i] = filemp[wcmt][i];\n else filemp[wcac][i] = filemp[wcmt2][i];\n }\n Commits[S2] = wcac;\n wcmt = wcac;\n wcac = Commits.size()+1;\n cac_emp = 1;\n }\n }\n return 0;\n}<\/code><\/pre>\n\n\n\n#include \"gc.h\"\n\n#include <bits\/stdc++.h>\nusing namespace std;\n\ntemplate <typename A, typename B>string to_string(pair<A, B> p);template <typename A, typename B, typename C>string to_string(tuple<A, B, C> p);template <typename A, typename B, typename C, typename D>string to_string(tuple<A, B, C, D> p);string to_string(const string& s) { return '\"' + s + '\"';}string to_string(const char* s) { return to_string((string) s);}string to_string(bool b) { return (b ? \"true\" : \"false\");}string to_string(vector<bool> v) { bool first = true; string res = \"{\"; for (int i = 0; i < static_cast<int>(v.size()); i++) { if (!first) { res += \", \"; } first = false; res += to_string(v[i]); } res += \"}\"; return res;}template <size_t N>string to_string(bitset<N> v) { string res = \"\"; for (size_t i = 0; i < N; i++) { res += static_cast<char>('0' + v[i]); } return res;}template <typename A>string to_string(A v) { bool first = true; string res = \"{\"; for (const auto &x : v) { if (!first) { res += \", \"; } first = false; res += to_string(x); } res += \"}\"; return res;}template <typename A, typename B>string to_string(pair<A, B> p) { return \"(\" + to_string(p.first) + \", \" + to_string(p.second) + \")\";}template <typename A, typename B, typename C>string to_string(tuple<A, B, C> p) { return \"(\" + to_string(get<0>(p)) + \", \" + to_string(get<1>(p)) + \", \" + to_string(get<2>(p)) + \")\";}template <typename A, typename B, typename C, typename D>string to_string(tuple<A, B, C, D> p) { return \"(\" + to_string(get<0>(p)) + \", \" + to_string(get<1>(p)) + \", \" + to_string(get<2>(p)) + \", \" + to_string(get<3>(p)) + \")\";}void debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) { cerr << \" \" << to_string(H); debug_out(T...);}\n\n#ifdef LOCAL\n#define debug(...) cerr << \"[\" << #__VA_ARGS__ << \"]:\", debug_out(__VA_ARGS__)\n#else\n#define debug(...) 42\n#endif\n\n#define set0(x) memset(x,0,sizeof(x))\n#define F first\n#define S second\n#define PB push_back\n#define MP make_pair\n#define rep(i, a, b) for(int i = a; i < (b); ++i)\n#define trav(a, x) for(auto& a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\ntemplate<typename T> void read(T &x){\n x = 0;char ch = getchar();ll f = 1;\n while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}\n while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;\n}\ntemplate<typename T, typename... Args> void read(T &first, Args& ... args) {\n read(first);\n read(args...);\n}\n\nusing namespace std;\n\nbool vis[1024] = {0};\n\nvoid gc(unsigned char *mem) {\n unsigned char *opt = mem;\n static unsigned char nmem[1024*1024*64];\n int Rn = *((int*)mem);\n queue<int> Q2;\n debug(Rn);\n for(int i=0;i<Rn;i++){\n int pt = ((int*)mem)[i+1];\n debug(pt);\n Q2.push(pt);\n }\n mem+=4*(Rn+1);\n int Tn = *((int*)mem);\n debug(Tn);\n mem+=4;\n vector<int> Tmap[1024][4];\n bool vis[1024] = {0};\n int rewire[1024] = {0};\n for(int i=0;i<Tn;i++){\n int tnt = *((int*)mem);\n debug(tnt);\n mem+=4;\n int cp = 0;\n for(int j=0;j<tnt;j++){\n debug((int)mem[j],cp);\n if(mem[j] == 0){\n Tmap[i][mem[j]].PB(cp);\n cp+=1;\n }\n if(mem[j] == 1){\n if(cp&1)cp+=1;\n Tmap[i][mem[j]].PB(cp);\n cp+=2;\n }\n if(mem[j] >= 2){\n if(cp&3)cp+=4-(cp&3);\n Tmap[i][mem[j]].PB(cp);\n cp+=4;\n }\n }\n mem+=tnt;\n }\n int Hl = *((int*)mem);\n debug(Hl);\n mem+=4;\n unsigned char *old_heap = mem;\n int sz = 0;\n vector<int> wupd_pointers,wupd_clsname;\n queue<int> Q;\n while(!Q2.empty()){\n int C = Q2.front();Q2.pop();\n *((int*)(mem+C)) = *((int*)(mem+C))+2048;\n Q.push(C);\n }\n while(!Q.empty()){\n debug(Q.size());\n int C = Q.front();Q.pop();\n debug(1);\n int typ = *((int*)(mem+C));\n assert(typ<134217728);\n typ = typ&2047;\n vis[typ] = 1;\n wupd_clsname.PB(sz);\n *((int*)(nmem+sz)) = typ;\n *((int*)(mem+C)) = sz+134217728;\n unsigned char* cstr = mem+C+4;\n sz+=4;\n for(auto ct:Tmap[typ][0]){\n nmem[sz] = cstr[ct];\n sz+=1;\n }\n debug(2);\n if(sz&1)sz+=1;\n for(auto ct:Tmap[typ][1]){\n nmem[sz] = cstr[ct];\n nmem[sz+1] = cstr[ct+1];\n sz+=2;\n }\n if(sz&3)sz+=1;\n if(sz&3)sz+=1;\n for(auto ct:Tmap[typ][2]){\n *((int*)(nmem+sz)) = *((int*)(cstr+ct));\n sz+=4;\n }\n debug(3);\n for(auto ct:Tmap[typ][3]){\n debug(ct);\n debug(*((int*)(cstr+ct)));\n int cv = *((int*)(cstr+ct)),cv2 = *((int*)(mem+cv));\n debug(cv);\n debug(cv2);\n debug(sz);\n if(cv == 1){\n *((int*)(nmem+sz)) = 1;\n sz+=4;\n continue;\n }\n if(cv2&134217728) *((int*)(nmem+sz)) = cv2-134217728;\n else{\n wupd_pointers.PB(sz);\n if(!(cv2&2048)){\n *((int*)(mem+cv)) = cv2+2048;\n Q.push(cv);\n }\n *((int*)(nmem+sz)) = cv;\n }\n sz+=4;\n debug(cv,\"end\");\n }\n debug(1235);\n }\n debug(234);\n for(auto ct:wupd_pointers){\n int cv = *((int*)(nmem+ct));\n int cv2 = *((int*)(mem+cv));\n if(cv2&134217728) *((int*)(nmem+ct)) = cv2-134217728;\n }\n debug(235);\n mem = opt;\n int Rn2 = *((int*)mem);\n for(int i=0;i<Rn2;i++){\n ((int*)mem)[i+1] = (*((int*)(old_heap+((int*)mem)[i+1])))-134217728;\n }\n \n debug(236);\n mem+=4*(Rn+1);\n int Tn2 = 0;\n for(int i=0;i<1024;i++){\n if(vis[i])rewire[i] = Tn2;\n Tn2+=vis[i];\n }\n *((int*)mem) = Tn2;\n mem+=4;\n debug(237);\n for(int i=0;i<Tn;i++){\n if(!vis[i])continue;\n int tnt = Tmap[i][0].size()+Tmap[i][1].size()+Tmap[i][2].size()+Tmap[i][3].size();\n *((int*)mem) = tnt;\n mem+=4;\n for(int j=0;j<Tmap[i][0].size();j++)mem[j] = 0;\n mem+=Tmap[i][0].size();\n for(int j=0;j<Tmap[i][1].size();j++)mem[j] = 1;\n mem+=Tmap[i][1].size();\n for(int j=0;j<Tmap[i][2].size();j++)mem[j] = 2;\n mem+=Tmap[i][2].size();\n for(int j=0;j<Tmap[i][3].size();j++)mem[j] = 3;\n mem+=Tmap[i][3].size();\n }\n debug(238);\n for(auto ct:wupd_clsname){\n *((int*)(nmem+ct)) = rewire[*((int*)(nmem+ct))];\n }\n *((int*)mem) = sz;\n memcpy(mem+4,nmem,sz);\n}<\/code><\/pre>\n ","protected":false},"excerpt":{"rendered":"