-
Notifications
You must be signed in to change notification settings - Fork 5
/
BearPasswordLexic.cpp
205 lines (163 loc) · 5.13 KB
/
BearPasswordLexic.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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
// BEGIN CUT HERE
/*
SRM 695 Div1 Easy (300)
問題
-文字aまたはbだけからなるN文字のパスワードSを作る
-Sの同じ文字が連続する部分を取り出したものを部分文字列とする
-異なる位置からはじまる部分文字列は異なるものとする
-長さがi+1の部分文字列の個数が配列x[i]として与えられる
-条件を満たす文字列のうち辞書順最小のものを求める
*/
// END CUT HERE
#include <algorithm>
#include <string>
#include <vector>
#include <iostream>
#include <sstream>
#include <cstring>
using namespace std;
typedef vector<int> IntVec;
class BearPasswordLexic {
public:
string findPassword(vector <int> x) {
int N = (int)x.size();
int len = 0;
for (int i = N - 1; i >= 0; --i) {
for (int j = i + 1; j < N; ++j) {
x[i] -= x[j] * (j - i + 1);
}
len += (i + 1) * x[i];
if (x[i] < 0) {
return "";
}
}
if (len != N) {
return "";
}
string ans;
int high = N - 1, low = 0;
bool f = true;
while (ans.length() != N) {
while (high > 0 && x[high] <= 0) {
--high;
}
if (x[high]-- > 0) {
ans += string(high + 1, f ? 'a' : 'b');
f = !f;
}
while (low < (N - 1) && x[low] <= 0) {
++low;
}
if (x[low]-- > 0) {
ans += string(low + 1, f ? 'a' : 'b');
f = !f;
}
}
return ans;
}
// BEGIN CUT HERE
private:
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(); }
void verify_case(int Case, const string &Expected, const string &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } }
public:
void run_test(int Case) {
int n = 0;
// test_case_0
if ((Case == -1) || (Case == n)){
int Arr0[] = {5,0,0,0,0};
string Arg1 = "ababa";
vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, findPassword(Arg0));
}
n++;
// test_case_1
if ((Case == -1) || (Case == n)){
int Arr0[] = {4,2,1,0};
string Arg1 = "aaab";
vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, findPassword(Arg0));
}
n++;
// test_case_2
if ((Case == -1) || (Case == n)){
int Arr0[] = {3,1,1};
string Arg1 = "";
vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, findPassword(Arg0));
}
n++;
// test_case_3
if ((Case == -1) || (Case == n)){
int Arr0[] = {4,3,2,1};
string Arg1 = "aaaa";
vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, findPassword(Arg0));
}
n++;
// test_case_4
if ((Case == -1) || (Case == n)){
int Arr0[] = {0};
string Arg1 = "";
vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, findPassword(Arg0));
}
n++;
// test_case_5
if ((Case == -1) || (Case == n)){
int Arr0[] = {4,0,3,2};
string Arg1 = "";
vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, findPassword(Arg0));
}
n++;
if ((Case == -1) || (Case == n)) {
int Arr0[] = { 8,5,3,1,0,0,0,0 };
string Arg1 = "aaaabaaa";
vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, findPassword(Arg0));
}
n++;
if ((Case == -1) || (Case == n)) {
int Arr0[] = { 10,6,4,2,1,0,0,0,0,0 };
string Arg1 = "aaaaabaaab";
vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, findPassword(Arg0));
}
n++;
if ((Case == -1) || (Case == n)) {
int Arr0[] = { 7,5,3,1,0,0,0 };
string Arg1 = "aaaabbb";
vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, findPassword(Arg0));
}
n++;
if ((Case == -1) || (Case == n)) {
int Arr0[] = { 50,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 };
string Arg1 = "ababababababababababababababababababababababababab";
vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, findPassword(Arg0));
}
n++;
if ((Case == -1) || (Case == n)) {
int Arr0[] = { 50,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 };
string Arg1 = "aababababababababababababababababababababababababa";
vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, findPassword(Arg0));
}
n++;
if ((Case == -1) || (Case == n)) {
int Arr0[] = { 50,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 };
string Arg1 = "aabaababababababababababababababababababababababab";
vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, findPassword(Arg0));
}
n++;
}
// END CUT HERE
};
// BEGIN CUT HERE
int main() {
BearPasswordLexic ___test;
___test.run_test(-1);
}
// END CUT HERE