Summer Holiday (the Smallest point of strong unicom Penetration)

<span id="Label3"></p>Summer Holiday<p><p><span><strong><span style="font-family: Arial; font-size: 12px; font-weight: bold; color: green;">Time limit:10000/1000 MS (java/others) Memory limit:32768/32768 K (java/others)<br>Total submission (s): 2319 Accepted submission (s): 1082<br></span></strong></span><br><br></p></p>Problem Descriptionto see a world in a Grain of Sand<br>And a Heaven in a Wild Flower,<br>Hold Infinity in the palm of your hand<br>And Eternity in an Hour.<br>--william Blake<br><br>I heard that LCY to help everyone booked a new Malaysian Thai 7th tour, Wiskey is really happy night can not sleep ah, he thought to be quick to tell everyone, although he has all the contact information, but a link in the past is too time and telephone costs. He knows that others have other contacts, so that he can notify others and let others help inform Others. Can you help wiskey figure out at least how many people to tell, at least how much will it cost to get everyone notified?<p><p></p></p>Input multiple set of test arrays, ending with Eof.<br>The first line is two integers N and M (1<=n<=1000, 1<=m<=2000), representing the number of people and the contact LOGARITHM.<br>The next line has n integers, indicating the phone charges for Wiskey contact person I.<br>Then there are M lines, each line has two integer x, y, which means X can contact y, but does not mean Y can also contact X.<p><p></p></p>The output outputs the minimum number of contacts and the minimum cost.<br>Each case outputs an answer LINE.<p><p></p></p>Sample Input12 162 2 2 2 2 2 2 2 2 2 2 2 1 33 22 13 42 43 55 44 66 47 47 127 88 78 910 911 10<p><p></p></p>Sample OUTPUT3 6: Each of the strong Unicom components can access to each member of the Unicom diagram, but also access the next strong Unicom component, so add an entry, another array to find the minimum value of the strong Unicom component; code:<pre><span style="color: #008080;"><span style="color: #008080;">1</span></span>#include <iostream><span style="color: #008080;"><span style="color: #008080;">2</span></span>#include <cstdio><span style="color: #008080;"><span style="color: #008080;">3</span></span>#include <cstring><span style="color: #008080;"><span style="color: #008080;">4</span></span>#include <algorithm><span style="color: #008080;"><span style="color: #008080;">5</span></span>#include <queue><span style="color: #008080;"><span style="color: #008080;">6</span></span>#include <stack><span style="color: #008080;"><span style="color: #008080;">7</span></span>#include <vector><span style="color: #008080;"><span style="color: #008080;">8</span></span> <span style="color: #0000ff;"><span style="color: #0000ff;">using</span></span> <span style="color: #0000ff;"><span style="color: #0000ff;">namespace</span></span><span style="color: #000000;"><span style="color: #000000;">std;</span></span><span style="color: #008080;"><span style="color: #008080;">9</span></span> <span style="color: #0000ff;"><span style="color: #0000ff;">Const</span></span> <span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>inf=<span style="color: #800080;"><span style="color: #800080;">0x3f3f3f3f</span></span><span style="color: #000000;"><span style="color: #000000;">;</span></span><span style="color: #008080;"><span style="color: #008080;">Ten</span></span> <span style="color: #008000;"><span style="color: #008000;">//</span></span><span style="color: #008000;"><span style="color: #008000;">#define LOCAL</span></span><span style="color: #008080;"><span style="color: #008080;"></span> one</span> <span style="color: #0000ff;"><span style="color: #0000ff;">#define</span></span>Mem (x, y) memset (x,y,sizeof (x))<span style="color: #008080;"><span style="color: #008080;"></span> a</span> <span style="color: #0000ff;"><span style="color: #0000ff;">Const</span></span> <span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>maxn=<span style="color: #800080;"><span style="color: #800080;">1010</span></span><span style="color: #000000;"><span style="color: #000000;">;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span><span style="color: #000000;"><span style="color: #000000;">dfs_block,css;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>dfn[maxn],low[maxn],instack[maxn],pre[maxn],minicost[maxn],<span style="color: #0000ff;"><span style="color: #0000ff;">inch</span></span><span style="color: #000000;"><span style="color: #000000;">[maxn];</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span>vector<<span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>><span style="color: #000000;"><span style="color: #000000;">vec[maxn];</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span><span style="color: #000000;"><span style="color: #000000;">cost[maxn];</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span>stack<<span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>><span style="color: #000000;"><span style="color: #000000;">S;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;">void</span></span><span style="color: #000000;"><span style="color: #000000;">initial () {</span></span><span style="color: #008080;"><span style="color: #008080;"></span> +</span>Mem (dfn,<span style="color: #800080;"><span style="color: #800080;">0</span></span>); Mem (low,<span style="color: #800080;"><span style="color: #800080;">0</span></span>); Mem (instack,<span style="color: #800080;"><span style="color: #800080;">0</span></span>); Mem (pre,<span style="color: #800080;"><span style="color: #800080;">0</span></span>); Mem (minicost,inf); Mem (<span style="color: #0000ff;"><span style="color: #0000ff;">inch</span></span>,<span style="color: #800080;"><span style="color: #800080;">0</span></span><span style="color: #000000;"><span style="color: #000000;">);</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;"></span> for</span>(<span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>I=<span style="color: #800080;"><span style="color: #800080;">0</span></span>; i<maxn;i++<span style="color: #000000;"><span style="color: #000000;">) vec[i].clear ();</span></span><span style="color: #008080;"><span style="color: #008080;"></span> +</span> <span style="color: #0000ff;"><span style="color: #0000ff;"></span> while</span>(!<span style="color: #000000;"><span style="color: #000000;">S.empty ()) S.pop ();</span></span><span style="color: #008080;"><span style="color: #008080;"></span> a</span>css=dfs_block=<span style="color: #800080;"><span style="color: #800080;">0</span></span><span style="color: #000000;"><span style="color: #000000;">;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> at</span> <span style="color: #000000;"><span style="color: #000000;">}</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;">void</span></span>Targin (<span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>U<span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span><span style="color: #000000;"><span style="color: #000000;">Fa) {</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span>dfn[u]=low[u]=++<span style="color: #000000;"><span style="color: #000000;">dfs_block;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #000000;"><span style="color: #000000;">S.push (u);</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span>instack[u]=<span style="color: #800080;"><span style="color: #800080;">1</span></span><span style="color: #000000;"><span style="color: #000000;">;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;"></span> for</span>(<span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>I=<span style="color: #800080;"><span style="color: #800080;">0</span></span>; I<vec[u].size (); i++<span style="color: #000000;"><span style="color: #000000;">){</span></span><span style="color: #008080;"><span style="color: #008080;"></span> in</span> <span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>v=<span style="color: #000000;"><span style="color: #000000;">vec[u][i];</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;">if</span></span>(!<span style="color: #000000;"><span style="color: #000000;">Dfn[v]) {</span></span><span style="color: #008080;"><span style="color: #008080;"></span> to</span> <span style="color: #000000;"><span style="color: #000000;">Targin (v,u);</span></span><span style="color: #008080;"><span style="color: #008080;"></span> +</span>low[u]=<span style="color: #000000;"><span style="color: #000000;">min (low[u],low[v]);</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #0000ff;"><span style="color: #0000ff;">Else</span></span> <span style="color: #0000ff;"><span style="color: #0000ff;">if</span></span>(instack[v]) Low[u]=min (low[u],dfn[v]);<span style="color: #008000;"><span style="color: #008000;">//</span></span><span style="color: #008000;"><span style="color: #008000;">v written in U</span> ...</span><span style="color: #008080;"><span style="color: #008080;"></span> *</span> <span style="color: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;"></span> $</span> <span style="color: #0000ff;"><span style="color: #0000ff;">if</span></span>(dfn[u]==<span style="color: #000000;"><span style="color: #000000;">Low[u]) {</span></span><span style="color: #008080;"><span style="color: #008080;">Panax Notoginseng</span></span>css++<span style="color: #000000;"><span style="color: #000000;">;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;"></span> while</span>(<span style="color: #800080;"><span style="color: #800080;">1</span></span><span style="color: #000000;"><span style="color: #000000;">){</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>v=<span style="color: #000000;"><span style="color: #000000;">s.top ();</span></span><span style="color: #008080;"><span style="color: #008080;"></span> +</span> <span style="color: #000000;"><span style="color: #000000;">S.pop ();</span></span><span style="color: #008080;"><span style="color: #008080;"></span> a</span>instack[v]=<span style="color: #800080;"><span style="color: #800080;">0</span></span><span style="color: #000000;"><span style="color: #000000;">;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span>pre[v]=<span style="color: #000000;"><span style="color: #000000;">css;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> +</span> <span style="color: #0000ff;"><span style="color: #0000ff;">if</span></span>(u==v)<span style="color: #0000ff;"><span style="color: #0000ff;"></span> break</span><span style="color: #000000;"><span style="color: #000000;">;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;"></span> $</span> <span style="color: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;"></span> $</span> <span style="color: #000000;"><span style="color: #000000;">}</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span><span style="color: #000000;"><span style="color: #000000;">main () {</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #000000;"><span style="color: #000000;">#ifdef LOCAL</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span>Freopen (<span style="color: #800000;"><span style="color: #800000;">"</span></span><span style="color: #800000;"><span style="color: #800000;">data.in</span></span><span style="color: #800000;"><span style="color: #800000;">"</span></span>,<span style="color: #800000;"><span style="color: #800000;">"</span></span><span style="color: #800000;"><span style="color: #800000;">R</span></span><span style="color: #800000;"><span style="color: #800000;">"</span></span><span style="color: #000000;"><span style="color: #000000;">, stdin);</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span>Freopen (<span style="color: #800000;"><span style="color: #800000;">"</span></span><span style="color: #800000;"><span style="color: #800000;">Data.out</span></span><span style="color: #800000;"><span style="color: #800000;">"</span></span>,<span style="color: #800000;"><span style="color: #800000;">"</span></span><span style="color: #800000;"><span style="color: #800000;">W</span></span><span style="color: #800000;"><span style="color: #800000;">"</span></span><span style="color: #000000;"><span style="color: #000000;">, stdout);</span></span><span style="color: #008080;"><span style="color: #008080;">Wuyi</span></span> <span style="color: #0000ff;"><span style="color: #0000ff;">#endif</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span><span style="color: #000000;"><span style="color: #000000;">n,m;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;"></span> while</span>(~SCANF (<span style="color: #800000;"><span style="color: #800000;">"</span></span><span style="color: #800000;"><span style="color: #800000;">%d%d</span></span><span style="color: #800000;"><span style="color: #800000;">"</span></span>,&n,&<span style="color: #000000;"><span style="color: #000000;">M)) {</span></span><span style="color: #008080;"><span style="color: #008080;"></span> wu</span> <span style="color: #000000;"><span style="color: #000000;">Initial ();</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;"></span> for</span>(<span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>I=<span style="color: #800080;"><span style="color: #800080;">1</span></span>; I<=n;i++) scanf (<span style="color: #800000;"><span style="color: #800000;">"</span></span><span style="color: #800000;"><span style="color: #800000;">%d</span></span><span style="color: #800000;"><span style="color: #800000;">"</span></span>, cost+<span style="color: #000000;"><span style="color: #000000;">i);</span></span><span style="color: #008080;"><span style="color: #008080;"></span> about</span> <span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span><span style="color: #000000;"><span style="color: #000000;">b;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> $</span> <span style="color: #0000ff;"><span style="color: #0000ff;"></span> while</span>(m--<span style="color: #000000;"><span style="color: #000000;">){</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span>scanf<span style="color: #800000;"><span style="color: #800000;">"</span></span><span style="color: #800000;"><span style="color: #800000;">%d%d</span></span><span style="color: #800000;"><span style="color: #800000;">"</span></span>,&a,&<span style="color: #000000;"><span style="color: #000000;">b);</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #000000;"><span style="color: #000000;">Vec[a].push_back (b);</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;"></span> a</span> <span style="color: #0000ff;"><span style="color: #0000ff;"></span> for</span>(<span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>I=<span style="color: #800080;"><span style="color: #800080;">1</span></span>; i<=n;i++<span style="color: #000000;"><span style="color: #000000;">){</span></span><span style="color: #008080;"><span style="color: #008080;"></span> +</span> <span style="color: #0000ff;"><span style="color: #0000ff;">if</span></span>(dfn[i])<span style="color: #0000ff;"><span style="color: #0000ff;">Continue</span></span><span style="color: #000000;"><span style="color: #000000;">;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span>Targin (i,-<span style="color: #800080;"><span style="color: #800080;">1</span></span><span style="color: #000000;"><span style="color: #000000;">);</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;"></span> $</span> <span style="color: #0000ff;"><span style="color: #0000ff;"></span> for</span>(<span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>I=<span style="color: #800080;"><span style="color: #800080;">1</span></span>; i<=n;i++<span style="color: #000000;"><span style="color: #000000;">){</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span>Minicost[pre[i]]=min (minicost[pre[i]],cost[i]);<span style="color: #008000;"><span style="color: #008000;">//</span></span><span style="color: #008000;"><span style="color: #008000;">the minimum value of the current strong Unicom component;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #0000ff;"><span style="color: #0000ff;"></span> for</span>(<span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>j=<span style="color: #800080;"><span style="color: #800080;">0</span></span>; J<vec[i].size (); J + +<span style="color: #000000;"><span style="color: #000000;">){</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>v=<span style="color: #000000;"><span style="color: #000000;">vec[i][j];</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #0000ff;"><span style="color: #0000ff;">if</span></span>(pre[i]!=pre[v])<span style="color: #0000ff;"><span style="color: #0000ff;">inch</span></span>[pre[v]]++;<span style="color: #008000;"><span style="color: #008000;">//</span></span><span style="color: #008000;"><span style="color: #008000;">if the strong Unicom component can be reached by other strong unicom components, into the degree + +;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;"></span> in</span> <span style="color: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>ans1=<span style="color: #800080;"><span style="color: #800080;">0</span></span>, ans2=<span style="color: #800080;"><span style="color: #800080;">0</span></span><span style="color: #000000;"><span style="color: #000000;">;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #0000ff;"><span style="color: #0000ff;"></span> for</span>(<span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>I=<span style="color: #800080;"><span style="color: #800080;">1</span></span>; i<=css;i++<span style="color: #000000;"><span style="color: #000000;">){</span></span><span style="color: #008080;"><span style="color: #008080;"></span> about</span> <span style="color: #008000;"><span style="color: #008000;">//</span></span><span style="color: #008000;"><span style="color: #008000;">printf ("%d\n", in[i]);</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #0000ff;"><span style="color: #0000ff;">if</span></span>(<span style="color: #0000ff;"><span style="color: #0000ff;">inch</span></span>[i]==<span style="color: #800080;"><span style="color: #800080;">0</span></span><span style="color: #000000;"><span style="color: #000000;">){</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span>ans1++<span style="color: #000000;"><span style="color: #000000;">;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span>ans2+=<span style="color: #000000;"><span style="color: #000000;">minicost[i];</span></span><span style="color: #008080;"><span style="color: #008080;"></span> +</span> <span style="color: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #000000;"><span style="color: #000000;"> } </span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span>printf<span style="color: #800000;"><span style="color: #800000;">"</span></span><span style="color: #800000;"><span style="color: #800000;">%d%d\n</span></span><span style="color: #800000;"><span style="color: #800000;">"</span></span><span style="color: #000000;"><span style="color: #000000;">, ans1,ans2);</span></span><span style="color: #008080;"><span style="color: #008080;">Bayi</span></span> <span style="color: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #0000ff;"><span style="color: #0000ff;">return</span></span> <span style="color: #800080;"><span style="color: #800080;">0</span></span><span style="color: #000000;"><span style="color: #000000;">;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span>}</pre><p><p></p></p><p><p>Summer Holiday (the Smallest point of strong unicom Penetration)</p></p></span>