-
Notifications
You must be signed in to change notification settings - Fork 0
/
FruitTrees.cpp
170 lines (161 loc) · 3.7 KB
/
FruitTrees.cpp
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
#line 3 "FruitTrees.cpp"
#include <algorithm>
#include <stack>
#include <bitset>
#include <cassert>
#include <map>
#include <string>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
#include <cmath>
#include <limits>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define sz(x) int((x).size())
#define FOR(i,a,b) for(int (i) = (a); (i) < (b); ++(i))
#define REP(i,n) for(int (i) = 0; (i) < (n); ++(i))
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define square(a) (a)*(a)
#define mp(a,b) make_pair((a),(b))
const int oo = numeric_limits<int>::max();
class FruitTrees {
public:
int gcd(int a, int b) {
if (a < b)
swap(a, b);
return (b == 0) ? a : gcd(b, a%b);
}
int maxDist(int apple, int kiwi, int grape) {
int maxi = 0;
for (int i = 1; i < apple; i++) {
for (int j = 1; j < apple; j++) {
if (i == j)
continue;
int mini = min(min(mm(0, i), mm(0,j)), mm(i,j));
maxi = max(maxi, mini);
}
}
return maxi;
}
};
// BEGIN CUT HERE
#include <ctime>
#include <cmath>
#include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
using namespace std;
int main(int argc, char* argv[])
{
if (argc == 1)
{
cout << "Testing FruitTrees (250.0 points)" << endl << endl;
for (int i = 0; i < 20; i++)
{
ostringstream s; s << argv[0] << " " << i;
int exitCode = system(s.str().c_str());
if (exitCode)
cout << "#" << i << ": Runtime Error" << endl;
}
int T = time(NULL)-1396818932;
double PT = T/60.0, TT = 75.0;
cout.setf(ios::fixed,ios::floatfield);
cout.precision(2);
cout << endl;
cout << "Time : " << T/60 << " minutes " << T%60 << " secs" << endl;
cout << "Score : " << 250.0*(.3+(.7*TT*TT)/(10.0*PT*PT+TT*TT)) << " points" << endl;
}
else
{
int _tc; istringstream(argv[1]) >> _tc;
FruitTrees _obj;
int _expected, _received;
time_t _start = clock();
switch (_tc)
{
case 0:
{
int apple = 1;
int kiwi = 5;
int grape = 8;
_expected = 0;
_received = _obj.maxDist(apple, kiwi, grape); break;
}
case 1:
{
int apple = 3;
int kiwi = 3;
int grape = 6;
_expected = 1;
_received = _obj.maxDist(apple, kiwi, grape); break;
}
case 2:
{
int apple = 40;
int kiwi = 30;
int grape = 20;
_expected = 5;
_received = _obj.maxDist(apple, kiwi, grape); break;
}
case 3:
{
int apple = 899;
int kiwi = 1073;
int grape = 1147;
_expected = 14;
_received = _obj.maxDist(apple, kiwi, grape); break;
}
case 4:
{
int apple = 2000;
int kiwi = 2000;
int grape = 2000;
_expected = 666;
_received = _obj.maxDist(apple, kiwi, grape); break;
}
/*case 5:
{
int apple = ;
int kiwi = ;
int grape = ;
_expected = ;
_received = _obj.maxDist(apple, kiwi, grape); break;
}*/
/*case 6:
{
int apple = ;
int kiwi = ;
int grape = ;
_expected = ;
_received = _obj.maxDist(apple, kiwi, grape); break;
}*/
/*case 7:
{
int apple = ;
int kiwi = ;
int grape = ;
_expected = ;
_received = _obj.maxDist(apple, kiwi, grape); break;
}*/
default: return 0;
}
cout.setf(ios::fixed,ios::floatfield);
cout.precision(2);
double _elapsed = (double)(clock()-_start)/CLOCKS_PER_SEC;
if (_received == _expected)
cout << "#" << _tc << ": Passed (" << _elapsed << " secs)" << endl;
else
{
cout << "#" << _tc << ": Failed (" << _elapsed << " secs)" << endl;
cout << " Expected: " << _expected << endl;
cout << " Received: " << _received << endl;
}
}
}
// END CUT HERE