Submission #432693

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <climits>
#include <vector>
#include <numeric>
#include <complex>
#include <map>
#include <bitset>
using namespace std;

//#define __int64 long long
#define long __int64
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
const int Vecy[4] = {0,-1,0,1};
const int Vecx[4] = {1,0,-1,0};


int main(){
	int ans = 0;   //← - 西 東 + →
	int n,a,b;
	string s[100];
	int d[100];
	int vec[100];
	cin >> n >> a >> b;
	for(int i=0; i<n; i++){
		cin >> s[i] >> d[i];
		if(s[i] == "West"){
			vec[i] = -1;
		}else{
			vec[i] = 1;
		}
	}
	
	for(int i=0; i<n; i++){
		if(d[i] < a){
			ans += vec[i] * a;
		}else if(d[i] <= b){
			ans += vec[i] * d[i];
		}else{
			ans += vec[i] * b;
		}
	}
    
	
	//出力
	if(ans == 0){
		cout << 0 << endl;
	}else if(ans < 0){
		cout << "West " << -ans << endl;
	}else{
		cout << "East " << ans << endl;
	}
	
    return 0;
}

Submission Info

Judge Result