{"id":53,"date":"2024-01-30T02:54:44","date_gmt":"2024-01-29T18:54:44","guid":{"rendered":"https:\/\/www.nenuacm.top\/?p=53"},"modified":"2024-02-16T01:19:35","modified_gmt":"2024-02-15T17:19:35","slug":"2024-1-27-%e6%90%9c%e7%b4%a2%e4%b9%a0%e9%a2%98","status":"publish","type":"post","link":"https:\/\/www.nenuacm.top\/index.php\/2024\/01\/30\/2024-1-27-%e6%90%9c%e7%b4%a2%e4%b9%a0%e9%a2%98\/","title":{"rendered":"2024.1.27 \u641c\u7d22\u4e60\u9898"},"content":{"rendered":"\n

A – \u9a6c\u7684\u904d\u5386<\/h1>\n\n\n\n

\u9898\u76ee\uff1a<\/h2>\n\n\n\n
\n

Description<\/h3>\n\n\n\n

\u6709\u4e00\u4e2a n\u00d7<\/em>m \u7684\u68cb\u76d8\uff0c\u5728\u67d0\u4e2a\u70b9(x,y)\u4e0a\u6709\u4e00\u4e2a\u9a6c\uff0c\u8981\u6c42\u4f60\u8ba1\u7b97\u51fa\u9a6c\u5230\u8fbe\u68cb\u76d8\u4e0a\u4efb\u610f\u4e00\u4e2a\u70b9\u6700\u5c11\u8981\u8d70\u51e0\u6b65\u3002<\/p>\n\n\n\n

Input<\/h3>\n\n\n\n

\u8f93\u5165\u53ea\u6709\u4e00\u884c\u56db\u4e2a\u6574\u6570\uff0c\u5206\u522b\u4e3a n,<\/em>m,<\/em>x,<\/em>y\u3002<\/p>\n\n\n\n

Output<\/h3>\n\n\n\n

\u4e00\u4e2a n\u00d7<\/em>m \u7684\u77e9\u9635\uff0c\u4ee3\u8868\u9a6c\u5230\u8fbe\u67d0\u4e2a\u70b9\u6700\u5c11\u8981\u8d70\u51e0\u6b65\uff08\u4e0d\u80fd\u5230\u8fbe\u5219\u8f93\u51fa \u22121\uff09\u3002<\/p>\n\n\n\n

\u5bf9\u4e8e\u5168\u90e8\u7684\u6d4b\u8bd5\u70b9\uff0c\u4fdd\u8bc1 1\u2264x\u2264n\u2264400\uff0c1\u2264y\u2264m\u2264400\u3002<\/p>\n\n\n\n

nenu\u5bd2\u5047\u641c\u7d22\u7ec3\u4e60 – Virtual Judge (vjudge.net)<\/a><\/p>\n<\/blockquote>\n\n\n\n

\u601d\u8def\uff1a<\/h2>\n\n\n\n

\u8fd9\u9053\u9898\u5176\u5b9e\u770b\u5230\u9898\u76ee\u7684\u7b2c\u4e00\u53cd\u5e94\u5c31\u662fdfs\uff0c\u56e0\u4e3adfs\u53bb\u89e3\u51b3\u8fd9\u4e2a\u95ee\u9898\u5f88\u5bb9\u6613\uff0c\u4ee3\u7801\u4e5f\u5f88\u597d\u5b9e\u73b0\uff0c\u4f46\u662f\u641c\u7d22\u4e2d\u4f1a\u6709\u5f88\u591a\u91cd\u590d\u7684\u8def\u5f84\uff0c\u628a\u9a6c\u53ef\u80fd\u8d70\u7684\u6240\u6709\u60c5\u51b5\u90fd\u904d\u5386\u4e86\uff0c\u65f6\u95f4\u662f\u76f8\u5f53\u4e45\u7684\uff0c\u6240\u4ee5\u5c31\u4f1aTLE\uff08time limited exceed\uff09\u3002<\/p>\n\n\n\n

\u65e2\u7136dfs\u8d70\u4e0d\u901a\uff0c\u6211\u4eec\u5c31\u7528bfs\u6765\u641c\u7d22\u3002<\/p>\n\n\n\n

\u6211\u4eec\u6765\u68b3\u7406\u4e00\u4e0bbfs\u5e7f\u5ea6\u4f18\u5148\u641c\u7d22\u7684\u601d\u8def\u3002<\/p>\n\n\n\n

\u5148\u628a\u6211\u4eec\u8981\u641c\u7d22\u7684\u7b2c\u4e00\u4e2a\u8282\u70b9\u52a0\u5165\u961f\u5217\uff0c\u7136\u540e\u5f39\u51fa\u961f\u5217\u7684\u7b2c\u4e00\u4e2a\u8282\u70b9\uff0c\u770b\u770b\u5176\u6709\u90a3\u4e9b\u5b50\u8282\u70b9\uff0c\u628a\u6240\u6709\u7684\u5b50\u8282\u70b9\u52a0\u5165\u961f\u5217\u3002<\/p>\n\n\n\n

\u7136\u540e\u6211\u4eec\u518d\u5f39\u51fa\u6b64\u65f6\u961f\u5217\u91cc\u7684\u7b2c\u4e00\u4e2a\u8282\u70b9\uff0c\u7136\u540e\u7ee7\u7eed\u6269\u5c55\u5176\u5b50\u8282\u70b9\u3002\u76f4\u5230\u6700\u540e\u961f\u5217\u4e3a\u7a7a\u7ed3\u675f\u3002<\/p>\n\n\n\n

\u6240\u4ee5\u8fd9\u9053\u9898\u7684\u601d\u8def\u5c31\u662f\uff0c\u6211\u4eec\u5148\u52a0\u5165\u9a6c\u6700\u5f00\u59cb\u6240\u5728\u7684\uff08x\uff0cy\uff09\u8282\u70b9\uff0c\u7136\u540e\u6269\u5c55\u5b83\u4e0b\u4e00\u6b65\u80fd\u5230\u7684\u6240\u6709\u4f4d\u7f6e\u52a0\u5165\u961f\u5217\uff0c\u7136\u540e\u518d\u5f39\u51fa\u961f\u5217\u7684\u7b2c\u4e00\u4e2a\u8282\u70b9\uff0c\u7ee7\u7eed\u6269\u5c55\u3002\u8fd9\u6837\u5f53\u6211\u4eecbfs\u4e00\u904d\u4e4b\u540e\uff0c\u5c31\u5df2\u7ecf\u66f4\u65b0\u8fc7\u6240\u6709\u70b9\u7684\u6b65\u6570\u4e86\u3002<\/p>\n\n\n\n

\u4ee3\u7801DFS\u7248\u672c\uff08TLE\uff09\uff1a<\/h2>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nconst int INF = 0x3f3f3f3f;\nint n,m,x,y;\nint mx[1005][1005];\nint dx[8]={2,-2,2,-2,-1,1,-1,1};\nint dy[8]={1,1,-1,-1,2,2,-2,-2};\nvoid dfs(int x,int y,int dis){\n    if(x <= 0 || y <= 0 || x > n || y > m){\n        return ;\n    }\n\n    mx[x][y] = dis;\n    int nx,ny;\n    for(int i = 0;i < 8;i++){\n        nx = x + dx[i];\n        ny = y + dy[i];\n        if(dis + 1 < mx[nx][ny] || mx[nx][ny] == INF){\n            dfs(nx,ny,dis + 1);\n        }\n    }\n}\nint main() {\n    \n    cin >> n >> m >> x >> y;\n    for(int i = 1;i <= n;i++){\n        for(int j = 1;j <= m;j++){\n            mx[i][j] = INF;\n        }\n    }\n    dfs(x,y,0);\n    for(int i = 1;i <= n;i++){\n        for(int j = 1;j <= m;j++){\n            if(mx[i][j] != INF)\n                cout << mx[i][j] << \" \";\n            else cout << -1 << \" \";\n        }\n        cout << \"\\n\";\n    }\n}<\/code><\/pre>\n\n\n\n
\u4ee3\u7801BFS\u7248\u672c\uff08AC\uff09\uff1a<\/h2>\n\n\n\n
#include <bits\/stdc++.h>\nusing namespace std;\n\n\/\/ \u5b9a\u4e49\u4e00\u4e2a\u7ed3\u6784\u4f53\u6765\u4fdd\u5b58\u5750\u6807\u548c\u6b65\u6570\nstruct Node {\n    int x, y, dist;\n};\n\nint n, m, x, y;\nint mx[1005][1005];\nint dx[8] = {-2, -2, -1, -1, 2, 2, 1, 1};\nint dy[8] = {1, -1, 2, -2, 1, -1, 2, -2};\n\nvoid bfs(int x, int y) {\n    queue<Node> q;\n    q.push({x, y, 0});\n    mx[x][y] = 0;\n\n    while (!q.empty()) {\n        Node node = q.front();\n        q.pop();\n        for (int i = 0;i < 8;i++) {\n            int nx = node.x + dx[i];\n            int ny = node.y + dy[i];\n            \/\/\u5982\u679c\u8fd9\u4e2a\u70b9\u5408\u7406\u5b58\u5728\u4e14\u6ca1\u88ab\u8bbf\u95ee\u8fc7\n            if (nx > 0 && ny > 0 && nx <= n && ny <= m && mx[nx][ny] == -1) {\n                mx[nx][ny] = node.dist + 1;\n                q.push({nx, ny, mx[nx][ny]});\n            }\n        }\n    }\n}\n\nint main() {\n    cin >> n >> m >> x >> y;\n    memset(mx,-1,sizeof(mx));\n\n    bfs(x, y);\n\n    for (int i = 1; i <= n;i++) {\n        for (int j = 1; j <= m;j++) {\n            cout << left << setw(5) << mx[i][j];\n        }\n        cout << \"\\n\";\n    }\n}<\/code><\/pre>\n\n\n\n
B – \u9ad8\u624b\u53bb\u6563\u6b65<\/h1>\n\n\n\n
\u9898\u76ee\uff1a<\/h2>\n\n\n\n
\n
Background<\/h3>\n\n\n\n
\u9ad8\u624b\u6700\u8fd1\u8c08\u604b\u7231\u4e86\u3002\u4e0d\u8fc7\u662f\u5355\u76f8\u601d\u3002\u201c\u5373\u4f7f\u662f\u5355\u76f8\u601d\uff0c\u4e5f\u662f\u5b8c\u6574\u7684\u7231\u60c5\u201d\uff0c\u9ad8\u624b\u4ece\u672a\u653e\u5f03\u5bf9\u5b83\u7684\u8ffd\u6c42\u3002\u4eca\u5929\uff0c\u8fd9\u4e2a\u9633\u5149\u660e\u5a9a\u7684\u65e9\u6668\uff0c\u592a\u9633\u4ece\u897f\u8fb9\u7f13\u7f13\u5347\u8d77\u3002\u4e8e\u662f\u5b83\u627e\u5230\u9ad8\u624b\uff0c\u5e0c\u671b\u5728\u6668\u8bfb\u5f00\u59cb\u4e4b\u524d\u548c\u9ad8\u624b\u4e00\u8d77\u5728\u9ccc\u5934\u5c71\u4e0a\u4e00\u8d77\u6563\u6b65\u3002\u9ad8\u624b\u5f53\u7136\u4e0d\u4f1a\u653e\u5f03\u8fd9\u6b21\u68a6\u5bd0\u4ee5\u6c42\u7684\u673a\u4f1a\uff0c\u4ed6\u5df2\u7ecf\u51c6\u5907\u597d\u4e86\u4e00\u5207\u3002<\/p>\n\n\n\n
Description<\/h3>\n\n\n\n
\u9ccc\u5934\u5c71\u4e0a\u6709 n \u4e2a\u89c2\u666f\u70b9\uff0c\u89c2\u666f\u70b9\u4e24\u4e24\u4e4b\u95f4\u6709\u6e38\u6b65\u9053\u5171 m \u6761\u3002\u9ad8\u624b\u7684\u90a3\u4e2a\u5b83\uff0c\u4e0d\u559c\u6b22\u592a\u523a\u6fc0\u7684\u8fc7\u7a0b\uff0c\u56e0\u6b64\u90a3\u4e9b\u6ca1\u6709\u8def\u7684\u89c2\u666f\u70b9\u9ad8\u624b\u662f\u4e0d\u4f1a\u9009\u62e9\u53bb\u7684\u3002\u53e6\u5916\uff0c\u5979\u4e5f\u4e0d\u559c\u6b22\u53bb\u540c\u4e00\u4e2a\u89c2\u666f\u70b9\u4e00\u6b21\u4ee5\u4e0a\u3002\u800c\u9ad8\u624b\u60f3\u8ba9\u4ed6\u4eec\u5728\u4e00\u8d77\u7684\u8def\u7a0b\u6700\u957f\uff08\u89c2\u666f\u65f6\u5b83\u4e0d\u4f1a\u7406\u9ad8\u624b\uff09\uff0c\u5df2\u77e5\u9ad8\u624b\u7684\u7a7f\u68ad\u673a\u53ef\u4ee5\u8ba9\u4ed6\u4eec\u5728\u4efb\u610f\u4e00\u4e2a\u89c2\u666f\u70b9\u51fa\u53d1\uff0c\u4e5f\u5728\u4efb\u610f\u4e00\u4e2a\u89c2\u666f\u70b9\u7ed3\u675f\u3002<\/p>\n\n\n\n
Input<\/h3>\n\n\n\n
\u7b2c\u4e00\u884c\uff0c\u4e24\u4e2a\u7528\u7a7a\u683c\u9694\u5f00\u7684\u6574\u6570 n\u3001m\u3002\u4e4b\u540e m<\/em> \u884c\uff0c\u4e3a\u6bcf\u6761\u6e38\u6b65\u9053\u7684\u4fe1\u606f\uff1a\u4e24\u7aef\u89c2\u666f\u70b9\u7f16\u53f7\u3001\u957f\u5ea6\u3002<\/p>\n\n\n\n
Output<\/h3>\n\n\n\n
\u4e00\u4e2a\u6574\u6570\uff0c\u8868\u793a\u4ed6\u4eec\u6700\u957f\u76f8\u4f34\u7684\u8def\u7a0b\u3002<\/p>\n\n\n\n
\u5bf9\u4e8e 100%100% \u7684\u6570\u636e\uff1an\u226420\uff0cm\u226450\uff0c\u4fdd\u8bc1\u89c2\u666f\u70b9\u4e24\u4e24\u4e4b\u95f4\u4e0d\u4f1a\u6709\u591a\u6761\u6e38\u6b65\u9053\u8fde\u63a5\u3002<\/p>\n\n\n\n
nenu\u5bd2\u5047\u641c\u7d22\u7ec3\u4e60 – Virtual Judge (vjudge.net)<\/a><\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h2>\n\n\n\n
\u7b80\u5355\u603b\u7ed3\u4e00\u4e0b\uff0c\u5c31\u662f\u4e00\u4e2a\u65e0\u5411\u52a0\u6743\u56fe\uff0c\u8981\u627e\u5230\u5176\u4e2d\u6700\u957f\u7684\u4e00\u6761\u8def\u5f84\uff0c\u6570\u636e\u91cf\u5f88\u5c0f\uff0c\u53ef\u4ee5\u7528\u90bb\u63a5\u77e9\u9635\u6765\u5904\u7406\u3002<\/p>\n\n\n\n
\u9996\u5148\u6211\u4eec\u7528\u90bb\u63a5\u77e9\u9635\u5b58\u56fe\u4e4b\u540e\uff0c\u6765\u601d\u8003\u4e00\u4e0b\u600e\u4e48\u627e\u5230\u6700\u957f\u7684\u4e00\u6761\u8def\u5f84\u3002\u6bd4\u5982\u6211\u4eec\u4efb\u9009\u4e00\u4e2a\u8d77\u70b9\uff0c\u5728\u56fe\u4e0a\u641c\u7d22\uff0c\u8ba1\u7b97\u6240\u6709\u53ef\u80fd\u7684\u8def\u5f84\uff0c\u6211\u4eec\u641c\u7d22\u4e00\u4e0b\uff0c\u5c31\u80fd\u5f97\u5230\u4ece\u8be5\u70b9\u51fa\u53d1\u7684\u6700\u957f\u957f\u5ea6\u3002\u6211\u4eec\u904d\u5386\uff0c\u628a\u6bcf\u4e2a\u70b9\u4f5c\u4e3a\u8d77\u70b9\u51fa\u53d1\u7684\u60c5\u51b5\u90fd\u8003\u8651\u4e00\u904d\u5c31\u884c\u3002<\/p>\n\n\n\n
\u56e0\u4e3a\u6570\u636e\u91cf\u5f88\u5c0f\uff0c\u6240\u4ee5\u6211\u4eec\u7528dfs\u6765\u641c\u7d22\u5c31\u884c\uff0c\u6bd5\u7adfdfs\u7684\u5b9e\u73b0\u975e\u5e38\u5bb9\u6613\u3002<\/p>\n\n\n\n
\u4ee3\u7801DFS\u7248\u672c\uff08AC\uff09\uff1a<\/h2>\n\n\n\n
#include <bits\/stdc++.h>\nusing namespace std;\n\nint mx[100][100];\nint vis[100];\nint n,m;\nint ans = 0;\n\nvoid dfs(int x,int dis){\n    ans = max(ans,dis);\n    for(int i = 1;i <= n;i++){\n        \/\/\u6ca1\u6709\u8def\n        if(!mx[x][i]){\n            continue;\n        }else{\n            \/\/\u6709\u8def,\u5148\u5224\u65ad\u6709\u6ca1\u6709\u88ab\u8bbf\u95ee\u8fc7\u3002\u88ab\u8bbf\u95ee\u8fc7\u7684\u8bdd\u5c31\u6362\u4e00\u6761\n            if(!vis[i]){\n                vis[i] = 1;\n                dfs(i,dis + mx[x][i]);\n                vis[i] = 0;\n            }else{\n                continue;\n            }\n        }\n    }\n}\n\nint main() {\n\n    cin >> n >> m;\n    for(int i = 1;i <= m;i++){\n        int a,b,w;\n        cin >> a >> b >> w;\n        mx[a][b] = w;\n        mx[b][a] = w;\n    }\n    for(int i = 1;i <= n;i++){\n        vis[i] = 1;\n        dfs(i,0);\n        vis[i] = 0;\n    }\n    cout << ans << \"\\n\";\n}<\/code><\/pre>\n\n\n\n
C – \u5c0f\u57cb\u4e0e\u626b\u96f7<\/h1>\n\n\n\n
\u9898\u76ee\uff1a<\/h2>\n\n\n\n
\n
Background<\/h3>\n\n\n\n
\u5c0f\u57cb\u603b\u662f\u5728\u5bb6\u4e2d\u6253\u6e38\u620f\uff0c\u4e00\u5929\uff0c\u5979\u7a81\u7136\u60f3\u73a9Windows\u81ea\u5e26\u7684\u626b\u96f7\uff0c\u5728\u4e00\u65c1\u7684\u54e5\u54e5\u770b\u89c1\u4e86\uff0c\u60f3\u8d77\u4e86\u81ea\u5df1\u5c0f\u65f6\u5019\u4fe1\u606f\u8bfe\u5728\u673a\u623f\u73a9\u626b\u96f7\u7684\u65e5\u5b50\uff0c\u4fbf\u5174\u81f4\u52c3\u52c3\u5730\u5f00\u59cb\u6559\u5c0f\u57cb\u626b\u96f7\u3002\u7136\u800c\uff0c\u5c0f\u57cb\u8fd8\u662f\u4e0d\u660e\u767d 3bv\uff08Bechtel’s Board Benchmark Value\uff0c\u6bcf\u5c40\u5c06\u6240\u6709\u975e\u96f7\u7684\u65b9\u5757\u70b9\u5f00\u6240\u9700\u6700\u5c11\u5de6\u952e\u70b9\u51fb\u6570\uff0c\u53c2\u89c1\u626b\u96f7\u7f51\u7684\u6559\u7a0b<\/a> \uff09\u600e\u4e48\u7b97\uff0c\u4e8e\u662f\u5979\u627e\u5230\u4e86\u4f60\u3002<\/p>\n\n\n\n
\"img\"\/<\/div><\/figure>\n\n\n\n
Description<\/h3>\n\n\n\n
\u5c0f\u57cb\u4f1a\u544a\u8bc9\u4f60\u4e00\u76d8\u626b\u96f7\uff0c\u7528\u4e00\u4e2a n\u00d7m \u7684\u77e9\u9635\u8868\u793a\uff0c1 \u662f\u96f7 \uff0c0 \u4e0d\u662f\u96f7\uff0c\u8bf7\u4f60\u544a\u8bc9\u5979\u8fd9\u76d8\u626b\u96f7\u7684 3bv \u3002<\/p>\n\n\n\n
\u5468\u56f4\u516b\u683c\u6ca1\u6709\u201c\u96f7\u201d\u4e14\u81ea\u8eab\u4e0d\u662f\u201c\u96f7\u201d\u7684\u65b9\u683c\u79f0\u4e3a\u201c\u7a7a\u683c\u201d\uff0c\u5468\u56f4\u516b\u683c\u6709\u201c\u96f7\u201d\u4e14\u81ea\u8eab\u4e0d\u662f\u201c\u96f7\u201d\u7684\u65b9\u683c\u79f0\u4e3a\u201c\u6570\u5b57\u201d\uff0c\u7531\u201c\u7a7a\u683c\u201d\u7ec4\u6210\u7684\u516b\u8fde\u901a\u5757\u79f0\u4e3a\u4e00\u4e2a\u201c\u7a7a\u201d\u30023bv = \u5468\u56f4\u516b\u683c\u6ca1\u6709\u201c\u7a7a\u683c\u201d\u7684\u201c\u6570\u5b57\u201d\u4e2a\u6570 + \u201c\u7a7a”\u7684\u4e2a\u6570\u3002<\/p>\n\n\n\n
\u5982\u679c\u770b\u4e0d\u61c2\u4e0a\u9762\u7684\u8ba1\u7b97\u65b9\u5f0f\uff0c\u53ef\u4ee5\u770b\u9898\u76ee\u80cc\u666f\u4e2d\u7ed9\u51fa\u7684\u6559\u7a0b\uff0c\u6216\u8005\u770b\u4e0b\u9762\u7684\u6837\u4f8b\u89e3\u91ca\u3002<\/p>\n\n\n\n
\u6ce8\uff1a\u516b\u8fde\u901a<\/a><\/p>\n\n\n\n
Input<\/h3>\n\n\n\n
\u7b2c\u4e00\u884c\u6709\u4e24\u4e2a\u6574\u6570 n \u548c m\uff0c\u4ee3\u8868\u8fd9\u76d8\u626b\u96f7\u662f\u4e00\u4e2a n\u00d7m \u7684\u77e9\u9635\u3002<\/p>\n\n\n\n
\u540e\u9762\u7684 n \u884c\u6bcf\u884c\u6709 m \u4e2a\u6574\u6570\uff0c\u8868\u793a\u8fd9\u4e2a\u77e9\u9635\uff0c\u6bcf\u4e2a\u6570\u5b57\u4e3a 0 \u6216 1\uff0c1 \u4ee3\u8868\u662f\u96f7\uff0c0 \u4ee3\u8868\u4e0d\u662f\u96f7\u3002<\/p>\n\n\n\n
Output<\/h3>\n\n\n\n
\u4e00\u4e2a\u6574\u6570\uff0c\u4ee3\u8868\u8fd9\u76d8\u626b\u96f7\u7684 3bv \u3002<\/p>\n\n\n\n
1\u2264n,m\u22641000<\/p>\n\n\n\n
nenu\u5bd2\u5047\u641c\u7d22\u7ec3\u4e60 – Virtual Judge (vjudge.net)<\/a><\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h2>\n\n\n\n
\u8fd9\u9898\u9664\u4e86\u9898\u610f\u6bd4\u8f83\u96be\u61c2\u4ee5\u5916\uff0c\u5176\u5b9e\u633a\u597d\u5199\u7684\uff0c\u5c31\u662f\u4ee3\u7801\u91cf\u6709\u70b9\u957f\uff08\u7b14\u8005\u8fd8\u8bfb\u5047\u9898\u4e86\uff09<\/del>\u3002<\/p>\n\n\n\n
\u5176\u5b9e\u505a\u597d\u5224\u65ad\u5c31\u53ef\u4ee5\u4e86\u3002\u5224\u65ad\u8c01\u662f\u7a7a\u683c\uff0c\u8c01\u662f\u96f7\uff0c\u8c01\u662f\u6570\u5b57\u3002\u7136\u540e\u6839\u636e\u9898\u610f\u505adfs\u641c\u7d22\u5c31\u884c\u3002<\/p>\n\n\n\n
\u7b14\u8005\u7684\u601d\u8def\u662f\u5148\u53bb\u627e\u7a7a\u683c\uff0c\u7136\u540e\u5f97\u5230\u7a7a\u683c\u7684\u77e9\u9635\u3002dfs\u641c\u7d22\u8fd9\u4e2a\u77e9\u9635\uff0c\u627e\u51fa\u7a7a\u7684\u4e2a\u6570\u3002<\/p>\n\n\n\n
\u7136\u540e\u518d\u53bb\u627e\u56db\u5468\u6709\u96f7\u6ca1\u7a7a\u683c\u7684\u6570\u5b57\uff0c\u904d\u5386\u4e00\u904d\u77e9\u9635\u7684\u6bcf\u4e2a\u4f4d\u7f6e\u3002\u6bcf\u4e2a\u4f4d\u7f6e\u90fd\u4e0a\u4e0b\u5de6\u53f3\u516b\u4e2a\u65b9\u5411\u505a\u4e2a\u5224\u65ad\u5c31\u884c\uff0c\u5982\u679c\u6ee1\u8db3\u5c31\uff0b1\u3002<\/p>\n\n\n\n
\u4ee3\u7801DFS\u7248\u672c\uff08AC\uff09\uff1a<\/h2>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint mx[1005][1005];\nint vis[1005][1005];\nint n,m;\nint dx[] = {1,-1,0};\nint dy[] = {1,-1,0};\nint check(int x,int y){\n\tint flag = 0;\n\t\/\/\u4e5d\u4e2a\u683c\u5b50\u90fd\u4e3a0\uff0c\u624d\u662f\u7a7a\u683c\n\tfor(int i = 0;i < 3;i++){\n\t\tfor(int j = 0;j < 3;j++){\n\t\t\tint nx = x + dx[i];\n\t\t\tint ny = y + dy[j];\n\t\t\tif(nx <= 0 || ny <= 0 || nx > n || ny > m){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(mx[nx][ny] != 0) flag = 1;\n\t\t}\n\t}\n\tif(flag) return 0;\n\telse return 1;\n}\nint dfs(int x,int y){\n\tif(x <= 0 || y <= 0 || x > n || y > m || vis[x][y] == 0){\n\t\treturn 0;\n\t}\n\tvis[x][y] = 0;\n\treturn 1 + dfs(x - 1,y) + dfs(x + 1,y) + dfs(x,y + 1) + dfs(x,y - 1) + \n\tdfs(x + 1,y + 1) + dfs(x - 1,y + 1) + dfs(x + 1,y - 1) + dfs(x - 1,y - 1) ;\n}\nint main(){\n\n\tcin >> n >> m;\n\tfor(int i = 1;i <= n;i++){\n\t\tfor(int j = 1;j <= m;j++){\n\t\t\tcin >> mx[i][j];\n\t\t}\n\t}\n\tfor(int i = 1;i <= n;i++){\n\t\tfor(int j = 1;j <= m;j++){\n\t\t\tvis[i][j] = check(i,j);\n\t\t}\n\t}\n\tint cnt = 0;\n\tfor(int i = 1;i <= n;i++){\n\t\tfor(int j = 1;j <= m;j++){\n\t\t\tif(dfs(i,j) > 0){\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 1;i <= n;i++){\n\t\tfor(int j = 1;j <= m;j++){\n\t\t\tif(mx[i][j]) continue;\n\t\t\tint flag = 0;\n\t\t\t\/\/(i,j)\u4e0a\u4e0b\u5de6\u53f3\u90fd\u4e0d\u662f\u7a7a\u683c\uff0c\u4e14\u5b58\u5728\u96f7\n\t\t\tfor(int k = 0;k < 3;k++){\n\t\t\t\tfor(int l = 0;l < 3;l++){\n\t\t\t\t\tint nx = i + dx[k];\n\t\t\t\t\tint ny = j + dy[l];\n\t\t\t\t\tif(nx <= 0 || ny <= 0 || nx > n || ny > m ){\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tif(check(nx,ny)) flag = 1;\/\/\u8bf4\u660e\u6709\u7a7a\u683c\n\t\t\t\t}\n\t\t\t}\n\t\t\t\/\/\u6709\u7a7a\u683c\u4e0d\u884c\n\t\t\tif(flag){\n\t\t\t\tflag = 0;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tflag = 0;\n\t\t\t\/\/\u6ca1\u7a7a\u683c\u7684\u65f6\u5019\u5c31\u627e\u96f7\n\t\t\tfor(int k = 0;k < 3;k++){\n\t\t\t\tfor(int l = 0;l < 3;l++){\n\t\t\t\t\tint nx = i + dx[k];\n\t\t\t\t\tint ny = j + dy[l];\n\t\t\t\t\tif(nx <= 0 || ny <= 0 || nx > n || ny > m ){\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tif(mx[nx][ny] == 1) flag = 1;\/\/\u8bf4\u660e\u6709\u7a7a\u683c\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag){\n\t\t\t\tflag = 0;\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t}\n\tcout << cnt << \"\\n\";\n}<\/code><\/pre>\n\n\n\n
\u5f69\u86cb(\u6c42\u6210\u6700\u5927\u7a7a\u7684\u5927\u5c0f\u4e86\uff09\uff1a<\/h2>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint mx[1005][1005];\nint vis[1005][1005];\nint n,m;\nint dx[] = {1,-1,0};\nint dy[] = {1,-1,0};\nint check(int x,int y){\n\tint flag = 0;\n\t\/\/\u4e5d\u4e2a\u683c\u5b50\u90fd\u4e3a0\uff0c\u624d\u6b63\u786e\n\tfor(int i = 0;i < 3;i++){\n\t\tfor(int j = 0;j < 3;j++){\n\t\t\tint nx = x + dx[i];\n\t\t\tint ny = y + dy[j];\n\t\t\tif(nx <= 0 || ny <= 0 || nx > n || ny > m){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(mx[nx][ny] != 0) flag = 1;\n\t\t}\n\t}\n\tif(flag) return 0;\n\telse return 1;\n}\nint dfs(int x,int y){\n\tif(x <= 0 || y <= 0 || x > n || y > m || vis[x][y] == 0){\n\t\treturn 0;\n\t}\n\tvis[x][y] = 0;\n\treturn 1 + dfs(x - 1,y) + dfs(x + 1,y) + dfs(x,y + 1) + dfs(x,y - 1);\n}\nint main(){\n\n\tcin >> n >> m;\n\tfor(int i = 1;i <= n;i++){\n\t\tfor(int j = 1;j <= m;j++){\n\t\t\tcin >> mx[i][j];\n\t\t}\n\t}\n\tfor(int i = 1;i <= n;i++){\n\t\tfor(int j = 1;j <= m;j++){\n\t\t\tvis[i][j] = check(i,j);\n\t\t}\n\t}\n\t\/\/ for(int i = 1;i <= n;i++){\n\t\/\/ \tfor(int j = 1;j <= m;j++){\n\t\/\/ \t\tcout << vis[i][j] << \" \";\n\t\/\/ \t}\n\t\/\/ \tcout << \"\\n\";\n\t\/\/ }\n\tint maxx = 0;\n\tfor(int i = 1;i <= n;i++){\n\t\tfor(int j = 1;j <= m;j++){\n\t\t\tint cnt = dfs(i,j);\n\t\t\tmaxx = max(cnt,maxx);\n\t\t}\n\t}\n\tcout << maxx << \"\\n\";\n}<\/code><\/pre>\n\n\n\n
D – \u5168\u7403\u53d8\u6696<\/h1>\n\n\n\n
\u9898\u76ee\uff1a<\/h2>\n\n\n\n
\n
Description<\/h3>\n\n\n\n
\u4f60\u6709\u4e00\u5f20\u67d0\u6d77\u57df N \u00d7 N \u50cf\u7d20\u7684\u7167\u7247\uff0c.<\/code> \u8868\u793a\u6d77\u6d0b\u3001 #<\/code> \u8868\u793a\u9646\u5730\uff0c\u5982\u4e0b\u6240\u793a\uff1a…….
.##….
.##….
….##.
..####.
…###.
…….<\/p>\n\n\n\n
\u5176\u4e2d “\u4e0a\u4e0b\u5de6\u53f3” \u56db\u4e2a\u65b9\u5411\u4e0a\u8fde\u5728\u4e00\u8d77\u7684\u4e00\u7247\u9646\u5730\u7ec4\u6210\u4e00\u5ea7\u5c9b\u5c7f\u3002\u4f8b\u5982\u4e0a\u56fe\u5c31\u6709 2 \u5ea7\u5c9b\u5c7f\u3002<\/p>\n\n\n\n
\u7531\u4e8e\u5168\u7403\u53d8\u6696\u5bfc\u81f4\u4e86\u6d77\u9762\u4e0a\u5347\uff0c\u79d1\u5b66\u5bb6\u9884\u6d4b\u672a\u6765\u51e0\u5341\u5e74\uff0c\u5c9b\u5c7f\u8fb9\u7f18\u4e00\u4e2a\u50cf\u7d20\u7684\u8303\u56f4\u4f1a\u88ab\u6d77\u6c34\u6df9\u6ca1\u3002\u5177\u4f53\u6765\u8bf4\u5982\u679c\u4e00\u5757\u9646\u5730\u50cf\u7d20\u4e0e\u6d77\u6d0b\u76f8\u90bb\uff08\u4e0a\u4e0b\u5de6\u53f3\u56db\u4e2a\u76f8\u90bb\u50cf\u7d20\u4e2d\u6709\u6d77\u6d0b\uff09\uff0c\u5b83\u5c31\u4f1a\u88ab\u6df9\u6ca1\u3002<\/p>\n\n\n\n
\u4f8b\u5982\u4e0a\u56fe\u4e2d\u7684\u6d77\u57df\u672a\u6765\u4f1a\u53d8\u6210\u5982\u4e0b\u6837\u5b50\uff1a…….
…….
…….
…….
….#..
…….
…….<\/p>\n\n\n\n
\u8bf7\u4f60\u8ba1\u7b97\uff1a\u4f9d\u7167\u79d1\u5b66\u5bb6\u7684\u9884\u6d4b\uff0c\u7167\u7247\u4e2d\u6709\u591a\u5c11\u5c9b\u5c7f\u4f1a\u88ab\u5b8c\u5168\u6df9\u6ca1\u3002<\/p>\n\n\n\n
Input<\/h3>\n\n\n\n
\u7b2c\u4e00\u884c\u5305\u542b\u4e00\u4e2a\u6574\u6570N\u3002(1\u2264N\u22641000)\u3002<\/p>\n\n\n\n
\u4ee5\u4e0b N \u884c N \u5217\u4ee3\u8868\u4e00\u5f20\u6d77\u57df\u7167\u7247\u3002<\/p>\n\n\n\n
\u7167\u7247\u4fdd\u8bc1\u7b2c 1\u884c\u3001\u7b2c 1 \u5217\u3001\u7b2cN\u884c\u3001\u7b2cN\u5217\u7684\u50cf\u7d20\u90fd\u662f\u6d77\u6d0b\u3002<\/p>\n\n\n\n
Output<\/h3>\n\n\n\n
\u4e00\u4e2a\u6574\u6570\u8868\u793a\u7b54\u6848\u3002<\/p>\n\n\n\n
nenu\u5bd2\u5047\u641c\u7d22\u7ec3\u4e60 – Virtual Judge (vjudge.net)<\/a><\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h2>\n\n\n\n
\u8fd9\u9053\u9898\u4e00\u5f00\u59cb\u6211\u60f3\u5230\u7684\u89e3\u6cd5\u662f\uff0c\u5148\u7edf\u8ba1\u4e00\u6b21\u539f\u59cb\u5c9b\u5c7f\u4e2a\u6570\uff0c\u7136\u540e\u628a\u4f1a\u6df9\u6ca1\u7684\u9646\u5730\u5220\u6389\uff0c\u518d\u7edf\u8ba1\u4e00\u6b21\u3002\u7136\u540e\u4e24\u6b21\u7edf\u8ba1\u76f8\u51cf\u5f97\u5230\u7ed3\u679c\u3002\u4f46\u662f\u4ea4\u4e0a\u53bb\u4e4b\u540eWA\u4e86\u3002\u6240\u4ee5\u6211\u8003\u8651\u5230\u8fd9\u4e48\u4e00\u79cd\u60c5\u51b5\uff1a<\/p>\n\n\n\n
7\n.......\n.##.##.\n.#####.\n.##.##.\n.......\n.......\n.......<\/code><\/pre>\n\n\n\n
\u7c7b\u4f3c\u8fd9\u6837\u7684\u56fe\uff0c\u539f\u672c\u4e00\u4e2a\u5c9b\u5c7f\uff0c\u6700\u540e\u4f1a\u53d8\u6210\u4e24\u4e2a\u5c9b\u5c7f\uff0c\u6211\u7684\u7b54\u6848\u5c31\u4f1a\u8dd1\u51fa\u8d1f\u6570\u6765\u3002<\/p>\n\n\n\n
\u6240\u4ee5\u6211\u4eec\u5e94\u8be5\u6362\u4e00\u4e2a\u601d\u8def\u60f3\u3002\u5c31\u662f\u6211\u4eec\u5728\u539f\u6709\u7edf\u8ba1\u5c9b\u5c7f\u4e2a\u6570\u7684\u57fa\u7840\u4e0a\uff0c\u770b\u770b\u8fd9\u4e2a\u5c9b\u5c7f\u4e0a\u6709\u6ca1\u6709\u4e0d\u4f1a\u88ab\u6df9\u6ca1\u7684\u90e8\u5206\uff0c\u5982\u679c\u6709\uff0c\u8bf4\u660e\u8fd9\u4e2a\u8fde\u901a\u5c9b\u5c7f\u6700\u540e\u4e0d\u4f1a\u5168\u90e8\u88ab\u6df9\u6ca1\u3002<\/p>\n\n\n\n
\u6240\u4ee5\u6211\u5c31\u5728dfs\u91cc\u52a0\u4e86\u4e2a\u53d8\u91cf\u5224\u65ad\uff0c\u5982\u679c\u6709\uff0c\u5c31cnt2++\u3002<\/p>\n\n\n\n
\u6700\u540e\u628a \u5c9b\u5c7f\u4e2a\u6570cnt – \u4e0d\u4f1a\u88ab\u6df9\u6ca1\u7684\u5c9b\u5c7f\u4e2a\u6570cnt2 \u5c31\u80fd\u5f97\u51fa\u6b63\u786e\u7684\u7ed3\u679c\u4e86\u3002<\/p>\n\n\n\n
\u4ee3\u7801DFS\uff08AC\uff09\uff1a<\/h2>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint mx[1005][1005];\nint mx2[1005][1005];\nint dx[] = {1,-1,0};\nint dy[] = {1,-1,0};\nint vis[1005][1005];\nint n;\nint f;\nint check(int x,int y){\n    \/\/\u4e0a\u4e0b\u5de6\u53f3\u90fd\u662f\u5c9b\n    if(mx[x - 1][y] && mx[x + 1][y] && mx[x][y - 1] && mx[x][y + 1]){\n        return 1;\n    }\n    return 0;\n}\nint dfs(int x,int y){\n    \n    if(!vis[x][y]) f += check(x,y);\n    vis[x][y] = 1;\n    if(x <= 0 || y <= 0 || x > n || y > n || mx2[x][y] == 0){\n        return 0;\n    }\n    mx2[x][y] = 0;\n    return 1 + dfs(x - 1,y) + dfs(x + 1,y) + dfs(x,y + 1) + dfs(x,y - 1);\n}\nint main(){\n\n    cin >> n;\n    for(int i = 1;i <= n;i++){\n        for(int j = 1;j <= n;j++){\n            char c;\n            cin >> c;\n            if(c == '.') mx[i][j] = 0;\n            else mx[i][j] = 1;\n            mx2[i][j] = mx[i][j];\n        }\n    }\n    int cnt = 0;\n    int cnt2 = 0;\n    for(int i = 1;i <= n;i++){\n        for(int j = 1;j <= n;j++){\n            if(dfs(i,j) > 0){\n                cnt++;\n                if(f){\n                    f = 0;\n                    cnt2++;\n                }\n            }\n        }\n    }\n    cout << cnt - cnt2 << \"\\n\";\n}<\/code><\/pre>\n\n\n\n
E – \u8ff7\u5bab\u5bfb\u8def<\/h1>\n\n\n\n
\u9898\u76ee\uff1a<\/h2>\n\n\n\n
\n
Description<\/h3>\n\n\n\n
\u673a\u5668\u732b\u88ab\u56f0\u5728\u4e00\u4e2a\u77e9\u5f62\u8ff7\u5bab\u91cc\u3002<\/p>\n\n\n\n
\u8ff7\u5bab\u53ef\u4ee5\u89c6\u4e3a\u4e00\u4e2a n\u00d7m \u77e9\u9635\uff0c\u6bcf\u4e2a\u4f4d\u7f6e\u8981\u4e48\u662f\u7a7a\u5730\uff0c\u8981\u4e48\u662f\u5899\u3002\u673a\u5668\u732b\u53ea\u80fd\u4ece\u4e00\u4e2a\u7a7a\u5730\u8d70\u5230\u5176\u4e0a\u3001\u4e0b\u3001\u5de6\u3001\u53f3\u7684\u7a7a\u5730\u3002<\/p>\n\n\n\n
\u673a\u5668\u732b\u521d\u59cb\u65f6\u4f4d\u4e8e(1,1)\u7684\u4f4d\u7f6e\uff0c\u95ee\u80fd\u5426\u8d70\u5230(n,m)\u4f4d\u7f6e\u3002<\/p>\n\n\n\n
Input<\/h3>\n\n\n\n
\u7b2c\u4e00\u884c\uff0c\u4e24\u4e2a\u6b63\u6574\u6570n,m\u3002<\/p>\n\n\n\n
\u63a5\u4e0b\u6765n\u884c\uff0c\u8f93\u5165\u8fd9\u4e2a\u8ff7\u5bab\u3002\u6bcf\u884c\u8f93\u5165\u4e00\u4e2a\u957f\u4e3am\u7684\u5b57\u7b26\u4e32\uff0c#<\/code> \u8868\u793a\u5899\uff0c.<\/code> \u8868\u793a\u7a7a\u5730\u3002<\/p>\n\n\n\n
Output<\/h3>\n\n\n\n
\u4ec5\u4e00\u884c\uff0c\u4e00\u4e2a\u5b57\u7b26\u4e32\u3002\u5982\u679c\u673a\u5668\u732b\u80fd\u8d70\u5230(n,m)\uff0c\u5219\u8f93\u51fa Yes<\/code>\uff1b\u5426\u5219\u8f93\u51fa No<\/code>\u3002<\/p>\n\n\n\n
\u5bf9\u4e8e 100% \u7684\u6570\u636e\uff0c\u4fdd\u8bc1 1\u2264n,m\u2264100\uff0c\u4e14(1,1)\u548c(n,m)\u5747\u4e3a\u7a7a\u5730\u3002<\/p>\n\n\n\n
nenu\u5bd2\u5047\u641c\u7d22\u7ec3\u4e60 – Virtual Judge (vjudge.net)<\/a><\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h2>\n\n\n\n
\u770b\u5230\u9898\u76ee\u5c31\u9a6c\u4e0a\u60f3\u5230\u641c\u7d22\uff0c\u6570\u636e\u91cf\u4e0d\u5927\uff0c\u53ef\u4ee5\u5c1d\u8bd5\u7528dfs\uff0c\u56e0\u4e3a\u6bcf\u4e2a\u683c\u5b50\u4e5f\u53ea\u4f1a\u88ab\u8d70\u4e00\u6b21\u3002\u7ed3\u675f\u6761\u4ef6\u5c31\u662f\u8d70\u5230\u7ec8\u70b9\u7684\u65f6\u5019\uff0c\u5982\u679c\u80fd\u8d70\u5230\u7684\u5730\u65b9\u8d70\u5b8c\u90fd\u6ca1\u6709\u5230\u8fbe\u8fc7\u7ec8\u70b9\uff0c\u8bf4\u660e\u4e0d\u53ef\u5230\u8fbe\uff0c\u8f93\u51faNo\uff0c\u5426\u5219\u5c31\u662fYes\uff0c\u7528\u4e00\u4e2a\u5168\u5c40\u53d8\u91cf\u5b58\u50a8\u5224\u65ad\u7ed3\u679c\u5c31\u884c\u3002<\/p>\n\n\n\n
\u4ee3\u7801DFS\uff08AC\uff09\uff1a<\/h2>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint n,m;\nint mx[105][105];\nint flag;\nint mv[][2] = {{0,1},{1,0},{-1,0},{0,-1}};\nvoid dfs(int x,int y){\n    if(x == n && y == m){\n        flag = 1;\n        return ;\n    }\n    for(int i = 0;i < 4;i++){\n        int xx = x + mv[i][0];\n        int yy = y + mv[i][1];\n        if(xx <= 0 || y <= 0 || xx > n || yy > m || mx[xx][yy] == 0){\n            continue;\n        }\n        mx[xx][yy] = 0;\n        dfs(xx,yy);\n    }\n}\nint main(){\n    cin >> n >> m;\n    for(int i = 1;i <= n;i++){\n        for(int j = 1;j <= m;j++){\n            char c;\n            cin >> c;\n            if(c == '.') mx[i][j] = 1;\n            else mx[i][j] = 0;\n        }\n    }\n    dfs(1,1);\n    if(flag) cout << \"Yes\" << \"\\n\";\n    else cout << \"No\" << \"\\n\";\n} <\/code><\/pre>\n\n\n\n
\u603b\u7ed3<\/h1>\n\n\n\n
\u8fd9\u5957\u9898\u57fa\u672c\u4e0a\u5c31\u662fDFS\u548cBFS\u7684\u7ecf\u5178\u9898\u76ee\uff0c\u601d\u8def\u90fd\u8f83\u4e3a\u7b80\u5355\uff0c\u4ee3\u7801\u91cf\u9002\u4e2d\u3002\u641c\u7d22\u95ee\u9898\u6709\u4ee5\u4e0b\u51e0\u6b65\uff1a<\/p>\n\n\n\n
    \n
  1. \u5224\u65ad\u6570\u636e\u8303\u56f4\uff0c\u770b\u770b\u7528DFS\u5408\u9002\u8fd8\u662fBFS\u5408\u9002<\/li>\n\n\n\n
  2. \u80fd\u7528DFS\u7684\u5c31\u5199DFS\uff0c\u56e0\u4e3a\u4ee3\u7801\u66f4\u5bb9\u6613\u5b9e\u73b0\u4e00\u4e9b\uff0c\u7f3a\u70b9\u5728\u4e8e\u4e0d\u6613debug<\/li>\n\n\n\n
  3. DFS\u7684\u601d\u60f3\u5c31\u662f\u5148\u5199\u51fa\u7ed3\u675f\/\u7ec8\u6b62\u6761\u4ef6\uff0c\u7136\u540e\u5f00\u59cb\u5404\u4e2a\u65b9\u5411\u641c\u7d22<\/li>\n\n\n\n
  4. BFS\u7684\u601d\u60f3\u5c31\u662f\u6211\u62d3\u5c55\u4e86\u4ec0\u4e48\u8282\u70b9\uff0c\u5c31\u628a\u62d3\u5c55\u7684\u8282\u70b9\u52a0\u5165\u961f\u5217\uff0c\u7136\u540e\u518d\u4f9d\u6b21pop\u51fa\u6765\u5904\u7406<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"
    A – \u9a6c\u7684\u904d\u5386 \u9898\u76ee\uff1a Description \u6709\u4e00\u4e2a n\u00d7m \u7684\u68cb\u76d8\uff0c\u5728\u67d0\u4e2a\u70b9(x,y)\u4e0a\u6709\u4e00 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[7,6],"tags":[],"class_list":["post-53","post","type-post","status-publish","format-standard","hentry","category-7","category-6"],"_links":{"self":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/53","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/comments?post=53"}],"version-history":[{"count":11,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/53\/revisions"}],"predecessor-version":[{"id":64,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/53\/revisions\/64"}],"wp:attachment":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/media?parent=53"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/categories?post=53"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/tags?post=53"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}