| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 60014 | Kerim | Election (BOI18_election) | C++17 | 3037 ms | 1236 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 MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x) cerr<< #x <<" = "<< x<<endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
char s[MAXN];
int vis[MAXN];
int main(){
//~ freopen("file.in", "r", stdin);
int n;
scanf("%d",&n);
scanf("%s",s+1);
int q;
scanf("%d",&q);
while(q--){
int l,r;
scanf("%d%d",&l,&r);
int par=0;
for(int i=l;i<=r;i++){
par+=(s[i]=='C');
par-=(s[i]=='T');
if(par<0)
par=0,vis[i]=1;
}par=0;
for(int i=r;i>=l;i--)
if(!vis[i]){
par+=(s[i]=='C');
par-=(s[i]=='T');
if(par<0)
par=0,vis[i]=1;
}
int ans=0;
for(int i=l;i<=r;i++){
ans+=vis[i];
vis[i]=0;
}
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... | ||||
