{"id":562,"date":"2012-11-12T23:18:00","date_gmt":"2012-11-12T15:18:00","guid":{"rendered":"http:\/\/www.shuizilong.com\/house\/?p=562"},"modified":"2012-11-19T12:30:11","modified_gmt":"2012-11-19T04:30:11","slug":"codechef-november-challenge-2012","status":"publish","type":"post","link":"https:\/\/www.shuizilong.com\/house\/archives\/codechef-november-challenge-2012\/","title":{"rendered":"CodeChef November Challenge 2012"},"content":{"rendered":"

Level 1
Coin Flip: \u7b7e\u5230
Delicious Dishes: \u7b7e\u5230
Sridhar Likes Travelling\uff1a\u7b7e\u5230
Level 2
A Wonderful Chocolate\uff1aSCDP + \u77e9\u9635
Candy Collecting Game\uff1aDP Lucky Balance\uff1a\u7ec4\u5408
Jam Board\uff1a\u5e76\u67e5\u96c6 ( \u6ce8\u610f\u5361 scanf()… \u4f7f\u7528 getchar() .. .
Level 3
Arithmetic Progressions<\/a>\uff1a\u94fe\u8868\u4f18\u5316\u66b4\u529b ( \u5feb\u901f FFT
Martial Arts<\/a>\uff1a\u8d39\u7528\u6d41 || KM ??
Many Left<\/a>\uff1a\u5361\u65f6 + \u542f\u53d1\u5f0f\u8d2a\u5fc3<\/p>\n

<\/p>\n

\u3002\u3002\u3002\u8003\u8bd5\u5468\u3002\u3002\u5404\u79cd\u5fd9\u7206\u3002\u3002 himehime \u505a\u6389\u4e86 3 \u9053\u7b7e\u5230\u9898\u3002\u3002\u6211\u505a\u4e86\u4e2d\u95f4 5 \u9053\u9898\u3002\u3002\u9644\u52a0\u9898\u4e2d\u95f4\u4ea4\u4e86 1 \u6b21\u3002\u3002\u3002\u6700\u540e\u4e00\u5929\u53c8\u6539\u4e86\u6539\u3002\u3002\u3002\u3002\u3002\u3002\uff08\u3002\u518d\u6b21\u5bf9 ACRush \u6df1\u8868\u656c\u4f69\u3002\u3002\u771f\u5b8c\u7f8e\u4e3b\u4e49\u8005\uff01\u3002\u8dea\u70c2\uff01\u3002<\/p>\n

.. \u672c\u6708\u6700\u6709\u4ef7\u503c\u7684\u9898\u662f Martial Arts<\/a>
\n“\u7ed9\u5b9a\u4e00\u4e2a n \u9636\u5e26\u6743\u4e8c\u5206\u5b8c\u5168\u56fe\u3002\u3002\u6c42\u4e00\u4e2a\u5b8c\u5907\u5339\u914d\u3002\u3002\u4f7f\u5f97\u8be5\u5b8c\u5907\u5339\u914d\u53bb\u6389\u4e00\u7ec4\u6743\u503c\u6700\u5927\u7684\u8fb9\u540e\u3002\u3002\u6743\u503c\u6700\u5927\u3002”\u3002\u3002\u3002 ( n <= 100 .. )
\n\u3002\u3002\uff08\u5982\u679c\u5982\u679c\u662f\u6c42 n-1 \u6761\u8fb9\u7684\u6700\u4f18\u5339\u914d\u7684\u8bdd\u53ef\u4ee5\u76f4\u63a5\u8d39\u7528\u6d41\u3002\u3002\u4f46\u662f\u9898\u76ee\u4e2d\u95ee\u9898\u7684\u5b9a\u4e49\u7565\u6709\u4e0d\u540c\u3002\u3002\u4e8c\u5206\u7b54\u6848\u7684\u8bdd\u4f3c\u4e4e\u8fd9\u4e2a\u9898\u53ea\u662f\u5c40\u90e8\u5355\u8c03\u3002\u3002 \u5df2\u77e5\u6700\u5927\u6743\u5b8c\u5907\u5339\u914d\uff08\u591a\u89e3\u65f6\u53d6\u6700\u5927\u503c\u6700\u77ed\u7684\u90a3\u7ec4\uff09\u3002\u3002\u51cf\u53bb\u6743\u503c\u6700\u5927\u7684\u4e00\u6761\u8fb9\u662f\u4e00\u4e2a “\u6f5c\u5728\u89e3”\u3002\u3002\uff08\u9664\u6b64\u6f5c\u5728\u89e3\u4e4b\u5916\u3002\u3002\u8fd8\u6709\u54ea\u4e9b\u662f\u6f5c\u5728\u89e3\uff1f\u3002\u3002\u5982\u4f55\u901a\u8fc7\u589e\u5e7f\u8f6c\u79fb\u8fc7\u53bb\uff1f\u3002\u3002<\/del><\/p>\n

————<\/p>\n

\u3002\u3002\u3002\u3002\u4e5f\u5c31\u662f\u8bf4\u6211\u8fd9\u4e2a SB \u4e00\u5f00\u59cb\u5c31\u628a\u9898\u76ee\u62bd\u8c61\u9519\u4e86\u3002\u3002\u3002\u5b9e\u9645\u4e0a tie-breaking \u7684\u60c5\u51b5\u662f\u9700\u8981\u4ed4\u7ec6\u5904\u7406\u7684\u3002\uff08\u540c\u6837\u662f\u56e0\u4e3a tie-breaking \u7684\u539f\u56e0\u3002\u3002\u4f7f\u5f97\u89e3\u53ea\u662f\u5c40\u90e8\u5355\u8c03\u3002\u3002\u65e0\u6cd5\u76f4\u63a5\u4e8c\u5206\u7b54\u6848\u3002\u3002\uff09\u3002\u6211\u5f00\u59cb\u4ee5\u4e3a\u6807\u7a0b\u88ab cha\u3002\u3002\u540e\u6765\u53d1\u73b0\u53ea\u662f\u5199\u89e3\u9898\u62a5\u544a\u7684\u4eba\u4e5f\u6ca1\u6709\u5b8c\u5168\u7406\u89e3\u6e05\u695a\u3002\u3002\u8bc4\u8bba\u7684\u5730\u65b9 anton_lunyov<\/a> \u7ed9\u4e86\u6781\u597d\u7684\u63cf\u8ff0\u3002\u3002\u3002\u603b\u4e4b\u76f4\u63a5\u770b Editorial<\/a> \u5427\u3002\u3002\u3002<\/p>\n

\uff08\u4e5f\u5c31\u662f\u8bf4\u53ef\u4ee5\u7406\u89e3\u6210\u6709\u4e24\u4e2a\u73a9\u5bb6\u3002\u3002\u73a9\u5bb6 A\uff08\u9632\u5fa1\u65b9\uff09\u786e\u5b9a\u4e00\u4e2a\u5b8c\u5907\u5339\u914d\u3002\u3002\u4e4b\u540e\u73a9\u5bb6 B ( \u8fdb\u653b\u65b9\uff09\u4f1a\u5e72\u6389\u4e00\u4e2a\u6700\u4f18\u8fb9\u3002\u3002\u6ce8\u610f\u8fd9\u4e2a\u548c k \u90e8\u6700\u4f18\u5339\u914d\u4e4b\u95f4\u7684\u4e0d\u540c\u3002\u8fd9\u4e2a\u95ee\u9898\u8981\u96be\u5f88\u591a\u3002\u3002\uff09\u3002\u3002<\/p>\n

\u3002\u3002\u5514\u3002\u3002\u3002\u95ee\u9898\u7684\u5173\u952e\u662f\u8868\u8ff0\u6210 “a function of the weight of the highest weighted edge” \u3002\u3002\u3002\u4e4b\u540e\u62cd “Dynamic Assignment Problem” \u3002\u3002( \u53ea\u6709\u5355\u8fb9\u4fee\u6539\u64cd\u4f5c\u3002\u3002)\u3002\u3002\u3002\u4e00\u822c\u60c5\u51b5\u4e0b\u73a9\u5bb6 A \u548c\u73a9\u5bb6 B \u671d\u76f8\u53cd\u65b9\u5411\u51b3\u7b56\u3002\u3002\u800c\u5728 tie-breaking \u7684\u60c5\u51b5\u3002\u3002\u73a9\u5bb6 A \u548c \u73a9\u5bb6 B \u7684\u76ee\u6807\u53c8\u53d8\u5f97\u4e00\u81f4\u4e86\u3002\u3002\u8fd9\u6837\u76f4\u63a5\u5411\u9898\u89e3\u91cc\u5f00\u59cb\u8bf4\u7684 “To handle this we can consider each edge’s weight as pair (score difference, score to home team)” \u662f\u4e0d\u884c\u7684\u3002\u3002\u6211\u4eec\u9700\u8981\u8fd9\u4e2a\u7ed3\u6784\u8bbe\u8ba1\u4e24\u4e2a\u6bd4\u8f83\u51fd\u6570\u3002\u3002<\/p>\n

\u3002\u3002\u3002\u57fa\u672c\u878d\u5408\u4e86 \u6807\u7a0b<\/a> \u548c anton_lunyov \u7684\u5199\u6cd5<\/a>\u3002\u3002\uff08anton_lunyov \u662f\u6392\u5e8f\u540e\u6b63\u5411\u63d2\u5165\u8fb9\u8868\u3002\u3002\u6807\u7a0b\u662f\u9006\u5e8f\u5220\u9664\u3002 … (\u3002\u8fd9\u6837\u53ef\u4ee5\u5f97\u5230\u4e00\u4e2a 5s \u5de6\u53f3\u7684\u526a\u679d\u3002\u3002<\/p>\n

\r\nstruct rec{\r\n\r\n    LL x, y;\r\n\r\n\trec(LL _x = 0):x(_x),y(_x){}\r\n\trec(LL x, LL y):x(x),y(y){}\r\n\r\n\trec  operator+ (const rec &rhs) const {return rec(x+rhs.x, y+rhs.y);}\r\n\tvoid operator+=(const rec &rhs) {x+=rhs.x, y+=rhs.y;}\r\n\trec  operator- (const rec &rhs) const {return rec(x-rhs.x, y-rhs.y);}\r\n\tvoid operator-=(const rec &rhs) {x-=rhs.x, y-=rhs.y;}\r\n\trec  operator-() const {return rec(-x, -y);}\r\n\tbool operator==(const rec &rhs) const {return x==rhs.x && y==rhs.y;}\r\n    bool operator< (const rec &rhs) const {return x<rhs.x || x==rhs.x && y<rhs.y;}\r\n    bool operator<=(const rec &rhs) const {return x<rhs.x || x==rhs.x && y<=rhs.y;}\r\n\r\n    bool isZero() const {return (*this) == rec();}\r\n    bool operator!() const {return isZero();}\r\n    void output(){\r\n        printf("%lld %lld\\n", y, y - x);\r\n    }\r\n\r\n} W[N][N], lx[N], ly[N], slack[N];\r\n\r\ninline bool comp(const rec &lhs, const rec &rhs){ \/\/Player B perspective .. .\r\n    return lhs.x < rhs.x || lhs.x == rhs.x && lhs.y > rhs.y;\r\n}\r\n<\/pre>\n
\u3002\u3002\u6743\u503c\u5bf9\u8c61\u3002\u3002\u4ee5 pair \u7684\u5f62\u5f0f\u5b58\u50a8 G-S \u548c G \u3002\u3002\uff08\u3002\u3002\u3002\u652f\u6301\u4e24\u4e2a\u6bd4\u8f83\u51fd\u6570\u3002\u3002\u9ed8\u8ba4\u7684\u5c0f\u4e8e\u3002\u3002\u548c\u5728 tie-breaking \u4e0b\u3002\u3002\u73a9\u5bb6 B \u4e3a\u89c6\u89d2\u7684\u5c0f\u4e8e\u3002\u3002
\n\u3002\u4e4b\u540e\u7d27\u63a5\u4e00\u4e2a \u52a8\u6001\u5308\u7259\u5229 \u7b97\u6cd5\u7684\u6a21\u677f\u3002\u3002\u3002<\/p>\n
\r\nint  px[N], py[N], pxx[N], ps[N], Q[N], op, cz;\r\nbool vx[N], vy[N];\r\nint n;\r\n\r\n#define w(x, y) (lx[x] + ly[y] - W[x][y])\r\n\r\nvoid add_to_tree(int x, int xx){\r\n    vx[Q[op++] = x] = true, pxx[x] = xx;\r\n    REP(y, n) if (w(x, y) < slack[y])\r\n        slack[y] = w(x, y), ps[y] = x;\r\n}\r\n\r\nvoid augment(int root){ \/\/ 1. Designate each exposed (unmatched) node in V as the root of a Hungarian tree.\r\n\r\n    int x, y; RST(vx, vy), op = cz = 0;\r\n    pxx[x = root] = -1, add_to_tree(x, -1);\r\n    REP_N(y, n) slack[y] = w(x, y), ps[y] = x;\r\n\r\n    while (true){\r\n\r\n        while (cz < op){ \/\/ 2. Grow the Hungarian trees rooted at the exposed nodes in the equality subgraph.\r\n            x = Q[cz++]; REP_N(y, n) if (w(x, y).isZero() && !vy[y]){\r\n                if (py[y] == -1) goto Augment;\r\n                vy[y] = true, add_to_tree(py[y], x);\r\n            }\r\n        }\r\n\r\n        rec delta = rec(INFF); \/\/ 3. Modify the dual variables lx and ly as follows to add new edges to the equality subgraph.\r\n        REP(i, n) if (!vy[i]) checkMin(delta, slack[i]);\r\n        REP(i, n){\r\n            if (vx[i]) lx[i] -= delta;\r\n            if (vy[i]) ly[i] += delta; else slack[i] -= delta;\r\n        }\r\n\r\n        REP_N(y, n) if (!vy[y] && slack[y].isZero()){ \/\/ 2.' Grow the Hungarian trees directely by the new edges in the equality subgraph.\r\n            if (py[y] == -1){\r\n                x = ps[y];\r\n                goto Augment;\r\n            }\r\n            else {\r\n                vy[y] = true; if (!vx[py[y]])\r\n                    add_to_tree(py[y], ps[y]);\r\n            }\r\n        }\r\n    }\r\n\r\n    assert(0); \/\/ !! Impossible Position !!..\r\n\r\n    Augment: for (int t;x!=-1;x=pxx[x],y=t) \/\/ 4. Augment the current matching by flipping matched and unmatched edges along the selected augmenting path.\r\n        t = px[x], py[y] = x, px[x] = y;\r\n}\r\n\r\n\r\nvoid KM(){\r\n\r\n    static bool first_time = true;\r\n\r\n    if (first_time){\r\n\r\n        first_time = false;\r\n\r\n        FLC(px, py, -1), RST(lx, ly);\r\n        REP_2(i, j, n, n) checkMax(lx[i], W[i][j]);\r\n\r\n        REP(root, n) augment(root);\r\n    }\r\n    else {\r\n        \/\/ .. .\r\n    }\r\n}\r\n<\/pre>\n
\r\n#define y px[x]\r\n\r\nrec maximum_match(){\r\n\trec res = rec(); REP(x, n) res += W[x][y];\r\n\treturn res;\r\n}\r\n\r\nrec secondary_match(){\r\n\trec del = rec(0); REP(x, n) checkMax(del, W[x][y], comp);\r\n\treturn maximum_match() - del;\r\n}\r\n\r\n#undef y\r\n<\/pre>\n
\u3002\u3002\u3002\u6b64\u5904\u7684\u4e24\u4e2a\u5c0f\u51fd\u6570\u3002\u3002\u5206\u522b\u662f\u8fd4\u56de\u5b8c\u5907\u5339\u914d\u3002\u3002\u548c\u88ab\u5220\u9664\u4e00\u6761\u8fb9\u540e\u7684\u5b8c\u5907\u5339\u914d\u3002\uff08\u4e0b\u79f0\u4e8f\u683c\u4e3a 1 \u7684\u5339\u914d\u3002\u3002\u3002\u3002<\/p>\n
\r\nvector<pair<PLL,PLL> > E;\r\n\r\nint main() {\r\n\r\n#ifndef ONLINE_JUDGE\r\n    freopen("in.txt", "r", stdin);\r\n#endif\r\n\r\n\tRD(n); REP_2(i, j, n, n){\r\n        LL p1, p2; RD(p1, p2);\r\n        W[i][j] = rec(p1-p2, p1);\r\n        E.PB(MP(MP(W[i][j].x, -W[i][j].y), MP(i,j)));\r\n\t}\r\n\r\n\tKM(), SRT(E);\r\n\trec res = rec(-N*V);\r\n\r\n\tDWN(i, SZ(E), 0){\r\n\r\n\t\tint x = E[i].se.fi, y = E[i].se.se;\r\n\r\n\t\tint yy = px[x]; if (yy != y){\r\n\t\t\tW[x][y] = rec(V), px[x] = py[yy] = -1;\r\n\t\t\tcheckMax(lx[x], W[x][y] - ly[y]);\r\n\t\t\taugment(x);\r\n\t\t}\r\n\r\n\t\tcheckMax(res, secondary_match());\r\n\r\n\t\tW[x][y] = rec(-N*V);\r\n\t\tif (px[x]==y) {\r\n\t\t\tpx[x] = py[y]=-1;\r\n\t\t\taugment(x);\r\n\t\t}\r\n\r\n\t\tif (maximum_match() <= res) break; \/\/ Cut .. .\r\n\t}\r\n\r\n\tres.output();\r\n}\r\n<\/pre>\n
\u3002\u3002\u4e3b\u51fd\u6570\u3002\u3002\uff08\u4e3b\u8981\u662f\u6392\u5e8f\u8fb9\u8868\u3002\u3002\u4ee5\u53ca\u9006\u5e8f\u6328\u4e2a\u5220\u8fb9\u3002\u3002\u3002\u3002
\n\u679a\u4e3e\u6bcf\u6761\u8fb9\u3002\u3002\u5c06\u8be5\u8fb9\u7684\u6743\u503c\u8bbe\u7f6e\u6210\u6700\u5927\uff08\u4fdd\u8bc1\u5176\u4e00\u5b9a\u88ab\u9009\u4e2d\u3002\u589e\u5e7f\u4e00\u6b21\u540e\u53d6\u89e3\u3002\u3002\uff08\u6b64\u65f6\u6c42\u51fa\u7684\u89e3\u6b64\u8fb9\u7684\u51fd\u6570\u3002\u3002
\n\u3002\u3002\u3002\u4e4b\u540e\u5728\u8bbe\u7f6e\u6210\u8d1f\u65e0\u7a77\u5927\u3002\uff08\u3002\u3002\u8868\u793a\u5220\u8fb9\u3002\u3002\u5220\u8fb9\u4e0d\u4f1a\u5bfc\u81f4\u53ef\u884c\u9876\u6807\u7684\u4fee\u6539\u3002\u3002\u4f46\u662f\u4e5f\u8981\u589e\u5e7f\u4e00\u6b21\u3002\u3002<\/p>\n
\u52a8\u6001\u5339\u914d\u3002\u3002O(n4).. .<\/a><\/p>\n
\u5176\u6b21\u662f Arithmetic Progressions \u3002\u3002 
“\u7ed9\u5b9a\u4e00\u4e2a\u957f\u5ea6\u4e3a n \u6570\u5217 {an}\uff0c\u6c42\u6240\u6709\u6ee1\u8db3 i < j < k\uff0c\u4e14 a[j] – a[i] = a[k] – a[j] \u7684\u4e09\u5143\u7ec4\u6570\u3002\u3002” 
( n <= 1e6, 1 <= ai <= 3e4 .. . )<\/p>\n
\u3002\u3002\u5f00\u59cb\u7684\u60f3\u6cd5\u662f\u94fe\u8868\u4f18\u5316\u7684\u66b4\u529b\u7b97\u6cd5\u3002\u3002\u3002\u3002\u7136\u540e\u662f\u89c9\u5f97\u6b63\u89e3\u5e94\u8be5\u662f\u5206\u5757\u540e\u4f7f\u7528 FFT\u3002\u4f46\u662f\u4e00\u4ea4 TLE \u3002\uff08\u5f53\u65f6\u731c\u6d4b\u662f\u5e38\u6570\u5199\u6e23\u4e86\u3002\u3002\u540e\u6765\u53d1\u73b0\u786e\u5b9e\u662f\u8fd9\u6837 T T\u3002\u3002\u3002 
\u3002\u3002\u3002\u540e\u6765\u8fd9\u4e2a\u9898\u5c31\u88ab\u6401\u7f6e\u4e86\u3002\u3002\u76f4\u5230\u671f\u4e2d\u8003\u8bd5\u524d\u5915\u5728\u8bc4\u8bba\u533a\u91cc\u770b\u5230\u59ff\u52bf\u5e1d anton_lunyov<\/a> \u8bf4\u4ed6\u59ff\u52bf\u8fc7\u4e86\u8fd9\u9898\u3002\u3002\uff08\u3002\u65e0\u9650\u4ef0\u6155\u3002\u3002\u3002\u3002<\/p>\n
“@kunalgaurav18 Because of the condition i < j < k. Well, for me this condition ruins very beautiful solution. Currently to handle this condition I have very bad solution that pass the TL which were very surprisingly for me.”<\/p><\/blockquote>\n
\u3002\u3002\u3002\u7136\u540e\u6211\u63e3\u6d4b\u4e86\u4e00\u4e0b\u4ed6\u8fd9\u4e2a\u601d\u8def\u3002\u3002\u56de\u6765\u5199\u4e86\u4e00\u53d1\u5c45\u7136\u8fc7\u4e86\u3002\u3002 \u3002\u3002\uff08\u3002\u3002\u5927\u6982\u662f\u628a\u5206\u6210\u524d\u9762\u4e00\u534a\u548c\u540e\u9762\u4e00\u534a\u3002\u3002\u6ce8\u610f\u5904\u7406\u5de6\u8fb9\u4e00\u534a\u65f6\u8981\u5148\u63d2\u5165\u8fdb\u53bb\u7136\u540e\u9006\u5e8f Resume\u3002\u3002\u3002\uff08\u7c7b\u4f3c\u5bf9 Dance Link \u7684\u5904\u7406\u3002\u3002<\/p>\n
\uff08\u6700\u6709\u4ef0\u6155\u4e00\u4e0b Rank I \u7684 CPU \u5e76\u884c\u7684\u795e\u7287<\/a>\u3002\u3002\u6807\u7a0b\u5df2\u88ab\u64b8\u7206\uff01\u3002\uff09<\/p>\n
————– PS : 
… \u7ed9 SB Codechef \u7684 UI \u8dea\u4e86\u554a\u3002\u3002\u3002\u6bcf\u6b21\u8fdb\u53bb\u8981\u8f7d\u5165\u4e00\u4e2a Facebook \u6309\u94ae\u3002\u3002\u7136\u540e\u5475\u5475\u5475\u4f60\u61c2\u7684\u3002\u7ed3\u679c\u9875\u9762\u53f3\u8fb9\u51fa\u6765\u4e00\u5927\u7247\u767d\u3002\u3002\u628a\u5404\u79cd\u6309\u94ae\u4ec0\u4e48\u7684\u5168\u906e\u4f4f\u4e86\u3002\u3002 
\u3002\u3002\u3002\u3002\u6bcf\u6b21\u90fd\u8981\u7528 \u5ba1\u67e5\u5143\u7d20 Kill \u6389\u3002\u3002\u3002\u3002\uff09 <\/p>\n
External link: <\/h3>\n
http:\/\/www.codechef.com\/NOV12\/<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"
Level 1 Coin Flip: \u7b7e\u5230 Delicious Dishes: \u7b7e\u5230 Sridhar Likes Travelling\uff1a\u7b7e\u5230 Level 2 A Wonderful Chocolate\uff1aSCDP + \u77e9\u9635 Candy Collecting Game\uff1aDP Lucky Balance\uff1a\u7ec4\u5408 Jam Board\uff1a\u5e76\u67e5\u96c6 ( \u6ce8\u610f\u5361 scanf()… \u4f7f\u7528 getchar() .. . Level 3 Arithmetic Progressions\uff1a\u94fe\u8868\u4f18\u5316\u66b4\u529b ( \u5feb\u901f FFT Martial Arts\uff1a\u8d39\u7528\u6d41 || KM ?? Many Left\uff1a\u5361\u65f6 + \u542f\u53d1\u5f0f\u8d2a\u5fc3<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","enabled":false}}},"categories":[1],"tags":[],"class_list":["post-562","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p2tdP7-94","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/562","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/comments?post=562"}],"version-history":[{"count":1,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/562\/revisions"}],"predecessor-version":[{"id":563,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/562\/revisions\/563"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/media?parent=562"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/categories?post=562"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/tags?post=562"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}