| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 861672 | ador | Election (BOI18_election) | C++17 | 5 ms | 348 KiB |
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>> QV = {};
cin >> N >> V >> Q;
for(int i=0;i<Q;i++) {
int L, R;
cin >> L >> R;
QV.push_back({L, R});
}
for(int i=0;i<Q;i++) {
string votes = V.substr(QV[i][0]-1, QV[i][1]-QV[i][0]+1);
int cv=0, tv=0, ni=0, nd=0;
for (int j=0;j<votes.length();j++) {
if(votes[j] == 'T' && tv == cv) ni++;
else if(votes[j] == 'T') tv++;
else cv++;
}
cv = 0, tv=0;
for (int j=0;j<votes.length();j++) {
if(votes[votes.length()-j-1] == 'T' && tv == cv) nd++;
else if(votes[votes.length()-j-1] == 'T') tv++;
else cv++;
}
cout << max(ni, nd) << "\n";
}
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
