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;
int main() {
int N, Q;
string V;
vector<vector<int>> vp;
cin >> N >> V >> Q;
for(int i=0;i<Q;i++) {
int L, R;
cin >> L >> R;
vp.push_back({L, R});
}
for(int i=0; i<(int)vp.size(); i++) {
string subV = V.substr(vp[i][0]-1, vp[i][1]-vp[i][0]+1);
int cv = 0, cvd = 0, tv = 0, tvd = 0, nulled = 0, nulledd = 0;
for(int j=0;j<(int)subV.size();j++) {
if(subV[j] == 'T' && cv == tv) nulled++;
else if (subV[j] == 'C') cv++;
else tv++;
if(subV[subV.size()-j-1] == 'T' && cvd == tvd) nulledd++;
else if (subV[subV.size()-j-1] == 'C') cvd++;
else tvd++;
}
cout << max(nulled, nulledd) << "\n";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |