Submission #1514000

---

Source Code Expand

#include <iostream>
#include <vector>
#include <queue>
#include <sstream>
#include <algorithm>
#include <bitset>
#include <limits>
#include <map>
#include <set>
#include <iomanip>
#include <cmath>

using namespace std;

typedef long long int ll;
typedef std::numeric_limits<double> dbl;
const long long int LL_INF=1LL<<60;

vector<string> split(const string& input, char delimiter)
{
    stringstream stream(input);
    
    string field;
    vector<string> result;
    while (getline(stream, field, delimiter)) {
        result.push_back(field);
    }
    return result;
}

//#define DEBUG

ll A, B, N, D, K, Q, W, H, T;

int main()
{
    cin >> N >> A >> B;
    int pos = 0;
    for (int n = 0; n < N; ++n) {
        string str;
        int d;
        cin >> str >> d;
        d = (d < A) ? A : ((d > B) ? B : d);
        if (str == string("East"))
            pos += d;
        else
            pos -= d;
    }

    if (pos == 0)
        cout << 0 << endl;
    else if (pos < 0)
        cout << "West " << -pos << endl;
    else
        cout << "East " << pos << endl;

    //cout << fixed << setprecision(10) << M_PI * (double)rad << endl;

    return 0;
}

Submission Info

Judge Result