// BEGIN CUT HERE
void main( int argc, char* argv[] ) {
{
int XSARRAY[] = {1,2,3,4};
vector <int> XS( XSARRAY, XSARRAY+ARRSIZE(XSARRAY) );
int YSARRAY[] = {10,5,3,5};
vector <int> YS( YSARRAY, YSARRAY+ARRSIZE(YSARRAY) );
PilingRectsDiv1 theObject;
eq(0, theObject.getmax(2, XS, YS, 0, 0, 1, 0, 0, 1),14LL);
}
{
int XSARRAY[] = {7,7};
vector <int> XS( XSARRAY, XSARRAY+ARRSIZE(XSARRAY) );
int YSARRAY[] = {4,4};
vector <int> YS( YSARRAY, YSARRAY+ARRSIZE(YSARRAY) );
PilingRectsDiv1 theObject;
eq(1, theObject.getmax(2, XS, YS, 9, 0, 10, 2, 7, 9),56LL);
}
{
int XSARRAY[] = {5,6,9,10,4,7};
vector <int> XS( XSARRAY, XSARRAY+ARRSIZE(XSARRAY) );
int YSARRAY[] = {9,5,8,6,8,7};
vector <int> YS( YSARRAY, YSARRAY+ARRSIZE(YSARRAY) );
PilingRectsDiv1 theObject;
eq(2, theObject.getmax(3, XS, YS, 0, 0, 1, 0, 0, 1),69LL);
}
{
int XSARRAY[] = {1000000000};
vector <int> XS( XSARRAY, XSARRAY+ARRSIZE(XSARRAY) );
int YSARRAY[] = {1000000000};
vector <int> YS( YSARRAY, YSARRAY+ARRSIZE(YSARRAY) );
PilingRectsDiv1 theObject;
//eq(3, theObject.getmax(10000, XS, YS, 93827162, 91238127, 98231267, 92138287, 98563732, 99381279),1240119561532788LL);
}
{
int XSARRAY[] = {375,571,973,896,460,930,583,530,657,590};
vector <int> XS( XSARRAY, XSARRAY+ARRSIZE(XSARRAY) );
int YSARRAY[] = {284,37,994,699,941,745,166,884,270,708};
vector <int> YS( YSARRAY, YSARRAY+ARRSIZE(YSARRAY) );
PilingRectsDiv1 theObject;
eq(4, theObject.getmax(5, XS, YS, 428, 1000, 788, 851, 125, 894),420515LL);
}
{
int XSARRAY[] = {898,579,465,665,875,391,583,901,326,133,656,562,701,707,492,617,455,441,382,952,689,656,334,877,120,318,497,25,569,962,845,562,632,898,882,498,595,889,382,507,791,548,810,606,105,869,569,970,322,974};
vector <int> XS( XSARRAY, XSARRAY+ARRSIZE(XSARRAY) );
int YSARRAY[] = {83,18,492,27,339,622,851,915,464,347,287,210,282,166,976,167,968,769,14,383,454,983,319,165,185,315,795,851,124,287,846,745,19,639,894,828,540,420,147,452,501,670,466,554,166,1,446,808,508,172};
vector <int> YS( YSARRAY, YSARRAY+ARRSIZE(YSARRAY) );
PilingRectsDiv1 theObject;
eq(5, theObject.getmax(34734, XS, YS, 569, 185, 285, 741, 304, 296),10050LL);
}
}
bool KawigiEdit_RunTest(int testNum, int p0, vector <int> p1, vector <int> p2, int p3, int p4, int p5, int p6, int p7, int p8, bool hasAnswer, long long p9) {
cout << "Test " << testNum << ": [" << p0 << "," << "{";
for (int i = 0; int(p1.size()) > i; ++i) {
if (i > 0) {
cout << ",";
}
cout << p1[i];
}
cout << "}" << "," << "{";
for (int i = 0; int(p2.size()) > i; ++i) {
if (i > 0) {
cout << ",";
}
cout << p2[i];
}
cout << "}" << "," << p3 << "," << p4 << "," << p5 << "," << p6 << "," << p7 << "," << p8;
cout << "]" << endl;
PilingRectsDiv1 *obj;
long long answer;
obj = new PilingRectsDiv1();
clock_t startTime = clock();
answer = obj->getmax(p0, p1, p2, p3, p4, p5, p6, p7, p8);
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" << p9 << endl;
}
cout << "Your answer:" << endl;
cout << "\t" << answer << endl;
if (hasAnswer) {
res = answer == p9;
}
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;
}
bool do_test(int N, vector<int> XS, vector<int> YS, int XA, int XB, int XC, int YA, int YB, int YC, long long __expected) {
time_t startClock = clock();
PilingRectsDiv1 *instance = new PilingRectsDiv1();
long long __result = instance->getmax(N, XS, YS, XA, XB, XC, YA, YB, YC);
double elapsed = (double)(clock() - startClock) / CLOCKS_PER_SEC;
delete instance;
if (__result == __expected) {
cout << "PASSED!" << " (" << elapsed << " seconds)" << endl;
return true;
}
else {
cout << "FAILED!" << " (" << elapsed << " seconds)" << endl;
cout << " Expected: " << to_string(__expected) << endl;
cout << " Received: " << to_string(__result) << endl;
return false;
}
}
