Artifact 8837192db915bbc6c85f3af29245f08ab48dfd45
#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>
#ifdef __GNUC__
#include <ext/hash_map>
#define unordered_map __gnu_cxx::hash_map
#else
#include <unordered_map>
#endif
using namespace std;
typedef long long LL;
typedef complex<double> CMP;
class ThePalindrome { public:
int find(string s)
{
for(int i=0; i<s.size(); ++i)
if( is_palin(s + string(s.rbegin()+(s.size()-i), s.rend())) )
return i + s.size();
return s.size() * 2;
}
bool is_palin(const string& s) {
return s == string(s.rbegin(), s.rend());
}
};
// 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(_, ThePalindrome().find(s));}
int main(){
CASE(0)
string s = "abab";
int _ = 5;
END
CASE(1)
string s = "abacaba";
int _ = 7;
END
CASE(2)
string s = "qwerty";
int _ = 11;
END
CASE(3)
string s = "abdfhdyrbdbsdfghjkllkjhgfds";
int _ = 38;
END
/*
CASE(4)
string s = ;
int _ = ;
END
CASE(5)
string s = ;
int _ = ;
END
*/
}
// END CUT HERE