Submission #4014006

---

Source Code Expand

#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>

using namespace std;
typedef long long ll;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};

const ll mod = 1e9 + 7;
const ll inf = 1e18;

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

    // input
    ll N, A, B;
    cin >> N >> A >> B;

    int position = 0;
    FOR(i, 0, N){
        string s;
        ll d;
        cin >> s >> d;

        int sign;
        if(s=="West"){
            sign = -1;
        }else{
            sign = 1;
        }

        position += sign * min(B, max(A, d));
    }    

    if(position==0){
        p(position);
    }
    else if(position < 0){
        cout << "West " << -position << endl;
    }
    else{
        cout << "East " << position << endl; 
    }

    return 0;
}

Submission Info

Judge Result