#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define PF push_front
#define MP make_pair
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const int maxn = 1e5 + 10;
const int mod = 1e9 + 7;
bool mark[maxn];
int main () {
int n, q;
string s;
cin >> n >> s >> q;
for (int i = 0; i < q; i++) {
memset (mark, 0, sizeof mark);
int l, r;
cin >> l >> r;
l --, r --;
int cnt = 0, cntr = 0, ans = 0;
for (int j = l; j <= r; j++) {
if (s[j] == 'C') {
if (cntr > 0) {
cntr --;
ans --;
if (cnt == -1) {
cnt ++;
ans ++;
}
}
cnt ++;
}
else {
cntr ++;
ans ++;
cnt --;
if (cnt == -1) {
cnt ++;
cntr --;
}
}
// cout << j << " -> " << cnt << " " << cntr << " " << ans << endl;
}
cout << ans << endl;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
21 ms |
504 KB |
Output is correct |
2 |
Correct |
21 ms |
508 KB |
Output is correct |
3 |
Correct |
21 ms |
508 KB |
Output is correct |
4 |
Correct |
20 ms |
584 KB |
Output is correct |
5 |
Correct |
20 ms |
660 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
21 ms |
504 KB |
Output is correct |
2 |
Correct |
21 ms |
508 KB |
Output is correct |
3 |
Correct |
21 ms |
508 KB |
Output is correct |
4 |
Correct |
20 ms |
584 KB |
Output is correct |
5 |
Correct |
20 ms |
660 KB |
Output is correct |
6 |
Execution timed out |
3034 ms |
1356 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
21 ms |
504 KB |
Output is correct |
2 |
Correct |
21 ms |
508 KB |
Output is correct |
3 |
Correct |
21 ms |
508 KB |
Output is correct |
4 |
Correct |
20 ms |
584 KB |
Output is correct |
5 |
Correct |
20 ms |
660 KB |
Output is correct |
6 |
Execution timed out |
3034 ms |
1356 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |