# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
103536 | ekrem | Election (BOI18_election) | C++98 | 3032 ms | 1520 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>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define N 1000005
using namespace std;
typedef long long ll;
int n, q, bas, son, say, ans, u[N];
char s[N];
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
scanf("%d %s %d",&n ,s + 1 ,&q);
while(q--){
scanf("%d %d",&bas, &son);
ans = say = 0;
for(int i = bas; i <= son; i++){
if(s[i] == 'C')
say++;
else
say--;
if(say < 0){
ans++;
say = 0;
u[i] = 1;
} else
u[i] = 0;
}
say = 0;
for(int i = son; i >= bas; i--){
if(u[i])
continue;
if(s[i] == 'C')
say++;
else
say--;
if(say < 0){
say = 0;
ans++;
}
}
printf("%d\n", ans);
}
return 0;
}
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... |