Submission #1753844

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include <cmath>
#define	MOD  1000000007;
#define PI = 3.14159265358979323846;
using namespace std;

int main()
{
	int N, A, B;
	cin >> N >> A >> B;

	string s[100];
	int d[100];
	int t = 0;

	for (int i = 0; i < N; i++)
	{
		cin >> s[i] >> d[i];

		int direction = 0;
		if (s[i] == "East")
		{
			direction = 1;
		}
		else if (s[i] == "West")
		{
			direction = -1;
		}

		if (d[i] < A)
		{
			t += A*direction;
		}
		else if (d[i] > B) {
			t += B*direction;
		}
		else {
			t += d[i] * direction;
		}
	}

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

Submission Info

Judge Result