Artifact 12f642c106b5741226ecef1c3ca8768d06678d13
#include <iostream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <iterator>
#include <functional>
#include <complex>
#include <queue>
#include <stack>
#include <cmath>
#include <cassert>
#include <cstring>
using namespace std;
typedef long long LL;
typedef complex<double> CMP;
class NinePuzzle { public:
int getMinimumCost(string init, string goal)
{
multiset<char> s;
for(int i=0; i<init.size(); ++i)
s.insert( init[i] );
int cnt = 0;
for(int i=0; i<goal.size(); ++i)
if( s.count(goal[i]) )
s.erase( s.find(goal[i]) );
else
++cnt;
return cnt;
}
};
// BEGIN CUT HERE
#include <ctime>
double start_time; string timer()
{ ostringstream os; os << " (" << int((clock()-start_time)/CLOCKS_PER_SEC*1000) << " msec)"; return os.str(); }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v)
{ os << "{ ";
for(typename vector<T>::const_iterator it=v.begin(); it!=v.end(); ++it)
os << '\"' << *it << '\"' << (it+1==v.end() ? "" : ", "); os << " }"; return os; }
void verify_case(const int& Expected, const int& Received) {
bool ok = (Expected == Received);
if(ok) cerr << "PASSED" << timer() << endl; else { cerr << "FAILED" << timer() << endl;
cerr << "\to: \"" << Expected << '\"' << endl << "\tx: \"" << Received << '\"' << endl; } }
#define CASE(N) {cerr << "Test Case #" << N << "..." << flush; start_time=clock();
#define END verify_case(_, NinePuzzle().getMinimumCost(init, goal));}
int main(){
CASE(0)
string init = "BG*YRGRRYR" ;
string goal = "BGGY*YRRRR" ;
int _ = 0;
END
CASE(1)
string init = "GBBB*BGBBG" ;
string goal = "RYYY*YRYYR";
int _ = 9;
END
CASE(2)
string init = "RRBR*BRBBB" ;
string goal = "BBRB*RBRRR" ;
int _ = 1;
END
/*
CASE(3)
string init = ;
string goal = ;
int _ = ;
END
CASE(4)
string init = ;
string goal = ;
int _ = ;
END
*/
}
// END CUT HERE