#include<bits/stdc++.h>
using namespace std;
int i,j,n,m,l,r,mas[500005],a[2],rez;
vector<int> k;
vector<int>::iterator it;
char c;
int main()
{
cin.sync_with_stdio(0);
cin.tie(0);
cin >> n;
i=0;
while (i<n)
{
cin >> c;
if (c=='C')
{
mas[i]=1;
}
i++;
}
cin >> m;
i=0;
while (i<m)
{
cin >> l >> r;
l--;
r--;
j=l;
a[0]=0;
a[1]=0;
k.clear();
rez=0;
while (j<=r)
{
a[mas[j]]++;
if (a[1]<a[0])
{
a[mas[j]]--;
k.push_back(j);
rez++;
}
j++;
}
a[0]=0;
a[1]=0;
j=r;
it=k.end();
it--;
while (j>=l)
{
if (k.empty()||j!=*it)
{
a[mas[j]]++;
if (a[1]<a[0])
{
a[mas[j]]--;
rez++;
//cout << j << "\n";
}
}
else
{
k.pop_back();
it=k.end();
it--;
}
j--;
}
cout << rez << "\n";
i++;
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
376 KB |
Output is correct |
2 |
Correct |
13 ms |
496 KB |
Output is correct |
3 |
Correct |
11 ms |
612 KB |
Output is correct |
4 |
Correct |
16 ms |
712 KB |
Output is correct |
5 |
Correct |
14 ms |
712 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
376 KB |
Output is correct |
2 |
Correct |
13 ms |
496 KB |
Output is correct |
3 |
Correct |
11 ms |
612 KB |
Output is correct |
4 |
Correct |
16 ms |
712 KB |
Output is correct |
5 |
Correct |
14 ms |
712 KB |
Output is correct |
6 |
Execution timed out |
3013 ms |
1936 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
376 KB |
Output is correct |
2 |
Correct |
13 ms |
496 KB |
Output is correct |
3 |
Correct |
11 ms |
612 KB |
Output is correct |
4 |
Correct |
16 ms |
712 KB |
Output is correct |
5 |
Correct |
14 ms |
712 KB |
Output is correct |
6 |
Execution timed out |
3013 ms |
1936 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |