[POJ1236] Network of schools (and +floyd, pseudo strong connected Component)

Source: Internet
Author: User
Tags fread
<span id="Label3"></p><p><p>Title Link: http://poj.org/problem?id=1236</p></p><p><p>This problem is originally a strong connectivity component board problem, but weak long not write Tarjan so unfamiliar, and see this data range feel shrinking point this thing can use the distance between point to judge do not know the group of the giant magnetic magnet ... Below the weak on everyone to get a how to use Floyd and check set to shrink point ... The general idea is to Floyd run out all the distance, then O (n^2) find 22 can reach the point of their relationship with and check set to Maintain. Next o (n) find and look up the representative elements in the Set. This time should be a special sentence when the connecting block is 1. Then o (n^2) to find all the one-way edges, and then update all the representation of the elements of the degree of access, It's done ... It's finished ... The data is too water so weak Floyd ran over, and later can not be so speculative qaq</p></p><p><p></p></p><pre><span style="color: #008080;"><span style="color: #008080;">1</span></span> <span style="color: #008000;"><span style="color: #008000;">/*</span></span><span style="color: #008080;"><span style="color: #008080;">2</span></span> <span style="color: #008000;"><span style="color: #008000;">━━━━━┒ギリギリ♂eye! </span></span><span style="color: #008080;"><span style="color: #008080;">3</span></span> <span style="color: #008000;"><span style="color: #008000;">┓┏┓┏┓┃キリキリ♂mind! </span></span><span style="color: #008080;"><span style="color: #008080;">4</span></span> <span style="color: #008000;"><span style="color: #008000;">┛┗┛┗┛┃\0/</span></span><span style="color: #008080;"><span style="color: #008080;">5</span></span> <span style="color: #008000;"><span style="color: #008000;">┓┏┓┏┓┃/</span></span><span style="color: #008080;"><span style="color: #008080;">6</span></span> <span style="color: #008000;"><span style="color: #008000;">┛┗┛┗┛┃ノ)</span></span><span style="color: #008080;"><span style="color: #008080;">7</span></span> <span style="color: #008000;"><span style="color: #008000;">┓┏┓┏┓┃</span></span><span style="color: #008080;"><span style="color: #008080;">8</span></span> <span style="color: #008000;"><span style="color: #008000;">┛┗┛┗┛┃</span></span><span style="color: #008080;"><span style="color: #008080;">9</span></span> <span style="color: #008000;"><span style="color: #008000;">┓┏┓┏┓┃</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: #008080;"><span style="color: #008080;"></span> one</span> <span style="color: #008000;"><span style="color: #008000;">┓┏┓┏┓┃</span></span><span style="color: #008080;"><span style="color: #008080;"></span> a</span> <span style="color: #008000;"><span style="color: #008000;">┛┗┛┗┛┃</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #008000;"><span style="color: #008000;">┓┏┓┏┓┃</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #008000;"><span style="color: #008000;">┃┃┃┃┃┃</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #008000;"><span style="color: #008000;">┻┻┻┻┻┻</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #008000;"><span style="color: #008000;">*/</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span>#include <algorithm><span style="color: #008080;"><span style="color: #008080;"></span> -</span>#include <iostream><span style="color: #008080;"><span style="color: #008080;"></span> +</span>#include <iomanip><span style="color: #008080;"><span style="color: #008080;"></span> -</span>#include <cstring><span style="color: #008080;"><span style="color: #008080;"></span> +</span>#include <climits><span style="color: #008080;"><span style="color: #008080;"></span> a</span>#include <complex><span style="color: #008080;"><span style="color: #008080;"></span> at</span>#include <fstream><span style="color: #008080;"><span style="color: #008080;"></span> -</span>#include <cassert><span style="color: #008080;"><span style="color: #008080;"></span> -</span>#include <cstdio><span style="color: #008080;"><span style="color: #008080;"></span> -</span>#include <bitset><span style="color: #008080;"><span style="color: #008080;"></span> -</span>#include <vector><span style="color: #008080;"><span style="color: #008080;"></span> -</span>#include <deque><span style="color: #008080;"><span style="color: #008080;"></span> in</span>#include <queue><span style="color: #008080;"><span style="color: #008080;"></span> -</span>#include <stack><span style="color: #008080;"><span style="color: #008080;"></span> to</span>#include <ctime><span style="color: #008080;"><span style="color: #008080;"></span> +</span>#include <<span style="color: #0000ff;"><span style="color: #0000ff;">Set</span></span>><span style="color: #008080;"><span style="color: #008080;"></span> -</span>#include <map><span style="color: #008080;"><span style="color: #008080;"></span> the</span>#include <cmath><span style="color: #008080;"><span style="color: #008080;"></span> *</span> <span style="color: #008080;"><span style="color: #008080;"></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;">Panax Notoginseng</span></span> <span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;">#define</span></span>Fr First<span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #0000ff;"><span style="color: #0000ff;">#define</span></span>SC Second<span style="color: #008080;"><span style="color: #008080;"></span> +</span> <span style="color: #0000ff;"><span style="color: #0000ff;">#define</span></span>CL Clear<span style="color: #008080;"><span style="color: #008080;"></span> a</span> <span style="color: #0000ff;"><span style="color: #0000ff;">#define</span></span>W (a) while (a--)<span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #0000ff;"><span style="color: #0000ff;">#define</span></span>PB (a) push_back (a)<span style="color: #008080;"><span style="color: #008080;"></span> +</span> <span style="color: #0000ff;"><span style="color: #0000ff;">#define</span></span>Rint (a) scanf ("%d", &a)<span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;">#define</span></span>Rll (a) scanf ("%i64d", &a)<span style="color: #008080;"><span style="color: #008080;"></span> $</span> <span style="color: #0000ff;"><span style="color: #0000ff;">#define</span></span>Rs (a) scanf ("%s", a)<span style="color: #008080;"><span style="color: #008080;"></span> $</span> <span style="color: #0000ff;"><span style="color: #0000ff;">#define</span></span>FRead () freopen ("in", "r", Stdin)<span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;">#define</span></span>FWrite () freopen ("out", "w", Stdout)<span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;">#define</span></span>Rep (i, len) for (int i = 0; i < (len); i++)<span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #0000ff;"><span style="color: #0000ff;">#define</span></span>For (i, a, len) for (int i = (a); i < (len); i++)<span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;">#define</span></span>Cls (a) memset ((a), 0, sizeof (a))<span style="color: #008080;"><span style="color: #008080;">Wuyi</span></span> <span style="color: #0000ff;"><span style="color: #0000ff;">#define</span></span>CLR (a, x) memset ((a), (x), sizeof (a))<span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #0000ff;"><span style="color: #0000ff;">#define</span></span>Full (a) memset ((a), 0x7f7f, sizeof (a))<span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #008080;"><span style="color: #008080;"></span> wu</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;">0x7f7f7f</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;">Const</span></span> <span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>MAXN =<span style="color: #800080;"><span style="color: #800080;">111</span></span><span style="color: #000000;"><span style="color: #000000;">;</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;">n, m;</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: #0000ff;"><span style="color: #0000ff;">inch</span></span>[maxn],<span style="color: #0000ff;"><span style="color: #0000ff;"></span> out</span><span style="color: #000000;"><span style="color: #000000;">[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;">dp[maxn][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;">pos[maxn], cnt;</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;">pre[maxn];</span></span><span style="color: #008080;"><span style="color: #008080;"></span> a</span> <span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span><span style="color: #000000;"><span style="color: #000000;">belong[maxn];</span></span><span style="color: #008080;"><span style="color: #008080;"></span> +</span> <span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>Find<span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span><span style="color: #000000;"><span style="color: #000000;">X) {</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;">return</span></span>x = = pre[x]? x:pre[x] =<span style="color: #000000;"><span style="color: #000000;">Find (pre[x]);</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: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #0000ff;"><span style="color: #0000ff;">void</span></span>Unite<span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>X<span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span><span style="color: #000000;"><span style="color: #000000;">Y) {</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span>x =<span style="color: #000000;"><span style="color: #000000;">Find (x);</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span>y =<span style="color: #000000;"><span style="color: #000000;">Find (y);</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;">if</span></span>(x! = Y) pre[x] =<span style="color: #000000;"><span style="color: #000000;">y;</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: #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;">main () {</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;">FRead ();</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;">v;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #0000ff;"><span style="color: #0000ff;"></span> while</span>(~<span style="color: #000000;"><span style="color: #000000;">Rint (N)) {</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span>Cls (<span style="color: #0000ff;"><span style="color: #0000ff;">inch</span></span>); Cls (<span style="color: #0000ff;"><span style="color: #0000ff;"></span> out</span><span style="color: #000000;"><span style="color: #000000;">);</span></span><span style="color: #008080;"><span style="color: #008080;"></span> +</span>For (i,<span style="color: #800080;"><span style="color: #800080;">1</span></span>, n+<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>pre[i] =<span style="color: #000000;"><span style="color: #000000;">i;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span>For (j,<span style="color: #800080;"><span style="color: #800080;">1</span></span>, n+<span style="color: #800080;"><span style="color: #800080;">1</span></span>) dp[i][j] =<span style="color: #000000;"><span style="color: #000000;">inf;</span></span><span style="color: #008080;"><span style="color: #008080;">Bayi</span></span>dp[i][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> <span style="color: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span>For (u,<span style="color: #800080;"><span style="color: #800080;">1</span></span>, n+<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> while</span><span style="color: #000000;"><span style="color: #000000;">(Rint (v)) {</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;">if</span></span>(v = =<span style="color: #800080;"><span style="color: #800080;">0</span></span>)<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> the</span>dp[u][v] =<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: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span>For (k,<span style="color: #800080;"><span style="color: #800080;">1</span></span>, n+<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>For (i,<span style="color: #800080;"><span style="color: #800080;">1</span></span>, n+<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>For (j,<span style="color: #800080;"><span style="color: #800080;">1</span></span>, n+<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;">if</span></span>(dp[i][j] > dp[i][k] +<span style="color: #000000;"><span style="color: #000000;">Dp[k][j])</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span>dp[i][j] = dp[i][k] +<span style="color: #000000;"><span style="color: #000000;">dp[k][j];</span></span><span style="color: #008080;"><span style="color: #008080;">94</span></span>For (i,<span style="color: #800080;"><span style="color: #800080;">1</span></span>, n+<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>For (j, i+<span style="color: #800080;"><span style="color: #800080;">1</span></span>, n+<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;">if</span></span>(dp[i][j]! = inf && dp[j][i]! =<span style="color: #000000;"><span style="color: #000000;">Inf) {</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #000000;"><span style="color: #000000;">Unite (i, j);</span></span><span style="color: #008080;"><span style="color: #008080;">98</span></span> <span style="color: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;"></span> about</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;">101</span></span>For (i,<span style="color: #800080;"><span style="color: #800080;">1</span></span>, n+<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;">102</span></span> <span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>FA =<span style="color: #000000;"><span style="color: #000000;">Find (i);</span></span><span style="color: #008080;"><span style="color: #008080;">103</span></span> <span style="color: #0000ff;"><span style="color: #0000ff;">if</span></span>(i = = Fa) pos[cnt++] =<span style="color: #000000;"><span style="color: #000000;">i;</span></span><span style="color: #008080;"><span style="color: #008080;">104</span></span>belong[i] =<span style="color: #000000;"><span style="color: #000000;">fa;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;">106</span></span> <span style="color: #0000ff;"><span style="color: #0000ff;">if</span></span>(cnt = =<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;">107</span></span>printf<span style="color: #800000;"><span style="color: #800000;">"</span></span><span style="color: #800000;"><span style="color: #800000;">1\n0\n</span></span><span style="color: #800000;"><span style="color: #800000;">"</span></span><span style="color: #000000;"><span style="color: #000000;">);</span></span><span style="color: #008080;"><span style="color: #008080;">108</span></span> <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;">109</span></span> <span style="color: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span>For (i,<span style="color: #800080;"><span style="color: #800080;">1</span></span>, n+<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;">111</span></span>For (j,<span style="color: #800080;"><span style="color: #800080;">1</span></span>, n+<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;">if</span></span>(i = = J)<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;">113</span></span> <span style="color: #0000ff;"><span style="color: #0000ff;">if</span></span>(belong[i]! = belong[j] && dp[j][i] = = inf && dp[i][j]! =<span style="color: #000000;"><span style="color: #000000;">Inf) {</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #0000ff;"><span style="color: #0000ff;">inch</span></span>[belong[i]]++<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> out</span>[belong[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: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;">117</span></span> <span style="color: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;">118</span></span> <span style="color: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;">119</span></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> -</span> <span style="color: #000000;"><span style="color: #000000;">Rep (i, Cnt) {</span></span><span style="color: #008080;"><span style="color: #008080;">121</span></span> <span style="color: #0000ff;"><span style="color: #0000ff;">if</span></span>(!<span style="color: #0000ff;"><span style="color: #0000ff;"></span> out</span>[pos[i]]) ans1++<span style="color: #000000;"><span style="color: #000000;">;</span></span><span style="color: #008080;"><span style="color: #008080;">122</span></span> <span style="color: #0000ff;"><span style="color: #0000ff;">if</span></span>(!<span style="color: #0000ff;"><span style="color: #0000ff;">inch</span></span>[pos[i]]) ans2++<span style="color: #000000;"><span style="color: #000000;">;</span></span><span style="color: #008080;"><span style="color: #008080;">123</span></span> <span style="color: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;">124</span></span>printf<span style="color: #800000;"><span style="color: #800000;">"</span></span><span style="color: #800000;"><span style="color: #800000;">%d\n%d\n</span></span><span style="color: #800000;"><span style="color: #800000;">"</span></span><span style="color: #000000;"><span style="color: #000000;">, ans1, Max (ans1, ans2));</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;">126</span></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;">127</span></span>}</pre><p><p></p></p><p><p>[POJ1236] Network of schools (and +floyd, pseudo strong connected Component)</p></p></span>

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.