Submission #1592139

---

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)

string a;
string ans;
deque<string> v;

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> a;
    int n = a.size();
    if (n == 1) {
        cout << a << endl;
        return 0;
    }
    vector<char> stack;
    int i = 0;
    while (i < n) {
        int cnt = 0;
        while (i < n && (a[i] == '+' || a[i] == '-' || a[i] == '*')) {
            int end = stack.size() - 1;
            string tmp;
            if (end == -1) {
                tmp += v[0];
                tmp += v[1];
                tmp += a[i];
                v.pop_front();
                v.pop_front();
                v.push_front(tmp);
            }
            else if (end == 0 && cnt == 0) {
                tmp += stack[end];  
                tmp += v[0];
                tmp += a[i];
                v.pop_front();
                v.push_front(tmp);
            }
            else {
                if (cnt == 0) {
                    tmp += stack[end];
                    tmp += stack[end - 1];
                    tmp += a[i];
                    cnt++;
                    stack.pop_back();
                    stack.pop_back();
                    v.push_front(tmp);
                }
                else {
                    tmp += v[0];
                    tmp += stack[end];
                    tmp += a[i];
                    v.pop_front();
                    stack.pop_back();
                    v.push_front(tmp);
                }
            }
            i++;
        }
        if (i == n) break;
        stack.push_back(a[i]);
        i++;
    }
    rep(i, v.size()) ans += v[i];
    cout << ans << endl;
}

Submission Info

Judge Result