{"id":51260,"date":"2025-08-10T19:49:36","date_gmt":"2025-08-10T11:49:36","guid":{"rendered":"https:\/\/www.wsisp.com\/helps\/51260.html"},"modified":"2025-08-10T19:49:36","modified_gmt":"2025-08-10T11:49:36","slug":"%e3%80%90%e7%bc%a9%e7%82%b9-%e6%8b%93%e6%89%91%e5%ba%8f%e3%80%91p3119-usaco15jan-grass-cownoisseur-g%e7%9c%81%e9%80%89","status":"publish","type":"post","link":"https:\/\/www.wsisp.com\/helps\/51260.html","title":{"rendered":"\u3010\u7f29\u70b9 \u62d3\u6251\u5e8f\u3011P3119 [USACO15JAN] Grass Cownoisseur G|\u7701\u9009-"},"content":{"rendered":"

\u672c\u6587\u6d89\u53ca\u77e5\u8bc6\u70b9<\/h2>\n

C++\u56fe\u8bba<\/p>\n

P3119 [USACO15JAN] Grass Cownoisseur G<\/h2>\n

\u9898\u76ee\u63cf\u8ff0<\/h3>\n

\u4e3a\u4e86\u66f4\u597d\u5730\u7ba1\u7406\u725b\u7fa4\u7684\u653e\u7267\u8def\u7ebf，Farmer John \u5728\u4ed6\u7684\u519c\u573a\u4e2d\u5b89\u88c5\u4e86\u82e5\u5e72\u5355\u5411\u725b\u9053\u3002\u519c\u573a\u7531 <\/p>\n

N<\/p>\n

N<\/p>\n

<\/span><\/span>N<\/span><\/span><\/span><\/span><\/span> \u5757\u8349\u573a\u7ec4\u6210，\u7f16\u53f7\u4e3a <\/p>\n

1<\/p>\n

1<\/p>\n

<\/span><\/span>1<\/span><\/span><\/span><\/span><\/span> \u5230 <\/p>\n

N<\/p>\n

N<\/p>\n

<\/span><\/span>N<\/span><\/span><\/span><\/span><\/span>，\u6bcf\u6761\u5355\u5411\u725b\u9053\u8fde\u63a5\u4e00\u5bf9\u8349\u573a\u3002\u4f8b\u5982，\u82e5\u5b58\u5728\u4e00\u6761\u4ece\u8349\u573a <\/p>\n

X<\/p>\n

X<\/p>\n

<\/span><\/span>X<\/span><\/span><\/span><\/span><\/span> \u5230 <\/p>\n

Y<\/p>\n

Y<\/p>\n

<\/span><\/span>Y<\/span><\/span><\/span><\/span><\/span> \u7684\u8def\u5f84，\u5219\u725b\u53ef\u4ee5\u4ece <\/p>\n

X<\/p>\n

X<\/p>\n

<\/span><\/span>X<\/span><\/span><\/span><\/span><\/span> \u524d\u5f80 <\/p>\n

Y<\/p>\n

Y<\/p>\n

<\/span><\/span>Y<\/span><\/span><\/span><\/span><\/span>，\u4f46\u4e0d\u80fd\u4ece <\/p>\n

Y<\/p>\n

Y<\/p>\n

<\/span><\/span>Y<\/span><\/span><\/span><\/span><\/span> \u8fd4\u56de <\/p>\n

X<\/p>\n

X<\/p>\n

<\/span><\/span>X<\/span><\/span><\/span><\/span><\/span>\u3002<\/p>\n

\u4f17\u6240\u5468\u77e5，Bessie \u559c\u6b22\u5c3d\u53ef\u80fd\u591a\u5730\u54c1\u5c1d\u4e0d\u540c\u8349\u573a\u7684\u7267\u8349\u3002\u5979\u6bcf\u5929\u4ece\u8349\u573a <\/p>\n

1<\/p>\n

1<\/p>\n

<\/span><\/span>1<\/span><\/span><\/span><\/span><\/span> \u51fa\u53d1，\u8bbf\u95ee\u4e00\u7cfb\u5217\u8349\u573a\u540e\u8fd4\u56de\u8349\u573a <\/p>\n

1<\/p>\n

1<\/p>\n

<\/span><\/span>1<\/span><\/span><\/span><\/span><\/span>\u3002\u5979\u8bd5\u56fe\u6700\u5927\u5316\u6cbf\u9014\u7ecf\u8fc7\u7684\u4e0d\u540c\u8349\u573a\u6570\u91cf（\u91cd\u590d\u8bbf\u95ee\u7684\u8349\u573a\u53ea\u7b97\u4e00\u6b21）\u3002<\/p>\n

\u7531\u4e8e\u5355\u5411\u8def\u5f84\u7684\u9650\u5236，Bessie \u62c5\u5fc3\u8fd9\u4f1a\u51cf\u5c11\u5979\u6bcf\u65e5\u8def\u7ebf\u4e2d\u53ef\u4ee5\u8bbf\u95ee\u7684\u8349\u573a\u6570\u91cf\u3002\u5979\u60f3\u77e5\u9053\u5982\u679c\u5979\u8fdd\u53cd\u89c4\u5219，\u5728\u8def\u7ebf\u4e2d\u6700\u591a\u9006\u5411\u901a\u8fc7\u67d0\u6761\u9053\u8def\u4e00\u6b21，\u6700\u591a\u80fd\u54c1\u5c1d\u591a\u5c11\u8349\u573a\u7684\u7267\u8349\u3002\u8bf7\u8ba1\u7b97\u5979\u4ece\u8349\u573a <\/p>\n

1<\/p>\n

1<\/p>\n

<\/span><\/span>1<\/span><\/span><\/span><\/span><\/span> \u51fa\u53d1\u5e76\u8fd4\u56de\u7684\u60c5\u51b5\u4e0b，\u6700\u591a\u80fd\u8bbf\u95ee\u7684\u4e0d\u540c\u8349\u573a\u6570\u91cf\u3002\u6ce8\u610f Bessie \u5728\u6574\u4e2a\u65c5\u7a0b\u4e2d\u6700\u591a\u53ea\u80fd\u9006\u5411\u901a\u8fc7\u4e00\u6761\u9053\u8def，\u4e14\u540c\u4e00\u6761\u8def\u5f84\u4e0d\u80fd\u9006\u5411\u4e24\u6b21\u3002<\/p>\n

\u8f93\u5165\u683c\u5f0f<\/h3>\n

\u7b2c\u4e00\u884c\u5305\u542b\u4e24\u4e2a\u6574\u6570 <\/p>\n

N<\/p>\n

N<\/p>\n

<\/span><\/span>N<\/span><\/span><\/span><\/span><\/span> \u548c <\/p>\n

M<\/p>\n

M<\/p>\n

<\/span><\/span>M<\/span><\/span><\/span><\/span><\/span>，\u8868\u793a\u8349\u573a\u6570\u91cf\u548c\u5355\u5411\u725b\u9053\u6570\u91cf（<\/p>\n

1<\/p>\n

\u2264<\/p>\n

N<\/p>\n

,<\/p>\n

M<\/p>\n

\u2264<\/p>\n

100<\/p>\n

,<\/p>\n

000<\/p>\n

1 \\\\leq N, M \\\\leq 100,000<\/p>\n

<\/span><\/span>1<\/span><\/span>\u2264<\/span><\/span><\/span><\/span>N<\/span>,<\/span><\/span>M<\/span><\/span>\u2264<\/span><\/span><\/span><\/span>100<\/span>,<\/span><\/span>000<\/span><\/span><\/span><\/span><\/span>）\u3002<\/p>\n

\u63a5\u4e0b\u6765 <\/p>\n

M<\/p>\n

M<\/p>\n

<\/span><\/span>M<\/span><\/span><\/span><\/span><\/span> \u884c\u6bcf\u884c\u63cf\u8ff0\u4e00\u6761\u5355\u5411\u725b\u9053，\u5305\u542b\u4e24\u4e2a\u4e0d\u540c\u7684\u6574\u6570 <\/p>\n

X<\/p>\n

X<\/p>\n

<\/span><\/span>X<\/span><\/span><\/span><\/span><\/span> \u548c <\/p>\n

Y<\/p>\n

Y<\/p>\n

<\/span><\/span>Y<\/span><\/span><\/span><\/span><\/span>，\u8868\u793a\u4ece <\/p>\n

X<\/p>\n

X<\/p>\n

<\/span><\/span>X<\/span><\/span><\/span><\/span><\/span> \u5230 <\/p>\n

Y<\/p>\n

Y<\/p>\n

<\/span><\/span>Y<\/span><\/span><\/span><\/span><\/span> \u7684\u5355\u5411\u8def\u5f84\u3002\u4fdd\u8bc1\u6bcf\u6761\u8def\u5f84\u4e0d\u4f1a\u91cd\u590d\u51fa\u73b0\u3002<\/p>\n

\u8f93\u51fa\u683c\u5f0f<\/h3>\n

\u8f93\u51fa\u4e00\u884c，\u8868\u793a Bessie \u5728\u6700\u591a\u9006\u5411\u901a\u8fc7\u4e00\u6761\u9053\u8def\u7684\u60c5\u51b5\u4e0b，\u4ece\u8349\u573a <\/p>\n

1<\/p>\n

1<\/p>\n

<\/span><\/span>1<\/span><\/span><\/span><\/span><\/span> \u51fa\u53d1\u5e76\u8fd4\u56de\u65f6\u80fd\u8bbf\u95ee\u7684\u6700\u5927\u4e0d\u540c\u8349\u573a\u6570\u91cf\u3002<\/p>\n

\u8f93\u5165\u8f93\u51fa\u6837\u4f8b #1<\/h3>\n

\u8f93\u5165 #1<\/h4>\n

7 10
\n1 2
\n3 1
\n2 5
\n2 4
\n3 7
\n3 5
\n3 6
\n6 5
\n7 2
\n4 7<\/p>\n

\u8f93\u51fa #1<\/h4>\n

6<\/p>\n

\u8bf4\u660e\/\u63d0\u793a<\/h3>\n

\u6837\u4f8b\u89e3\u6790：<\/p>\n

\u4ee5\u4e0b\u662f\u6837\u4f8b\u8f93\u5165\u7684 ASCII \u56fe\u793a：<\/p>\n

v—3–>6
\n7 | \\\\ |
\n^\\\\ v \\\\|
\n| \\\\ 1 |
\n| | v
\n| v 5
\n4<–2—^<\/p>\n

Bessie \u53ef\u4ee5\u901a\u8fc7\u9006\u5411\u8def\u5f84 <\/p>\n

5<\/p>\n

\u2192<\/p>\n

3<\/p>\n

5\\\\to 3<\/p>\n

<\/span><\/span>5<\/span><\/span>\u2192<\/span><\/span><\/span><\/span>3<\/span><\/span><\/span><\/span><\/span> \u8bbf\u95ee\u8349\u573a <\/p>\n

1<\/p>\n

,<\/p>\n

2<\/p>\n

,<\/p>\n

4<\/p>\n

,<\/p>\n

7<\/p>\n

,<\/p>\n

2<\/p>\n

,<\/p>\n

5<\/p>\n

,<\/p>\n

3<\/p>\n

,<\/p>\n

1<\/p>\n

1, 2, 4, 7, 2, 5, 3, 1<\/p>\n

<\/span><\/span>1<\/span>,<\/span><\/span>2<\/span>,<\/span><\/span>4<\/span>,<\/span><\/span>7<\/span>,<\/span><\/span>2<\/span>,<\/span><\/span>5<\/span>,<\/span><\/span>3<\/span>,<\/span><\/span>1<\/span><\/span><\/span><\/span><\/span>\u3002\u5230\u8fbe\u8349\u573a <\/p>\n

3<\/p>\n

3<\/p>\n

<\/span><\/span>3<\/span><\/span><\/span><\/span><\/span> \u540e，\u82e5\u4e0d\u518d\u6b21\u9006\u5411\u5176\u4ed6\u8def\u5f84\u5219\u65e0\u6cd5\u524d\u5f80 <\/p>\n

6<\/p>\n

6<\/p>\n

<\/span><\/span>6<\/span><\/span><\/span><\/span><\/span>\u3002<\/p>\n

\u7f29\u70b9 \u62d3\u6251\u6392\u5e8f<\/h2>\n

\u6ce8\u610f：\u4efb\u610f\u9053\u8def\u6b63\u5411\u884c\u9a76\u7684\u6b21\u6570\u4e0d\u9650\u3002\u9006\u884c\u53ea\u80fd0\u6b21\u62161\u6b21\u3002\u9006\u884c\u548c\u6b63\u5411\u884c\u9a76\u4e92\u76f8\u4e0d\u5f71\u54cd\u3002 \u4e60\u60ef\u4ece0\u5f00\u59cb\u3002 \u6027\u8d28\u4e00：\u6700\u4f18\u89e3\u53ef\u80fd\u65e0\u9006\u884c\u3002\u5982：<\/p>\n

0<\/p>\n

\u2192<\/p>\n

1<\/p>\n

\u2192<\/p>\n

0<\/p>\n

0 \\\\rightarrow 1 \\\\rightarrow 0<\/p>\n

<\/span><\/span>0<\/span><\/span>\u2192<\/span><\/span><\/span><\/span>1<\/span><\/span>\u2192<\/span><\/span><\/span><\/span>0<\/span><\/span><\/span><\/span><\/span>\u3002 \u6027\u8d28\u4e8c：\u80fd\u591f\u5230\u8fbe\u73af\u4e0a\u4efb\u610f\u4e00\u70b9，\u5219\u80fd\u591f\u5230\u8fbe\u4efb\u610f\u73af\u3002 \u5c0f\u7ed3\u4e00：\u73af\u53ef\u4ee5\u7f29\u70b9\u3002 dis1[i]\u8bb0\u5f55\u4ece0\u51fa\u53d1\u5230i\u7ecf\u8fc7\u7684\u6700\u591a\u519c\u573a\u3002 dis2[i]\u8bb0\u5f55\u4ecei\u51fa\u53d1\u5230\u8fbe0\u7ecf\u8fc7\u7684\u6700\u591a\u519c\u573a\u3002\u53ef\u5c06\u8fb9\u53cd\u5411，\u548cvis1[i]\u4e00\u6837\u6c42\u3002 \u60c5\u51b5\u4e00：\u4e0d\u9006\u5e8f，\u7ed3\u679c\u662fdis1[0]\u3002 \u60c5\u51b5\u4e8c：\u9006\u5e8f\u4e00\u6b21，\u6211\u4eec\u5047\u5b9a\u9006\u884c\u7684\u8fb9\u662fuv\u3002 \u524d\u63d0\u4e00：\u5b58\u5728\u8def\u5f84\u4e00<\/p>\n

0<\/p>\n

\u2192<\/p>\n

v<\/p>\n

0\\\\rightarrow v<\/p>\n

<\/span><\/span>0<\/span><\/span>\u2192<\/span><\/span><\/span><\/span>v<\/span><\/span><\/span><\/span><\/span>\u3002 \u524d\u63d0\u4e8c：\u5b58\u5728\u8def\u5f84\u4e8c<\/p>\n

u<\/p>\n

\u2192<\/p>\n

0<\/p>\n

u \\\\rightarrow 0<\/p>\n

<\/span><\/span>u<\/span><\/span>\u2192<\/span><\/span><\/span><\/span>0<\/span><\/span><\/span><\/span><\/span>\u3002 \u524d\u63d0\u4e09：\u4ee5\u4e0a\u4e24\u6761\u8def\u5f84\u53ef\u4ee5\u4e0d\u5305\u62ec<\/p>\n

u<\/p>\n

\u2192<\/p>\n

v<\/p>\n

u \\\\rightarrow v<\/p>\n

<\/span><\/span>u<\/span><\/span>\u2192<\/span><\/span><\/span><\/span>v<\/span><\/span><\/span><\/span><\/span>\u3002<\/p>\n

\u524d\u63d0\u4e09<\/h3>\n

\u6027\u8d28\u4e09：\u5982\u679c<\/p>\n

0<\/p>\n

\u2192<\/p>\n

v<\/p>\n

，\u5305\u62ec<\/p>\n

u<\/p>\n

\u2192<\/p>\n

v<\/p>\n

0 \\\\rightarrow v，\u5305\u62ecu \\\\rightarrow v<\/p>\n

<\/span><\/span>0<\/span><\/span>\u2192<\/span><\/span><\/span><\/span>v<\/span>，\u5305\u62ec<\/span>u<\/span><\/span>\u2192<\/span><\/span><\/span><\/span>v<\/span><\/span><\/span><\/span><\/span>,\u5219： \u5b58\u5728<\/p>\n

0<\/p>\n

\u2192<\/p>\n

u<\/p>\n

0 \\\\rightarrow u<\/p>\n

<\/span><\/span>0<\/span><\/span>\u2192<\/span><\/span><\/span><\/span>u<\/span><\/span><\/span><\/span><\/span>\u7684\u8def\u5f84，\u5373u\u57280\u6240\u5728\u7684\u73af\u3002 \u6027\u8d28\u4e94：\u5982\u679c<\/p>\n

u<\/p>\n

\u2192<\/p>\n

0<\/p>\n

\u5305\u62ec<\/p>\n

u<\/p>\n

\u2192<\/p>\n

v<\/p>\n

u \\\\rightarrow 0\u5305\u62ecu \\\\rightarrow v<\/p>\n

<\/span><\/span>u<\/span><\/span>\u2192<\/span><\/span><\/span><\/span>0<\/span>\u5305\u62ec<\/span>u<\/span><\/span>\u2192<\/span><\/span><\/span><\/span>v<\/span><\/span><\/span><\/span><\/span>,\u5219\u5b58\u5728<\/p>\n

v<\/p>\n

\u2192<\/p>\n

0<\/p>\n

v \\\\rightarrow 0<\/p>\n

<\/span><\/span>v<\/span><\/span>\u2192<\/span><\/span><\/span><\/span>0<\/span><\/span><\/span><\/span><\/span>d\u8def\u5f84\u3002\u5373v\u548c0\u5728\u540c\u4e00\u4e2a\u73af\u3002 \u679a\u4e3e\u7f29\u70b9\u540e\u7684\u8fb9uv： \u60c5\u51b5\u4e00;<\/p>\n

0<\/p>\n

\u2260<\/p>\n

u<\/p>\n

\u4e14<\/p>\n

0<\/p>\n

\u2260<\/p>\n

v<\/p>\n

0\\\\neq u\u4e140 \\\\neq v<\/p>\n

<\/span><\/span>0<\/span><\/span><\/span>\ue020<\/span><\/span><\/span><\/span><\/span><\/span><\/span><\/span>=<\/span><\/span><\/span><\/span><\/span>u<\/span>\u4e14<\/span>0<\/span><\/span><\/span>\ue020<\/span><\/span><\/span><\/span><\/span><\/span><\/span><\/span>=<\/span><\/span><\/span><\/span><\/span>v<\/span><\/span><\/span><\/span><\/span>，\u8def\u5f84\u4e00\u548c\u8def\u5f84\u4e8c，\u90fd\u4e0d\u5305\u62ecuv，\u6b63\u5e38\u5904\u7406\u3002 \u60c5\u51b5\u4e8c：<\/p>\n

0<\/p>\n

=<\/p>\n

=<\/p>\n

u<\/p>\n

\u4e14<\/p>\n

0<\/p>\n

=<\/p>\n

=<\/p>\n

v<\/p>\n

0 == u\u4e140 ==v<\/p>\n

<\/span><\/span>0<\/span><\/span>==<\/span><\/span><\/span><\/span>u<\/span>\u4e14<\/span>0<\/span><\/span>==<\/span><\/span><\/span><\/span>v<\/span><\/span><\/span><\/span><\/span>，\u81ea\u73af\u5fc5\u987b\u5ffd\u7565，\u5426\u5219\u51fa\u9519\u3002 \u60c5\u51b5\u4e09：<\/p>\n

0<\/p>\n

=<\/p>\n

=<\/p>\n

u<\/p>\n

,<\/p>\n

0<\/p>\n

\u2260<\/p>\n

v<\/p>\n

0==u,0\\\\neq v<\/p>\n

<\/span><\/span>0<\/span><\/span>==<\/span><\/span><\/span><\/span>u<\/span>,<\/span><\/span>0<\/span><\/span><\/span>\ue020<\/span><\/span><\/span><\/span><\/span><\/span><\/span><\/span>=<\/span><\/span><\/span><\/span><\/span>v<\/span><\/span><\/span><\/span><\/span> ，\u8def\u5f84\u4e00\u548c\u8def\u5f84\u4e8c\u4e0d\u9006\u5e8f，\u5148\u8def\u5f84\u4e00，\u9006\u884c(vu)，\u8def\u5f84\u4e8c\u3002\u4e0b\u56fe\u7684\u8def\u5f84： <\/p>\n

0<\/p>\n

\u2192<\/p>\n

1<\/p>\n

\u2192<\/p>\n

\u9006\u884c<\/p>\n

0<\/p>\n

0 \\\\rightarrow 1_{\\\\rightarrow}^{\u9006\u884c} 0<\/p>\n

<\/span><\/span>0<\/span><\/span>\u2192<\/span><\/span><\/span><\/span>1<\/span><\/span>\u2192<\/span><\/span><\/span><\/span><\/span>\u9006\u884c<\/span><\/span><\/span><\/span><\/span>\u200b<\/span><\/span><\/span><\/span><\/span><\/span><\/span><\/span>0<\/span><\/span><\/span><\/span><\/span> \"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\" \u60c5\u51b5\u56db：<\/p>\n

0<\/p>\n

\u2260<\/p>\n

u<\/p>\n

,<\/p>\n

0<\/p>\n

=<\/p>\n

=<\/p>\n

v<\/p>\n

0 \\\\neq u,0 == v<\/p>\n

<\/span><\/span>0<\/span><\/span><\/span>\ue020<\/span><\/span><\/span><\/span><\/span><\/span><\/span><\/span>=<\/span><\/span><\/span><\/span><\/span>u<\/span>,<\/span><\/span>0<\/span><\/span>==<\/span><\/span><\/span><\/span>v<\/span><\/span><\/span><\/span><\/span>\u3002\u548c\u60c5\u51b5\u4e09\u7c7b\u4f3c\u3002<\/p>\n

\u5b9e\u73b0<\/h3>\n

ans = dis[0]\u3002 ans = <\/p>\n

m<\/p>\n

a<\/p>\n

x<\/p>\n

\u7f29\u70b9\u540e\u5b58\u5728\u8fb9<\/p>\n

u<\/p>\n

v<\/p>\n

(<\/p>\n

a<\/p>\n

n<\/p>\n

s<\/p>\n

,<\/p>\n

d<\/p>\n

i<\/p>\n

s<\/p>\n

1<\/p>\n

[<\/p>\n

v<\/p>\n

]<\/p>\n

+<\/p>\n

d<\/p>\n

i<\/p>\n

s<\/p>\n

2<\/p>\n

[<\/p>\n

u<\/p>\n

]<\/p>\n

\u2212<\/p>\n

0<\/p>\n

\u70b9\u6240\u5728\u73af\u5927\u5c0f<\/p>\n

)<\/p>\n

max_{\u7f29\u70b9\u540e\u5b58\u5728\u8fb9uv}(ans,dis1[v]+dis2[u] – 0\u70b9\u6240\u5728\u73af\u5927\u5c0f)<\/p>\n

<\/span><\/span>ma<\/span>x<\/span><\/span>\u7f29\u70b9\u540e\u5b58\u5728\u8fb9<\/span>uv<\/span><\/span><\/span><\/span><\/span>\u200b<\/span><\/span><\/span><\/span><\/span><\/span><\/span><\/span>(<\/span>an<\/span>s<\/span>,<\/span><\/span>d<\/span>i<\/span>s<\/span>1<\/span>[<\/span>v<\/span>]<\/span><\/span>+<\/span><\/span><\/span><\/span>d<\/span>i<\/span>s<\/span>2<\/span>[<\/span>u<\/span>]<\/span><\/span>\u2212<\/span><\/span><\/span><\/span>0<\/span>\u70b9\u6240\u5728\u73af\u5927\u5c0f<\/span>)<\/span><\/span><\/span><\/span><\/span> 0\u6240\u5728\u7684\u73af，dis1\u548cdis2\u5404\u8ba1\u7b97\u4e86\u4e00\u6b21\u3002 \u96640\u5916，dis1[v]\u548cdis2[u]\u4e0d\u5305\u62ec\u76f8\u540c\u7684\u70b9，\u5426\u5219\u6574\u4e2a\u8def\u5f84\u662f\u73af，\u4f1a\u88ab\u7f29\u70b9\u3002<\/p>\n

\u6c42dis1<\/h3>\n

\u521d\u59cbdis1[0]=1，\u5176\u5b83\u4e3a0\u3002\u6309\u62d3\u6251\u5e8f\u9006\u5e8f\u5904\u7406cur，\u901a\u8fc7child\u679a\u4e3ecur\u7f29\u70b9\u540e\u7684\u5b69\u5b50\u3002 dis1[child] = max(dis1[child],dis1[cur]+\u6b64\u70b9\u6240\u5728\u73af\u5927\u5c0f)<\/p>\n

\u7ecf\u5178\u6837\u4f8b<\/h4>\n

\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"<\/p>\n

\u4ee3\u7801<\/h2>\n

\u6838\u5fc3\u4ee3\u7801<\/h3>\n

#<\/span>include<\/span> <iostream><\/span><\/span>
\n#<\/span>include<\/span> <sstream><\/span><\/span>
\n#<\/span>include<\/span> <vector><\/span><\/span>
\n#<\/span>include<\/span><map><\/span><\/span>
\n#<\/span>include<\/span><unordered_map><\/span><\/span>
\n#<\/span>include<\/span><set><\/span><\/span>
\n#<\/span>include<\/span><unordered_set><\/span><\/span>
\n#<\/span>include<\/span><string><\/span><\/span>
\n#<\/span>include<\/span><algorithm><\/span><\/span>
\n#<\/span>include<\/span><functional><\/span><\/span>
\n#<\/span>include<\/span><queue><\/span><\/span>
\n#<\/span>include<\/span> <stack><\/span><\/span>
\n#<\/span>include<\/span><iomanip><\/span><\/span>
\n#<\/span>include<\/span><numeric><\/span><\/span>
\n#<\/span>include<\/span> <math.h><\/span><\/span>
\n#<\/span>include<\/span> <climits><\/span><\/span>
\n#<\/span>include<\/span><assert.h><\/span><\/span>
\n#<\/span>include<\/span><cstring><\/span><\/span>
\n#<\/span>include<\/span><list><\/span><\/span><\/p>\n

#<\/span>include<\/span> <bitset><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

template<\/span><<\/span>class<\/span> T1<\/span>,<\/span> class<\/span> T2<\/span>><\/span>
\nstd::<\/span>istream&<\/span> operator<\/span> >><\/span> (<\/span>std::<\/span>istream&<\/span> in,<\/span> pair<<\/span>T1,<\/span> T2><\/span>&<\/span> pr)<\/span> {<\/span>
\nin >><\/span> pr.<\/span>first >><\/span> pr.<\/span>second;<\/span>
\nreturn<\/span> in;<\/span>
\n}<\/span><\/p>\n

template<\/span><<\/span>class<\/span> T1<\/span>,<\/span> class<\/span> T2<\/span>,<\/span> class<\/span> T3<\/span> ><\/span>
\nstd::<\/span>istream&<\/span> operator<\/span> >><\/span> (<\/span>std::<\/span>istream&<\/span> in,<\/span> tuple<<\/span>T1,<\/span> T2,<\/span> T3><\/span>&<\/span> t)<\/span> {<\/span>
\nin >><\/span> get<<\/span>0<\/span>><\/span>(<\/span>t)<\/span> >><\/span> get<<\/span>1<\/span>><\/span>(<\/span>t)<\/span> >><\/span> get<<\/span>2<\/span>><\/span>(<\/span>t)<\/span>;<\/span>
\nreturn<\/span> in;<\/span>
\n}<\/span><\/p>\n

template<\/span><<\/span>class<\/span> T1<\/span>,<\/span> class<\/span> T2<\/span>,<\/span> class<\/span> T3<\/span>,<\/span> class<\/span> T4<\/span> ><\/span>
\nstd::<\/span>istream&<\/span> operator<\/span> >><\/span> (<\/span>std::<\/span>istream&<\/span> in,<\/span> tuple<<\/span>T1,<\/span> T2,<\/span> T3,<\/span> T4><\/span>&<\/span> t)<\/span> {<\/span>
\nin >><\/span> get<<\/span>0<\/span>><\/span>(<\/span>t)<\/span> >><\/span> get<<\/span>1<\/span>><\/span>(<\/span>t)<\/span> >><\/span> get<<\/span>2<\/span>><\/span>(<\/span>t)<\/span> >><\/span> get<<\/span>3<\/span>><\/span>(<\/span>t)<\/span>;<\/span>
\nreturn<\/span> in;<\/span>
\n}<\/span><\/p>\n

template<\/span><<\/span>class<\/span> T1<\/span>,<\/span> class<\/span> T2<\/span>,<\/span> class<\/span> T3<\/span>,<\/span> class<\/span> T4<\/span>,<\/span>class<\/span> T5<\/span> ><\/span>
\nstd::<\/span>istream&<\/span> operator<\/span> >><\/span> (<\/span>std::<\/span>istream&<\/span> in,<\/span> tuple<<\/span>T1,<\/span> T2,<\/span> T3,<\/span> T4,<\/span>T5><\/span>&<\/span> t)<\/span> {<\/span>
\nin >><\/span> get<<\/span>0<\/span>><\/span>(<\/span>t)<\/span> >><\/span> get<<\/span>1<\/span>><\/span>(<\/span>t)<\/span> >><\/span> get<<\/span>2<\/span>><\/span>(<\/span>t)<\/span> >><\/span> get<<\/span>3<\/span>><\/span>(<\/span>t)<\/span> >><\/span> get<<\/span>4<\/span>><\/span>(<\/span>t)<\/span>;<\/span>
\nreturn<\/span> in;<\/span>
\n}<\/span><\/p>\n

template<\/span><<\/span>class<\/span> T1<\/span>,<\/span> class<\/span> T2<\/span>,<\/span> class<\/span> T3<\/span>,<\/span> class<\/span> T4<\/span>,<\/span> class<\/span> T5<\/span>,<\/span>class<\/span> T6<\/span> ><\/span>
\nstd::<\/span>istream&<\/span> operator<\/span> >><\/span> (<\/span>std::<\/span>istream&<\/span> in,<\/span> tuple<<\/span>T1,<\/span> T2,<\/span> T3,<\/span> T4,<\/span> T5,<\/span>T6><\/span>&<\/span> t)<\/span> {<\/span>
\nin >><\/span> get<<\/span>0<\/span>><\/span>(<\/span>t)<\/span> >><\/span> get<<\/span>1<\/span>><\/span>(<\/span>t)<\/span> >><\/span> get<<\/span>2<\/span>><\/span>(<\/span>t)<\/span> >><\/span> get<<\/span>3<\/span>><\/span>(<\/span>t)<\/span> >><\/span> get<<\/span>4<\/span>><\/span>(<\/span>t)<\/span> >><\/span>get<<\/span>5<\/span>><\/span>(<\/span>t)<\/span>;<\/span>
\nreturn<\/span> in;<\/span>
\n}<\/span><\/p>\n

template<\/span><<\/span>class<\/span> T<\/span> =<\/span> int<\/span>><\/span>
\nvector<<\/span>T><\/span> Read<\/span>(<\/span>)<\/span> {<\/span>
\nint<\/span> n;<\/span>
\ncin >><\/span> n;<\/span>
\nvector<<\/span>T><\/span> ret<\/span>(<\/span>n)<\/span>;<\/span>
\nfor<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> n;<\/span> i++<\/span>)<\/span> {<\/span>
\ncin >><\/span> ret[<\/span>i]<\/span>;<\/span>
\n}<\/span>
\nreturn<\/span> ret;<\/span>
\n}<\/span>
\ntemplate<\/span><<\/span>class<\/span> T<\/span> =<\/span> int<\/span>><\/span>
\nvector<<\/span>T><\/span> ReadNotNum<\/span>(<\/span>)<\/span> {<\/span>
\nvector<<\/span>T><\/span> ret;<\/span>
\nT tmp;<\/span>
\nwhile<\/span> (<\/span>cin >><\/span> tmp)<\/span> {<\/span>
\nret.<\/span>emplace_back<\/span>(<\/span>tmp)<\/span>;<\/span>
\nif<\/span> (<\/span>'\\\\n'<\/span> ==<\/span> cin.<\/span>get<\/span>(<\/span>)<\/span>)<\/span> {<\/span> break<\/span>;<\/span> }<\/span>
\n}<\/span>
\nreturn<\/span> ret;<\/span>
\n}<\/span><\/p>\n

template<\/span><<\/span>class<\/span> T<\/span> =<\/span> int<\/span>><\/span>
\nvector<<\/span>T><\/span> Read<\/span>(<\/span>int<\/span> n)<\/span> {<\/span>
\nvector<<\/span>T><\/span> ret<\/span>(<\/span>n)<\/span>;<\/span>
\nfor<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> n;<\/span> i++<\/span>)<\/span> {<\/span>
\ncin >><\/span> ret[<\/span>i]<\/span>;<\/span>
\n}<\/span>
\nreturn<\/span> ret;<\/span>
\n}<\/span><\/p>\n

