#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define vi vector<int>
#define ve vector
#define ll long long
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define onbit __builtin_popcount
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e18
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
using namespace std;
using namespace __gnu_pbds;
template <class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll MOD = 1e9+9;
const int nax = 2e3+5;
const int MAX_VAL = 1e6;
double PI=3.14159265359;
int arx[8]={1,1,0,-1,-1,-1, 0, 1};
int ary[8]={0,1,1, 1, 0,-1,-1,-1};
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
int n;
string t;
bool vis[nax];
int l,r;
/*int cur=0;
int dp[nax][2];
int dfs(int x,int y)
{
if (x==r+1){
bool test=true;
int ans=0;
for(int i=l;i<=r;i++){
if (t[i]=='T'&&vis[i]==false) ans++;
if (ans>(i-l+1)/2) {
test=false;
break;
}
}
ans=0;
for(int i=r;i>=l;i--){
if (t[i]=='T'&&vis[i]==false) ans++;
if (ans>(r-i+1)/2) {
test=false;
break;
}
}cout <<ans<<endl;
if (test) return 0;
return 1e9;
}
if (dp[x][y]!=-1) return dp[x][y];
dp[x][y]=1e9;
dp[x][y]=min(dp[x][y],dfs(x+1,0));
if (t[x]=='T'){
vis[x]=true;
dp[x][y]=min(dp[x][y],1+dfs(x+1,1));
vis[x]=false;
}
cout << x<<" "<<y<<" "<<dp[x][y]<<endl;
return dp[x][y];
}*/
int main(){
optimise;
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif*/
//setIO("redistricting");
cin>>n;
cin>>t;
int q;cin>>q;
while(q--)
{
for (int i = 0; i < n; ++i)
{
vis[i]=0;
}
cin>>l>>r;
l--;r--;
int cur=0;
for (int i = l; i <= r; ++i)
{
if (t[i]=='C') cur++;
else cur--;
if (cur<0){
vis[i]=true;
}
}cur=0;
for(int i=r;i>=l;i--)
{
if (t[i]=='C') cur++;
else if (t[i]=='T'&&vis[i]==0) cur--;
if (cur<0){
vis[i]=true;
}
javascript:tab_clicked(1) }
int res=0;
for (int i = l; i <= r; ++i)
{
if (vis[i]==true&&t[i]=='T')res++;
cout << vis[i]<<endl;
}cout << res<<endl;
}
}
Compilation message
election.cpp: In function 'int main()':
election.cpp:110:18: error: 'tab_clicked' was not declared in this scope
110 | javascript:tab_clicked(1) }
| ^~~~~~~~~~~
election.cpp:110:7: warning: label 'javascript' defined but not used [-Wunused-label]
110 | javascript:tab_clicked(1) }
| ^~~~~~~~~~
election.cpp: In function 'void setIO(std::string)':
election.cpp:33:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
33 | freopen((s + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
election.cpp:34:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
34 | freopen((s + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
