|
| 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 UndoHistory{ |
| 35 | + public: |
| 36 | + string longestPrefix(string s, set<string> S){ |
| 37 | + string maxs; |
| 38 | + for(string t : S) |
| 39 | + if(isPrefix(s, t) && t.size() > maxs.size()) maxs = t; |
| 40 | + return maxs; |
| 41 | + } |
| 42 | + //Returns true if t is substring of s |
| 43 | + bool isPrefix(string s, string t){ |
| 44 | + int k = t.size(); |
| 45 | + return k <= s.size() && s.substr(0, k) == t; |
| 46 | + } |
| 47 | + int minPresses(vector <string> lines){ |
| 48 | + string line, buffer; |
| 49 | + set<string> undo; |
| 50 | + int i = 0, n = lines.size(), strokes = 1; |
| 51 | + buffer.push_back(lines[0][0]); |
| 52 | + undo.insert(buffer); |
| 53 | + |
| 54 | + while(i < n){ |
| 55 | + string line = lines[i]; |
| 56 | + // cout<<"buffer = "<<buffer<<" strokes = "<<strokes<<endl; |
| 57 | + if(buffer == line){ |
| 58 | + strokes++; |
| 59 | + i++; |
| 60 | + } |
| 61 | + else { |
| 62 | + string t = longestPrefix(line, undo); |
| 63 | + if(isPrefix(line, buffer) && t.size() <= buffer.size()+2){ |
| 64 | + int m = buffer.size(); |
| 65 | + buffer.push_back(line[m]); |
| 66 | + strokes++; |
| 67 | + } |
| 68 | + else{ |
| 69 | + buffer = t; |
| 70 | + strokes += 2; |
| 71 | + } |
| 72 | + undo.insert(buffer); |
| 73 | + // cout<<"buffer = "<<buffer<<" line = "<<line<<endl; |
| 74 | + } |
| 75 | + } |
| 76 | + return strokes; |
| 77 | + } |
| 78 | + |
| 79 | + |
| 80 | +// BEGIN CUT HERE |
| 81 | + public: |
| 82 | + 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(); } |
| 83 | + private: |
| 84 | + 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(); } |
| 85 | + 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; } } |
| 86 | + void test_case_0() { string Arr0[] = {"tomorrow", "topcoder"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 18; verify_case(0, Arg1, minPresses(Arg0)); } |
| 87 | + void test_case_1() { string Arr0[] = {"a","b"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 6; verify_case(1, Arg1, minPresses(Arg0)); } |
| 88 | + void test_case_2() { string Arr0[] = {"a", "ab", "abac", "abacus" }; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 10; verify_case(2, Arg1, minPresses(Arg0)); } |
| 89 | + void test_case_3() { string Arr0[] = {"pyramid", "sphinx", "sphere", "python", "serpent"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 39; verify_case(3, Arg1, minPresses(Arg0)); } |
| 90 | + void test_case_4() { string Arr0[] = {"ba","a","a","b","ba"} |
| 91 | +; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 13; verify_case(4, Arg1, minPresses(Arg0)); } |
| 92 | + |
| 93 | +// END CUT HERE |
| 94 | + |
| 95 | +}; |
| 96 | + |
| 97 | +// BEGIN CUT HERE |
| 98 | +int main(){ |
| 99 | + |
| 100 | + UndoHistory ___test; |
| 101 | + ___test.run_test(-1); |
| 102 | +} |
| 103 | +// END CUT HERE |
0 commit comments