template<\/span><<\/span>int<\/span> N =<\/span> 1'000'000<\/span>><\/span>
\nclass<\/span> COutBuff<\/span>
\n{<\/span>
\npublic<\/span>:<\/span>
\nCOutBuff<\/span>(<\/span>)<\/span> {<\/span>
\nm_p =<\/span> puffer;<\/span>
\n}<\/span>
\ntemplate<\/span><<\/span>class<\/span> T<\/span>><\/span>
\nvoid<\/span> write<\/span>(<\/span>T x)<\/span> {<\/span>
\nint<\/span> num[<\/span>28<\/span>]<\/span>,<\/span> sp =<\/span> 0<\/span>;<\/span>
\nif<\/span> (<\/span>x <<\/span> 0<\/span>)<\/span>
\n*<\/span>m_p++<\/span> =<\/span> '-'<\/span>,<\/span> x =<\/span> –<\/span>x;<\/span><\/p>\n

if<\/span> (<\/span>!<\/span>x)<\/span>
\n*<\/span>m_p++<\/span> =<\/span> 48<\/span>;<\/span><\/p>\n

while<\/span> (<\/span>x)<\/span>
\nnum[<\/span>++<\/span>sp]<\/span> =<\/span> x %<\/span> 10<\/span>,<\/span> x \/=<\/span> 10<\/span>;<\/span><\/p>\n

while<\/span> (<\/span>sp)<\/span>
\n*<\/span>m_p++<\/span> =<\/span> num[<\/span>sp—<\/span>]<\/span> +<\/span> 48<\/span>;<\/span>
\nAuotToFile<\/span>(<\/span>)<\/span>;<\/span>
\n}<\/span>
\nvoid<\/span> writestr<\/span>(<\/span>const<\/span> char<\/span>*<\/span> sz)<\/span> {<\/span>
\nstrcpy<\/span>(<\/span>m_p,<\/span> sz)<\/span>;<\/span>
\nm_p +=<\/span> strlen<\/span>(<\/span>sz)<\/span>;<\/span>
\nAuotToFile<\/span>(<\/span>)<\/span>;<\/span>
\n}<\/span>
\ninline<\/span> void<\/span> write<\/span>(<\/span>char<\/span> ch)<\/span>
\n{<\/span>
\n*<\/span>m_p++<\/span> =<\/span> ch;<\/span>
\nAuotToFile<\/span>(<\/span>)<\/span>;<\/span>
\n}<\/span>
\ninline<\/span> void<\/span> ToFile<\/span>(<\/span>)<\/span> {<\/span>
\nfwrite<\/span>(<\/span>puffer,<\/span> 1<\/span>,<\/span> m_p –<\/span> puffer,<\/span> stdout<\/span>)<\/span>;<\/span>
\nm_p =<\/span> puffer;<\/span>
\n}<\/span>
\n~<\/span>COutBuff<\/span>(<\/span>)<\/span> {<\/span>
\nToFile<\/span>(<\/span>)<\/span>;<\/span>
\n}<\/span>
\nprivate<\/span>:<\/span>
\ninline<\/span> void<\/span> AuotToFile<\/span>(<\/span>)<\/span> {<\/span>
\nif<\/span> (<\/span>m_p –<\/span> puffer ><\/span> N –<\/span> 100<\/span>)<\/span> {<\/span>
\nToFile<\/span>(<\/span>)<\/span>;<\/span>
\n}<\/span>
\n}<\/span>
\nchar<\/span> puffer[<\/span>N]<\/span>,<\/span> *<\/span> m_p;<\/span>
\n}<\/span>;<\/span><\/p>\n

