Submission #4662780

---

Source Code Expand

#include <ios>
#include <iomanip>
#include <iostream>
#include <functional>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <climits>

using namespace std;
typedef long long int ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define MOD 1000000007
#define INF (1e9)
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl

ll gcd(ll a, ll b) { return b ? gcd(b,a%b) : a;}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
typedef pair <ll,ll> P;

int main()
{
    ll N, A, B;
    cin >> N >> A >> B;
    ll pos = 0;
    rep(i, N) {
        string s;
        ll d;
        cin >> s >> d;
        if (d < A) {
            d = A;
        } else if (d > B) {
            d = B;
        }
        if(s == "East") {
            pos += d;
        } else {
            pos -= d;
        }
    }
    if (pos == 0) {
        print(0);
    } else if (pos < 0) {
        cout << "West " << abs(pos) << endl;
    } else {
        cout << "East " << pos << endl;
    }
    return 0;
}

Submission Info

Judge Result