int run_test_case( int casenum__ ) {
long long starttime__ = get_time();
switch( casenum__ ) {
case 0: {
int pos[] = {0,1,1};
int expected__ = 1;
return verify_case( casenum__, starttime__, expected__, CubeAnts().getMinimumSteps( vector <int>( pos, pos + ( sizeof pos / sizeof(int) ) ) ) );
}
case 1: {
int pos[] = {5,4};
int expected__ = 2;
return verify_case( casenum__, starttime__, expected__, CubeAnts().getMinimumSteps( vector <int>( pos, pos + ( sizeof pos / sizeof(int) ) ) ) );
}
case 2: {
int pos[] = {0};
int expected__ = 0;
return verify_case( casenum__, starttime__, expected__, CubeAnts().getMinimumSteps( vector <int>( pos, pos + ( sizeof pos / sizeof(int) ) ) ) );
}
case 3: {
int pos[] = {6,1,6};
int expected__ = 3;
return verify_case( casenum__, starttime__, expected__, CubeAnts().getMinimumSteps( vector <int>( pos, pos + ( sizeof pos / sizeof(int) ) ) ) );
}
case 4: {
int pos[] = {7,7,3,3,7,7,3,3};
int expected__ = 2;
return verify_case( casenum__, starttime__, expected__, CubeAnts().getMinimumSteps( vector <int>( pos, pos + ( sizeof pos / sizeof(int) ) ) ) );
}
// custom cases
/*
case 5: {
int pos[] = ;
int expected__ = ;
return verify_case( casenum__, starttime__, expected__, CubeAnts().getMinimumSteps( vector <int>( pos, pos + ( sizeof pos / sizeof(int) ) ) ) );
}
*/
/*
case 6: {
int pos[] = ;
int expected__ = ;
return verify_case( casenum__, starttime__, expected__, CubeAnts().getMinimumSteps( vector <int>( pos, pos + ( sizeof pos / sizeof(int) ) ) ) );
}
*/
/*
case 7: {
int pos[] = ;
int expected__ = ;
return verify_case( casenum__, starttime__, expected__, CubeAnts().getMinimumSteps( vector <int>( pos, pos + ( sizeof pos / sizeof(int) ) ) ) );
}
*/
default:
return -1;
}
}
int run_test_case(int casenum__) {
switch (casenum__) {
case 0: {
int pos[] = {0,1,1};
int expected__ = 1;
clock_t start__ = clock();
int received__ = CubeAnts().getMinimumSteps(vector <int>(pos, pos + (sizeof pos / sizeof pos[0])));
return verify_case(casenum__, expected__, received__, clock()-start__);
}
case 1: {
int pos[] = {5,4};
int expected__ = 2;
clock_t start__ = clock();
int received__ = CubeAnts().getMinimumSteps(vector <int>(pos, pos + (sizeof pos / sizeof pos[0])));
return verify_case(casenum__, expected__, received__, clock()-start__);
}
case 2: {
int pos[] = {0};
int expected__ = 0;
clock_t start__ = clock();
int received__ = CubeAnts().getMinimumSteps(vector <int>(pos, pos + (sizeof pos / sizeof pos[0])));
return verify_case(casenum__, expected__, received__, clock()-start__);
}
case 3: {
int pos[] = {6,1,6};
int expected__ = 3;
clock_t start__ = clock();
int received__ = CubeAnts().getMinimumSteps(vector <int>(pos, pos + (sizeof pos / sizeof pos[0])));
return verify_case(casenum__, expected__, received__, clock()-start__);
}
case 4: {
int pos[] = {7,7,3,3,7,7,3,3};
int expected__ = 2;
clock_t start__ = clock();
int received__ = CubeAnts().getMinimumSteps(vector <int>(pos, pos + (sizeof pos / sizeof pos[0])));
return verify_case(casenum__, expected__, received__, clock()-start__);
}
// custom cases
/* case 5: {
int pos[] = ;
int expected__ = ;
clock_t start__ = clock();
int received__ = CubeAnts().getMinimumSteps(vector <int>(pos, pos + (sizeof pos / sizeof pos[0])));
return verify_case(casenum__, expected__, received__, clock()-start__);
}*/
/* case 6: {
int pos[] = ;
int expected__ = ;
clock_t start__ = clock();
int received__ = CubeAnts().getMinimumSteps(vector <int>(pos, pos + (sizeof pos / sizeof pos[0])));
return verify_case(casenum__, expected__, received__, clock()-start__);
}*/
/* case 7: {
int pos[] = ;
int expected__ = ;
clock_t start__ = clock();
int received__ = CubeAnts().getMinimumSteps(vector <int>(pos, pos + (sizeof pos / sizeof pos[0])));
return verify_case(casenum__, expected__, received__, clock()-start__);
}*/
default:
return -1;
}
}
