#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int>v(n + 1);
for(int i = 1;i <= n;++i){
char c;
cin >> c;
if(c == 'T')v[i] = 1;
else v[i] = 0;
}
int q;
cin >> q;
while(q--){
int l, r, o = 0, z = 0, res = 0;
cin >> l >> r;
vector<int>vv = v;
for(int i = l;i <= r;++i){
o += (vv[i] == 1);
z += (vv[i] == 0);
if(o > z){
o--;
res++;
vv[i] = -1;
}
}
o = 0, z = 0;
for(int i = r;i >= l;--i){
o += (vv[i] == 1);
z += (vv[i] == 0);
if(o > z){
o--;
res++;
vv[i] = -1;
}
}
cout << res << '\n';
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
340 KB |
Output is correct |
2 |
Correct |
9 ms |
340 KB |
Output is correct |
3 |
Correct |
12 ms |
312 KB |
Output is correct |
4 |
Correct |
9 ms |
340 KB |
Output is correct |
5 |
Correct |
9 ms |
304 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
340 KB |
Output is correct |
2 |
Correct |
9 ms |
340 KB |
Output is correct |
3 |
Correct |
12 ms |
312 KB |
Output is correct |
4 |
Correct |
9 ms |
340 KB |
Output is correct |
5 |
Correct |
9 ms |
304 KB |
Output is correct |
6 |
Execution timed out |
3084 ms |
1916 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
340 KB |
Output is correct |
2 |
Correct |
9 ms |
340 KB |
Output is correct |
3 |
Correct |
12 ms |
312 KB |
Output is correct |
4 |
Correct |
9 ms |
340 KB |
Output is correct |
5 |
Correct |
9 ms |
304 KB |
Output is correct |
6 |
Execution timed out |
3084 ms |
1916 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |