topcoder/QuickSums.cpp at master · arshdeep/topcoder · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
#include <iostream>
#include <cstdio>
#include <vector>
#include <cassert>
#include <sstream>
#include <set>
#include <unordered_map>
#include <map>
#include <algorithm>
#include <time.h>
using namespace std;
/* QuickSums https://www.topcoder.com/stat?c=problem_statement&pm=2829&rd=5072 */

class QuickSums
{
private:
	int parseInt(string str);
	string normalizeIntString(string str);
public:
	int minSums(string numbers, int sum);
};

int QuickSums::parseInt(string str)
{
	istringstream ss(str);
	int ret;

	ss >> ret;

	return ret;
}

string QuickSums::normalizeIntString(string str)
{
	istringstream ss(str);
	__int64 ret;

	ss >> ret;
	stringstream ss2;

	ss2 << ret;
	return ss2.str();
}

#define MAXSUM 100
int QuickSums::minSums(string numbers, int sum)
{
	numbers = normalizeIntString(numbers);
	int len = numbers.length();
	int dp[10][10][101];

	for (int i = 0; i < len; ++i)
	{
		for (int j = 0; j < len; ++j)
		{
			for (int k = 0; k <= sum; ++k)
				dp[i][j][k] = INT_MAX;
		}
	}

	for (int idx = 0; idx < len; ++idx)
	{
		dp[idx][idx][parseInt(numbers.substr(idx, 1))] = 0;
	}

	for (int gap = 1; gap < len; ++gap)
	{
		for (int i = 0, j = gap; j < len; ++i, ++j)
		{
			int v = parseInt(numbers.substr(i, j - i + 1));
			if (v  > 0 && v < sum)
				dp[i][j][v] = 0;
			for (int k = i; k < j; ++k)
			{
				for (int s1 = 0; s1 < sum; ++s1)
				{
					for (int s2 = 0; s2 + s1 <= sum; ++s2)
					{
						if (dp[i][k][s1] < INT_MAX && dp[k + 1][j][s2] < INT_MAX)
							dp[i][j][s1 + s2] = std::min(dp[i][j][s1 + s2], dp[i][k][s1] + dp[k + 1][j][s2] + 1);
					}
				}
			}
		}
	}

	return dp[0][len-1][sum] < INT_MAX ? dp[0][len-1][sum] : -1;
}

void TEST(string numbers, int sum, int expected)
{
	clock_t start, end;
	double cpu_time_used;

	start = clock();
	QuickSums quickSums;

	int result = quickSums.minSums( numbers, sum);

	assert( result == expected );

	end = clock();
	cpu_time_used = ((double) (end - start));
	cout<<"Time taken : "<<cpu_time_used<<endl;
}


void Test1()
{
	TEST("99999", 45, 4);
	TEST("382834", 100, 2);
	TEST("99999", 100, -1);
	TEST("9230560001", 71, 4);
	TEST("0123456789", 45, 8);
	TEST("0000000001", 1, 0);
	TEST("8833614925", 100, -1);
	TEST("1", 1, 0);
	TEST("1000000001", 2, 1);
	TEST("1000000001", 11, 1);
	TEST("0220120200", 63, 4);
}

void Test2()
{

}

void Test3()
{

}

void Test4()
{

}

void Test5()
{

}

void Test6()
{

}

int main()
{
	Test1();
	Test2();
	Test3();
	Test4();
	Test5();
	Test6();

	cout<<"success";

	getchar();
	return 0;
}