#nullable enable using M = (int, int, int); #region var (_input, _iter) = (Array.Empty(), 0); T I() where T : IParsable { while (_iter >= _input.Length) (_input, _iter) = (Console.ReadLine()!.Trim().Split(' '), 0); return T.Parse(_input[_iter++], null); } #endregion var n = I(); var q = I(); var s = I(); var ul = (1, 0, 0); var ur = (0, 0, 1); SegmentTree data; { var init = new M[n]; for (var i = 0; i < n; i++) init[i] = s[i] == ')' ? ul : ur; data = new(init); } var ans = new List(); for (var i = 0; i < q; i++) { var k = I(); if (k == 1) data.Set(I() - 1, I() == 1 ? ur : ul); else ans.Add(data.Product(I() - 1, I()).Item2 * 2); } Console.WriteLine(string.Join(Environment.NewLine, ans)); readonly struct Op : ISegmentTreeOperator { public M IdentityElement => (0, 0, 0); public M Operation(M x, M y) { var (xl, xv, xr) = x; var (yl, yv, yr) = y; var a = Math.Min(xr, yl); xr -= a; yl -= a; return (xl + yl, xv + yv + a, xr + yr); } } interface ISegmentTreeOperator { TMonoid IdentityElement { get; } TMonoid Operation(TMonoid x, TMonoid y); } class SegmentTree where TOperator : struct, ISegmentTreeOperator { public int BaseSize { get; init; } protected int Height { get; init; } protected TOperator Op { get; init; } protected TMonoid[] Values { get; init; } public SegmentTree(TMonoid[] initial, TOperator op = default) { Op = op; (BaseSize, Height) = (1, 0); while (BaseSize < initial.Length) (BaseSize, Height) = (BaseSize << 1, Height + 1); var size = BaseSize << 1; Values = new TMonoid[size]; var values = Values; for (var i = 0; i < size; i++) values[i] = op.IdentityElement; for (var i = 0; i < initial.Length; i++) values[i + BaseSize] = initial[i]; for (var i = BaseSize - 1; i > 0; i--) Update(values, i); } public TMonoid Product(int l, int r) { (l, r) = (l + BaseSize, r + BaseSize); var (resL, resR) = (Op.IdentityElement, Op.IdentityElement); var values = Values; while (l < r) { if ((l & 1) == 1) resL = Op.Operation(resL, values[l++]); if ((r & 1) == 1) resR = Op.Operation(values[--r], resR); (l, r) = (l >> 1, r >> 1); } return Op.Operation(resL, resR); } public void Set(int index, TMonoid value) { var j = index + BaseSize; var values = Values; values[j] = value; while ((j >>= 1) > 0) Update(values, j); } protected void Update(TMonoid[] values, int k) { values[k] = Op.Operation(values[k << 1], values[(k << 1) + 1]); } }