Submission #432515

---

Source Code Expand

#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <limits>
#include <tuple>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <complex>
 
using namespace std;
 
typedef long long          ll;
typedef unsigned int       uint;
typedef unsigned long long ull;
static const double EPS = 1e-12;
static const double PI  = acos(-1.0);
 
#define FOR(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define REP(i,n)   for (int i=0;i<(int)(n);i++)
#define ALL(a)     (a).begin(),(a).end()
#define DEBUG(x)   cout<<#x<<": "<<x<<endl

int main() {
  int N;
  int A;
  int B;
  cin >> N >> A >> B;
  int x = 0;
  REP(i, N) {
    string s;
    int d;
    cin >> s >> d;
    if (s == "East") {
      x += min(max(d, A), B);
    } else {
      x -= min(max(d, A), B);
    }
  }
  if (x < 0) {
    std::cout << "West " << -x << std::endl;
  } else if (x == 0) {
    std::cout << 0 << std::endl;
  } else {
    std::cout << "East " << x << std::endl;
  }
  return 0;
}

Submission Info

Judge Result