template<\/span><<\/span>int<\/span> N =<\/span> 1'000'000<\/span>><\/span>
\nclass<\/span> CInBuff<\/span>
\n{<\/span>
\npublic<\/span>:<\/span>
\ninline<\/span> CInBuff<\/span>(<\/span>)<\/span> {<\/span>}<\/span>
\ninline<\/span> CInBuff<<\/span>N><\/span>&<\/span> operator<\/span>>><\/span>(<\/span>char<\/span>&<\/span> ch)<\/span> {<\/span>
\nFileToBuf<\/span>(<\/span>)<\/span>;<\/span>
\nch =<\/span> *<\/span>S++<\/span>;<\/span>
\nreturn<\/span> *<\/span>this<\/span>;<\/span>
\n}<\/span>
\ninline<\/span> CInBuff<<\/span>N><\/span>&<\/span> operator<\/span>>><\/span>(<\/span>int<\/span>&<\/span> val)<\/span> {<\/span>
\nFileToBuf<\/span>(<\/span>)<\/span>;<\/span>
\nint<\/span> x<\/span>(<\/span>0<\/span>)<\/span>,<\/span> f<\/span>(<\/span>0<\/span>)<\/span>;<\/span>
\nwhile<\/span> (<\/span>!<\/span>isdigit<\/span>(<\/span>*<\/span>S)<\/span>)<\/span>
\nf |=<\/span> (<\/span>*<\/span>S++<\/span> ==<\/span> '-'<\/span>)<\/span>;<\/span>
\nwhile<\/span> (<\/span>isdigit<\/span>(<\/span>*<\/span>S)<\/span>)<\/span>
\nx =<\/span> (<\/span>x <<<\/span> 1<\/span>)<\/span> +<\/span> (<\/span>x <<<\/span> 3<\/span>)<\/span> +<\/span> (<\/span>*<\/span>S++<\/span> ^<\/span> 48<\/span>)<\/span>;<\/span>
\nval =<\/span> f ?<\/span> –<\/span>x :<\/span> x;<\/span> S++<\/span>;<\/span>\/\/\u5ffd\u7565\u7a7a\u683c\u6362\u884c<\/span>
\nreturn<\/span> *<\/span>this<\/span>;<\/span>
\n}<\/span>
\ninline<\/span> CInBuff&<\/span> operator<\/span>>><\/span>(<\/span>long<\/span> long<\/span>&<\/span> val)<\/span> {<\/span>
\nFileToBuf<\/span>(<\/span>)<\/span>;<\/span>
\nlong<\/span> long<\/span> x<\/span>(<\/span>0<\/span>)<\/span>;<\/span> int<\/span> f<\/span>(<\/span>0<\/span>)<\/span>;<\/span>
\nwhile<\/span> (<\/span>!<\/span>isdigit<\/span>(<\/span>*<\/span>S)<\/span>)<\/span>
\nf |=<\/span> (<\/span>*<\/span>S++<\/span> ==<\/span> '-'<\/span>)<\/span>;<\/span>
\nwhile<\/span> (<\/span>isdigit<\/span>(<\/span>*<\/span>S)<\/span>)<\/span>
\nx =<\/span> (<\/span>x <<<\/span> 1<\/span>)<\/span> +<\/span> (<\/span>x <<<\/span> 3<\/span>)<\/span> +<\/span> (<\/span>*<\/span>S++<\/span> ^<\/span> 48<\/span>)<\/span>;<\/span>
\nval =<\/span> f ?<\/span> –<\/span>x :<\/span> x;<\/span> S++<\/span>;<\/span>\/\/\u5ffd\u7565\u7a7a\u683c\u6362\u884c<\/span>
\nreturn<\/span> *<\/span>this<\/span>;<\/span>
\n}<\/span>
\ntemplate<\/span><<\/span>class<\/span> T1<\/span>,<\/span> class<\/span> T2<\/span>><\/span>
\ninline<\/span> CInBuff&<\/span> operator<\/span>>><\/span>(<\/span>pair<<\/span>T1,<\/span> T2><\/span>&<\/span> val)<\/span> {<\/span>
\n*<\/span>this<\/span> >><\/span> val.<\/span>first >><\/span> val.<\/span>second;<\/span>
\nreturn<\/span> *<\/span>this<\/span>;<\/span>
\n}<\/span>
\ntemplate<\/span><<\/span>class<\/span> T1<\/span>,<\/span> class<\/span> T2<\/span>,<\/span> class<\/span> T3<\/span>><\/span>
\ninline<\/span> CInBuff&<\/span> operator<\/span>>><\/span>(<\/span>tuple<<\/span>T1,<\/span> T2,<\/span> T3><\/span>&<\/span> val)<\/span> {<\/span>
\n*<\/span>this<\/span> >><\/span> get<<\/span>0<\/span>><\/span>(<\/span>val)<\/span> >><\/span> get<<\/span>1<\/span>><\/span>(<\/span>val)<\/span> >><\/span> get<<\/span>2<\/span>><\/span>(<\/span>val)<\/span>;<\/span>
\nreturn<\/span> *<\/span>this<\/span>;<\/span>
\n}<\/span>
\ntemplate<\/span><<\/span>class<\/span> T1<\/span>,<\/span> class<\/span> T2<\/span>,<\/span> class<\/span> T3<\/span>,<\/span> class<\/span> T4<\/span>><\/span>
\ninline<\/span> CInBuff&<\/span> operator<\/span>>><\/span>(<\/span>tuple<<\/span>T1,<\/span> T2,<\/span> T3,<\/span> T4><\/span>&<\/span> val)<\/span> {<\/span>
\n*<\/span>this<\/span> >><\/span> get<<\/span>0<\/span>><\/span>(<\/span>val)<\/span> >><\/span> get<<\/span>1<\/span>><\/span>(<\/span>val)<\/span> >><\/span> get<<\/span>2<\/span>><\/span>(<\/span>val)<\/span> >><\/span> get<<\/span>3<\/span>><\/span>(<\/span>val)<\/span>;<\/span>
\nreturn<\/span> *<\/span>this<\/span>;<\/span>
\n}<\/span>
\ntemplate<\/span><<\/span>class<\/span> T<\/span> =<\/span> int<\/span>><\/span>
\ninline<\/span> CInBuff&<\/span> operator<\/span>>><\/span>(<\/span>vector<<\/span>T><\/span>&<\/span> val)<\/span> {<\/span>
\nint<\/span> n;<\/span>
\n*<\/span>this<\/span> >><\/span> n;<\/span>
\nval.<\/span>resize<\/span>(<\/span>n)<\/span>;<\/span>
\nfor<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> n;<\/span> i++<\/span>)<\/span> {<\/span>
\n*<\/span>this<\/span> >><\/span> val[<\/span>i]<\/span>;<\/span>
\n}<\/span>
\nreturn<\/span> *<\/span>this<\/span>;<\/span>
\n}<\/span>
\ntemplate<\/span><<\/span>class<\/span> T<\/span> =<\/span> int<\/span>><\/span>
\nvector<<\/span>T><\/span> Read<\/span>(<\/span>int<\/span> n)<\/span> {<\/span>
\nvector<<\/span>T><\/span> ret<\/span>(<\/span>n)<\/span>;<\/span>
\nfor<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> n;<\/span> i++<\/span>)<\/span> {<\/span>
\n*<\/span>this<\/span> >><\/span> ret[<\/span>i]<\/span>;<\/span>
\n}<\/span>
\nreturn<\/span> ret;<\/span>
\n}<\/span>
\ntemplate<\/span><<\/span>class<\/span> T<\/span> =<\/span> int<\/span>><\/span>
\nvector<<\/span>T><\/span> Read<\/span>(<\/span>)<\/span> {<\/span>
\nvector<<\/span>T><\/span> ret;<\/span>
\n*<\/span>this<\/span> >><\/span> ret;<\/span>
\nreturn<\/span> ret;<\/span>
\n}<\/span>
\nprivate<\/span>:<\/span>
\ninline<\/span> void<\/span> FileToBuf<\/span>(<\/span>)<\/span> {<\/span>
\nconst<\/span> int<\/span> canRead =<\/span> m_iWritePos –<\/span> (<\/span>S –<\/span> buffer)<\/span>;<\/span>
\nif<\/span> (<\/span>canRead >=<\/span> 100<\/span>)<\/span> {<\/span> return<\/span>;<\/span> }<\/span>
\nif<\/span> (<\/span>m_bFinish)<\/span> {<\/span> return<\/span>;<\/span> }<\/span>
\nfor<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> canRead;<\/span> i++<\/span>)<\/span>
\n{<\/span>
\nbuffer[<\/span>i]<\/span> =<\/span> S[<\/span>i]<\/span>;<\/span>\/\/memcpy\u51fa\u9519<\/span>
\n}<\/span>
\nm_iWritePos =<\/span> canRead;<\/span>
\nbuffer[<\/span>m_iWritePos]<\/span> =<\/span> 0<\/span>;<\/span>
\nS =<\/span> buffer;<\/span>
\nint<\/span> readCnt =<\/span> fread<\/span>(<\/span>buffer +<\/span> m_iWritePos,<\/span> 1<\/span>,<\/span> N –<\/span> m_iWritePos,<\/span> stdin<\/span>)<\/span>;<\/span>
\nif<\/span> (<\/span>readCnt <=<\/span> 0<\/span>)<\/span> {<\/span> m_bFinish =<\/span> true<\/span>;<\/span> return<\/span>;<\/span> }<\/span>
\nm_iWritePos +=<\/span> readCnt;<\/span>
\nbuffer[<\/span>m_iWritePos]<\/span> =<\/span> 0<\/span>;<\/span>
\nS =<\/span> buffer;<\/span>
\n}<\/span>
\nint<\/span> m_iWritePos =<\/span> 0<\/span>;<\/span> bool<\/span> m_bFinish =<\/span> false<\/span>;<\/span>
\nchar<\/span> buffer[<\/span>N +<\/span> 10<\/span>]<\/span>,<\/span> *<\/span> S =<\/span> buffer;<\/span>
\n}<\/span>;<\/span><\/p>\n

class<\/span> CDGTopSort<\/span>
\n{<\/span>
\npublic<\/span>:<\/span>
\ntemplate<\/span> <<\/span>class<\/span> T<\/span> =<\/span> vector<<\/span>int<\/span>><\/span> ><\/span>
\nCDGTopSort<\/span>(<\/span>const<\/span> vector<<\/span>T><\/span>&<\/span> vNeiBo)<\/span> :<\/span>m_vDeg<\/span>(<\/span>vNeiBo.<\/span>size<\/span>(<\/span>)<\/span>)<\/span>,<\/span> m_neiBo<\/span>(<\/span>vNeiBo)<\/span> {<\/span>
\nconst<\/span> int<\/span> N =<\/span> vNeiBo.<\/span>size<\/span>(<\/span>)<\/span>;<\/span>
\nm_backNeiBo.<\/span>resize<\/span>(<\/span>N)<\/span>;<\/span>
\nfor<\/span> (<\/span>int<\/span> cur =<\/span> 0<\/span>;<\/span> cur <<\/span> N;<\/span> cur++<\/span>)<\/span>
\n{<\/span>
\nm_vDeg[<\/span>cur]<\/span> =<\/span> vNeiBo[<\/span>cur]<\/span>.<\/span>size<\/span>(<\/span>)<\/span>;<\/span>
\nfor<\/span> (<\/span>const<\/span> auto<\/span>&<\/span> next :<\/span> vNeiBo[<\/span>cur]<\/span>)<\/span>
\n{<\/span>
\nm_backNeiBo[<\/span>next]<\/span>.<\/span>emplace_back<\/span>(<\/span>cur)<\/span>;<\/span>
\n}<\/span>
\n}<\/span>
\n}<\/span>
\nvoid<\/span> Init<\/span>(<\/span>)<\/span> {<\/span><\/p>\n

auto<\/span> Add =<\/span> [<\/span>&<\/span>]<\/span>(<\/span>int<\/span> i)<\/span> {<\/span>
\nif<\/span> (<\/span>0<\/span> !=<\/span> m_vDeg[<\/span>i]<\/span>)<\/span> {<\/span> return<\/span>;<\/span> }<\/span>
\nm_que.<\/span>emplace<\/span>(<\/span>i)<\/span>;<\/span>
\n}<\/span>;<\/span>
\nfor<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> m_vDeg.<\/span>size<\/span>(<\/span>)<\/span>;<\/span> i++<\/span>)<\/span>
\n{<\/span>
\nAdd<\/span>(<\/span>i)<\/span>;<\/span>
\n}<\/span>
\nwhile<\/span> (<\/span>m_que.<\/span>size<\/span>(<\/span>)<\/span>)<\/span>
\n{<\/span>
\nconst<\/span> int<\/span> cur =<\/span> m_que.<\/span>front<\/span>(<\/span>)<\/span>;<\/span> m_que.<\/span>pop<\/span>(<\/span>)<\/span>;<\/span>
\nif<\/span> (<\/span>!<\/span>OnDo<\/span>(<\/span>cur)<\/span>)<\/span> {<\/span> continue<\/span>;<\/span> }<\/span>
\nfor<\/span> (<\/span>const<\/span> auto<\/span>&<\/span> next :<\/span> m_backNeiBo[<\/span>cur]<\/span>)<\/span>
\n{<\/span>
\nm_vDeg[<\/span>next]<\/span>—<\/span>;<\/span>
\nAdd<\/span>(<\/span>next)<\/span>;<\/span>
\n}<\/span>
\n}<\/span>;<\/span>
\n}<\/span>
\nqueue<<\/span>int<\/span>><\/span> m_que;<\/span>
\nvector<<\/span>int<\/span>><\/span> m_vDeg;<\/span>
\nvector<<\/span>int<\/span>><\/span> m_vSort;<\/span>
\nprotected<\/span>:<\/span>
\nconst<\/span> vector<<\/span>vector<<\/span>int<\/span>>><\/span>&<\/span> m_neiBo;<\/span>
\nvector<<\/span>vector<<\/span>int<\/span>>><\/span> m_backNeiBo;<\/span>
\nvirtual<\/span> bool<\/span> OnDo<\/span>(<\/span>int<\/span> cur)<\/span> {<\/span>
\nm_vSort.<\/span>emplace_back<\/span>(<\/span>cur)<\/span>;<\/span>
\nreturn<\/span> true<\/span>;<\/span>
\n}<\/span>;<\/span>
\n}<\/span>;<\/span><\/p>\n

class<\/span> CNeiBo<\/span>
\n{<\/span>
\npublic<\/span>:<\/span>
\nstatic<\/span> vector<<\/span>vector<<\/span>int<\/span>>><\/span> Two<\/span>(<\/span>int<\/span> n,<\/span> const<\/span> vector<<\/span>pair<<\/span>int<\/span>,<\/span> int<\/span>>><\/span>&<\/span> edges,<\/span> bool<\/span> bDirect,<\/span> int<\/span> iBase =<\/span> 0<\/span>)<\/span>
\n{<\/span>
\nvector<<\/span>vector<<\/span>int<\/span>>><\/span> vNeiBo<\/span>(<\/span>n)<\/span>;<\/span>
\nfor<\/span> (<\/span>const<\/span> auto<\/span>&<\/span> [<\/span>i1,<\/span> i2]<\/span> :<\/span> edges)<\/span>
\n{<\/span>
\nvNeiBo[<\/span>i1 –<\/span> iBase]<\/span>.<\/span>emplace_back<\/span>(<\/span>i2 –<\/span> iBase)<\/span>;<\/span>
\nif<\/span> (<\/span>!<\/span>bDirect)<\/span>
\n{<\/span>
\nvNeiBo[<\/span>i2 –<\/span> iBase]<\/span>.<\/span>emplace_back<\/span>(<\/span>i1 –<\/span> iBase)<\/span>;<\/span>
\n}<\/span>
\n}<\/span>
\nreturn<\/span> vNeiBo;<\/span>
\n}<\/span>
\nstatic<\/span> vector<<\/span>vector<<\/span>int<\/span>>><\/span> Two<\/span>(<\/span>int<\/span> n,<\/span> const<\/span> vector<<\/span>vector<<\/span>int<\/span>>><\/span>&<\/span> edges,<\/span> bool<\/span> bDirect,<\/span> int<\/span> iBase =<\/span> 0<\/span>)<\/span>
\n{<\/span>
\nvector<<\/span>vector<<\/span>int<\/span>>><\/span> vNeiBo<\/span>(<\/span>n)<\/span>;<\/span>
\nfor<\/span> (<\/span>const<\/span> auto<\/span>&<\/span> v :<\/span> edges)<\/span>
\n{<\/span>
\nvNeiBo[<\/span>v[<\/span>0<\/span>]<\/span> –<\/span> iBase]<\/span>.<\/span>emplace_back<\/span>(<\/span>v[<\/span>1<\/span>]<\/span> –<\/span> iBase)<\/span>;<\/span>
\nif<\/span> (<\/span>!<\/span>bDirect)<\/span>
\n{<\/span>
\nvNeiBo[<\/span>v[<\/span>1<\/span>]<\/span> –<\/span> iBase]<\/span>.<\/span>emplace_back<\/span>(<\/span>v[<\/span>0<\/span>]<\/span> –<\/span> iBase)<\/span>;<\/span>
\n}<\/span>
\n}<\/span>
\nreturn<\/span> vNeiBo;<\/span>
\n}<\/span>
\nstatic<\/span> vector<<\/span>vector<<\/span>std::<\/span>pair<<\/span>int<\/span>,<\/span> int<\/span>>><\/span>><\/span> Three<\/span>(<\/span>int<\/span> n,<\/span> vector<<\/span>vector<<\/span>int<\/span>>><\/span>&<\/span> edges,<\/span> bool<\/span> bDirect,<\/span> int<\/span> iBase =<\/span> 0<\/span>)<\/span>
\n{<\/span>
\nvector<<\/span>vector<<\/span>std::<\/span>pair<<\/span>int<\/span>,<\/span> int<\/span>>><\/span>><\/span> vNeiBo<\/span>(<\/span>n)<\/span>;<\/span>
\nfor<\/span> (<\/span>const<\/span> auto<\/span>&<\/span> v :<\/span> edges)<\/span>
\n{<\/span>
\nvNeiBo[<\/span>v[<\/span>0<\/span>]<\/span> –<\/span> iBase]<\/span>.<\/span>emplace_back<\/span>(<\/span>v[<\/span>1<\/span>]<\/span> –<\/span> iBase,<\/span> v[<\/span>2<\/span>]<\/span>)<\/span>;<\/span>
\nif<\/span> (<\/span>!<\/span>bDirect)<\/span>
\n{<\/span>
\nvNeiBo[<\/span>v[<\/span>1<\/span>]<\/span> –<\/span> iBase]<\/span>.<\/span>emplace_back<\/span>(<\/span>v[<\/span>0<\/span>]<\/span> –<\/span> iBase,<\/span> v[<\/span>2<\/span>]<\/span>)<\/span>;<\/span>
\n}<\/span>
\n}<\/span>
\nreturn<\/span> vNeiBo;<\/span>
\n}<\/span>
\nstatic<\/span> vector<<\/span>vector<<\/span>std::<\/span>pair<<\/span>int<\/span>,<\/span> int<\/span>>><\/span>><\/span> Three<\/span>(<\/span>int<\/span> n,<\/span> const<\/span> vector<<\/span>tuple<<\/span>int<\/span>,<\/span> int<\/span>,<\/span> int<\/span>>><\/span>&<\/span> edges,<\/span> bool<\/span> bDirect,<\/span> int<\/span> iBase =<\/span> 0<\/span>)<\/span>
\n{<\/span>
\nvector<<\/span>vector<<\/span>std::<\/span>pair<<\/span>int<\/span>,<\/span> int<\/span>>><\/span>><\/span> vNeiBo<\/span>(<\/span>n)<\/span>;<\/span>
\nfor<\/span> (<\/span>const<\/span> auto<\/span>&<\/span> [<\/span>u,<\/span> v,<\/span> w]<\/span> :<\/span> edges)<\/span>
\n{<\/span>
\nvNeiBo[<\/span>u –<\/span> iBase]<\/span>.<\/span>emplace_back<\/span>(<\/span>v –<\/span> iBase,<\/span> w)<\/span>;<\/span>
\nif<\/span> (<\/span>!<\/span>bDirect)<\/span>
\n{<\/span>
\nvNeiBo[<\/span>v –<\/span> iBase]<\/span>.<\/span>emplace_back<\/span>(<\/span>u –<\/span> iBase,<\/span> w)<\/span>;<\/span>
\n}<\/span>
\n}<\/span>
\nreturn<\/span> vNeiBo;<\/span>
\n}<\/span>
\nstatic<\/span> vector<<\/span>vector<<\/span>int<\/span>>><\/span> Mat<\/span>(<\/span>vector<<\/span>vector<<\/span>int<\/span>>><\/span>&<\/span> neiBoMat)<\/span>
\n{<\/span>
\nvector<<\/span>vector<<\/span>int<\/span>>><\/span> neiBo<\/span>(<\/span>neiBoMat.<\/span>size<\/span>(<\/span>)<\/span>)<\/span>;<\/span>
\nfor<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> neiBoMat.<\/span>size<\/span>(<\/span>)<\/span>;<\/span> i++<\/span>)<\/span>
\n{<\/span>
\nfor<\/span> (<\/span>int<\/span> j =<\/span> i +<\/span> 1<\/span>;<\/span> j <<\/span> neiBoMat.<\/span>size<\/span>(<\/span>)<\/span>;<\/span> j++<\/span>)<\/span>
\n{<\/span>
\nif<\/span> (<\/span>neiBoMat[<\/span>i]<\/span>[<\/span>j]<\/span>)<\/span>
\n{<\/span>
\nneiBo[<\/span>i]<\/span>.<\/span>emplace_back<\/span>(<\/span>j)<\/span>;<\/span>
\nneiBo[<\/span>j]<\/span>.<\/span>emplace_back<\/span>(<\/span>i)<\/span>;<\/span>
\n}<\/span>
\n}<\/span>
\n}<\/span>
\nreturn<\/span> neiBo;<\/span>
\n}<\/span>
\n}<\/span>;<\/span><\/p>\n

class<\/span> CSCCTarjan<\/span> {<\/span>
\npublic<\/span>:<\/span>
\nCSCCTarjan<\/span>(<\/span>vector<<\/span>vector<<\/span>int<\/span>>><\/span>&<\/span> neiBo)<\/span> :<\/span>m_neiBo<\/span>(<\/span>neiBo)<\/span> {<\/span>
\nconst<\/span> int<\/span> N =<\/span> neiBo.<\/span>size<\/span>(<\/span>)<\/span>;<\/span>
\nm_vTime.<\/span>assign<\/span>(<\/span>N,<\/span> –<\/span>1<\/span>)<\/span>;<\/span>
\nm_vBack.<\/span>assign<\/span>(<\/span>N,<\/span> –<\/span>1<\/span>)<\/span>;<\/span>
\nm_vIsStack.<\/span>assign<\/span>(<\/span>N,<\/span> false<\/span>)<\/span>;<\/span>
\nfor<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> N;<\/span> i++<\/span>)<\/span> {<\/span>
\nDFS<\/span>(<\/span>i)<\/span>;<\/span>
\n}<\/span>
\n}<\/span>
\nvoid<\/span> InitPtNew<\/span>(<\/span>)<\/span> {<\/span>
\nm_ptNew.<\/span>resize<\/span>(<\/span>m_neiBo.<\/span>size<\/span>(<\/span>)<\/span>)<\/span>;<\/span>
\niota<\/span>(<\/span>m_ptNew.<\/span>begin<\/span>(<\/span>)<\/span>,<\/span> m_ptNew.<\/span>end<\/span>(<\/span>)<\/span>,<\/span> 0<\/span>)<\/span>;<\/span>
\nfor<\/span> (<\/span>auto<\/span>&<\/span> v :<\/span> m_sccs)<\/span> {<\/span>
\nnth_element<\/span>(<\/span>v.<\/span>begin<\/span>(<\/span>)<\/span>,<\/span> v.<\/span>begin<\/span>(<\/span>)<\/span>,<\/span> v.<\/span>end<\/span>(<\/span>)<\/span>)<\/span>;<\/span>
\nm_v0.<\/span>emplace_back<\/span>(<\/span>v[<\/span>0<\/span>]<\/span>)<\/span>;<\/span>
\nfor<\/span> (<\/span>int<\/span> i =<\/span> 1<\/span>;<\/span> i <<\/span> v.<\/span>size<\/span>(<\/span>)<\/span>;<\/span> i++<\/span>)<\/span> {<\/span>
\nm_ptNew[<\/span>v[<\/span>i]<\/span>]<\/span> =<\/span> v[<\/span>0<\/span>]<\/span>;<\/span>
\n}<\/span>
\n}<\/span>
\n}<\/span>
\nvector<<\/span>vector<<\/span>int<\/span>>><\/span> GetNewNeiBo<\/span>(<\/span>)<\/span> {<\/span>
\nvector<<\/span>vector<<\/span>int<\/span>>><\/span> neiBo<\/span>(<\/span>m_neiBo.<\/span>size<\/span>(<\/span>)<\/span>)<\/span>;<\/span>
\nfor<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> neiBo.<\/span>size<\/span>(<\/span>)<\/span>;<\/span> i++<\/span>)<\/span> {<\/span>
\nconst<\/span> int<\/span> n1 =<\/span> m_ptNew[<\/span>i]<\/span>;<\/span>
\nfor<\/span> (<\/span>const<\/span> auto<\/span>&<\/span> next :<\/span> m_neiBo[<\/span>i]<\/span>)<\/span> {<\/span>
\nconst<\/span> int<\/span> n2 =<\/span> m_ptNew[<\/span>next]<\/span>;<\/span>
\nif<\/span> (<\/span>n1 ==<\/span> n2)<\/span> {<\/span> continue<\/span>;<\/span> }<\/span>\/\/\u81ea\u73af<\/span>
\nneiBo[<\/span>n1]<\/span>.<\/span>emplace_back<\/span>(<\/span>n2)<\/span>;<\/span>
\n}<\/span>
\n}<\/span>
\nfor<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> neiBo.<\/span>size<\/span>(<\/span>)<\/span>;<\/span> i++<\/span>)<\/span> {<\/span>
\nunordered_set<<\/span>int<\/span>><\/span> s<\/span>(<\/span>neiBo[<\/span>i]<\/span>.<\/span>begin<\/span>(<\/span>)<\/span>,<\/span> neiBo[<\/span>i]<\/span>.<\/span>end<\/span>(<\/span>)<\/span>)<\/span>;<\/span>
\nvector<<\/span>int<\/span>><\/span> tmp<\/span>(<\/span>s.<\/span>begin<\/span>(<\/span>)<\/span>,<\/span> s.<\/span>end<\/span>(<\/span>)<\/span>)<\/span>;<\/span>
\nneiBo[<\/span>i]<\/span>.<\/span>swap<\/span>(<\/span>tmp)<\/span>;<\/span>
\n}<\/span>
\nreturn<\/span> neiBo;<\/span>
\n}<\/span>
\nvector<<\/span>vector<<\/span>int<\/span>>><\/span> m_sccs;<\/span>
\nvector<<\/span>int<\/span>><\/span> m_v0,<\/span> m_ptNew;<\/span>
\nprotected<\/span>:<\/span>
\nvoid<\/span> DFS<\/span>(<\/span>int<\/span> cur)<\/span> {<\/span>
\nif<\/span> (<\/span>–<\/span>1<\/span> !=<\/span> m_vTime[<\/span>cur]<\/span>)<\/span> {<\/span> return<\/span>;<\/span> }<\/span>
\nm_vTime[<\/span>cur]<\/span> =<\/span> m_vBack[<\/span>cur]<\/span> =<\/span> m_iTimes++<\/span>;<\/span>
\nm_vIsStack[<\/span>cur]<\/span> =<\/span> true<\/span>;<\/span>
\nm_sta.<\/span>emplace<\/span>(<\/span>cur)<\/span>;<\/span>
\nfor<\/span> (<\/span>const<\/span> auto<\/span>&<\/span> next :<\/span> m_neiBo[<\/span>cur]<\/span>)<\/span> {<\/span>
\nif<\/span> (<\/span>–<\/span>1<\/span> ==<\/span> m_vTime[<\/span>next]<\/span>)<\/span> {<\/span>
\nDFS<\/span>(<\/span>next)<\/span>;<\/span>
\nm_vBack[<\/span>cur]<\/span> =<\/span> min<\/span>(<\/span>m_vBack[<\/span>cur]<\/span>,<\/span> m_vBack[<\/span>next]<\/span>)<\/span>;<\/span>
\n}<\/span>
\nelse<\/span> if<\/span> (<\/span>m_vIsStack[<\/span>next]<\/span>)<\/span> {<\/span>
\nm_vBack[<\/span>cur]<\/span> =<\/span> min<\/span>(<\/span>m_vBack[<\/span>cur]<\/span>,<\/span> m_vTime[<\/span>next]<\/span>)<\/span>;<\/span>
\n}<\/span>
\n}<\/span>
\nif<\/span> (<\/span>m_vTime[<\/span>cur]<\/span> !=<\/span> m_vBack[<\/span>cur]<\/span>)<\/span> {<\/span> return<\/span>;<\/span> }<\/span>
\nvector<<\/span>int<\/span>><\/span> scc;<\/span>
\nwhile<\/span> (<\/span>m_sta.<\/span>size<\/span>(<\/span>)<\/span>)<\/span>
\n{<\/span>
\nauto<\/span> u =<\/span> m_sta.<\/span>top<\/span>(<\/span>)<\/span>;<\/span> m_sta.<\/span>pop<\/span>(<\/span>)<\/span>;<\/span>
\nscc.<\/span>emplace_back<\/span>(<\/span>u)<\/span>;<\/span>
\nm_vIsStack[<\/span>u]<\/span> =<\/span> false<\/span>;<\/span>
\nif<\/span> (<\/span>cur ==<\/span> u)<\/span> {<\/span> break<\/span>;<\/span> }<\/span>
\n}<\/span>
\nm_sccs.<\/span>emplace_back<\/span>(<\/span>scc)<\/span>;<\/span>
\n}<\/span>
\nvector<<\/span>vector<<\/span>int<\/span>>><\/span>&<\/span> m_neiBo;<\/span>
\nint<\/span> m_iTimes =<\/span> 0<\/span>;<\/span>
\nvector<<\/span>int<\/span>><\/span> m_vTime,<\/span> m_vBack;<\/span>
\nvector<<\/span>bool<\/span>><\/span> m_vIsStack;<\/span>
\nstack<<\/span>int<\/span>><\/span> m_sta;<\/span>
\n}<\/span>;<\/span>
\nclass<\/span> Solution<\/span> {<\/span>
\npublic<\/span>:<\/span>
\nint<\/span> Ans<\/span>(<\/span>const<\/span> int<\/span> N,<\/span> vector<<\/span>pair<<\/span>int<\/span>,<\/span> int<\/span>>><\/span>&<\/span> edge)<\/span> {<\/span>
\nfor<\/span> (<\/span>auto<\/span>&<\/span> [<\/span>u,<\/span> v]<\/span> :<\/span> edge)<\/span> {<\/span> u—<\/span>,<\/span> v—<\/span>;<\/span> }<\/span>
\nauto<\/span> neiBo =<\/span> CNeiBo<\/span>::<\/span>Two<\/span>(<\/span>N,<\/span> edge,<\/span> true<\/span>,<\/span> 0<\/span>)<\/span>;<\/span>
\nCSCCTarjan scc<\/span>(<\/span>neiBo)<\/span>;<\/span>
\nscc.<\/span>InitPtNew<\/span>(<\/span>)<\/span>;<\/span>
\nm_ringSize.<\/span>assign<\/span>(<\/span>N,<\/span> 0<\/span>)<\/span>;<\/span>
\nfor<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> N;<\/span> i++<\/span>)<\/span> {<\/span>
\nm_ringSize[<\/span>scc.<\/span>m_ptNew[<\/span>i]<\/span>]<\/span>++<\/span>;<\/span>
\n}<\/span>
\nauto<\/span> neiBo1 =<\/span> scc.<\/span>GetNewNeiBo<\/span>(<\/span>)<\/span>;<\/span>
\nvector<<\/span>vector<<\/span>int<\/span>>><\/span> neiBo2<\/span>(<\/span>N)<\/span>;<\/span>
\nfor<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> N;<\/span> i++<\/span>)<\/span> {<\/span>
\nfor<\/span> (<\/span>const<\/span> auto<\/span>&<\/span> j :<\/span> neiBo1[<\/span>i]<\/span>)<\/span> {<\/span>
\nneiBo2[<\/span>j]<\/span>.<\/span>emplace_back<\/span>(<\/span>i)<\/span>;<\/span>
\n}<\/span>
\n}<\/span>
\nassert<\/span>(<\/span>0<\/span> ==<\/span> scc.<\/span>m_ptNew[<\/span>0<\/span>]<\/span>)<\/span>;<\/span>
\nauto<\/span> dis1 =<\/span> More<\/span>(<\/span>N,<\/span> neiBo1)<\/span>;<\/span>
\nauto<\/span> dis2 =<\/span> More<\/span>(<\/span>N,<\/span> neiBo2)<\/span>;<\/span>
\nint<\/span> ans =<\/span> dis1[<\/span>0<\/span>]<\/span>;<\/span>
\nfor<\/span> (<\/span>int<\/span> u =<\/span> 0<\/span>;<\/span> u <<\/span> N;<\/span> u++<\/span>)<\/span> {<\/span>
\nfor<\/span> (<\/span>const<\/span> auto<\/span>&<\/span> v :<\/span> neiBo1[<\/span>u]<\/span>)<\/span> {<\/span>
\nif<\/span> (<\/span>(<\/span>0<\/span> ==<\/span> dis1[<\/span>v]<\/span>)<\/span> ||<\/span> (<\/span>0<\/span> ==<\/span> dis2[<\/span>u]<\/span>)<\/span>)<\/span> {<\/span> continue<\/span>;<\/span> }<\/span>
\nif<\/span> (<\/span>(<\/span>0<\/span> ==<\/span> scc.<\/span>m_ptNew[<\/span>u]<\/span>)<\/span> &&<\/span> (<\/span>0<\/span> ==<\/span> scc.<\/span>m_ptNew[<\/span>v]<\/span>)<\/span>)<\/span> {<\/span> continue<\/span>;<\/span> }<\/span>
\nans =<\/span> max<\/span>(<\/span>ans,<\/span> dis1[<\/span>v]<\/span> +<\/span> dis2[<\/span>u]<\/span> –<\/span> m_ringSize[<\/span>0<\/span>]<\/span>)<\/span>;<\/span>
\n}<\/span>
\n}<\/span>
\nreturn<\/span> ans;<\/span>
\n}<\/span>
\nvector<<\/span>int<\/span>><\/span> More<\/span>(<\/span>const<\/span> int<\/span> N,<\/span> vector<<\/span>vector<<\/span>int<\/span>>><\/span>&<\/span> neiBo)<\/span> {<\/span>
\nvector<<\/span>int<\/span>><\/span> ret<\/span>(<\/span>N)<\/span>;<\/span>
\nret[<\/span>0<\/span>]<\/span> =<\/span> m_ringSize[<\/span>0<\/span>]<\/span>;<\/span>
\nCDGTopSort topSort<\/span>(<\/span>neiBo)<\/span>;<\/span>
\ntopSort.<\/span>Init<\/span>(<\/span>)<\/span>;<\/span>
\nfor<\/span> (<\/span>auto<\/span> it =<\/span> topSort.<\/span>m_vSort.<\/span>rbegin<\/span>(<\/span>)<\/span>;<\/span> it !=<\/span> topSort.<\/span>m_vSort.<\/span>rend<\/span>(<\/span>)<\/span>;<\/span> ++<\/span>it)<\/span> {<\/span>
\nif<\/span> (<\/span>0<\/span> ==<\/span> ret[<\/span>*<\/span>it]<\/span>)<\/span> {<\/span> continue<\/span>;<\/span> }<\/span>
\nfor<\/span> (<\/span>const<\/span> auto<\/span>&<\/span> child :<\/span> neiBo[<\/span>*<\/span>it]<\/span>)<\/span> {<\/span>
\nret[<\/span>child]<\/span> =<\/span> max<\/span>(<\/span>ret[<\/span>child]<\/span>,<\/span> ret[<\/span>*<\/span>it]<\/span> +<\/span> m_ringSize[<\/span>child]<\/span>)<\/span>;<\/span>
\n}<\/span>
\n}<\/span>
\nreturn<\/span> ret;<\/span>
\n}<\/span>
\nvector<<\/span>int<\/span>><\/span> m_ringSize;<\/span>
\n}<\/span>;<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n#<\/span>ifdef<\/span> _DEBUG<\/span><\/span>
\nfreopen<\/span>(<\/span>"a.in"<\/span>,<\/span> "r"<\/span>,<\/span> stdin<\/span>)<\/span>;<\/span>
\n#<\/span>endif<\/span> \/\/ DEBUG<\/span><\/span>
\nios::<\/span>sync_with_stdio<\/span>(<\/span>0<\/span>)<\/span>;<\/span> cin.<\/span>tie<\/span>(<\/span>nullptr<\/span>)<\/span>;<\/span> cout.<\/span>tie<\/span>(<\/span>nullptr<\/span>)<\/span>;<\/span>
\nint<\/span> N;<\/span>
\ncin >><\/span> N ;<\/span>
\nauto<\/span> edge =<\/span> Read<<\/span>pair<<\/span>int<\/span>,<\/span>int<\/span>>><\/span>(<\/span>)<\/span>;<\/span>
\n#<\/span>ifdef<\/span> _DEBUG<\/span><\/span>
\nprintf<\/span>(<\/span>"N=%d"<\/span>,<\/span>N)<\/span>;<\/span>
\nOut<\/span>(<\/span>edge,<\/span> ",edge="<\/span>)<\/span>;<\/span>
\n\/\/Out(que, ",que=");<\/span>
\n#<\/span>endif<\/span> \/\/ DEBUG<\/span><\/span>
\nauto<\/span> res =<\/span> Solution<\/span>(<\/span>)<\/span>.<\/span>Ans<\/span>(<\/span>N,<\/span> edge)<\/span>;<\/span>
\ncout <<<\/span> res;<\/span>
\nreturn<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\"\"<\/p>\n

\u6269\u5c55\u9605\u8bfb<\/h2>\n\n\u6211\u60f3\u5bf9\u5927\u5bb6\u8bf4\u7684\u8bdd<\/tr>\n\n\n\n\n\n\n\n\n\n
\u5de5\u4f5c\u4e2d\u9047\u5230\u7684\u95ee\u9898，\u53ef\u4ee5\u6309\u7c7b\u522b\u67e5\u9605\u9119\u4eba\u7684\u7b97\u6cd5\u6587\u7ae0，\u8bf7\u70b9\u51fb\u300a\u7b97\u6cd5\u4e0e\u6570\u636e\u6c47\u603b\u300b\u3002<\/td>\n<\/tr>\n
\u5b66\u4e60\u7b97\u6cd5：\u6309\u7ae0\u8282\u5b66\u4e60\u300a\u559c\u7f3a\u5168\u4e66\u7b97\u6cd5\u518c\u300b，\u5927\u91cf\u7684\u9898\u76ee\u548c\u6d4b\u8bd5\u7528\u4f8b，\u6253\u5305\u4e0b\u8f7d\u3002\u91cd\u89c6\u64cd\u4f5c<\/td>\n<\/tr>\n
\u6709\u6548\u5b66\u4e60：\u660e\u786e\u7684\u76ee\u6807 \u53ca\u65f6\u7684\u53cd\u9988 \u62c9\u4f38\u533a（\u96be\u5ea6\u5408\u9002） \u4e13\u6ce8<\/td>\n<\/tr>\n
\u5458\u5de5\u8bf4：\u6280\u672f\u81f3\u4e0a，\u8001\u677f\u4e0d\u4fe1；\u6295\u8d44\u4eba\u7684\u4ee3\u8868\u8bf4：\u6280\u672f\u81f3\u4e0a，\u8001\u677f\u4f1a\u4fe1\u3002<\/td>\n<\/tr>\n
\u95fb\u7f3a\u9677\u5219\u559c(\u559c\u7f3a)\u662f\u4e00\u4e2a\u7f8e\u597d\u7684\u613f\u671b，\u65e9\u53d1\u73b0\u95ee\u9898，\u65e9\u4fee\u6539\u95ee\u9898，\u7ed9\u8001\u677f\u8282\u7ea6\u94b1\u3002<\/td>\n<\/tr>\n
\u5b50\u58a8\u5b50\u8a00\u4e4b：\u4e8b\u65e0\u7ec8\u59cb，\u65e0\u52a1\u591a\u4e1a\u3002\u4e5f\u5c31\u662f\u6211\u4eec\u5e38\u8bf4\u7684\u4e13\u4e1a\u7684\u4eba\u505a\u4e13\u4e1a\u7684\u4e8b\u3002<\/td>\n<\/tr>\n
\u5982\u679c\u7a0b\u5e8f\u662f\u4e00\u6761\u9f99，\u90a3\u7b97\u6cd5\u5c31\u662f\u4ed6\u7684\u662f\u775b<\/td>\n<\/tr>\n
\u5931\u8d25+\u53cd\u601d=\u6210\u529f \u6210\u529f+\u53cd\u601d=\u6210\u529f<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u89c6\u9891\u8bfe\u7a0b<\/h3>\n

\u5148\u5b66\u7b80\u5355\u7684\u8bfe\u7a0b，\u8bf7\u79fb\u6b65CSDN\u5b66\u9662，\u542c\u767d\u94f6\u8bb2\u5e08（\u4e5f\u5c31\u662f\u9119\u4eba）\u7684\u8bb2\u89e3\u3002 https:\/\/edu.csdn.net\/course\/detail\/38771 \u5982\u4f55\u4f60\u60f3\u5feb\u901f\u5f62\u6210\u6218\u6597\u4e86，\u4e3a\u8001\u677f\u5206\u5fe7，\u8bf7\u5b66\u4e60C#\u5165\u804c\u57f9\u8bad\u3001C++\u5165\u804c\u57f9\u8bad\u7b49\u8bfe\u7a0b https:\/\/edu.csdn.net\/lecturer\/6176<\/p>\n

\u6d4b\u8bd5\u73af\u5883<\/h3>\n

\u64cd\u4f5c\u7cfb\u7edf：win7 \u5f00\u53d1\u73af\u5883： VS2019 C++17 \u6216\u8005 \u64cd\u4f5c\u7cfb\u7edf：win10 \u5f00\u53d1\u73af\u5883： VS2022 C++17 \u5982\u65e0\u7279\u6b8a\u8bf4\u660e，\u672c\u7b97\u6cd5\u7528**C++**\u5b9e\u73b0\u3002 \"\"<\/p>\n","protected":false},"excerpt":{"rendered":"

\u6587\u7ae0\u6d4f\u89c8\u9605\u8bfb1.6k\u6b21\uff0c\u70b9\u8d5e98\u6b21\uff0c\u6536\u85cf36\u6b21\u3002\u4e3a\u4e86\u66f4\u597d\u5730\u7ba1\u7406\u725b\u7fa4\u7684\u653e\u7267\u8def\u7ebf\uff0cFarmer John \u5728\u4ed6\u7684\u519c\u573a\u4e2d\u5b89\u88c5\u4e86\u82e5\u5e72\u5355\u5411\u725b\u9053\u3002\u519c\u573a\u7531 $N$ \u5757\u8349\u573a\u7ec4\u6210\uff0c\u7f16\u53f7\u4e3a $1$ \u5230 $N$\uff0c\u6bcf\u6761\u5355\u5411\u725b\u9053\u8fde\u63a5\u4e00\u5bf9\u8349\u573a\u3002\u4f8b\u5982\uff0c\u82e5\u5b58\u5728\u4e00\u6761\u4ece\u8349\u573a $X$ \u5230 $Y$ \u7684\u8def\u5f84\uff0c\u5219\u725b\u53ef\u4ee5\u4ece $X$ \u524d\u5f80 $Y$\uff0c\u4f46\u4e0d\u80fd\u4ece $Y$ \u8fd4\u56de $X$\u3002\u4f17\u6240\u5468\u77e5\uff0cBessie \u559c\u6b22\u5c3d\u53ef\u80fd\u591a\u5730\u54c1\u5c1d\u4e0d\u540c\u8349\u573a\u7684\u7267\u8349\u3002\u5979\u6bcf\u5929\u4ece\u8349\u573a $1$ \u51fa\u53d1\uff0c\u8bbf\u95ee\u4e00\u7cfb\u5217\u8349\u573a\u540e\u8fd4\u56de\u8349\u573a $1$\u3002\u5979\u8bd5\u56fe\u6700\u5927\u5316\u6cbf\u9014\u7ecf\u8fc7\u7684\u4e0d\u540c\u8349\u573a\u6570\u91cf\uff08\u91cd\u590d\u8bbf\u95ee\u7684\u8349\u573a\u53ea\u7b97\u4e00\u6b21\uff09\u3002\u7531\u4e8e\u5355\u5411\u8def\u5f84\u7684\u9650\u5236\uff0cBessie \u62c5<\/p>\n","protected":false},"author":2,"featured_media":51256,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[55,5062,3784,427],"topic":[],"class_list":["post-51260","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-server","tag-c","tag-5062","tag-3784","tag-427"],"yoast_head":"\n\u3010\u7f29\u70b9 \u62d3\u6251\u5e8f\u3011P3119 [USACO15JAN] Grass Cownoisseur G|\u7701\u9009- \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.wsisp.com\/helps\/51260.html\" \/>\n<meta property=\"og:locale\" content=\"zh_CN\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"\u3010\u7f29\u70b9 \u62d3\u6251\u5e8f\u3011P3119 [USACO15JAN] Grass Cownoisseur G|\u7701\u9009- \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\" \/>\n<meta property=\"og:description\" content=\"\u6587\u7ae0\u6d4f\u89c8\u9605\u8bfb1.6k\u6b21\uff0c\u70b9\u8d5e98\u6b21\uff0c\u6536\u85cf36\u6b21\u3002\u4e3a\u4e86\u66f4\u597d\u5730\u7ba1\u7406\u725b\u7fa4\u7684\u653e\u7267\u8def\u7ebf\uff0cFarmer John \u5728\u4ed6\u7684\u519c\u573a\u4e2d\u5b89\u88c5\u4e86\u82e5\u5e72\u5355\u5411\u725b\u9053\u3002\u519c\u573a\u7531 $N$ \u5757\u8349\u573a\u7ec4\u6210\uff0c\u7f16\u53f7\u4e3a $1$ \u5230 $N$\uff0c\u6bcf\u6761\u5355\u5411\u725b\u9053\u8fde\u63a5\u4e00\u5bf9\u8349\u573a\u3002\u4f8b\u5982\uff0c\u82e5\u5b58\u5728\u4e00\u6761\u4ece\u8349\u573a $X$ \u5230 $Y$ \u7684\u8def\u5f84\uff0c\u5219\u725b\u53ef\u4ee5\u4ece $X$ \u524d\u5f80 $Y$\uff0c\u4f46\u4e0d\u80fd\u4ece $Y$ \u8fd4\u56de $X$\u3002\u4f17\u6240\u5468\u77e5\uff0cBessie \u559c\u6b22\u5c3d\u53ef\u80fd\u591a\u5730\u54c1\u5c1d\u4e0d\u540c\u8349\u573a\u7684\u7267\u8349\u3002\u5979\u6bcf\u5929\u4ece\u8349\u573a $1$ \u51fa\u53d1\uff0c\u8bbf\u95ee\u4e00\u7cfb\u5217\u8349\u573a\u540e\u8fd4\u56de\u8349\u573a $1$\u3002\u5979\u8bd5\u56fe\u6700\u5927\u5316\u6cbf\u9014\u7ecf\u8fc7\u7684\u4e0d\u540c\u8349\u573a\u6570\u91cf\uff08\u91cd\u590d\u8bbf\u95ee\u7684\u8349\u573a\u53ea\u7b97\u4e00\u6b21\uff09\u3002\u7531\u4e8e\u5355\u5411\u8def\u5f84\u7684\u9650\u5236\uff0cBessie \u62c5\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.wsisp.com\/helps\/51260.html\" \/>\n<meta property=\"og:site_name\" content=\"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\" \/>\n<meta property=\"article:published_time\" content=\"2025-08-10T11:49:36+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/08\/20250810114934-6898874e70ca5.png\" \/>\n<meta name=\"author\" content=\"admin\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"\u4f5c\u8005\" \/>\n\t<meta name=\"twitter:data1\" content=\"admin\" \/>\n\t<meta name=\"twitter:label2\" content=\"\u9884\u8ba1\u9605\u8bfb\u65f6\u95f4\" \/>\n\t<meta name=\"twitter:data2\" content=\"13 \u5206\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/51260.html\",\"url\":\"https:\/\/www.wsisp.com\/helps\/51260.html\",\"name\":\"\u3010\u7f29\u70b9 \u62d3\u6251\u5e8f\u3011P3119 [USACO15JAN] Grass Cownoisseur G|\u7701\u9009- \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\",\"isPartOf\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/#website\"},\"datePublished\":\"2025-08-10T11:49:36+00:00\",\"dateModified\":\"2025-08-10T11:49:36+00:00\",\"author\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41\"},\"breadcrumb\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/51260.html#breadcrumb\"},\"inLanguage\":\"zh-Hans\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.wsisp.com\/helps\/51260.html\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/51260.html#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"\u9996\u9875\",\"item\":\"https:\/\/www.wsisp.com\/helps\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"\u3010\u7f29\u70b9 \u62d3\u6251\u5e8f\u3011P3119 [USACO15JAN] Grass Cownoisseur G|\u7701\u9009-\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/#website\",\"url\":\"https:\/\/www.wsisp.com\/helps\/\",\"name\":\"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\",\"description\":\"\u9999\u6e2f\u670d\u52a1\u5668_\u9999\u6e2f\u4e91\u670d\u52a1\u5668\u8d44\u8baf_\u670d\u52a1\u5668\u5e2e\u52a9\u6587\u6863_\u670d\u52a1\u5668\u6559\u7a0b\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/www.wsisp.com\/helps\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"zh-Hans\"},{\"@type\":\"Person\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41\",\"name\":\"admin\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"zh-Hans\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery\",\"contentUrl\":\"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery\",\"caption\":\"admin\"},\"sameAs\":[\"http:\/\/wp.wsisp.com\"],\"url\":\"https:\/\/www.wsisp.com\/helps\/author\/admin\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"\u3010\u7f29\u70b9 \u62d3\u6251\u5e8f\u3011P3119 [USACO15JAN] Grass Cownoisseur G|\u7701\u9009- \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.wsisp.com\/helps\/51260.html","og_locale":"zh_CN","og_type":"article","og_title":"\u3010\u7f29\u70b9 \u62d3\u6251\u5e8f\u3011P3119 [USACO15JAN] Grass Cownoisseur G|\u7701\u9009- \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","og_description":"\u6587\u7ae0\u6d4f\u89c8\u9605\u8bfb1.6k\u6b21\uff0c\u70b9\u8d5e98\u6b21\uff0c\u6536\u85cf36\u6b21\u3002\u4e3a\u4e86\u66f4\u597d\u5730\u7ba1\u7406\u725b\u7fa4\u7684\u653e\u7267\u8def\u7ebf\uff0cFarmer John \u5728\u4ed6\u7684\u519c\u573a\u4e2d\u5b89\u88c5\u4e86\u82e5\u5e72\u5355\u5411\u725b\u9053\u3002\u519c\u573a\u7531 $N$ \u5757\u8349\u573a\u7ec4\u6210\uff0c\u7f16\u53f7\u4e3a $1$ \u5230 $N$\uff0c\u6bcf\u6761\u5355\u5411\u725b\u9053\u8fde\u63a5\u4e00\u5bf9\u8349\u573a\u3002\u4f8b\u5982\uff0c\u82e5\u5b58\u5728\u4e00\u6761\u4ece\u8349\u573a $X$ \u5230 $Y$ \u7684\u8def\u5f84\uff0c\u5219\u725b\u53ef\u4ee5\u4ece $X$ \u524d\u5f80 $Y$\uff0c\u4f46\u4e0d\u80fd\u4ece $Y$ \u8fd4\u56de $X$\u3002\u4f17\u6240\u5468\u77e5\uff0cBessie \u559c\u6b22\u5c3d\u53ef\u80fd\u591a\u5730\u54c1\u5c1d\u4e0d\u540c\u8349\u573a\u7684\u7267\u8349\u3002\u5979\u6bcf\u5929\u4ece\u8349\u573a $1$ \u51fa\u53d1\uff0c\u8bbf\u95ee\u4e00\u7cfb\u5217\u8349\u573a\u540e\u8fd4\u56de\u8349\u573a $1$\u3002\u5979\u8bd5\u56fe\u6700\u5927\u5316\u6cbf\u9014\u7ecf\u8fc7\u7684\u4e0d\u540c\u8349\u573a\u6570\u91cf\uff08\u91cd\u590d\u8bbf\u95ee\u7684\u8349\u573a\u53ea\u7b97\u4e00\u6b21\uff09\u3002\u7531\u4e8e\u5355\u5411\u8def\u5f84\u7684\u9650\u5236\uff0cBessie \u62c5","og_url":"https:\/\/www.wsisp.com\/helps\/51260.html","og_site_name":"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","article_published_time":"2025-08-10T11:49:36+00:00","og_image":[{"url":"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/08\/20250810114934-6898874e70ca5.png"}],"author":"admin","twitter_card":"summary_large_image","twitter_misc":{"\u4f5c\u8005":"admin","\u9884\u8ba1\u9605\u8bfb\u65f6\u95f4":"13 \u5206"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/www.wsisp.com\/helps\/51260.html","url":"https:\/\/www.wsisp.com\/helps\/51260.html","name":"\u3010\u7f29\u70b9 \u62d3\u6251\u5e8f\u3011P3119 [USACO15JAN] Grass Cownoisseur G|\u7701\u9009- \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","isPartOf":{"@id":"https:\/\/www.wsisp.com\/helps\/#website"},"datePublished":"2025-08-10T11:49:36+00:00","dateModified":"2025-08-10T11:49:36+00:00","author":{"@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41"},"breadcrumb":{"@id":"https:\/\/www.wsisp.com\/helps\/51260.html#breadcrumb"},"inLanguage":"zh-Hans","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.wsisp.com\/helps\/51260.html"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.wsisp.com\/helps\/51260.html#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"\u9996\u9875","item":"https:\/\/www.wsisp.com\/helps"},{"@type":"ListItem","position":2,"name":"\u3010\u7f29\u70b9 \u62d3\u6251\u5e8f\u3011P3119 [USACO15JAN] Grass Cownoisseur G|\u7701\u9009-"}]},{"@type":"WebSite","@id":"https:\/\/www.wsisp.com\/helps\/#website","url":"https:\/\/www.wsisp.com\/helps\/","name":"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","description":"\u9999\u6e2f\u670d\u52a1\u5668_\u9999\u6e2f\u4e91\u670d\u52a1\u5668\u8d44\u8baf_\u670d\u52a1\u5668\u5e2e\u52a9\u6587\u6863_\u670d\u52a1\u5668\u6559\u7a0b","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.wsisp.com\/helps\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"zh-Hans"},{"@type":"Person","@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41","name":"admin","image":{"@type":"ImageObject","inLanguage":"zh-Hans","@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/image\/","url":"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery","contentUrl":"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery","caption":"admin"},"sameAs":["http:\/\/wp.wsisp.com"],"url":"https:\/\/www.wsisp.com\/helps\/author\/admin"}]}},"_links":{"self":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts\/51260","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/comments?post=51260"}],"version-history":[{"count":0,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts\/51260\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/media\/51256"}],"wp:attachment":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/media?parent=51260"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/categories?post=51260"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/tags?post=51260"},{"taxonomy":"topic","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/topic?post=51260"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}