Submission #4645276

---

Source Code Expand

#include <bits/stdc++.h>
typedef long long ll;
#define rep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define print2(x,y) cout << (x) << " " << (y) << endl;
#define printa(x,n) for(ll i = 0; i < n; i++){ cout << (x[i]) << " \n"[i == n-1];}
#define INF (1e18 + 7)
using namespace std;
const ll MOD = 1e9 + 7;
typedef pair<ll, ll> lpair;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll N,A,B;
    cin >> N >> A >> B;
    string S[110];
    ll D[110];
    rep(i,0,N) cin >> S[i] >> D[i];
    ll ans = 0;
    rep(i,0,N){
        if(S[i] == "East"){
            if(D[i] < A){
                ans += A;
            }else if(D[i] > B){
                ans += B;
            }else{
                ans += D[i];
            }
        }else{
            if(D[i] < A){
                ans -= A;
            }else if(D[i] > B){
                ans -= B;
            }else{
                ans -= D[i];
            }           
        }
    }
    if(ans == 0){
        print(0);
    }else if(ans > 0){
        cout << "East " << ans << endl;
    }else{
        cout << "West " << abs(ans) << endl;
    }


 }
 

Submission Info

Judge Result