This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
const int maxn = 500005;
int n;
string s;
int main()
{
cin >> n >> s;
s = '#' + s;
int q;
cin >> q;
while (q--)
{
int l, r;
cin >> l >> r;
vector<bool> gone(n + 5, false);
int c = 0;
int t = 0;
for (int i = l; i <= r; ++i)
{
if (s[i] == 'C')
{
c++;
}
else
{
if (t + 1 <= c)
{
++t;
}
else
{
gone[i] = true;
}
}
}
c = 0;
t = 0;
for (int i = r; i >= l; --i)
{
if (s[i] == 'C')
{
++c;
}
else if (gone[i] == false)
{
if (t + 1 <= c)
{
++t;
}
else
{
gone[i] = true;
}
}
}
int ans = 0;
for (int i = l; i <= r; ++i)
{
ans += gone[i];
}
cout << ans << '\n';
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |