{"id":37,"date":"2022-06-04T10:52:00","date_gmt":"2022-06-04T02:52:00","guid":{"rendered":"http:\/\/ubuntu.tim-wcx.ltd\/wordpress\/index.php\/2022\/06\/04\/2020-08-07\/"},"modified":"2022-06-04T10:52:00","modified_gmt":"2022-06-04T02:52:00","slug":"2020-08-07","status":"publish","type":"post","link":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/2022\/06\/04\/2020-08-07\/","title":{"rendered":"2020-08-07"},"content":{"rendered":"

\n <\/path>\n <\/svg><\/p>\n

http:\/\/acm.hdu.edu.cn\/showproblem.php?pid=1285<\/a><\/p>\n

<\/a>Problem Description<\/h5>\n

\u6709N\u4e2a\u6bd4\u8d5b\u961f\uff081<=N<=500\uff09\uff0c\u7f16\u53f7\u4f9d\u6b21\u4e3a1\uff0c2\uff0c3\uff0c\u3002\u3002\u3002\u3002\uff0cN\u8fdb\u884c\u6bd4\u8d5b\uff0c\u6bd4\u8d5b\u7ed3\u675f\u540e\uff0c\u88c1\u5224\u59d4\u5458\u4f1a\u8981\u5c06\u6240\u6709\u53c2\u8d5b\u961f\u4f0d\u4ece\u524d\u5f80\u540e\u4f9d\u6b21\u6392\u540d\uff0c\u4f46\u73b0\u5728\u88c1\u5224\u59d4\u5458\u4f1a\u4e0d\u80fd\u76f4\u63a5\u83b7\u5f97\u6bcf\u4e2a\u961f\u7684\u6bd4\u8d5b\u6210\u7ee9\uff0c\u53ea\u77e5\u9053\u6bcf\u573a\u6bd4\u8d5b\u7684\u7ed3\u679c\uff0c\u5373P1\u8d62P2\uff0c\u7528P1\uff0cP2\u8868\u793a\uff0c\u6392\u540d\u65f6P1\u5728P2\u4e4b\u524d\u3002\u73b0\u5728\u8bf7\u4f60\u7f16\u7a0b\u5e8f\u786e\u5b9a\u6392\u540d\u3002<\/p>\n

<\/a>Input<\/h5>\n

\u8f93\u5165\u6709\u82e5\u5e72\u7ec4\uff0c\u6bcf\u7ec4\u4e2d\u7684\u7b2c\u4e00\u884c\u4e3a\u4e8c\u4e2a\u6570N\uff081<=N<=500\uff09\uff0cM\uff1b\u5176\u4e2dN\u8868\u793a\u961f\u4f0d\u7684\u4e2a\u6570\uff0cM\u8868\u793a\u63a5\u7740\u6709M\u884c\u7684\u8f93\u5165\u6570\u636e\u3002\u63a5\u4e0b\u6765\u7684M\u884c\u6570\u636e\u4e2d\uff0c\u6bcf\u884c\u4e5f\u6709\u4e24\u4e2a\u6574\u6570P1\uff0cP2\u8868\u793a\u5373P1\u961f\u8d62\u4e86P2\u961f\u3002<\/p>\n

<\/a>Output<\/h5>\n

\u7ed9\u51fa\u4e00\u4e2a\u7b26\u5408\u8981\u6c42\u7684\u6392\u540d\u3002\u8f93\u51fa\u65f6\u961f\u4f0d\u53f7\u4e4b\u95f4\u6709\u7a7a\u683c\uff0c\u6700\u540e\u4e00\u540d\u540e\u9762\u6ca1\u6709\u7a7a\u683c\u3002<\/p>\n

\u5176\u4ed6\u8bf4\u660e\uff1a\u7b26\u5408\u6761\u4ef6\u7684\u6392\u540d\u53ef\u80fd\u4e0d\u662f\u552f\u4e00\u7684\uff0c\u6b64\u65f6\u8981\u6c42\u8f93\u51fa\u65f6\u7f16\u53f7\u5c0f\u7684\u961f\u4f0d\u5728\u524d\uff1b\u8f93\u5165\u6570\u636e\u4fdd\u8bc1\u662f\u6b63\u786e\u7684\uff0c\u5373\u8f93\u5165\u6570\u636e\u786e\u4fdd\u4e00\u5b9a\u80fd\u6709\u4e00\u4e2a\u7b26\u5408\u8981\u6c42\u7684\u6392\u540d\u3002<\/p>\n

<\/a>Sample Input<\/h5>\n
4 3\n1 2\n2 3\n4 3\n<\/code><\/pre>\n
<\/a>Sample Output<\/h5>\n
1 2 4 3\n<\/code><\/pre>\n
\u62d3\u6251\u6392\u5e8f<\/p>\n
#include<\/span> <\/span><\/span>\n#include<\/span> <\/span><\/span>\nusing<\/span> namespace<\/span> std;<\/span>\nvector<<\/span>int<\/span>><\/span>g[<\/span>600<\/span>]<\/span>;<\/span>\nint<\/span> in[<\/span>600<\/span>]<\/span>=<\/span> {<\/span>0<\/span>}<\/span>;<\/span>\npriority_queue<<\/span>int<\/span>,<\/span>vector<<\/span>int<\/span>><\/span>,<\/span>greater<<\/span>int<\/span>><\/span> ><\/span>que;<\/span>\nqueue<<\/span>int<\/span>><\/span>k;<\/span>\nint<\/span> n,<\/span>m,<\/span>x,<\/span>y;<\/span>\nint<\/span> toposort<\/span>(<\/span>)<\/span>\n{<\/span>\n    for<\/span>(<\/span>int<\/span> i=<\/span>1<\/span>;<\/span> i<=<\/span>n;<\/span> i++<\/span>)<\/span>\n    {<\/span>\n        if<\/span>(<\/span>!<\/span>in[<\/span>i]<\/span>)<\/span>\n            que.<\/span>push<\/span>(<\/span>i)<\/span>;<\/span>\n    }<\/span>\n    while<\/span>(<\/span>!<\/span>que.<\/span>empty<\/span>(<\/span>)<\/span>)<\/span>\n    {<\/span>\n        int<\/span> now=<\/span>que.<\/span>top<\/span>(<\/span>)<\/span>;<\/span>\n        que.<\/span>pop<\/span>(<\/span>)<\/span>;<\/span>\n        k.<\/span>push<\/span>(<\/span>now)<\/span>;<\/span>\n        for<\/span>(<\/span>int<\/span> i=<\/span>0<\/span>;<\/span> i<<\/span>g[<\/span>now]<\/span>.<\/span>size<\/span>(<\/span>)<\/span>;<\/span> i++<\/span>)<\/span>\n        {<\/span>\n            int<\/span> t=<\/span>g[<\/span>now]<\/span>[<\/span>i]<\/span>;<\/span>\n            in[<\/span>t]<\/span>--<\/span>;<\/span>\n            if<\/span>(<\/span>!<\/span>in[<\/span>t]<\/span>)<\/span>\n                que.<\/span>push<\/span>(<\/span>t)<\/span>;<\/span>\n        }<\/span>\n    }<\/span>\n}<\/span>\nint<\/span> main<\/span>(<\/span>)<\/span>\n{<\/span>\n    while<\/span>(<\/span>scanf<\/span>(<\/span>\"%d%d\"<\/span>,<\/span>&<\/span>n,<\/span>&<\/span>m)<\/span>!=<\/span>EOF<\/span>)<\/span>\n    {<\/span>\n        for<\/span>(<\/span>int<\/span> i=<\/span>1<\/span>;<\/span>i<=<\/span>n;<\/span>i++<\/span>)<\/span>\n            g[<\/span>i]<\/span>.<\/span>clear<\/span>(<\/span>)<\/span>,<\/span>in[<\/span>i]<\/span>=<\/span>0<\/span>;<\/span>\n        for<\/span>(<\/span>int<\/span> i=<\/span>1<\/span>;<\/span> i<=<\/span>m;<\/span> i++<\/span>)<\/span>\n        {<\/span>\n            scanf<\/span>(<\/span>\"%d%d\"<\/span>,<\/span>&<\/span>x,<\/span>&<\/span>y)<\/span>;<\/span>\n            g[<\/span>x]<\/span>.<\/span>push_back<\/span>(<\/span>y)<\/span>;<\/span>\n            in[<\/span>y]<\/span>++<\/span>;<\/span>\n        }<\/span>\n        toposort<\/span>(<\/span>)<\/span>;<\/span>\n        int<\/span> flag=<\/span>0<\/span>;<\/span>\n        while<\/span>(<\/span>!<\/span>k.<\/span>empty<\/span>(<\/span>)<\/span>)<\/span>\n        {<\/span>\n            if<\/span>(<\/span>!<\/span>flag)<\/span>\n            {<\/span>\n                printf<\/span>(<\/span>\"%d\"<\/span>,<\/span>k.<\/span>front<\/span>(<\/span>)<\/span>)<\/span>;<\/span>\n                flag=<\/span>1<\/span>;<\/span>\n            }<\/span>\n            else<\/span>\n            {<\/span>\n                printf<\/span>(<\/span>\" %d\"<\/span>,<\/span>k.<\/span>front<\/span>(<\/span>)<\/span>)<\/span>;<\/span>\n            }<\/span>\n            k.<\/span>pop<\/span>(<\/span>)<\/span>;<\/span>\n        }<\/span>\n        printf<\/span>(<\/span>\"n\"<\/span>)<\/span>;<\/span>\n    }<\/span>\n    return<\/span> 0<\/span>;<\/span>\n}<\/span>\n<\/code><\/pre>\n
<\/a>\u9898\u76ee\u63cf\u8ff0<\/h5>\n
\u6709\u4e00\u4e2an\u00d7n\u5927\u5c0f\u7684\u65b9\u5f62\u5e73\u9762\uff0c\u4e0a\u9762\u6709n\u00d7n\u4e2a\u70b9\uff0c\u6bcf\u4e2a\u70b9(i,j)\u7684\u503cwij\u662f\u7ed9\u5b9a\u7684\u3002<\/p>\n
\u5bf9\u4e8e\u70b9(i,j)\uff0c\u6211\u4eec\u79f0\u4e0e\u5176\u6a2a\u7eb5\u4e0b\u6807\u4e4b\u5dee\u7684\u7edd\u5bf9\u503c\u90fd\u4e0d\u8d85\u8fc71\u7684\u70b9\u4e3a\u4e0e\u5176\u76f8\u90bb\u7684\u70b9\u3002<\/p>\n
\u6211\u4eec\u5b9a\u4e49\u4e00\u4e2a\u70b9\u7684\u96c6\u5408S\u4e3a\u6781\u5927\u70b9\u7fa4\uff08\u6781\u5c0f\u70b9\u7fa4\uff09\u5f53\u4e14\u4ec5\u5f53\uff1a
 1.S\u4e2d\u6240\u6709\u70b9\u7684\u503c\u76f8\u540c\u3002
 2.S\u4e2d\u6240\u6709\u70b9\u90fd\u76f4\u63a5\u6216\u95f4\u63a5\u76f8\u90bb\u3002
 3.\u5bf9\u4e8e\u4efb\u610f\u76f8\u90bb\u4e24\u70b9s1,s2\uff0c\u6ee1\u8db3s1\u5c5e\u4e8eS\u4e14s2\u4e0d\u5c5e\u4e8eS\uff0c\u90fd\u6709s1\u7684\u503c>s2\u7684\u503c\uff08\u6781\u5927\u70b9\u7fa4\uff09\uff0c\u6216\u8005s1\u7684\u503c \u5bf9\u4e8e\u7ed9\u5b9a\u7684\u5e73\u9762\uff0c\u4f60\u8981\u6c42\u51fa\u6781\u5927\u70b9\u7fa4\u548c\u6781\u5c0f\u70b9\u7fa4\u7684\u6570\u91cf\u3002\u7279\u522b\u7684\uff0c\u5982\u679c\u6240\u6709\u70b9\u7684\u503c\u90fd\u76f8\u540c\uff0c\u90a3\u4e48\u6574\u4e2a\u5e73\u9762\u5c31\u65e2\u662f\u6781\u5927\u70b9\u7fa4\uff0c\u53c8\u662f\u6781\u5c0f\u70b9\u7fa4\u3002<\/p>\n
\u7531\u4e8e\u5de8\u795e ctt \u6b63\u5728\u548c\u5de8\u795e lzh \u4e92\u76f8\u540a\u6253\u6765\u540a\u6253\u53bb\uff0c\u4e8e\u662f\u53ea\u597d\u628a\u8fd9\u4e2a\u4efb\u52a1\u4ea4\u7ed9\u4e86\u4f60\u3002<\/p>\n
<\/a>\u8f93\u5165<\/h5>\n
\u7b2c\u4e00\u884c\u4e00\u4e2a\u6b63\u6574\u6570n\uff0c\u8868\u793a\u5730\u56fe\u7684\u5927\u5c0f\u3002<\/p>\n
\u63a5\u4e0b\u6765\u4e00\u4e2an\u00d7n\u7684\u77e9\u9635\uff0c\u8868\u793a\u5e73\u9762\u4e0a\u6bcf\u4e2a\u70b9\u7684\u503c\u3002<\/p>\n
<\/a>\u8f93\u51fa<\/h5>\n
\u5305\u542b\u4e24\u4e2a\u6570\uff0c\u5206\u522b\u8868\u793a\u6781\u5927\u70b9\u7fa4\u548c\u6781\u5c0f\u70b9\u7fa4\u7684\u6570\u91cf\u3002<\/p>\n
<\/a>\u6837\u4f8b\u8f93\u5165<\/h5>\n
\u3010\u6837\u4f8b1\u3011
 5
 2 2 2 1 1
 1 1 2 2 1
 1 1 1 1 1
 1 2 2 1 2
 1 2 2 2 2
 \u3010\u6837\u4f8b2\u3011
 5
 4 6 7 3 1
 4 4 6 5 5
 5 5 5 2 7
 4 6 2 4 7
 6 1 0 1 6<\/p>\n
<\/a>\u6837\u4f8b\u8f93\u51fa<\/h5>\n
\u3010\u6837\u4f8b1\u3011
 2 1
 \u3010\u6837\u4f8b2\u3011
 3 3<\/p>\n
<\/a>\u63d0\u793a<\/h5>\n
\u6837\u4f8b1\u89e3\u91ca\uff1a
 \u5982\u4e0b\u56fe\u6240\u793a\uff0c\u6807\u84dd\u7684\u4e3a\u6781\u5927\u70b9\u7fa4\uff0c\u6807\u6a59\u7684\u4e3a\u6781\u5c0f\u70b9\u7fa4\u3002
 \"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"
 \u6837\u4f8b2\u89e3\u91ca\uff1a
 \u5982\u4e0b\u56fe\u6240\u793a\uff0c\u6807\u84dd\u7684\u4e3a\u6781\u5927\u70b9\u7fa4\uff0c\u6807\u6a59\u7684\u4e3a\u6781\u5c0f\u70b9\u7fa4\u3002
 \"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"
 \"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"
 DFS+\u6807\u8bb0\u3002<\/p>\n
#pragma<\/span> GCC optimize(1)<\/span>\n#pragma<\/span> GCC optimize(2)<\/span>\n#pragma<\/span> GCC optimize(3,\"Ofast\",\"inline\")<\/span>\n#include<\/span> <\/span><\/span>\nusing<\/span> namespace<\/span> std;<\/span>\ntypedef<\/span> unsigned<\/span> long<\/span> long<\/span> ull;<\/span>\ntypedef<\/span> long<\/span> long<\/span> ll;<\/span>\nll a[<\/span>2000<\/span>]<\/span>[<\/span>2000<\/span>]<\/span>=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>\nll dx[<\/span>]<\/span>=<\/span>{<\/span>0<\/span>,<\/span>1<\/span>,<\/span>1<\/span>,<\/span>1<\/span>,<\/span>0<\/span>,<\/span>0<\/span>,<\/span>-<\/span>1<\/span>,<\/span>-<\/span>1<\/span>,<\/span>-<\/span>1<\/span>}<\/span>;<\/span>\nll dy[<\/span>]<\/span>=<\/span>{<\/span>0<\/span>,<\/span>1<\/span>,<\/span>0<\/span>,<\/span>-<\/span>1<\/span>,<\/span>1<\/span>,<\/span>-<\/span>1<\/span>,<\/span>1<\/span>,<\/span>0<\/span>,<\/span>-<\/span>1<\/span>}<\/span>;<\/span>\nll vis[<\/span>2000<\/span>]<\/span>[<\/span>2000<\/span>]<\/span>=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>\nll vis1[<\/span>2000<\/span>]<\/span>[<\/span>2000<\/span>]<\/span>=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>\nll n;<\/span>\nll sum=<\/span>1<\/span>;<\/span>\nll dfs<\/span>(<\/span>ll x,<\/span>ll y)<\/span>\n{<\/span>\n    vis1[<\/span>x]<\/span>[<\/span>y]<\/span>=<\/span>vis[<\/span>x]<\/span>[<\/span>y]<\/span>;<\/span>\n    for<\/span>(<\/span>ll i=<\/span>1<\/span>;<\/span>i<=<\/span>8<\/span>;<\/span>i++<\/span>)<\/span>\n    {<\/span>\n        ll x1=<\/span>x+<\/span>dx[<\/span>i]<\/span>;<\/span>\n        ll y1=<\/span>y+<\/span>dy[<\/span>i]<\/span>;<\/span>\n        if<\/span>(<\/span>x1<=<\/span>0<\/span>||<\/span>x1><\/span>n||<\/span>y1<=<\/span>0<\/span>||<\/span>y1><\/span>n)<\/span>\n            continue<\/span>;<\/span>\n        if<\/span>(<\/span>a[<\/span>x1]<\/span>[<\/span>y1]<\/span>==<\/span>a[<\/span>x]<\/span>[<\/span>y]<\/span>&&<\/span>vis[<\/span>x]<\/span>[<\/span>y]<\/span>!=<\/span>vis[<\/span>x1]<\/span>[<\/span>y1]<\/span>)<\/span>\n            return<\/span> -<\/span>1<\/span>;<\/span>\n        if<\/span>(<\/span>a[<\/span>x1]<\/span>[<\/span>y1]<\/span>==<\/span>a[<\/span>x]<\/span>[<\/span>y]<\/span>&&<\/span>vis[<\/span>x]<\/span>[<\/span>y]<\/span>==<\/span>vis[<\/span>x1]<\/span>[<\/span>y1]<\/span>&&<\/span>!<\/span>vis1[<\/span>x1]<\/span>[<\/span>y1]<\/span>)<\/span>\n        {<\/span>\n            if<\/span>(<\/span>dfs<\/span>(<\/span>x1,<\/span>y1)<\/span>==<\/span>-<\/span>1<\/span>)<\/span>\n                return<\/span> -<\/span>1<\/span>;<\/span>\n        }<\/span>\n    }<\/span>\n}<\/span>\nint<\/span> main<\/span>(<\/span>)<\/span>\n{<\/span>\n    ll l;<\/span>\n    int<\/span> flagh=<\/span>0<\/span>;<\/span>\n    scanf<\/span>(<\/span>\"%lld\"<\/span>,<\/span>&<\/span>n)<\/span>;<\/span>\n    for<\/span>(<\/span>ll i=<\/span>1<\/span>;<\/span>i<=<\/span>n;<\/span>i++<\/span>)<\/span>\n    {<\/span>\n        for<\/span>(<\/span>ll j=<\/span>1<\/span>;<\/span>j<=<\/span>n;<\/span>j++<\/span>)<\/span>\n        {<\/span>\n            scanf<\/span>(<\/span>\"%lld\"<\/span>,<\/span>&<\/span>a[<\/span>i]<\/span>[<\/span>j]<\/span>)<\/span>;<\/span>\n            if<\/span>(<\/span>i==<\/span>1<\/span>&&<\/span>j==<\/span>1<\/span>)<\/span>\n            {<\/span>\n                l=<\/span>a[<\/span>i]<\/span>[<\/span>j]<\/span>;<\/span>\n            }<\/span>\n            else<\/span>\n            {<\/span>\n                if<\/span>(<\/span>l!=<\/span>a[<\/span>i]<\/span>[<\/span>j]<\/span>)<\/span>\n                    flagh=<\/span>1<\/span>;<\/span>\n            }<\/span>\n        }<\/span>\n    }<\/span>\n    if<\/span>(<\/span>!<\/span>flagh)<\/span>\n    {<\/span>\n        cout<<<\/span>1<\/span><<<\/span>' '<\/span><<<\/span>1<\/span><<<\/span>endl;<\/span>\n        return<\/span> 0<\/span>;<\/span>\n    }<\/span>\n    for<\/span>(<\/span>ll i=<\/span>1<\/span>;<\/span>i<=<\/span>n;<\/span>i++<\/span>)<\/span>\n    {<\/span>\n        for<\/span>(<\/span>ll j=<\/span>1<\/span>;<\/span>j<=<\/span>n;<\/span>j++<\/span>)<\/span>\n        {<\/span>\n            ll flag1=<\/span>1<\/span>;<\/span>\n            ll flag2=<\/span>1<\/span>;<\/span>\n            for<\/span>(<\/span>ll k=<\/span>1<\/span>;<\/span>k<=<\/span>8<\/span>;<\/span>k++<\/span>)<\/span>\n            {<\/span>\n                ll x=<\/span>i+<\/span>dx[<\/span>k]<\/span>;<\/span>\n                ll y=<\/span>j+<\/span>dy[<\/span>k]<\/span>;<\/span>\n                if<\/span>(<\/span>x><\/span>n||<\/span>x<=<\/span>0<\/span>||<\/span>y><\/span>n||<\/span>y<=<\/span>0<\/span>)<\/span>\n                    continue<\/span>;<\/span>\n                if<\/span>(<\/span>a[<\/span>x]<\/span>[<\/span>y]<\/span>><\/span>a[<\/span>i]<\/span>[<\/span>j]<\/span>)<\/span>\n                {<\/span>\n                    flag1=<\/span>0<\/span>;<\/span>\n                }<\/span>\n                if<\/span>(<\/span>a[<\/span>x]<\/span>[<\/span>y]<\/span><<\/span>a[<\/span>i]<\/span>[<\/span>j]<\/span>)<\/span>\n                {<\/span>\n                    flag2=<\/span>0<\/span>;<\/span>\n                }<\/span>\n            }<\/span>\n            if<\/span>(<\/span>flag1)<\/span>\n            {<\/span>\n                vis[<\/span>i]<\/span>[<\/span>j]<\/span>=<\/span>1<\/span>;<\/span>\n            }<\/span>\n            if<\/span>(<\/span>flag2)<\/span>\n            {<\/span>\n                vis[<\/span>i]<\/span>[<\/span>j]<\/span>=<\/span>2<\/span>;<\/span>\n            }<\/span>\n        }<\/span>\n    }<\/span>\n    ll sum1=<\/span>0<\/span>,<\/span>sum2=<\/span>0<\/span>;<\/span>\n    for<\/span>(<\/span>ll i=<\/span>1<\/span>;<\/span>i<=<\/span>n;<\/span>i++<\/span>)<\/span>\n    {<\/span>\n        for<\/span>(<\/span>ll j=<\/span>1<\/span>;<\/span>j<=<\/span>n;<\/span>j++<\/span>)<\/span>\n        {<\/span>\n            if<\/span>(<\/span>vis[<\/span>i]<\/span>[<\/span>j]<\/span>!=<\/span>0<\/span>&&<\/span>!<\/span>vis1[<\/span>i]<\/span>[<\/span>j]<\/span>)<\/span>\n            {<\/span>\n                if<\/span>(<\/span>dfs<\/span>(<\/span>i,<\/span>j)<\/span>==<\/span>-<\/span>1<\/span>)<\/span>\n                    continue<\/span>;<\/span>\n                if<\/span>(<\/span>vis[<\/span>i]<\/span>[<\/span>j]<\/span>==<\/span>1<\/span>)<\/span>\n                    sum1++<\/span>;<\/span>\n                else<\/span>\n                    sum2++<\/span>;<\/span>\n            }<\/span>\n        }<\/span>\n    }<\/span>\n    cout<<<\/span>sum1<<<\/span>' '<\/span><<<\/span>sum2<<<\/span>endl;<\/span>\n    return<\/span> 0<\/span>;<\/span>\n}<\/span>\n<\/code><\/pre>\n
<\/a>\u9898\u76ee\u63cf\u8ff0<\/h5>\n
\u897f\u2f50\u62c9\u5148\u77e5\u7cfb\u7edf\u662f\u2f00\u4e2a\u5f3a\u2f24\u7684\u2f3c\u7075\u6307\u6570\u76d1\u6d4b\u2f79\u7d61\uff0c\u80fd\u4ee5\u58f0\u50cf\u626b\u63cf\u4e3b\u52a8\u76d1\u63a7\u5e02\u2ea0\u7684\u2f3c\u667a\u4e0e\u7cbe\u795e\u72b6\u6001\u3002\u4e3a\u4e86\u5224\u5b9a\u51fa\u66f4\u590d\u6742\u7684\u2f08\u7c7b\u2f3c\u7406\u53c2\u6570\uff0c\u897f\u2f50\u62c9\u7cfb\u7edf\u7eb3\u2f0a\u4e86\u4e0d\u540c\u4e8e\u65e2\u5b58\u2f08\u7c7b\u89c4\u8303\u7684\u8d85\u7fa4\u2f08\u683c\u2500\u2500\u4e0d\u4f1a\u968f\u610f\u548c\u4ed6\u2f08\u4ea7\u2f63\u5171\u9e23\uff0c\u4e5f\u4e0d\u4f1a\u611f\u60c5\u2f64\u4e8b\uff0c\u80fd\u4ee5\u2fae\u2f08\u7c7b\u7684\u773c\u5149\u6765\u4fef\u77b0\u5e76\u88c1\u5b9a\u2f08\u7c7b\u3002
 \u88ab\u7eb3\u2f0a\u7684\u8d85\u7fa4\u2f08\u683c\u4f1a\u76f8\u4e92\u5f71\u54cd\uff0c\u5171\u540c\u5904\u7406\u6570\u636e\u3002\u4ed6\u4eec\u4e4b\u95f4\u5177\u4f53\u7684\u5f71\u54cd\u2f45\u5f0f\u5f62\u5982\u2f00\u5f20\u2f46\u5411\u56fe\uff0c\u5982\u679c\u4f60\u5bf9\u2f00\u4e2a\u8282\u70b9\u8fdb\u2f8f\u64cd\u4f5c\uff0c\u548c\u8fd9\u4e2a\u8282\u70b9\u76f8\u90bb\u7684\u8282\u70b9\u4e5f\u4f1a\u53d7\u5230\u76f8\u540c\u7684\u5f71\u54cd\u3002
 \u64cd\u4f5c\u6709\u2f00\u79cd\uff1a\u4f7f\u2f00\u4e2a\u8282\u70b9\u7684\u6743\u503c\u52a0\u4e0a\u3002
 \u540c\u65f6\u4f60\u8fd8\u5e0c\u671b\u8be2\u95ee\u2f00\u4e2a\u8282\u70b9\u7684\u6743\u503c(\u6bcf\u2f00\u4e2a\u8282\u70b9\u7684\u521d\u59cb\u6743\u503c\u4e3a0)\u3002<\/p>\n
<\/a>\u8f93\u5165<\/h5>\n
\u7b2c\u2f00\u2f8f\u8bfb\u2f0an,m,Q,\u8868\u2f70\u8282\u70b9\u4e2a\u6570\u548c\u8fb9\u6570,\u4ee5\u53ca\u64cd\u4f5c\u548c\u8be2\u95ee\u7684\u603b\u6570\u3002
 \u63a5\u4e0b\u6765m\u2f8f\uff0c\u6bcf\u2f8f\u4e24\u4e2a\u6570ui,vi\u8868\u2f70ui,vi\u4e4b\u95f4\u6709\u8fde\u8fb9\u3002
 \u63a5\u4e0b\u6765Q\uff0c\u6bcf\u2f8f\u5148\u8bfb\u2f0a\u2f00\u4e2atype
 type=0\u8868\u2f70\u2f00\u4e2a\u8be2\u95ee\uff0c\u8bfb\u2f0a\u2f00\u4e2ax,\u8868\u2f70\u8be2\u95eex\u8282\u70b9\u7684\u6743\u503c\u3002
 type=1\u8868\u2f70\u2f00\u4e2a\u64cd\u4f5c\uff0c\u8bfb\u2f0ax,y,\u8868\u2f70\u5c06x\u8282\u70b9\u7684\u6743\u503c\u52a0\u4e0ay\u3002\uff08\u4e0ex\u76f8\u90bb\u7684\u8282\u70b9\u6743\u503c\u4e5f\u8981\u52a0\u4e0ay\uff09<\/p>\n
<\/a>\u8f93\u51fa<\/h5>\n
\u5bf9\u4e8e\u6bcf\u2f00\u4e2a\u8be2\u95ee\u8f93\u51fa\u2f00\u2f8f\uff0c\u8868\u2f70\u8be5\u8282\u70b9\u7684\u6743\u503c\u3002<\/p>\n
<\/a>\u6837\u4f8b\u8f93\u5165<\/h5>\n
4 4 4\n1 2\n1 3\n1 4\n2 3\n1 1 1\n0 2\n1 3 3\n0 2\n<\/code><\/pre>\n
<\/a>\u6837\u4f8b\u8f93\u51fa<\/h5>\n
1\n4\n<\/code><\/pre>\n
<\/a>\u63d0\u793a<\/h5>\n
n,m,Q\u22643\u00d7105\uff0cy\u22641000<\/p>\n
\u5206\u5757\u6cd5<\/p>\n
#include<\/span> <\/span><\/span>\nusing<\/span> namespace<\/span> std;<\/span>\ntypedef<\/span> long<\/span> long<\/span> ll;<\/span>\nvector<<\/span>ll><\/span>v[<\/span>1000500<\/span>]<\/span>;<\/span>\nvector<<\/span>ll><\/span>g[<\/span>1000500<\/span>]<\/span>;<\/span>\nvector<<\/span>ll><\/span>b[<\/span>1000500<\/span>]<\/span>;<\/span>\nll c[<\/span>1000500<\/span>]<\/span>=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>\nint<\/span> main<\/span>(<\/span>)<\/span>\n{<\/span>\n    register<\/span> ll n,<\/span>m,<\/span>q,<\/span>x,<\/span>y;<\/span>\n    scanf<\/span>(<\/span>\"%lld%lld%lld\"<\/span>,<\/span>&<\/span>n,<\/span>&<\/span>m,<\/span>&<\/span>q)<\/span>;<\/span>\n    register<\/span> ll k=<\/span>sqrt<\/span>(<\/span>m)<\/span>;<\/span>\n    for<\/span>(<\/span>register<\/span> ll i=<\/span>1<\/span>;<\/span>i<=<\/span>m;<\/span>i++<\/span>)<\/span>\n    {<\/span>\n        scanf<\/span>(<\/span>\"%lld%lld\"<\/span>,<\/span>&<\/span>x,<\/span>&<\/span>y)<\/span>;<\/span>\n        v[<\/span>x]<\/span>.<\/span>push_back<\/span>(<\/span>y)<\/span>;<\/span>\n        v[<\/span>y]<\/span>.<\/span>push_back<\/span>(<\/span>x)<\/span>;<\/span>\n    }<\/span>\n    register<\/span> ll s=<\/span>n+<\/span>1<\/span>;<\/span>\n    for<\/span>(<\/span>register<\/span> ll i=<\/span>1<\/span>;<\/span>i<=<\/span>n;<\/span>i++<\/span>)<\/span>\n    {<\/span>\n        if<\/span>(<\/span>v[<\/span>i]<\/span>.<\/span>size<\/span>(<\/span>)<\/span>>=<\/span>k)<\/span>\n        {<\/span>\n            register<\/span> ll t=<\/span>0<\/span>;<\/span>\n            for<\/span>(<\/span>ll j=<\/span>0<\/span>;<\/span>j<<\/span>v[<\/span>i]<\/span>.<\/span>size<\/span>(<\/span>)<\/span>;<\/span>j++<\/span>)<\/span>\n            {<\/span>\n                t++<\/span>;<\/span>\n                b[<\/span>v[<\/span>i]<\/span>[<\/span>j]<\/span>]<\/span>.<\/span>push_back<\/span>(<\/span>s)<\/span>;<\/span>\n                if<\/span>(<\/span>t%<\/span>k==<\/span>0<\/span>)<\/span>\n                {<\/span>\n                    g[<\/span>i]<\/span>.<\/span>push_back<\/span>(<\/span>s)<\/span>;<\/span>\n                    s++<\/span>;<\/span>\n                    t=<\/span>0<\/span>;<\/span>\n                }<\/span>\n            }<\/span>\n            if<\/span>(<\/span>t%<\/span>k)<\/span>\n            {<\/span>\n                g[<\/span>i]<\/span>.<\/span>push_back<\/span>(<\/span>s)<\/span>;<\/span>\n                s++<\/span>;<\/span>\n            }<\/span>\n        }<\/span>\n    }<\/span>\n    register<\/span> ll status;<\/span>\n    for<\/span>(<\/span>register<\/span> ll i=<\/span>1<\/span>;<\/span>i<=<\/span>q;<\/span>i++<\/span>)<\/span>\n    {<\/span>\n        scanf<\/span>(<\/span>\"%lld\"<\/span>,<\/span>&<\/span>status)<\/span>;<\/span>\n        if<\/span>(<\/span>status==<\/span>0<\/span>)<\/span>\n        {<\/span>\n            scanf<\/span>(<\/span>\"%lld\"<\/span>,<\/span>&<\/span>x)<\/span>;<\/span>\n            ll t=<\/span>c[<\/span>x]<\/span>;<\/span>\n            for<\/span>(<\/span>register<\/span> ll j=<\/span>0<\/span>;<\/span>j<<\/span>b[<\/span>x]<\/span>.<\/span>size<\/span>(<\/span>)<\/span>;<\/span>j++<\/span>)<\/span>\n            {<\/span>\n                t+<\/span>=<\/span>c[<\/span>b[<\/span>x]<\/span>[<\/span>j]<\/span>]<\/span>;<\/span>\n            }<\/span>\n            printf<\/span>(<\/span>\"%lldn\"<\/span>,<\/span>t)<\/span>;<\/span>\n        }<\/span>\n        else<\/span>\n        {<\/span>\n            scanf<\/span>(<\/span>\"%lld%lld\"<\/span>,<\/span>&<\/span>x,<\/span>&<\/span>y)<\/span>;<\/span>\n            c[<\/span>x]<\/span>+<\/span>=<\/span>y;<\/span>\n            if<\/span>(<\/span>v[<\/span>x]<\/span>.<\/span>size<\/span>(<\/span>)<\/span>>=<\/span>k)<\/span>\n            {<\/span>\n                for<\/span>(<\/span>register<\/span> ll j=<\/span>0<\/span>;<\/span>j<<\/span>g[<\/span>x]<\/span>.<\/span>size<\/span>(<\/span>)<\/span>;<\/span>j++<\/span>)<\/span>\n                {<\/span>\n                    c[<\/span>g[<\/span>x]<\/span>[<\/span>j]<\/span>]<\/span>+<\/span>=<\/span>y;<\/span>\n                }<\/span>\n            }<\/span>\n            else<\/span>\n            {<\/span>\n                for<\/span>(<\/span>register<\/span> ll j=<\/span>0<\/span>;<\/span>j<<\/span>v[<\/span>x]<\/span>.<\/span>size<\/span>(<\/span>)<\/span>;<\/span>j++<\/span>)<\/span>\n                {<\/span>\n                    c[<\/span>v[<\/span>x]<\/span>[<\/span>j]<\/span>]<\/span>+<\/span>=<\/span>y;<\/span>\n                }<\/span>\n            }<\/span>\n        }<\/span>\n    }<\/span>\n    return<\/span> 0<\/span>;<\/span>\n}<\/span>\n\n<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
http:\/\/acm.hdu.edu.cn\/sho…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-37","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/posts\/37","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/comments?post=37"}],"version-history":[{"count":0,"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/posts\/37\/revisions"}],"wp:attachment":[{"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/media?parent=37"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/categories?post=37"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/tags?post=37"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
http:\/\/icpc.upc.edu.cn\/problem.php?cid=2537&pid=1<\/a><\/p>\n
http:\/\/icpc.upc.edu.cn\/problem.php?cid=2537&pid=5<\/a><\/p>\n