baoshuo/OI-codes
baoshuo/OI-codes
0
1
Fork 0
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-27 14:56:27 +00:00
Code Releases Activity

T258621 [Aya Round 1 F] 琪露诺的选择题

Browse Source 
https://www.luogu.com.cn/record/82821621
This commit is contained in:
Baoshuo Ren 2022-08-07 16:24:06 +08:00
parent 2e465457b6
commit dc1c7f7f4c
Signed by: baoshuo
GPG Key ID: 00CB9680AB29F51A
1 changed files with 108 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

108
Luogu/T258621/T258621.cpp Normal file
View File

@ -0,0 +1,108 @@
#include <iostream>
#include <algorithm>
#include <string>
using std::cin;
using std::cout;
const char endl = '\n';
int t, n, a, e;
std::string s;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> t;
while (t--) {
cin >> n >> a >> e >> s;
int cnt = std::count(s.begin(), s.end(), 'A');
if (a > cnt) {
if (a - cnt > e || (e - (a - cnt)) % 2) {
cout << -1 << endl;
} else {
int cnt1 = e - (a - cnt) >> 1,
cnt2 = (a - cnt) + (e - (a - cnt) >> 1);
for (char c : s) {
if (c == 'A') {
if (cnt1 > 0) {
cout << 'B';
cnt1--;
} else {
cout << 'A';
}
} else { // c == 'B'
if (cnt2 > 0) {
cout << 'A';
cnt2--;
} else {
cout << 'B';
}
}
}
cout << endl;
}
} else if (a == cnt) {
if (e & 1) {
cout << -1 << endl;
} else {
int cnt1 = e >> 1,
cnt2 = e >> 1;
for (char c : s) {
if (c == 'A') {
if (cnt1 > 0) {
cout << 'B';
cnt1--;
} else {
cout << 'A';
}
} else { // c == 'B'
if (cnt2 > 0) {
cout << 'A';
cnt2--;
} else {
cout << 'B';
}
}
}
cout << endl;
}
} else { // a < cnt
if (cnt - a > e || (e - (cnt - a)) % 2) {
cout << -1 << endl;
} else {
int cnt1 = (cnt - a) + (e - (cnt - a) >> 1),
cnt2 = e - (cnt - a) >> 1;
for (char c : s) {
if (c == 'A') {
if (cnt1 > 0) {
cout << 'B';
cnt1--;
} else {
cout << 'A';
}
} else { // c == 'B'
if (cnt2 > 0) {
cout << 'A';
cnt2--;
} else {
cout << 'B';
}
}
}
cout << endl;
}
}
}
return 0;
}