tccc 2003 round 2 500

Author: keshavnandan

Marketing.cpp

@@ -0,0 +1,85 @@
+#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;
+int M[35][35];
+int l[35];
+int n;
+
+class Marketing {
+        public:
+        int dfs(int s){
+            int x = l[s];
+            for(int p = 0; p < n; p++){
+                if(M[s][p]){
+                    if(l[p] == x) return -1;
+                    if(l[p] == -1){
+                        l[p] = (x^1);
+                        if(dfs(p) == -1) return -1;
+                    }
+                }
+            }
+            return 1;
+        }
+
+        long long howMany(vector <string> comp)
+        {
+            n = comp.size();
+            fill(l, l+n+1, -1);
+            for(int i = 0; i <= n; i++)
+                for(int j = 0; j <= n; j++)
+                    M[i][j] = 0;
+
+            for(int i = 0; i < n; i++){
+                string s = comp[i];
+                stringstream ss(s);
+                int j;
+                while(ss>>j) M[i][j] = M[j][i] = 1;
+            }
+            int c = 1;
+            for(int i = 0; i < n; i++)
+            if(l[i] == -1){
+                l[i] = 1;
+                if(dfs(i) == -1) return -1;
+                c *= 2;
+            }
+            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(); }
+	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 long long &Expected, const long long &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[] = {"1 4","2","3","0",""}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); long long Arg1 = 2LL; verify_case(0, Arg1, howMany(Arg0)); }
+	void test_case_1() { string Arr0[] = {"1","2","0"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); long long Arg1 = -1LL; verify_case(1, Arg1, howMany(Arg0)); }
+	void test_case_2() { string Arr0[] = {"1","2","3","0","0 5","1"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); long long Arg1 = 2LL; verify_case(2, Arg1, howMany(Arg0)); }
+	void test_case_3() { string Arr0[] = {"","","","","","","","","","",
+ "","","","","","","","","","",
+ "","","","","","","","","",""}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); long long Arg1 = 1073741824LL; verify_case(3, Arg1, howMany(Arg0)); }
+	void test_case_4() { string Arr0[] = {"1","2","3","0","5","6","4"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); long long Arg1 = -1LL; verify_case(4, Arg1, howMany(Arg0)); }
+
+// END CUT HERE
+
+ };
+
+// BEGIN CUT HERE
+int main(){
+
+        Marketing ___test;
+        ___test.run_test(-1);
+
+}
+// END CUT HERE

Marketing.txt

@@ -0,0 +1,66 @@
+PROBLEM STATEMENT
+You work for a very large company that markets many different products.  In some cases, one product you market competes with another.  To help deal with this situation you have split the intended consumers into two groups, namely Adults and Teenagers.  If your company markets 2 products that compete with each other, selling one to Adults and the other to Teenagers will help maximize profits.  Given a list of the products that compete with each other, you are going to determine whether all can be marketed such that no pair of competing products are both sold to Teenagers or both sold to Adults.  If such an arrangement is not feasible your method will return -1.  Otherwise, it should return the number of possible ways of marketing all of the products.
+
+The products will be given in a vector <string> compete whose kth element describes product k.  The kth element will be a single-space delimited list of integers.  These integers will refer to the products that the kth product competes with.  For example:
+compete = {"1 4",
+            "2",
+            "3",
+            "0",
+	    ""}
+
+The example above shows product 0 competes with 1 and 4, product 1 competes with 2, product 2 competes with 3, and product 3 competes with 0.  Note, competition is symmetric so product 1 competing with product 2 means product 2 competes with product 1 as well.
+Ways to market:
+1) 0 to Teenagers, 1 to Adults, 2 to Teenagers, 3 to Adults, and 4 to Adults
+2) 0 to Adults, 1 to Teenagers, 2 to Adults, 3 to Teenagers, and 4 to Teenagers
+Your method would return 2.
+
+
+DEFINITION
+Class:Marketing
+Method:howMany
+Parameters:vector <string>
+Returns:long long
+Method signature:long long howMany(vector <string> compete)
+
+
+CONSTRAINTS
+-compete will contain between 1 and 30 elements, inclusive.
+-Each element of compete will have between 0 and 50 characters, inclusive.
+-Each element of compete will be a single space delimited sequence of integers such that:                                         All of the integers are unique.Each integer contains no extra leading zeros.Each integer is between 0 and k-1 inclusive where k is the number of elements in compete.
+-No element of compete contains leading or trailing whitespace.
+-Element i of compete will not contain the value i.
+-If i occurs in the jth element of compete, j will not occur in the ith element of compete.
+
+
+EXAMPLES
+
+0)
+{"1 4","2","3","0",""}
+
+Returns: 2
+
+The example from above.
+
+1)
+{"1","2","0"}
+
+Returns: -1
+
+Product 0 cannot be marketed with product 1 or 2.  Product 1 cannot be marketed with product 2.  There is no way to achieve a viable marketing scheme.
+
+2)
+{"1","2","3","0","0 5","1"}
+
+Returns: 2
+
+3)
+{"","","","","","","","","","",
+ "","","","","","","","","","",
+ "","","","","","","","","",""}
+
+Returns: 1073741824
+
+4)
+{"1","2","3","0","5","6","4"}
+
+Returns: -1