Submission #468312

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>

#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define INF 1<<30
#define MP make_pair
#define mp make_pair
#define pb push_back
#define PB push_back
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define ll long long
#define ull unsigned long long

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    string s;
    cin >> s;

    int n = s.length();
    vector<int> data;
    REP(i, n) {
        if(s.at(i) != 'M')  continue;

        int t = 0;
        FOR(j, i, n) {
            if(s.at(j) == '+') {
                t++;
            } else if(s.at(j) == '-') {
                t--;
            }
        }
        data.pb(t);
    }

    sort(data.begin(), data.end());
    int first = 0, second = 0;
    int dn = data.size();
    REP(i, dn) {
        if(dn / 2 > i) {
            first += data[i];
        } else {
            second += data[i];
        }
    }

    cout << second - first << endl;

    return 0;
}

Submission Info

Judge Result