another srm

Author: esulaimanov

CMakeLists.txt

@@ -1,4 +1,4 @@
 cmake_minimum_required(VERSION 3.12)
 project(topcoder)
-add_executable(topcoder OverallScores.cpp)
+add_executable(topcoder DivideLoot.cpp)
 ADD_DEFINITIONS(-std=c++11)

DivideLoot.cpp

@@ -0,0 +1,163 @@
+#include <vector>
+#include <list>
+#include <map>
+#include <set>
+#include <queue>
+#include <deque>
+#include <stack>
+#include <bitset>
+#include <algorithm>
+#include <functional>
+#include <numeric>
+#include <utility>
+#include <sstream>
+#include <iostream>
+#include <iomanip>
+#include <cstdio>
+#include <cmath>
+#include <cstdlib>
+#include <ctime>
+
+using namespace std;
+
+
+class DivideLoot {
+public:
+	string verify(int N, vector <int> loot) {
+		int sum = accumulate(loot.begin(),loot.end(),0);
+		if (sum % N != 0){
+		    return "impossible";
+		}
+		int d = sum / N;
+
+		multiset<int> m(loot.begin(),loot.end());
+
+        while (m.count(d)){
+            m.erase(d);
+        }
+
+        for (int i = 1; i <= d; ++i) {
+            while (m.count(i) && m.count(d - i)){
+                m.erase(i);
+                m.erase(d - i);
+            }
+        }
+        if (m.empty()){
+            return "possible";
+        }
+        return "impossible";
+	}
+};
+
+
+// BEGIN KAWIGIEDIT TESTING
+// Generated by KawigiEdit 2.1.4 (beta) modified by pivanof
+bool KawigiEdit_RunTest(int testNum, int p0, vector <int> p1, bool hasAnswer, string p2) {
+	cout << "Test " << testNum << ": [" << p0 << "," << "{";
+	for (int i = 0; int(p1.size()) > i; ++i) {
+		if (i > 0) {
+			cout << ",";
+		}
+		cout << p1[i];
+	}
+	cout << "}";
+	cout << "]" << endl;
+	DivideLoot *obj;
+	string answer;
+	obj = new DivideLoot();
+	clock_t startTime = clock();
+	answer = obj->verify(p0, p1);
+	clock_t endTime = clock();
+	delete obj;
+	bool res;
+	res = true;
+	cout << "Time: " << double(endTime - startTime) / CLOCKS_PER_SEC << " seconds" << endl;
+	if (hasAnswer) {
+		cout << "Desired answer:" << endl;
+		cout << "\t" << "\"" << p2 << "\"" << endl;
+	}
+	cout << "Your answer:" << endl;
+	cout << "\t" << "\"" << answer << "\"" << endl;
+	if (hasAnswer) {
+		res = answer == p2;
+	}
+	if (!res) {
+		cout << "DOESN'T MATCH!!!!" << endl;
+	} else if (double(endTime - startTime) / CLOCKS_PER_SEC >= 2) {
+		cout << "FAIL the timeout" << endl;
+		res = false;
+	} else if (hasAnswer) {
+		cout << "Match :-)" << endl;
+	} else {
+		cout << "OK, but is it right?" << endl;
+	}
+	cout << "" << endl;
+	return res;
+}
+int main() {
+	bool all_right;
+	all_right = true;
+	
+	int p0;
+	vector <int> p1;
+	string p2;
+	
+	{
+	// ----- test 0 -----
+	p0 = 1;
+	int t1[] = {47};
+			p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
+	p2 = "possible";
+	all_right = KawigiEdit_RunTest(0, p0, p1, true, p2) && all_right;
+	// ------------------
+	}
+	
+	{
+	// ----- test 1 -----
+	p0 = 3;
+	int t1[] = {10,8,10,1,1};
+			p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
+	p2 = "impossible";
+	all_right = KawigiEdit_RunTest(1, p0, p1, true, p2) && all_right;
+	// ------------------
+	}
+	
+	{
+	// ----- test 2 -----
+	p0 = 3;
+	int t1[] = {3,9,10,7,1};
+			p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
+	p2 = "possible";
+	all_right = KawigiEdit_RunTest(2, p0, p1, true, p2) && all_right;
+	// ------------------
+	}
+	
+	{
+	// ----- test 3 -----
+	p0 = 6;
+	int t1[] = {1,1,1,2,1,1,1,1,1,1,1};
+			p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
+	p2 = "possible";
+	all_right = KawigiEdit_RunTest(3, p0, p1, true, p2) && all_right;
+	// ------------------
+	}
+	
+	{
+	// ----- test 4 -----
+	p0 = 2;
+	int t1[] = {40,1,42};
+			p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
+	p2 = "impossible";
+	all_right = KawigiEdit_RunTest(4, p0, p1, true, p2) && all_right;
+	// ------------------
+	}
+	
+	if (all_right) {
+		cout << "You're a stud (at least on the example cases)!" << endl;
+	} else {
+		cout << "Some of the test cases had errors." << endl;
+	}
+	return 0;
+}
+// END KAWIGIEDIT TESTING
+//Powered by KawigiEdit 2.1.4 (beta) modified by pivanof!