|
| 1 | +#include <iostream> |
| 2 | +#include <sstream> |
| 3 | +#include <vector> |
| 4 | +#include <algorithm> |
| 5 | +#include <set> |
| 6 | +#include <map> |
| 7 | +#include <queue> |
| 8 | +#include <cstring> |
| 9 | +#include <climits> |
| 10 | +#include <cstdio> |
| 11 | +using namespace std; |
| 12 | +typedef pair<int,int> pi; |
| 13 | +typedef set<int> si; |
| 14 | +typedef vector<int> vi; |
| 15 | +typedef vector<vi> vvi; |
| 16 | +typedef vector<string> vs; |
| 17 | +typedef long long ll; |
| 18 | +#define sz size() |
| 19 | +#define mp(x, y) make_pair(x, y) |
| 20 | +#define ri(a, b) for(int i=((int)(a)); i < ((int)(b)); i++) // i -> [a, b) |
| 21 | +#define rie(a, b) for(int i=((int)(a)); i <= ((int)(b)); i++) // i -> [a, b] |
| 22 | +#define rj(a, b) for(int j=((int)(a)); j < ((int)(b)); j++) // j -> [a, b) |
| 23 | +#define rje(a, b) for(int j=((int)(a)); j <= ((int)(b)); j++) // j -> [a, b] |
| 24 | +#define rk(a, b) for(int k=((int)(a)); k < ((int)(b)); k++) // k -> [a, b) |
| 25 | +#define rke(a, b) for(int k=((int)(a)); k <= ((int)(b)); k++) // k -> [a, b] |
| 26 | +#define fi(b) for(int i=0; i < ((int)(b)); i++) // i -> [0, b) |
| 27 | +#define fie(b) for(int i=0; i <= ((int)(b)); i++) // i -> [0, b] |
| 28 | +#define fj(b) for(int j=0; j < ((int)(b)); j++) // j -> [0, b) |
| 29 | +#define fje(b) for(int j=0; j <= ((int)(b)); j++) // j -> [0, b] |
| 30 | +#define fk(b) for(int k=0; k < ((int)(b)); k++) // k -> [0, b) |
| 31 | +#define fke(b) for(int k=0; k < ((int)(b)); k++) // k -> [0, b] |
| 32 | +#define fle(b) for(int l=0; l <= ((int)(b)); l++) // l -> [0, b] |
| 33 | + |
| 34 | +class TaroFriends{ |
| 35 | + public: |
| 36 | + |
| 37 | + int getNumber(vector <int> coordinates, int X){ |
| 38 | + int n = coordinates.size(); |
| 39 | + sort(coordinates.begin(), coordinates.end()); |
| 40 | + int a = coordinates[0], b = coordinates[n-1]; |
| 41 | + int delta = b-a; |
| 42 | + if(n == 2) return min(delta, abs(delta - 2*X)); |
| 43 | + fi(n-1){ |
| 44 | + int y = max(b-X, coordinates[i]+X), x = min(a+X, coordinates[i+1]-X); |
| 45 | + delta = min(delta, y-x); |
| 46 | + } |
| 47 | + return delta; |
| 48 | + } |
| 49 | + |
| 50 | + |
| 51 | +// BEGIN CUT HERE |
| 52 | + public: |
| 53 | + 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(); if ((Case == -1) || (Case == 5)) test_case_5(); } |
| 54 | + private: |
| 55 | + 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(); } |
| 56 | + 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; } } |
| 57 | + void test_case_0() { int Arr0[] = {-3, 0, 1}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 3; int Arg2 = 3; verify_case(0, Arg2, getNumber(Arg0, Arg1)); } |
| 58 | + void test_case_1() { int Arr0[] = {4, 7, -7}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 5; int Arg2 = 4; verify_case(1, Arg2, getNumber(Arg0, Arg1)); } |
| 59 | + void test_case_2() { int Arr0[] = {-100000000, 100000000}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 100000000; int Arg2 = 0; verify_case(2, Arg2, getNumber(Arg0, Arg1)); } |
| 60 | + void test_case_3() { int Arr0[] = {3, 7, 4, 6, -10, 7, 10, 9, -5}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 7; int Arg2 = 7; verify_case(3, Arg2, getNumber(Arg0, Arg1)); } |
| 61 | + void test_case_4() { int Arr0[] = {-4, 0, 4, 0}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 4; int Arg2 = 4; verify_case(4, Arg2, getNumber(Arg0, Arg1)); } |
| 62 | + void test_case_5() { int Arr0[] = {7}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 0; int Arg2 = 0; verify_case(5, Arg2, getNumber(Arg0, Arg1)); } |
| 63 | + |
| 64 | +// END CUT HERE |
| 65 | + |
| 66 | +}; |
| 67 | + |
| 68 | +// BEGIN CUT HERE |
| 69 | +int main(){ |
| 70 | + |
| 71 | + TaroFriends ___test; |
| 72 | + ___test.run_test(-1); |
| 73 | +} |
| 74 | +// END CUT HERE |
0 commit comments