{"id":177,"date":"2010-03-21T01:12:00","date_gmt":"2010-03-20T17:12:00","guid":{"rendered":"http:\/\/localhost\/?p=177"},"modified":"2010-03-21T01:12:00","modified_gmt":"2010-03-20T17:12:00","slug":"zjoi2007_the_largest_semi-connected_subgraph","status":"publish","type":"post","link":"https:\/\/www.shuizilong.com\/wjmzbmr\/?p=177","title":{"rendered":"[ZJOI2007]\u6700\u5927\u534a\u8fde\u901a\u5b50\u56fe"},"content":{"rendered":"\n<p>[ZJOI2007]\u6700\u5927\u534a\u8fde\u901a\u5b50\u56fe<\/p>\n<p>Time Limit:30000MS&#160; Memory Limit:165536K<br \/>Total Submit:45 Accepted:14 <br \/>Case Time Limit:3000MS<\/p>\n<p><strong>Description <\/strong><\/p>\n<p> <img decoding=\"async\" src=\"http:\/\/61.187.179.132:8080\/JudgeOnline\/images\/1093\/1.jpg\" \/><\/p>\n<p><strong>Input <\/strong><\/p>\n<p> \u7b2c\u4e00\u884c\u5305\u542b\u4e24\u4e2a\u6574\u6570N\uff0cM\uff0cX\u3002N\uff0cM\u5206\u522b\u8868\u793a\u56feG\u7684\u70b9\u6570\u4e0e\u8fb9\u6570\uff0cX\u7684\u610f\u4e49\u5982\u4e0a\u6587\u6240\u8ff0\u3002\u63a5\u4e0b\u6765M\u884c\uff0c\u6bcf\u884c\u4e24\u4e2a\u6b63\u6574\u6570a, b\uff0c\u8868\u793a\u4e00\u6761\u6709\u5411\u8fb9(a,  b)\u3002\u56fe\u4e2d\u7684\u6bcf\u4e2a\u70b9\u5c06\u7f16\u53f7\u4e3a1,2,3\u2026N\uff0c\u4fdd\u8bc1\u8f93\u5165\u4e2d\u540c\u4e00\u4e2a(a,b)\u4e0d\u4f1a\u51fa\u73b0\u4e24\u6b21\u3002 <\/p>\n<p><strong>Output <\/strong><\/p>\n<p> \u5e94\u5305\u542b\u4e24\u884c\uff0c\u7b2c\u4e00\u884c\u5305\u542b\u4e00\u4e2a\u6574\u6570K\u3002\u7b2c\u4e8c\u884c\u5305\u542b\u6574\u6570C Mod X. <\/p>\n<p><strong>Sample Input <\/strong><\/p>\n<p>6 6 20070603<br \/>1 2<br \/>2 1<br \/>1 3<br \/>2 4<br \/>5 6<br \/>6 4<\/p>\n<p><strong>Sample Output <\/strong><\/p>\n<p>3<br \/>3<\/p>\n<p><strong>Hint <\/strong><\/p>\n<p> \u5bf9\u4e8e20%\u7684\u6570\u636e\uff0c N \u226418\uff1b <br \/>\u5bf9\u4e8e60%\u7684\u6570\u636e\uff0c N \u226410000\uff1b <br \/>\u5bf9\u4e8e100%\u7684\u6570\u636e\uff0c N \u2264100000, M \u22641000000\uff1b <br \/>\u5bf9\u4e8e100%\u7684\u6570\u636e\uff0c X \u226410^8\u3002 <\/p>\n<p><strong>Source <\/strong><\/p>\n<p>\u7206\u6808\u4f60\u4e8c\u5927\u7237\u554a\uff01\uff01<br \/>\u6211\u6655\u3002\u641e\u4e86\u534a\u5929WA\u610f\u601d\u5c31\u662f\u7206\u6808\u554a\u3002\u3002\u8fd9\u4e0b\u6ca1\u529e\u6cd5\u4e86\u3002\u6211\u5f04\u4e86\u6570\u636e\u53d1\u73b0\u6709\u4e00\u4e2a\u70b9\u65e0\u8bba\u600e\u4e48\u641e\u90fd\u7206\u6808\uff0cC++\u53c8\u4e0d\u50cfPascal\u80fd\u8c03\u6808\u7684\uff0c\u96be\u4e0d\u6210\u81ea\u5df1\u5199\u4e00\u4e2a\u6a21\u62df\u7248dfs\u56e7\u56e7\uff0c\u5c31\u8fd9\u6837\u5427\u3002\u4e0d\u53bbA\u8fd9\u9898\u4e86\u3002\u3002<br \/>\u8fd9\u9053\u9898\u5f88\u660e\u663e\u8981\u5f3a\u8054\u901a\u7f29\u70b9\uff0c\u6211\u7528\u7684\u662fTarjan\uff0c\u7136\u540e\u5f88\u660e\u663e\u5c31\u53d8\u6210\u4e86TAG\u4e0a\u7684\u6700\u957f\u8def\u95ee\u9898\uff0c\u53ef\u4ee5DP\u89e3\u51b3\u3002\u3002<br \/>Code\uff08\u7206\u6808\u4e00\u4e2a\u70b9\u3002\u6211\u4e5f\u6ca1\u529e\u6cd5\u56e7\uff09\uff1a<br \/>#include&lt;cstdio&gt;<br \/>#include&lt;iostream&gt;<br \/>#include&lt;algorithm&gt;<br \/>#include&lt;string&gt;<br \/>#include&lt;vector&gt;<br \/>#include&lt;cstring&gt;<br \/>#include&lt;set&gt;<br \/>#include&lt;queue&gt;<br \/>#define rep(i,n) for(int i=0;i&lt;n;i++)<br \/>#define pb push_back<br \/>using namespace std;<br \/>const int inf=~0U&gt;&gt;1,maxn=100000;<br \/>int n,m,mod;<br \/>vector&lt;int&gt; E[maxn];<br \/>typedef vector&lt;int&gt;::iterator it;<br \/>int ord[maxn]={0},low[maxn],stack[maxn],top=0,cnt=0,id[maxn],snt=0;<br \/>bool inStack[maxn]={0};<br \/>void dfs(int x)<br \/>{<br \/>    ord[x]=low[x]=++cnt;<br \/>    stack[top++]=x;inStack[x]=true;<br \/>    for(it i=E[x].begin();i!=E[x].end();++i)<br \/>        if(!ord[*i])<br \/>            dfs(*i),low[x]=min(low[x],low[*i]);<br \/>        else if(inStack[*i])<br \/>            low[x]=min(low[x],ord[*i]);<br \/>    if(low[x]==ord[x])<br \/>    {<br \/>        int u;do{u=stack[&#8211;top];id[u]=snt;inStack[u]=false;}while(u!=x);<br \/>        snt++;<br \/>    }<br \/>}<br \/>struct State<br \/>{<br \/>    int Ans,Num;<br \/>    State():Ans(0),Num(1){}<br \/>    void Renew(const State&amp;o)<br \/>    {<br \/>        if(o.Ans&lt;Ans)return;<br \/>        if(o.Ans&gt;Ans){*this=o;return;}<br \/>        Num+=o.Num;Num%=mod;<br \/>    }<br \/>};<br \/>State Dp[maxn];<br \/>set&lt;int&gt; Edge[maxn];<br \/>typedef set&lt;int&gt;::iterator sit;<br \/>int In[maxn]={0},Num[maxn]={0};<br \/>int main()<br \/>{<br \/>    \/\/freopen(&quot;in&quot;,&quot;r&quot;,stdin);<br \/>    scanf(&quot;%d %d %d&quot;,&amp;n,&amp;m,&amp;mod);int s,t;<br \/>    while(m&#8211;)scanf(&quot;%d %d&quot;,&amp;s,&amp;t),E[s-1].pb(t-1);<br \/>    rep(i,n)if(!ord[i])dfs(i);<br \/>    rep(i,n)<br \/>    {<br \/>        int own=id[i];Num[own]++;<br \/>        for(it e=E[i].begin();e!=E[i].end();++e)<br \/>            if(id[*e]!=own)<br \/>                Edge[own].insert(id[*e]);<br \/>    }<br \/>    rep(i,snt) for(sit e=Edge[i].begin();e!=Edge[i].end();++e) In[*e]++;<br \/>    queue&lt;int&gt; Q;vector&lt;int&gt; S;<br \/>    rep(i,snt) if(!In[i]) Q.push(i);<br \/>    while(Q.size())<br \/>    {<br \/>        int t=Q.front();Q.pop();<br \/>        S.push_back(t);<br \/>        for(sit i=Edge[t].begin();i!=Edge[t].end();++i)<br \/>            if(!&#8211;In[*i]) Q.push(*i);<br \/>    }<br \/>    for(vector&lt;int&gt;::reverse_iterator i=S.rbegin();i!=S.rend();++i)<br \/>    {<br \/>        for(sit e=Edge[*i].begin();e!=Edge[*i].end();++e)<br \/>            Dp[*i].Renew(Dp[*e]);<br \/>        Dp[*i].Ans+=Num[*i];<br \/>    }<br \/>    State Ans;<br \/>    rep(i,snt) Ans.Renew(Dp[i]);<br \/>    cout&lt;&lt;Ans.Ans&lt;&lt;endl;<br \/>    cout&lt;&lt;Ans.Num&lt;&lt;endl;<br \/>}<\/p>\n<p> <\/p>\n","protected":false},"excerpt":{"rendered":"<p>[ZJOI2007]\u6700\u5927\u534a\u8fde\u901a\u5b50\u56fe Time Limit:30000MS&#160; Memory Limit:165536KTotal Submit:45 Accepted:14 Case Time Limit:3000MS Description Input \u7b2c\u4e00\u884c\u5305\u542b\u4e24\u4e2a\u6574\u6570N\uff0cM\uff0cX\u3002N\uff0cM\u5206\u522b\u8868\u793a\u56feG\u7684\u70b9\u6570\u4e0e\u8fb9\u6570\uff0cX\u7684\u610f\u4e49\u5982\u4e0a\u6587\u6240\u8ff0\u3002\u63a5\u4e0b\u6765M\u884c\uff0c\u6bcf\u884c\u4e24\u4e2a\u6b63\u6574\u6570a, b\uff0c\u8868\u793a\u4e00\u6761\u6709\u5411\u8fb9(a, b)\u3002\u56fe\u4e2d\u7684\u6bcf\u4e2a\u70b9\u5c06\u7f16\u53f7\u4e3a1,2,3\u2026N\uff0c\u4fdd\u8bc1\u8f93\u5165\u4e2d\u540c\u4e00\u4e2a(a,b)\u4e0d\u4f1a\u51fa\u73b0\u4e24\u6b21\u3002 Output \u5e94\u5305\u542b\u4e24\u884c\uff0c\u7b2c\u4e00\u884c\u5305\u542b\u4e00\u4e2a\u6574\u6570K\u3002\u7b2c\u4e8c\u884c\u5305\u542b\u6574\u6570C Mod X. Sample Input 6 6 200706031 22 11 32 45 66 4 Sample Output 33 Hint \u5bf9\u4e8e20%\u7684\u6570\u636e\uff0c N \u226418\uff1b \u5bf9\u4e8e60%\u7684\u6570\u636e\uff0c N \u226410000\uff1b \u5bf9\u4e8e100%\u7684\u6570\u636e\uff0c N \u2264100000, M \u22641000000\uff1b \u5bf9\u4e8e100%\u7684\u6570\u636e\uff0c X \u226410^8\u3002 Source \u7206\u6808\u4f60\u4e8c\u5927\u7237\u554a\uff01\uff01\u6211\u6655\u3002\u641e\u4e86\u534a\u5929WA\u610f\u601d\u5c31\u662f\u7206\u6808\u554a\u3002\u3002\u8fd9\u4e0b\u6ca1\u529e\u6cd5\u4e86\u3002\u6211\u5f04\u4e86\u6570\u636e\u53d1\u73b0\u6709\u4e00\u4e2a\u70b9\u65e0\u8bba\u600e\u4e48\u641e\u90fd\u7206\u6808\uff0cC++\u53c8\u4e0d\u50cfPascal\u80fd\u8c03\u6808\u7684\uff0c\u96be\u4e0d\u6210\u81ea\u5df1\u5199\u4e00\u4e2a\u6a21\u62df\u7248dfs\u56e7\u56e7\uff0c\u5c31\u8fd9\u6837\u5427\u3002\u4e0d\u53bbA\u8fd9\u9898\u4e86\u3002\u3002\u8fd9\u9053\u9898\u5f88\u660e\u663e\u8981\u5f3a\u8054\u901a\u7f29\u70b9\uff0c\u6211\u7528\u7684\u662fTarjan\uff0c\u7136\u540e\u5f88\u660e\u663e\u5c31\u53d8\u6210\u4e86TAG\u4e0a\u7684\u6700\u957f\u8def\u95ee\u9898\uff0c\u53ef\u4ee5DP\u89e3\u51b3\u3002\u3002Code\uff08\u7206\u6808\u4e00\u4e2a\u70b9\u3002\u6211\u4e5f\u6ca1\u529e\u6cd5\u56e7\uff09\uff1a#include&lt;cstdio&gt;#include&lt;iostream&gt;#include&lt;algorithm&gt;#include&lt;string&gt;#include&lt;vector&gt;#include&lt;cstring&gt;#include&lt;set&gt;#include&lt;queue&gt;#define rep(i,n) for(int i=0;i&lt;n;i++)#define pb push_backusing [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[10],"tags":[],"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/177"}],"collection":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=177"}],"version-history":[{"count":0,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/177\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=177"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=177"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=177"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}