srm 631 div 2 250

Author: keshavnandan

TaroGrid.cpp

@@ -0,0 +1,78 @@
+#include <iostream>
+#include <sstream>
+#include <vector>
+#include <algorithm>
+#include <set>
+#include <map>
+#include <queue>
+#include <cstring>
+#include <climits>
+using namespace std;
+typedef pair<int,int> pi;
+typedef vector<int> vi;
+typedef vector<vi> vvi;
+typedef vector<string> vs;
+typedef vector<vs> vvs;
+
+class TaroGrid {
+        public:
+        int getNumber(vector <string> grid)
+        {
+            int bc = 0, wc = 0;
+            int c = 1;
+            int n = grid.size();
+            for(int j = 0; j < n; j++){
+                int i = 0;
+                while(i+1 < n){
+                    int tc = 1;
+                    while(i+1 < n && grid[i][j] == grid[i+1][j]){
+                        i++;
+                        tc++;
+                    }
+                    i++;
+                    c = max(c, tc);
+                }
+            }
+            return c;
+        }
+
+// 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(); if ((Case == -1) || (Case == 5)) test_case_5(); }
+	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[] = {"W"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 1; verify_case(0, Arg1, getNumber(Arg0)); }
+	void test_case_1() { string Arr0[] = {"WB",
+ "BW"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 1; verify_case(1, Arg1, getNumber(Arg0)); }
+	void test_case_2() { string Arr0[] = {"BWW",
+ "BBB",
+ "BWB"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 3; verify_case(2, Arg1, getNumber(Arg0)); }
+	void test_case_3() { string Arr0[] = {"BWBW",
+ "BBWB",
+ "WWWB",
+ "BWWW"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 3; verify_case(3, Arg1, getNumber(Arg0)); }
+	void test_case_4() { string Arr0[] = {"BWB",
+ "BBW",
+ "BWB"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 3; verify_case(4, Arg1, getNumber(Arg0)); }
+	void test_case_5() { string Arr0[] = {"BBWWBBWW",
+ "BBWWBBWW",
+ "WWBBWWBB",
+ "WWBBWWBB",
+ "BBWWBBWW",
+ "BBWWBBWW",
+ "WWBBWWBB",
+ "WWBBWWBB"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 2; verify_case(5, Arg1, getNumber(Arg0)); }
+
+// END CUT HERE
+
+ };
+
+// BEGIN CUT HERE
+int main(){
+
+        TaroGrid ___test;
+        ___test.run_test(-1);
+
+}
+// END CUT HERE

TaroGrid.txt

@@ -0,0 +1,88 @@
+PROBLEM STATEMENT
+
+Cat Taro has a square grid with N rows and N columns.
+Each cell of the grid is painted either black or white.
+You are given a vector <string> grid which represents the current state of the grid.
+Each element of grid represents one row of the grid.
+In grid, the character 'W' represents a white cell, and the character 'B' represents a black cell. 
+
+
+
+
+Taro wants to choose a set of consecutive cells that are in the same column and are painted in the same color.
+Return the largest number of cells he can choose.
+
+
+DEFINITION
+Class:TaroGrid
+Method:getNumber
+Parameters:vector <string>
+Returns:int
+Method signature:int getNumber(vector <string> grid)
+
+
+CONSTRAINTS
+-N will be between 1 and 50, inclusive.
+-grid will contain exactly N elements.
+-Each element of grid will contain exactly N characters.
+-Each character in grid will be 'W' or 'B'.
+
+
+EXAMPLES
+
+0)
+{"W"}
+
+Returns: 1
+
+
+
+1)
+{"WB",
+ "BW"}
+
+Returns: 1
+
+
+
+2)
+{"BWW",
+ "BBB",
+ "BWB"}
+
+Returns: 3
+
+He can choose the entire leftmost column (i.e., character 0 of each element of grid).
+
+3)
+{"BWBW",
+ "BBWB",
+ "WWWB",
+ "BWWW"}
+
+Returns: 3
+
+
+
+4)
+{"BWB",
+ "BBW",
+ "BWB"}
+
+Returns: 3
+
+
+
+5)
+{"BBWWBBWW",
+ "BBWWBBWW",
+ "WWBBWWBB",
+ "WWBBWWBB",
+ "BBWWBBWW",
+ "BBWWBBWW",
+ "WWBBWWBB",
+ "WWBBWWBB"}
+
+Returns: 2
+
+Note that the chosen cells must be consecutive.