Submission #1676623

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>

using namespace std;

int main() {
  int n, a, b;
  cin >> n >> a >> b;
  string s[n];
  int walk[n];
  int sum = 0;
  for (int i = 0; i < n; i++) {
    cin >> s[i] >> walk[i];
    if (s[i] == "West") {
      sum += walk[i];
    } else if (s[i] == "East") {
      sum += -walk[i];
    }
  }
  if (sum == 0) {
    cout << 0 << endl;
  } else if (sum > 0) {
    cout << "West"
         << " " << sum << endl;
  } else {
    cout << "East"
         << " " << -sum << endl;
  }

  return 0;
}

Submission Info

Judge Result