-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1896B.cpp
More file actions
71 lines (55 loc) · 1.09 KB
/
Copy path1896B.cpp
File metadata and controls
71 lines (55 loc) · 1.09 KB
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
#include <bits/stdc++.h>
#define ll long long
using namespace std;
void ABCounter (string s, ll& n, ll& a, ll& b);
int main () {
ll t;
cin >> t;
while (t--) {
ll n;
cin >> n;
string s;
cin >> s;
ll a = 0, b = 0;
ABCounter(s, n, a, b);
if(a == 0 || b == 0) {
cout << 0 << endl;
} else if (a == 1 && s.find('A') == n-1) {
cout << 0 << endl;
} else if (b == 1 && s.find('B') == 0) {
cout << 0 << endl;
} else {
vector <ll> v;
ll res = 0, l = 0, r = n-1;
while (l < n && s[l] == 'B') {
l++;
}
while(r >= 0 && s[r] == 'A') {
r--;
}
if (l > r) {
cout << 0 << endl;
continue;
}
for (ll i = l; i <= r; i++) {
if (s[i] == 'A') {
v.push_back(i);
}
}
for (ll i = 0; i < v.size()-1; i++) {
res += (v[i+1] - v[i]);
}
res += (r - v[v.size()-1]);
cout << res << endl;
}
}
}
void ABCounter (string s, ll& n, ll& a, ll& b) {
for (ll i = 0; i < n; i++) {
if (s[i] == 'A') {
a++;
} else if (s[i] == 'B') {
b++;
}
}
}