Submission #432576

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <list>
#include <string>
#define _USE_MATH_DEFINES
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <bitset>
#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
#define RREP(i,n) for(int (i)=(n)-1;(i)>=0;(i)--)
#define debug(x) cout<<x<<endl
using namespace std;
typedef long long int LL;
typedef pair<int,int> P;
typedef priority_queue<P,vector<P>,greater<P> > p_minpq;
#define INF 2000000000
struct edge{int to,cost;};

int main(void) {
	/*****************************/
	//cout << "ファイル名->";
	//string s;cin >> s;
	//ifstream ifs(s.c_str());
	/*****************************/
	int N,A,B,d[100];
	string s[100];
	cin >> N >> A >> B;
	REP(i,N) cin >> s[i] >> d[i];
	int dx = 0;
	REP(i,N) {
		if(s[i]=="East") {
			if(d[i]<A) dx += A;
			else if(d[i]>B) dx += B;
			else dx += d[i];
		} else {
			if(d[i]<A) dx -= A;
			else if(d[i]>B) dx -= B;
			else dx -= d[i];
		}
	}
	if(dx<0) cout << "West " << -dx << endl;
	else if(dx>0) cout << "East " << dx << endl;
	else cout << 0 << endl;
	return 0;
}

Submission Info

Judge Result