srm 204 div 1 300

keshavnandan · keshavnandan · commit 7311a6f69972 · 2014-12-29T02:17:20.000+05:30
diff --git a/Apothecary.cpp b/Apothecary.cpp
@@ -0,0 +1,69 @@
+#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 vector<int> vi;
+typedef vector<vi> vvi;
+typedef vector<string> vs;
+typedef vector<vs> vvs;
+
+class Apothecary{ 
+        public:
+        int next(int x){
+            int i = 1;
+            while(i < x) i *= 3;
+            return i;
+        }
+        vi balance(int W){
+            vi v[2];
+            int n = W, m = 1;
+            while(true){
+                int k = next(n);
+                if(k/2 < n){
+                    v[m].push_back(k);
+                    if(k == n) break;
+                    n = k-n;
+                    m = (m+1)%2;
+                }
+                else{
+                    v[m].push_back(k/3);
+                    n = n-k/3;
+                }
+            }
+            vi r;
+            for(int p : v[0]) r.push_back(-p);
+            for(int p : v[1]) r.push_back(p);     
+            sort(r.begin(), r.end());
+            return r;
+        } 
+        
+// 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(); }
+    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 vector <int> &Expected, const vector <int> &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: " << print_array(Expected) << endl; cerr << "\tReceived: " << print_array(Received) << endl; } }
+    void test_case_0() { int Arg0 = 17; int Arr1[] = { -9,  -1,  27 }; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); verify_case(0, Arg1, balance(Arg0)); }
+    void test_case_1() { int Arg0 = 1; int Arr1[] = { 1 }; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); verify_case(1, Arg1, balance(Arg0)); }
+    void test_case_2() { int Arg0 = 2016; int Arr1[] = { -243,  -9,  81,  2187 }; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); verify_case(2, Arg1, balance(Arg0)); }
+    void test_case_3() { int Arg0 = 1000000; int Arr1[] = { -531441,  -59049,  -6561,  -243,  -27,  1,  81,  729,  2187,  1594323 }; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); verify_case(3, Arg1, balance(Arg0)); }
+
+// END CUT HERE
+ 
+}; 
+
+// BEGIN CUT HERE 
+int main(){
+
+        Apothecary ___test; 
+        ___test.run_test(-1); 
+} 
+// END CUT HERE     
diff --git a/Apothecary.html b/Apothecary.html
@@ -0,0 +1,18 @@
+<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>
+An accurate scale is one of the most important tools of the apothecary (an old-time pharmacist).  
+To measure the weight of an object, the apothecary places the object on one
+pan of the scale, along with some weights of known size, and adds more weights
+of known size to the other pan until the scales balance.  For example, if an object
+weighs 17 grains, the apothecary could balance the scales by placing a 1-grain weight
+and a 9-grain weight in the pan with the object, and a 27-grain weight in the other
+pan.
+</p>
+
+<p>
+The apothecary owns weights in a range of sizes starting at 1 grain.  In particular, he owns one weight for each
+power of 3: 1 grain, 3 grains, 9 grains, 27 grains, etc.  Determine, for an object weighing <b>W</b> grains, how to distribute the weights among the
+pans to balance the object.  This distribution will be unique.  Return a vector &lt;int&gt; of the weights used.  The sign of each weight should be
+negative if the weight goes in the same pan as the object, and positive if it goes in the other pan.  The vector &lt;int&gt; should be arranged in increasing order.
+</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>Apothecary</td></tr><tr><td>Method:</td><td>balance</td></tr><tr><td>Parameters:</td><td>int</td></tr><tr><td>Returns:</td><td>vector &lt;int&gt;</td></tr><tr><td>Method signature:</td><td>vector &lt;int&gt; balance(int W)</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>64</td></tr></table></td></tr><tr><td colspan="2"><h3>Constraints</h3></td></tr><tr><td align="center" valign="top">-</td><td><b>W</b> is between 1 and 1000000, inclusive.</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>17</pre></td></tr></table></td></tr><tr><td><pre>Returns: { -9,  -1,  27 }</pre></td></tr><tr><td><table><tr><td colspan="2">The example above.</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>1</pre></td></tr></table></td></tr><tr><td><pre>Returns: { 1 }</pre></td></tr><tr><td><table><tr><td colspan="2">A 1-grain weight is placed in the pan opposite the object being measured.</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>2016</pre></td></tr></table></td></tr><tr><td><pre>Returns: { -243,  -9,  81,  2187 }</pre></td></tr><tr><td><table><tr><td colspan="2">A 9-grain weight and a 243-grain weight are placed in the pan with the object,
+and an 81-grain weight and a 2187-grain weight are placed in the opposite pan.</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>1000000</pre></td></tr></table></td></tr><tr><td><pre>Returns: { -531441,  -59049,  -6561,  -243,  -27,  1,  81,  729,  2187,  1594323 }</pre></td></tr><tr><td></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>
