瞎模拟,当游戏次数大于 1W 我们可以认为游戏不能结束,(其实这题并没有不能结束的情况,我试过了 0v0)
参考代码:#include
#define Inf 0x3F3F3F3F
#define Loc freopen("baka.in", "r", stdin)
typedef long long LL;
using namespace std;
stack T;
string A, B;
map V;
int main() {
cin >> A >> B; bool F = true; int cnt = 0;
while (cnt
if (F) {
T.push(A[0]); A.erase(A.begin());
if (V[T.top()]) {
char Tmp = T.top();V[T.top()] = false;
A += T.top(); T.pop();
while (T.top() != Tmp) {
V[T.top()] = false; A += T.top(); T.pop();
}
A += T.top(); T.pop();
F = !F;
}
else
V[T.top()] = true;
}
else {
T.push(B[0]); B.erase(B.begin());
if (V[T.top()]) {
char Tmp = T.top();V[T.top()] = false;
B += T.top(); T.pop();
while (T.top() != Tmp) {
V[T.top()] = false; B += T.top(); T.pop();
}
B += T.top(); T.pop();
F = !F;
}
else
V[T.top()] = true;
}
F = !F; cnt++;
}
if (A.size() == 0) cout <
else if (B.size() == 0) cout <
else cout <
}