srm 648 div 2 500

Author: keshavnandan

Fragile2.cpp

@@ -0,0 +1,92 @@
+#include <iostream>
+#include <sstream>
+#include <vector>
+#include <algorithm>
+#include <set>
+#include <map>
+#include <queue>
+#include <cstring>
+#include <climits>
+#include <cstdio>
+using namespace std;
+typedef pair<int,int> pi;
+typedef set<int> si;
+typedef vector<int> vi;
+typedef vector<vi> vvi;
+typedef vector<string> vs;
+int n;
+vs G;
+vi visited;
+set<int> articulation;
+void dfs(int i){
+    for(int j = 0; j < n; j++){
+        if(articulation.count(j)) continue;
+        if(visited[j] == 0 && G[i][j] == 'Y'){
+            visited[j] = 1;
+            dfs(j);
+        }
+    }
+}
+
+int dfs(){
+    int res = 0;
+    for(int i = 0; i < n; i++){
+        if(articulation.count(i)) continue;
+        if(visited[i] == 0){
+            visited[i] = 1;
+            res++;
+            dfs(i);
+        }
+    }
+    return res;
+}
+
+class Fragile2{ 
+        public: 
+        int countPairs(vector <string> graph) {
+           n = graph.size();
+           int total = 0;
+           G = graph;
+           articulation.clear();
+           visited = vi(n, 0);
+           int ans = dfs();
+
+           for(int i = 0; i < n; i++)
+            for(int j = i+1; j < n; j++){
+                G = graph;
+                articulation.clear();
+                visited = vi(n, 0);
+                articulation.insert(i);
+                articulation.insert(j);
+                if(dfs() > ans) total++;
+            }
+           return total;
+        } 
+        
+// BEGIN CUT HERE
+	public:
+	void run_test(int Case) { if ((Case == -1) || (Case == 0)) test_case_0(); if ((Case == -1) || (Case == 1)) test_case_1(); if ((Case == -1) || (Case == 2)) test_case_2(); if ((Case == -1) || (Case == 3)) test_case_3(); if ((Case == -1) || (Case == 4)) test_case_4(); }
+	private:
+	template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); }
+	void verify_case(int Case, const int &Expected, const int &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } }
+	void test_case_0() { string Arr0[] = {"NYNN", "YNYN", "NYNY", "NNYN"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 3; verify_case(0, Arg1, countPairs(Arg0)); }
+	void test_case_1() { string Arr0[] = {"NYNNNN", "YNYNNN", "NYNNNN", "NNNNYN", "NNNYNY", "NNNNYN"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 5; verify_case(1, Arg1, countPairs(Arg0)); }
+	void test_case_2() { string Arr0[] = {"NNN", "NNN", "NNN"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 0; verify_case(2, Arg1, countPairs(Arg0)); }
+	void test_case_3() { string Arr0[] = {"NYNYNNYYNN", "YNNNYNYYNN", "NNNNYNNNYN", "YNNNYYNNNN", "NYYYNNNNYN",
+ "NNNYNNNNYN", "YYNNNNNNNN", "YYNNNNNNYN", "NNYNYYNYNY", "NNNNNNNNYN"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 9; verify_case(3, Arg1, countPairs(Arg0)); }
+	void test_case_4() { string Arr0[] = {"NNNYNNYNNNNNNNYYNNNY", "NNNNNNNNYNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNN", "YNNNNNNNNNYNNNNNNNNN", "NNNNNNNYNNNNNYNNNNYN",
+ "NNNNNNNNNNNNNNNNYNNY", "YNNNNNNNNNNNNYYYNYNN", "NNNNYNNNNNNNNYYNNNNN", "NYNNNNNNNYNNNNNNNNNN", "NNNNNNNNYNNNYNNNNNYN",
+ "NNNYNNNNNNNNNNYNNNNN", "NNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNYNNNNNNNYNN", "NNNNYNYYNNNNNNNNNNNN", "YNNNNNYYNNYNNNNNNNNN",
+ "YNNNNNYNNNNNNNNNYNNN", "NNNNNYNNNNNNNNNYNYNN", "NNNNNNYNNNNNYNNNYNNN", "NNNNYNNNNYNNNNNNNNNN", "YNNNNYNNNNNNNNNNNNNN"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 42; verify_case(4, Arg1, countPairs(Arg0)); }
+
+// END CUT HERE
+ 
+}; 
+
+// BEGIN CUT HERE 
+int main(){
+
+        Fragile2 ___test; 
+        ___test.run_test(-1); 
+} 
+// END CUT HERE     

Fragile2.html

@@ -0,0 +1,24 @@
+<html><body bgcolor="#000000" text="#ffffff"><table><tr><td colspan="2"><h3>Problem Statement</h3></td></tr><tr><td>&#160;&#160;&#160;&#160;</td><td><p>Lun the dog has found an undirected graph in Shuseki Forest. The graph consisted of <i>N</i> vertices and some edges. The vertices of the graph were numbered 0 through <i>N</i>-1. Each edge connected a different pair of vertices.</p>
+<p></p>
+<p>You are given the description of the graph in a vector &lt;string&gt; <b>graph</b> with <i>N</i> elements, each containing <i>N</i> characters. For each <i>i</i> and <i>j</i>, <b>graph</b>[<i>i</i>][<i>j</i>] will be 'Y' if vertex <i>i</i> and vertex <i>j</i> are connected by an edge, and 'N' otherwise. (Note that for each <i>i</i>, <b>graph</b>[<i>i</i>][<i>i</i>] will be 'N': there are no self-loops.)</p>
+<p></p>
+<p>Lun is interested in <i>articulation pairs</i> in this graph. An <i>articulation pair</i> is an unordered pair of two different vertices whose deletion increases the number of connected components in the graph. (The deletion of a vertex also removes all edges incident with that vertex.)</p>
+<p></p>
+<p>Return the number of the articulation pairs in Lun's graph.</p></td></tr><tr><td colspan="2"><h3>Definition</h3></td></tr><tr><td>&#160;&#160;&#160;&#160;</td><td><table><tr><td>Class:</td><td>Fragile2</td></tr><tr><td>Method:</td><td>countPairs</td></tr><tr><td>Parameters:</td><td>vector &lt;string&gt;</td></tr><tr><td>Returns:</td><td>int</td></tr><tr><td>Method signature:</td><td>int countPairs(vector &lt;string&gt; graph)</td></tr><tr><td colspan="2">(be sure your method is public)</td></tr></table></td></tr><tr><td colspan="2"><h3>Limits</h3></td></tr><tr><td>&#160;&#160;&#160;&#160;</td><td><table><tr><td>Time limit (s):</td><td>2.000</td></tr><tr><td>Memory limit (MB):</td><td>256</td></tr><tr><td>Stack limit (MB):</td><td>256</td></tr></table></td></tr><tr><td colspan="2"><h3>Notes</h3></td></tr><tr><td align="center" valign="top">-</td><td>You are not given the value of <i>N</i> explicitly, but you can determine it as the number of elements in <b>graph</b>.</td></tr><tr><td align="center" valign="top">-</td><td>Two vertices belong to the same connected component if and only if we can reach one of them from the other by following a sequence of zero or more edges.</td></tr><tr><td colspan="2"><h3>Constraints</h3></td></tr><tr><td align="center" valign="top">-</td><td><b>graph</b> will contain between 3 and 20 elements, inclusive.</td></tr><tr><td align="center" valign="top">-</td><td>Each element of <b>graph</b> will contain <i>N</i> characters, where <i>N</i> is the number of the elements in <b>graph</b>.</td></tr><tr><td align="center" valign="top">-</td><td>Each character of each element of <b>graph</b> will be either 'Y' or 'N'.</td></tr><tr><td align="center" valign="top">-</td><td>For each valid <i>i</i> and <i>j</i>, <b>graph</b>[<i>i</i>][<i>j</i>] will be equal to <b>graph</b>[<i>j</i>][<i>i</i>].</td></tr><tr><td align="center" valign="top">-</td><td>For each valid <i>i</i>, <b>graph</b>[<i>i</i>][<i>i</i>] will be 'N'.</td></tr><tr><td colspan="2"><h3>Examples</h3></td></tr><tr><td align="center" nowrap="true">0)</td><td></td></tr><tr><td>&#160;&#160;&#160;&#160;</td><td><table><tr><td><table><tr><td><pre>{&quot;NYNN&quot;, &quot;YNYN&quot;, &quot;NYNY&quot;, &quot;NNYN&quot;}</pre></td></tr></table></td></tr><tr><td><pre>Returns: 3</pre></td></tr><tr><td><table><tr><td colspan="2"><p>The graph looks as follows:</p>
+<p></p>
+<img src="http://s6.postimg.org/dguz2x9mp/2b0.png"></img>
+<p></p>
+<p>The articulation pairs are (0, 2), (1, 2) and (1, 3).</p>
+<p>For example, here is why (0, 2) is an articulation pair:
+Currently there is one connected component.
+(It contains all four vertices.)
+If we remove the vertices 0 and 2, and all edges incident to these vertices, we will be left with two isolated vertices: 1 and 3.
+Each of these vertices now forms a different connected component, so the number of connected components increased from 1 to 2.</p></td></tr></table></td></tr></table></td></tr><tr><td align="center" nowrap="true">1)</td><td></td></tr><tr><td>&#160;&#160;&#160;&#160;</td><td><table><tr><td><table><tr><td><pre>{&quot;NYNNNN&quot;, &quot;YNYNNN&quot;, &quot;NYNNNN&quot;, &quot;NNNNYN&quot;, &quot;NNNYNY&quot;, &quot;NNNNYN&quot;}</pre></td></tr></table></td></tr><tr><td><pre>Returns: 5</pre></td></tr><tr><td><table><tr><td colspan="2"><img src="http://s6.postimg.org/ew1lorh1d/2b1.png"></img>
+<p></p>
+<p>The articulation pairs are (0, 4), (1, 3), (1, 4), (1, 5) and (2, 4).</p></td></tr></table></td></tr></table></td></tr><tr><td align="center" nowrap="true">2)</td><td></td></tr><tr><td>&#160;&#160;&#160;&#160;</td><td><table><tr><td><table><tr><td><pre>{&quot;NNN&quot;, &quot;NNN&quot;, &quot;NNN&quot;}</pre></td></tr></table></td></tr><tr><td><pre>Returns: 0</pre></td></tr><tr><td><table><tr><td colspan="2"><img src="http://s6.postimg.org/6rthk0um9/2b2.png"></img>
+<p></p>
+<p>There are no articulation pairs.</p></td></tr></table></td></tr></table></td></tr><tr><td align="center" nowrap="true">3)</td><td></td></tr><tr><td>&#160;&#160;&#160;&#160;</td><td><table><tr><td><table><tr><td><pre>{&quot;NYNYNNYYNN&quot;, &quot;YNNNYNYYNN&quot;, &quot;NNNNYNNNYN&quot;, &quot;YNNNYYNNNN&quot;, &quot;NYYYNNNNYN&quot;,
+ &quot;NNNYNNNNYN&quot;, &quot;YYNNNNNNNN&quot;, &quot;YYNNNNNNYN&quot;, &quot;NNYNYYNYNY&quot;, &quot;NNNNNNNNYN&quot;}</pre></td></tr></table></td></tr><tr><td><pre>Returns: 9</pre></td></tr><tr><td><table><tr><td colspan="2"></td></tr></table></td></tr></table></td></tr><tr><td align="center" nowrap="true">4)</td><td></td></tr><tr><td>&#160;&#160;&#160;&#160;</td><td><table><tr><td><table><tr><td><pre>{&quot;NNNYNNYNNNNNNNYYNNNY&quot;, &quot;NNNNNNNNYNNNNNNNNNNN&quot;, &quot;NNNNNNNNNNNNNNNNNNNN&quot;, &quot;YNNNNNNNNNYNNNNNNNNN&quot;, &quot;NNNNNNNYNNNNNYNNNNYN&quot;,
+ &quot;NNNNNNNNNNNNNNNNYNNY&quot;, &quot;YNNNNNNNNNNNNYYYNYNN&quot;, &quot;NNNNYNNNNNNNNYYNNNNN&quot;, &quot;NYNNNNNNNYNNNNNNNNNN&quot;, &quot;NNNNNNNNYNNNYNNNNNYN&quot;,
+ &quot;NNNYNNNNNNNNNNYNNNNN&quot;, &quot;NNNNNNNNNNNNNNNNNNNN&quot;, &quot;NNNNNNNNNYNNNNNNNYNN&quot;, &quot;NNNNYNYYNNNNNNNNNNNN&quot;, &quot;YNNNNNYYNNYNNNNNNNNN&quot;,
+ &quot;YNNNNNYNNNNNNNNNYNNN&quot;, &quot;NNNNNYNNNNNNNNNYNYNN&quot;, &quot;NNNNNNYNNNNNYNNNYNNN&quot;, &quot;NNNNYNNNNYNNNNNNNNNN&quot;, &quot;YNNNNYNNNNNNNNNNNNNN&quot;}</pre></td></tr></table></td></tr><tr><td><pre>Returns: 42</pre></td></tr><tr><td><table><tr><td colspan="2"></td></tr></table></td></tr></table></td></tr></table><p>This problem statement is the exclusive and proprietary property of TopCoder, Inc.  Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited.  (c)2003, TopCoder, Inc.  All rights reserved.  </p></body></html>