Submission #4066796

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<bitset>
#include<vector>
#include<deque>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<iomanip>
#include <functional>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1 << 30;
const double EPS = 1e-10;
const double pi = 3.14159265359;
//cout << fixed << std::setprecision(9)
//memset(a, 0, sizeof(a));
//--------------------------

int n, a, b;

int change(int t)
{
	if (t < a) return a;
	else if (t > b) return b;
	else return t;
}

int main()
{
	cin >> n >> a >> b;
	int cur = 0;
	for (int i = 0;i < n;i++) {
		string s;
		int d;
		cin >> s >> d;

		if (s == "East") {
			cur += change(d);
		}
		else {
			cur -= change(d);
		}
	}

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

	return 0;
}

Submission Info

Judge Result