Artifact c2bedd2e817bc09932ac9d9e0a34dfa057802538
#include <iostream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <iterator>
#include <complex>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;
typedef long long LL;
class Pathfinding
{
public:
int getDirections(int x, int y)
{
if( x==0 && y==0 )
return 0;
int xincr = 0;
int yincr = 0;
if(x<0) yincr=1, x=-x;
if(y<0) xincr=1, y=-y;
if( x==0 )
swap(xincr, yincr), swap(x, y);
if( y==0 )
{
if( yincr == 0 )
return x;
else
if( x%2 == 1 )
return x+2;
else
return x+4;
}
if( 0==xincr && y%2==yincr || 0==yincr && x%2==xincr )
return x+y;
if( 0==xincr && x%2==xincr || 0==yincr && y%2==yincr )
return x+y;
if( 0==xincr || 0==yincr )
return x+y+2;
if( x%2==xincr || y%2==yincr )
return x+y+2;
return x+y+4;
}
// BEGIN CUT HERE
public:
void run_test(int Case) { if ((Case == -1) || (Case == 0)) test_case_0(); if ((Case == -1) || (Case == 1)) test_case_1(); if ((Case == -1) || (Case == 2)) test_case_2(); if ((Case == -1) || (Case == 3)) test_case_3(); if ((Case == -1) || (Case == 4)) test_case_4(); }
private:
template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); }
void verify_case(int Case, const int &Expected, const int &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } }
void test_case_0() { int Arg0 = 0; int Arg1 = -4; int Arg2 = 8; verify_case(0, Arg2, getDirections(Arg0, Arg1)); }
void test_case_1() { int Arg0 = 5; int Arg1 = -4; int Arg2 = 9; verify_case(1, Arg2, getDirections(Arg0, Arg1)); }
void test_case_2() { int Arg0 = 5; int Arg1 = 4; int Arg2 = 9; verify_case(2, Arg2, getDirections(Arg0, Arg1)); }
void test_case_3() { int Arg0 = -1; int Arg1 = -4; int Arg2 = 7; verify_case(3, Arg2, getDirections(Arg0, Arg1)); }
void test_case_4() { int Arg0 = 0; int Arg1 = 0; int Arg2 = 0; verify_case(4, Arg2, getDirections(Arg0, Arg1)); }
// END CUT HERE
};
// BEGIN CUT HERE
int main() { Pathfinding().run_test(-1); }
// END CUT HERE