-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTheLargestString.cpp
158 lines (149 loc) · 3.58 KB
/
TheLargestString.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
#line 3 "TheLargestString.cpp"
#include <algorithm>
#include <stack>
#include <bitset>
#include <cassert>
#include <map>
#include <string>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
#include <cmath>
#include <limits>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define sz(x) int((x).size())
#define FOR(i,a,b) for(int (i) = (a); (i) < (b); ++(i))
#define REP(i,n) for(int (i) = 0; (i) < (n); ++(i))
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define square(a) (a)*(a)
#define mp(a,b) make_pair((a),(b))
const int oo = numeric_limits<int>::max();
class TheLargestString {
public:
string dp[48][48][2];
string s, t;
string calc(int i, int len, bool I) {
if (dp[i][len][I] != "")
return dp[i][len][I];
dp[i][len][] = make(i, i+len)
if (i + len == s.size())
return dp[i][len];
string res1 = calc(i, len-1), res2 = calc(i+1, len-1);
dp[i][len] = max(
for (int k = i; k < j; k++) {
string left = calc(i, k), right = calc(k+1, j);
dp[i][j] = max(dp[i][j], left+right);
}
return dp[i][j][n];
}
string find(string s0, string t0) {
s = s0; t = t0;
return calc(0, s.size());
}
};
// BEGIN CUT HERE
#include <ctime>
#include <cmath>
#include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
using namespace std;
int main(int argc, char* argv[])
{
if (argc == 1)
{
cout << "Testing TheLargestString (300.0 points)" << endl << endl;
for (int i = 0; i < 20; i++)
{
ostringstream s; s << argv[0] << " " << i;
int exitCode = system(s.str().c_str());
if (exitCode)
cout << "#" << i << ": Runtime Error" << endl;
}
int T = time(NULL)-1396807676;
double PT = T/60.0, TT = 75.0;
cout.setf(ios::fixed,ios::floatfield);
cout.precision(2);
cout << endl;
cout << "Time : " << T/60 << " minutes " << T%60 << " secs" << endl;
cout << "Score : " << 300.0*(.3+(.7*TT*TT)/(10.0*PT*PT+TT*TT)) << " points" << endl;
}
else
{
int _tc; istringstream(argv[1]) >> _tc;
TheLargestString _obj;
string _expected, _received;
time_t _start = clock();
switch (_tc)
{
case 0:
{
string s = "ab";
string t = "zy";
_expected = "by";
_received = _obj.find(s, t); break;
}
case 1:
{
string s = "abacaba";
string t = "zzzaaaa";
_expected = "cbaaaa";
_received = _obj.find(s, t); break;
}
case 2:
{
string s = "x";
string t = "x";
_expected = "xx";
_received = _obj.find(s, t); break;
}
case 3:
{
string s = "abbabbabbababaaaabbababab";
string t = "bababbaabbbababbbbababaab";
_expected = "bbbbbbbbbbbbbbbbbbaaab";
_received = _obj.find(s, t); break;
}
/*case 4:
{
string s = ;
string t = ;
_expected = ;
_received = _obj.find(s, t); break;
}*/
/*case 5:
{
string s = ;
string t = ;
_expected = ;
_received = _obj.find(s, t); break;
}*/
/*case 6:
{
string s = ;
string t = ;
_expected = ;
_received = _obj.find(s, t); break;
}*/
default: return 0;
}
cout.setf(ios::fixed,ios::floatfield);
cout.precision(2);
double _elapsed = (double)(clock()-_start)/CLOCKS_PER_SEC;
if (_received == _expected)
cout << "#" << _tc << ": Passed (" << _elapsed << " secs)" << endl;
else
{
cout << "#" << _tc << ": Failed (" << _elapsed << " secs)" << endl;
cout << " Expected: " << "\"" << _expected << "\"" << endl;
cout << " Received: " << "\"" << _received << "\"" << endl;
}
}
}
// END CUT HERE