Submission #1592224

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double, int> pdbi;
typedef pair<int,pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()

const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const ll INF = 1<<30;
const ll mod = 10000;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;

//#define int long long
#define addm(X, Y) ((X) = ((X) + (Y) % mod) % mod)

struct Node {
    int id;
    vector<int> ch;
    char w;
};

Node v[105];
string a;

void construct_tree(int n) {
    vector<Node> st;
    rep(i, n) {
        if (a[i] == '+' || a[i] == '-' || a[i] == '*') {
            Node v1 = st.back(); st.pop_back();
            Node v2 = st.back(); st.pop_back();
            v[i].ch.push_back(v2.id); v[i].ch.push_back(v1.id);
            st.emplace_back(v[i]);
        }
        else {
            st.emplace_back(v[i]);
        }
    }
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> a;
    int n = a.size();
    if (n == 1) {
        cout << a << endl;
        return 0;
    }
    rep(i, n) {
        v[i].id = i;
        v[i].w = a[i];
    }
    construct_tree(n);
    string ans;
    queue<int> q;
    q.push(n - 1);
    while (!q.empty()) {
        int p = q.front(); q.pop();
        ans += v[p].w;
        for (auto nx : v[p].ch) {
            q.push(nx);
        }
    }
    reverse(all(ans));
    cout << ans << endl;
}

Submission Info

Judge Result