Submission #54770502

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using pl = pair<ll, ll>;
constexpr ll INF = 1e9 + 7;
constexpr ll mod = 1e9 + 7;
constexpr ld eps = 1e-9;
const ld PI = acos(-1);

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    string s;
    cin >> s;
    int n = s.size();
    vector<char> res(n, 0);
    vector<int> o(n, 0);
    vector<int> z;
    for (int i = 0; i < n; ++i) {
        if (s[i] == '(') {
            z.push_back(i);
        } else if (s[i] == ')') {
            o[z.back()] = i;
            z.pop_back();
        }
    }
    vector<array<int, 2>> st;
    for (int i = 0; i < n; ++i) {
        if (s[i] == '(') {
            if (st.empty()) {
                st.push_back({i, i});
            } else {
                auto [who, l] = st.back();
                int len = o[i] - i;
                st.push_back({i, (st.size() % 2 ? (l + o[who] - who) - (i - who) - len : l + (i - who))});
            }
        } else if (s[i] == ')') {
            st.pop_back();
        } else {
            if (st.empty()) {
                res[i] = s[i];
                continue;
            }
            if (st.size() % 2) {
                if (isupper(s[i]))s[i] = tolower(s[i]);
                else s[i] = toupper(s[i]);
            }
            auto [who, l] = st.back();

            res[(st.size() % 2 ? l + o[who] - who - (i - who) : l + (i - who))] = s[i];
        }
    }
    for (auto x: res)if (x)cout << x;
    return 0;
}

Submission Info

Judge Result