Codeforces-SolutionsA/Codes/1997 C - Even Positions/1997C.cpp

72 lines
1.4 KiB
C++
Raw Permalink Normal View History

#include <bits/stdc++.h>
using namespace std;
#ifdef ONLINE_JUDGE
#define dbg(...)
#else
#include "Assets/debug.h"
#endif
#define int long long
#define ll long long
#define endl '\n'
#define ff first
#define ss second
#define ins insert
#define pb push_back
#define ppb pop_back
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define rep(i,a,b) for(int i=a; i<b; ++i)
#define rrep(i,a,b) for(int i=a; i>=b; --i)
#define yn(f) f? cout<<"YES\n":cout<<"NO\n"
#define FAST (ios_base::sync_with_stdio(false), cin.tie(nullptr));
ll pow(ll x,ll y,ll m=1e9+7) {ll ans=1;x%=m;while(y){if(y&1)ans=(ans*x)%m;x=(x*x)%m;y>>=1;}return ans;}
void solve()
{
int n;
string s;
cin>>n>>s;
int ct=0,cost=0;
vector<int>v;
for(int i=0; i<n; ++i)
{
if(s[i]=='(')
{
ct++;
v.push_back(i);
}
else if(s[i]==')')
{
ct--;
cost += i-v.back();
v.pop_back();
}
else
{
if(ct)
{
ct--;
cost += i-v.back();
v.pop_back();
}
else
{
ct++;
v.push_back(i);
}
}
}
cout<<cost<<endl;
}
signed main()
{
FAST;
int TCS = 1;
cin >> TCS;
for (int TC = 1; TC <= TCS; ++TC)
{
// cout<<"Case "<<TC<<": ";
solve();
}
}