Codeforces Educational Round 168 (Div. 2) || Editorial for Problem A,B,C,D

[@nicspyy]

B solution: void solve(){ int n; cin>>n; vs a(2); cin>>a[0]; cin>>a[1]; int cnt = 0; for(int i=2; i= 1) { s[i] = ')'; cnt--; } else { cnt = 1; s[i] = '('; } } } vector st; int ans = 0; for (int i = 0; i < n; i++) { if (s[i] == '(') { st.push_back(i); } else { ans += i - st.back(); st.pop_back(); } } cout a[i]; for(int i=2;i>x; v[i].pb(x); v[x].pb(i); } dfs(1,-1, v, minn, a); cout