topcoder/HairCuts.cpp at master · Grey0202/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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
#include <iostream>
#include <cstdio>
#include <vector>
#include <cassert>
#include <sstream>
#include <set>
#include <queue>
#include <map>
#include <algorithm>
#include <time.h>
using namespace std;
/* https://www.topcoder.com/stat?c=problem_statement&pm=4721&rd=8000 */
#define SIZEOFARRAY(s) sizeof(s)/sizeof(s[0])
#define memSet(a, val) memset(a, val, sizeof(a))

class HairCuts
{
public:
	double maxCut(vector<string> enter, string lastExit);
};
void parse(const vector<string> &enter, vector<int> &out)
{
	for (int i = 0, size = enter.size(); i < size; ++i)
	{
		istringstream iss(enter[i]);
		int hr, min;
		char colon;

		iss >> hr;
		iss >> colon;
		iss >> min;
		if (hr < 9)
		{
			hr += 12;
		}
		out.push_back(hr * 60 + min);
	}
}

double getMax(vector<int> &in, double mid)
{
	double temp = 0;
	for (int i = 0, size = in.size() - 1; i < size; ++i)
	{
		if (in[i] > temp)
			temp = in[i];
		temp += mid;
	}
	return temp;
}

double HairCuts::maxCut(vector<string> enter, string lastExit)
{
	vector<int> in;
	enter.push_back(lastExit);
	parse(enter, in);
	sort(in.begin(), in.end());

	double start = 5.0;
	double end = in[in.size() - 1];
	double last = end;

	while (end - start >= 1e-13)
	{
		double mid = start + (end - start) / 2;

		if (getMax(in, mid) >= last)
			end = mid;
		else
			start = mid;
	}
	if (getMax(in, start) > last + 1e-9)
		return -1;
	return start;
}

void TEST(vector<string> enter, string lastExit, double expected)
{
	clock_t start, end;
	double cpu_time_used;

	start = clock();
	HairCuts hairCuts;

	double result = hairCuts.maxCut(enter, lastExit);

	//assert( expected - result <= 1e-9  );

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

template<class T>
vector<T> convert(T *list, int n)
{
	vector<T> ret;

	for (int i = 0; i< n; ++i)
	{
		ret.push_back(list[i]);
	}

	return ret;
}

void Test1()
{
	string test[] = {"04:22","09:00"};
	TEST(convert(test, SIZEOFARRAY(test)), "05:52", 90.0);
}

void Test2()
{
	string test[] = {"09:00","09:22","09:22"};
	TEST(convert(test, SIZEOFARRAY(test)), "10:11", 23.666666666666863);
}

void Test3()
{
	string test[] = {"09:00","04:00","04:02"};
	TEST(convert(test, SIZEOFARRAY(test)), "04:09", -1.0);
}

void Test4()
{
	string test[] = 	{"01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00", "01:00"};
	TEST(convert(test, SIZEOFARRAY(test)), "05:10", 5.0);
}

void Test5()
{
}

void Test6()
{
}

void Test7()
{
}

void Test8()
{
}

void Test9()
{
}

void Test10()
{
}

void Test11()
{
}

void Test12()
{
}

void Test13()
{
}

int main()
{
	Test1();
	Test2();
	Test3();
	Test4();
	Test5();
	Test6();
	Test7();
	Test8();
	Test9();
	Test10();
	Test11();
	Test12();
	Test13();
	cout<<"success";

	getchar();
	return 0;
}