传送门
题意
分析
因为左右之间可以相互转换,所以不用考虑方向问题,所以如果是合法状态的话,只要保证奇数位置和偶数位置的相同类别的括号数量相同即可,用前缀和维护一下即可
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e6 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
char str[N];
int f[N];
int n,m;
int main() {
int T;
read(T);
while(T--){
scanf("%s",str + 1);
n = strlen(str + 1);
read(m);
for(int i = 1;i <= n;i++){
f[i] = f[i - 1];
if(str[i] == '[' || str[i] == ']')
f[i] += i & 1 ? 1 : -1;
}
while(m--){
int l,r;
read(l),read(r);
if(l > r) swap(l,r);
di(abs(f[r] - f[l - 1]));
}
}
return 0;
}