{"id":571,"date":"2012-11-18T00:23:58","date_gmt":"2012-11-17T16:23:58","guid":{"rendered":"http:\/\/www.shuizilong.com\/house\/?p=571"},"modified":"2012-11-30T22:45:06","modified_gmt":"2012-11-30T14:45:06","slug":"%e3%80%90%e7%ac%ac%e4%b8%89%e6%ac%a1-acdream-%e7%be%a4%e5%8e%9f%e5%88%9b%e7%be%a4%e8%b5%9b%e3%80%91%e8%a7%a3%e9%a2%98%e6%8a%a5%e5%91%8a%ef%bc%88%e6%8e%88%e6%9d%83%e8%bd%ac%e5%8f%91%e3%80%82","status":"publish","type":"post","link":"https:\/\/www.shuizilong.com\/house\/archives\/%e3%80%90%e7%ac%ac%e4%b8%89%e6%ac%a1-acdream-%e7%be%a4%e5%8e%9f%e5%88%9b%e7%be%a4%e8%b5%9b%e3%80%91%e8%a7%a3%e9%a2%98%e6%8a%a5%e5%91%8a%ef%bc%88%e6%8e%88%e6%9d%83%e8%bd%ac%e5%8f%91%e3%80%82\/","title":{"rendered":"\u3010\u7b2c\u4e09\u6b21 ACdream \u7fa4\u539f\u521b\u7fa4\u8d5b\u3011\u89e3\u9898\u62a5\u544a"},"content":{"rendered":"

Overview: <\/h1>\n

ACdream \u7fa4\u3010\u7b2c\u4e09\u6b21\u539f\u521b\u7fa4\u8d5b\u3011\u5c06\u4e8e\u301011\u670817\u65e5\u661f\u671f\u516d\u665a19\u70b9\u3011\u8fdb\u884c\u3002\u672c\u6b21\u539f\u521b\u7fa4\u8d5b\u7531[sjtu]ftiasch\uff08\u4eba\u79f0 GXX \u795e\u725b\u3001\u53c9\u59b9\uff09\u51fa\u9898\u3002\u6b22\u8fce\u5927\u5bb6\u79ef\u6781\u53c2\u4e0e\uff5e\u3010\u51a0\u519b\u3011\u548c\u3010ACdreamOJ\u7b2c10000\u6b21\u63d0\u4ea4\u3011\u7684ID\u6211\u4eec\u5c06\u4f1a\u8d60\u9001\u5c0f\u793c\u54c1\u4e00\u4efd \u3002\u3002 \u6bd4\u8d5b\u4f20\u9001\u95e8\u3002\u3002<\/a>\u3002\u3002<\/p><\/blockquote>\n

\uff08\u3002\u3002\u3002\u770b\u6837\u5b50\u53c9\u5a18\u4e0d\u613f\u610f\u5728 blog<\/a> \u91cc\u8d34\u592a\u5b66\u672f\u7684\u4e1c\u897f\u3002\u3002\u3002\u4ee5\u4e0b\u6388\u6743\u8f6c\u53d1\u3002\u3002\u3002
\nac-dream-3rd.tar \uff08\u9898\u76ee\u3001\u6807\u7a0b\u3001\u89e3\u9898\u62a5\u544a\u3001\u6d4b\u8bd5\u6570\u636e\u3002\u3002\u3002<\/a><\/p>\n

<\/p>\n

Official Solutions: <\/h1>\n

Xor<\/h2>\n

\u8003\u8651\u7b2c\\(i\\)\u4e2a\u4e8c\u8fdb\u5236\u4f4d\uff0c\u56e0\u4e3a\\(n\\)\u662f\u5947\u6570\uff0c\u6240\u4ee5\\(A\\)\u4e2d\u7b2c\\(i\\)\u4f4d\\(0\\)\u548c\\(1\\)\u7684\u4e2a\u6570\u4e0d\u76f8\u7b49(\u5bf9\u4e8e\\(B\\)\u4e5f\u6210\u7acb\uff09\u3002\u4e8e\u662f\u53ef\u4ee5\u786e\u5b9a\\(x\\)\u7684\u7b2c\\(i\\)\u4f4d\uff0c\u6700\u540e\u518d\u9a8c\u8bc1\\(x\\)\u662f\u5426\u5408\u6cd5\u5373\u53ef\u3002<\/p>\n

Triangle<\/h2>\n

\u7531\u53c9\u79ef\u7684\u8868\u8fbe\u5f0f\uff0c\u77e5\u9053\u9762\u79ef\u53ea\u8ddf\u5750\u6807\u7684\u5947\u5076\u6027\u6709\u5173\uff0c\u679a\u4e3e\u6bcf\u4e2a\u70b9\u7684\u7c7b\u578b\u5373\u53ef\u3002<\/p>\n

Tranform<\/h2>\n

\u5e7f\u641c\u7684\u590d\u6742\u5ea6\u662f… \\[N(1 + \\frac{1}{2} + \\cdots + \\frac{1}{N}) = O(N \\log N)\\].<\/p>\n

Product<\/h2>\n

\\[v(A) = \\frac{\\prod_{a \\in A}(1 + a) – \\prod_{a \\in A}(1 – a)}{2}\\]<\/p>\n

Permanent<\/h2>\n

\u72b6\u538b\u52a8\u6001\u89c4\u5212\u3002<\/p>\n

Path<\/h2>\n

\u5982\u679c \\(x\\) \u662f\u53ef\u884c\u7684\uff0c\u90a3\u4e48 \\((x – 2)\\) \u4e5f\u662f\u53ef\u884c\u7684\uff0c\u6240\u4ee5\u53ef\u4ee5\u52a8\u6001\u89c4\u5212\u6c42\u51fa\u6700\u957f\u7684\u5947\u6570\u548c\u5076\u6570\u3002\u6ce8\u610f\u8d1f\u6570\u7684\u60c5\u51b5\u3002<\/p>\n

\r\n#include <cassert>\r\n#include <cstdio>\r\n#include <cstring>\r\n#include <algorithm>\r\nusing namespace std;\r\n\r\nconst int N = 100000;\r\n\r\nint n, q, parent[N];\r\n\r\nint find(int i) {\r\n    return parent[i] == -1 ? i : (parent[i] = find(parent[i]));\r\n}\r\n\r\nint edge_count, first_edge[N], to[N << 1], length[N << 1], next_edge[N << 1];\r\n\r\nconst int INF = 100000000;\r\n\r\nint down[N][2], limit[2];\r\n\r\nvoid add_edge(int u, int v, int w) {\r\n    to[edge_count] = v;\r\n    length[edge_count] = w;\r\n    next_edge[edge_count] = first_edge[u];\r\n    first_edge[u] = edge_count ++;\r\n}\r\n\r\n#define UPDATE(x, a) x = max(x, a)\r\n\r\nvoid dfs(int p, int u) {\r\n    down[u][0] = 0;\r\n    down[u][1] = -INF;\r\n    for (int iter = first_edge[u]; iter != -1; iter = next_edge[iter]) {\r\n        int v = to[iter];\r\n        int l = length[iter];\r\n        if (v != p) {\r\n            dfs(u, v);\r\n            for (int x = 0; x < 2; ++ x) {\r\n                for (int y = 0; y < 2; ++ y) {\r\n                    UPDATE(limit[x + y + l & 1], down[u][x] + down[v][y] + l);\r\n                }\r\n            }\r\n            for (int y = 0; y < 2; ++ y) {\r\n                UPDATE(down[u][y + l & 1], down[v][y] + l);\r\n            }\r\n        }\r\n    }\r\n}\r\n\r\nint main() {\r\n    assert(scanf("%d%d", &n, &q) == 2);\r\n    assert(1 <= n && n <= N);\r\n    assert(1 <= q && q <= N);\r\n    memset(parent, -1, sizeof(parent));\r\n    edge_count = 0;\r\n    memset(first_edge, -1, sizeof(first_edge));\r\n    for (int i = 0; i < n - 1; ++ i) {\r\n        int a, b, c;\r\n        assert(scanf("%d%d%d", &a, &b, &c) == 3);\r\n        assert(1 <= a && a <= n);\r\n        assert(1 <= b && b <= n);\r\n        assert(1 <= c && c <= 2);\r\n        a --;\r\n        b --;\r\n        assert(find(a) != find(b));\r\n        parent[find(a)] = find(b);\r\n        add_edge(a, b, c);\r\n        add_edge(b, a, c);\r\n    }\r\n    limit[0] = limit[1] = -INF;\r\n    dfs(-1, 0);\r\n    while (q --) {\r\n        int l;\r\n        assert(scanf("%d", &l) == 1);\r\n        if (l < 0) {\r\n            puts("No");\r\n        } else {\r\n            int t = l % 2;\r\n            puts(l <= limit[t] ? "Yes" : "No");\r\n        }\r\n    }\r\n    return 0;\r\n}\r\n\r\n<\/pre>\n
Multiplication<\/h2>\n
\\[C[k] = (A[1] + A[2] + \\cdots + A[k]) \\cdot B[k] + (B[1] + B[2] + \\cdots + B[k]) \\cdot A[k] – A[k] \\cdot B[k]\\]<\/p>\n
Matching<\/h2>\n
\u5229\u7528 Tutte matrix<\/a> \u53ef\u4ee5\u5f97\u5230\u5f88\u77ed\u7684\\(O(N^3)\\)\u7b97\u6cd5\u3002<\/p>\n
\r\n#include <cassert>\r\n#include <cstdio>\r\n#include <cstring>\r\n#include <algorithm>\r\nusing namespace std;\r\n\r\nconst int N = 100;\r\nconst int MOD = 1000000000 + 7;\r\n\r\nint n, a[N][N];\r\n\r\nint inverse(int a) {\r\n    return a == 1 ? 1 : (long long)(MOD - MOD \/ a) * inverse(MOD % a) % MOD;\r\n}\r\n\r\nint main() {\r\n    assert(scanf("%d", &n) == 1);\r\n    assert(1 <= n && n <= N);\r\n    for (int i = 0; i < n; ++ i) {\r\n        for (int j = 0; j < n; ++ j) {\r\n            assert(scanf("%d", &a[i][j]) == 1);\r\n        }\r\n    }\r\n    for (int i = 0; i < n; ++ i) {\r\n        assert(a[i][i] == 0);\r\n        for (int j = 0; j < n; ++ j) {\r\n            assert(a[i][j] == a[j][i]);\r\n            assert(a[i][j] == 0 || a[i][j] == 1);\r\n        }\r\n    }\r\n    for (int i = 0; i < n; ++ i) {\r\n        for (int j = 0; j < n; ++ j) {\r\n            if (a[i][j]) {\r\n                a[i][j] = rand() % MOD;\r\n                a[j][i] = MOD - a[i][j];\r\n            }\r\n        }\r\n    }\r\n    int rank = 0;\r\n    for (int i = 0; i < n; ++ i) {\r\n        int pivot = rank;\r\n        while (pivot < n && !a[pivot][i]) {\r\n            pivot ++;\r\n        }\r\n        if (pivot < n) {\r\n            for (int j = 0; j < n; ++ j) {\r\n                swap(a[rank][j], a[pivot][j]);\r\n            }\r\n            {\r\n                int times = inverse(a[rank][i]);\r\n                for (int j = 0; j < n; ++ j) {\r\n                    a[rank][j] = (long long)a[rank][j] * times % MOD;\r\n                }\r\n                for (int k = 0; k < n; ++ k) {\r\n                    if (k != rank && a[k][i]) {\r\n                        int times = a[k][i];\r\n                        for (int j = 0; j < n; ++ j) {\r\n                            (a[k][j] += MOD - (long long)a[rank][j] * times % MOD) %= MOD;\r\n                        }\r\n                    }\r\n                }\r\n            }\r\n            rank ++;\r\n        }\r\n    }\r\n    assert(!(rank & 1));\r\n    printf("%d\\n", rank >> 1);\r\n    return 0;\r\n}\r\n<\/pre>\n
\r\n\/* .................................................................................................................................. *\/\r\n\r\nconst int N = 369;\r\n\r\nint P[N], F[N], B[N], Q[N], head, tail;\r\nbool G[N][N], InB[N], inQ[N]; int mark[N], tot;\r\nint n, s, t, match;\r\n\r\n#define pre F[P[i]]\r\nint lca(int u, int v){\r\n    ++tot; RST(mark);\r\n    for (int i=u;i;i=pre){ i=B[i]; mark[i]=tot; }\r\n    for (int i=v;i;i=pre){ i=B[i]; if (mark[i]==tot) return i;}\r\n}\r\n\r\nvoid blossoming(int u,int v){\r\n\r\n    int z = lca(u, v); RST(InB);\r\n\r\n    for (int i=u;B[i]!=z;i=pre){\r\n        if (B[pre]!=z) F[pre]=P[i];\r\n        InB[B[i]]=true;\r\n        InB[B[P[i]]]=true;\r\n    }\r\n    for (int i=v;B[i]!=z;i=pre){\r\n        if (B[pre]!=z) F[pre]=P[i]; \/\/\u540c\u7406\r\n        InB[B[i]]=true;\r\n        InB[B[P[i]]]=true;\r\n    }\r\n\r\n    if (B[u]!=z) F[u]=v;\r\n    if (B[v]!=z) F[v]=u;\r\n    REP_1(i, n)\r\n      if (InB[B[i]]){\r\n          B[i]=z;\r\n          if (!inQ[i]){\r\n              Q[tail++]=i;\r\n              inQ[i]=true;\r\n          }\r\n      }\r\n}\r\n\r\nvoid change(){\r\n    int x,y,z=t; while (z){\r\n        y=F[z], x=P[y];\r\n        P[y]=z, P[z]=y, z=x;\r\n    }\r\n}\r\n\r\nbool bfs(){\r\n\r\n    RST(F, inQ); REP_1(i, n) B[i] = i;\r\n    head=0; tail=1, Q[0]=s, inQ[s]=1;\r\n\r\n    while (head < tail){\r\n        int u=Q[head++];\r\n        REP_1(v, n) if (G[u][v] && B[u]!=B[v] && P[u]!=v){\r\n            if (s==v || P[v] && F[P[v]]) blossoming(u,v);\r\n            else if (!F[v]){\r\n                F[v] = u; if (P[v]){\r\n                    Q[tail++] = P[v];\r\n                    inQ[P[v]] = true;\r\n                }\r\n                else{\r\n                    t = v, change();\r\n                    return true;\r\n                }\r\n            }\r\n        }\r\n    }\r\n    return false;\r\n\r\n}\r\n\r\nint EBC(){\r\n    int match = 0; RST(P); REP_1_N(s, n) if (!P[s] && bfs()) ++match;\r\n    return match;\r\n}\r\n\r\nvoid init(){\r\n    RD(n); REP_2_1(i, j, n, n) RD(G[i][j]);\r\n}\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    init(); OT(EBC());\r\n}\r\n\r\n<\/pre>\n
Cut<\/h2>\n
\u4e00\u6761\u8fb9\u53ef\u4ee5\u5207\u5f00\uff0c\u5f53\u4e14\u4ec5\u5f53\u4e24\u8fb9\u8054\u901a\u5757\u90fd\u662f\u5076\u6570\u3002<\/p>\n
Component<\/h2>\n
\u8003\u8651\u8054\u901a\u5757\u4e0d\u5305\u62ec\u91cd\u5fc3\uff0c\u5219\u6700\u591a\u53ea\u80fd\u6709\\(\\frac{n}{2}\\)\u7684\u5927\u5c0f\u3002\u4e8e\u662f\u5c31\u7b97\u5305\u542b\u91cd\u5fc3\u7684\u8054\u901a\u5757\u7684\u6700\u5c0f\u6743\u503c\uff0c\u6709\u4e00\u4e2a\u719f\u77e5\u7684\u52a8\u6001\u89c4\u5212\u7b97\u6cd5\u53ef\u4ee5\u505a\u5230\\(O(N^2)\\)\u3002\u4e4b\u540e\u70b9\u5206\u6cbb\u5373\u53ef\u3002\u590d\u6742\u5ea6\u4ecd\u7136\u662f\\(O(N^2)\\)\u3002<\/p>\n
"\u719f\u77e5\u7684\u52a8\u6001\u89c4\u5212\u7b97\u6cd5"\u53ef\u4ee5\u53c2\u89c1\u4f55\u68ee\u7684\u96c6\u8bad\u961f\u8bba\u6587\u3002<\/p>\n
\r\n#include <cassert>\r\n#include <cstdio>\r\n#include <cstring>\r\n#include <vector>\r\n#include <algorithm>\r\nusing namespace std;\r\n\r\nconst int N = 2000;\r\nconst int INF = 1000000000;\r\n\r\nint n, weight[N], parent[N], answer[N + 1];\r\nvector <int> adjacent[N];\r\n\r\nint find(int i) {\r\n    return parent[i] == -1 ? i : find(parent[i]);\r\n}\r\n\r\nbool mark[N];\r\nint size[N], max_tree[N];\r\nvector <int> nodes;\r\nint minimum[N + 1][N + 1];\r\n\r\n#define foreach(i, v) for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++ i)\r\n\r\nvoid dfs(int p, int u) {\r\n    size[u] = 1;\r\n    max_tree[u] = 0;\r\n    nodes.push_back(u);\r\n    foreach (iter, adjacent[u]) {\r\n        int v = *iter;\r\n        if (v != p && !mark[v]) {\r\n            dfs(u, v);\r\n            size[u] += size[v];\r\n            max_tree[u] = max(max_tree[u], size[v]);\r\n        }\r\n    }\r\n}\r\n\r\nvoid divide(int root) {\r\n    nodes.clear();\r\n    dfs(-1, root);\r\n    int total = size[root];\r\n    int new_root = -1;\r\n    int min_cost = INF;\r\n    foreach (iter, nodes) {\r\n        int u = *iter;\r\n        int ret = max(total - size[u], max_tree[u]);\r\n        if (ret < min_cost) {\r\n            new_root = u;\r\n            min_cost = ret;\r\n        }\r\n    }\r\n    nodes.clear();\r\n    dfs(-1, new_root);\r\n    int m = nodes.size();\r\n    minimum[m][0] = 0;\r\n    for (int i = 1; i <= m; ++ i) {\r\n        minimum[m][i] = INF;\r\n    }\r\n    for (int i = m - 1; i >= 0; -- i) {\r\n        int id = nodes[i];\r\n        for (int j = 0; j <= m; ++ j) {\r\n            minimum[i][j] = minimum[i + size[id]][j];\r\n            if (j) {\r\n                minimum[i][j] = min(minimum[i][j], minimum[i + 1][j - 1] + weight[id]);\r\n            }\r\n        }\r\n    }\r\n    for (int j = 1; j <= m; ++ j) {\r\n        answer[j] = min(answer[j], minimum[1][j - 1] + weight[new_root]);\r\n    }\r\n    mark[new_root] = true;\r\n    foreach (iter, adjacent[new_root]) {\r\n        int v = *iter;\r\n        if (!mark[v]) {\r\n            divide(v);\r\n        }\r\n    }\r\n}\r\n\r\nint main() {\r\n    assert(scanf("%d", &n) == 1);\r\n    assert(1 <= n && n <= N);\r\n    for (int i = 0; i < n; ++ i) {\r\n        assert(scanf("%d", weight + i) == 1);\r\n        assert(1 <= weight[i] && weight[i] <= 1000000);\r\n    }\r\n    memset(parent, -1, sizeof(parent));\r\n    for (int i = 0; i < n - 1; ++ i) {\r\n        int a, b;\r\n        assert(scanf("%d%d", &a, &b) == 2);\r\n        a --;\r\n        b --;\r\n        adjacent[a].push_back(b);\r\n        adjacent[b].push_back(a);\r\n        assert(find(a) != find(b));\r\n        parent[find(a)] = find(b);\r\n    }\r\n    for (int i = 1; i <= n; ++ i) {\r\n        answer[i] = INF;\r\n    }\r\n    memset(mark, 0, sizeof(mark));\r\n    divide(0);\r\n    for (int i = 1; i <= n; ++ i) {\r\n        printf("%d%c", answer[i], i == n ? '\\n' : ' ' );\r\n    }\r\n    return 0;\r\n}\r\n<\/pre>\n
\r\n\/* .................................................................................................................................. *\/\r\n\r\nconst int N = 3009;\r\n\r\nint A[N], f[N], dp[N][N];\r\nVI adj[N]; bool vis[N]; int sz[N];\r\nint n, res;\r\n\r\n#define v adj[u][i]\r\nvoid dfs(int u){\r\n    vis[u] = true, sz[u] = 1;\r\n    FLC(dp[u], 0x3f), dp[u][1] = A[u];\r\n\r\n    REP(i, SZ(adj[u])) if (!vis[v]){\r\n        dfs(v), sz[u] += sz[v];\r\n        DWN_1(j, sz[u], 2) DWN_1(k, min(sz[v], j-1), 1) \/\/ \u526a\u679d .. .\r\n            checkMin(dp[u][j], dp[u][j-k] + dp[v][k]);\r\n    }\r\n    REP_1(i, sz[u]) checkMin(f[i], dp[u][i]);\r\n}\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    REP_1_C(i, RD(n)) RD(A[i]);\r\n\r\n    FLC(f, 0x3f); DO(n-1){\r\n        int x, y; RD(x, y);\r\n        adj[x].PB(y), adj[y].PB(x);\r\n    }\r\n\r\n    dfs(1); REP_1(i, n-1) OT(f[i]);\r\n    cout << f[n] << endl;\r\n}\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"
Overview: ACdream \u7fa4\u3010\u7b2c\u4e09\u6b21\u539f\u521b\u7fa4\u8d5b\u3011\u5c06\u4e8e\u301011\u670817\u65e5\u661f\u671f\u516d\u665a19\u70b9\u3011\u8fdb\u884c\u3002\u672c\u6b21\u539f\u521b\u7fa4\u8d5b\u7531[sjtu]ftiasch\uff08\u4eba\u79f0 GXX \u795e\u725b\u3001\u53c9\u59b9\uff09\u51fa\u9898\u3002\u6b22\u8fce\u5927\u5bb6\u79ef\u6781\u53c2\u4e0e\uff5e\u3010\u51a0\u519b\u3011\u548c\u3010ACdreamOJ\u7b2c10000\u6b21\u63d0\u4ea4\u3011\u7684ID\u6211\u4eec\u5c06\u4f1a\u8d60\u9001\u5c0f\u793c\u54c1\u4e00\u4efd \u3002\u3002 \u6bd4\u8d5b\u4f20\u9001\u95e8\u3002\u3002\u3002\u3002 \uff08\u3002\u3002\u3002\u770b\u6837\u5b50\u53c9\u5a18\u4e0d\u613f\u610f\u5728 blog \u91cc\u8d34\u592a\u5b66\u672f\u7684\u4e1c\u897f\u3002\u3002\u3002\u4ee5\u4e0b\u6388\u6743\u8f6c\u53d1\u3002\u3002\u3002 ac-dream-3rd.tar \uff08\u9898\u76ee\u3001\u6807\u7a0b\u3001\u89e3\u9898\u62a5\u544a\u3001\u6d4b\u8bd5\u6570\u636e\u3002\u3002\u3002<\/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":[96],"tags":[],"class_list":["post-571","post","type-post","status-publish","format-standard","hentry","category-acdream"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p2tdP7-9d","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/571","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=571"}],"version-history":[{"count":1,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/571\/revisions"}],"predecessor-version":[{"id":572,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/571\/revisions\/572"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/media?parent=571"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/categories?post=571"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/tags?post=571"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}