提出 #52612307

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pa first
#define pb second
#define endl '\n'
#define vint vector<int>
#define vlong vector<ll>
#define pii pair<int, int>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rng(i, a, b) for (int i = int(a); i <= int(b); i++)
#define per(i, a, b) for (int i = int(b - 1); i >= int(a); i--)
#define gnr(i, a, b) for (int i = int(b); i >= int(a); i--)
using namespace std;
#define ATC
#ifdef ATC
#include <atcoder/all>
using namespace atcoder;
#endif

#ifdef MT
void solve()
{
}
#endif

char toggle(char ch)
{
    if (ch >= 'a' && ch <= 'z')
        return ch - 'a' + 'A';
    else
        return ch - 'A' + 'a';
}

const int N = 5e5 + 10;

int par[N];

string str, ans;
void dfs(int s, int e, int d)
{
    for (int i = s; i != e; i += d) {
        if (str[i] != '(' && str[i] != ')') {
            if (str[i] != ' ')
                ans.push_back(str[i]);
        } else {
            str[i] = ' ';
            str[par[i]] = ' ';
            dfs(par[i], i, -d);
            i = par[i];
        }
    }
}

int main(void)
{
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> str;
    stack<int> st;
    rep(i, 0, str.length())
    {
        if (str[i] == '(') {
            st.push(i);
            continue;
        }
        if (str[i] == ')') {
            par[st.top()] = i;
            par[i] = st.top();
            st.pop();
            continue;
        }
        if (st.size() & 1) {
            str[i] = toggle(str[i]);
        }
    }

    dfs(0, str.length(), 1);
    cout << ans << endl;

#ifdef MT
    int t;
    cin >> t;
    for (int i = 0; i < t; i++)
        solve();
#endif
}

提出情報

ジャッジ結果