Submission #432776

---

Source Code Expand

#include<iostream>
#include <algorithm>
#include <cstdio>
#include<math.h>
#include<iomanip>
#include<map>
#include<set>
#include<deque>
#include<vector>
#include<stack>
#include<queue>
using namespace std;
#define ll long long
#define lli ll int
#define vi vector<int>
#define vvi vector<vector<int>>
#define vs vector<string>
#define fr(i,k,N) for(int i=k;i<N;i++)
#define rep(i,N) for(int i=0;i<N;i++)
template <class X> void pr(X test){cout<<test<<endl;}
template <class X> void prr(X test){for(auto it:test){cout<<it<<endl;}cout<<endl;}
lli combination(int n,int r){ lli temp=1; r=min(r,n-r); fr(i,1, r+1) temp=temp*(n-r+i)/i; return temp;}

int main(){
    int a,b,c,n,m,k;
    string s;
    char aaa;
    cin>>a>>b>>c;
    int sum=0;
        rep(i, a){
            int ti;
            string ts;
            cin>>ts>>ti;
            ti=max(b,min(c,ti));
            if(ts=="East") sum += ti;
            else sum-=ti;
        }
    if (sum>0) cout<<"East "<<sum<<endl;
    else if (sum<0) cout<<"West "<<-1*sum<<endl;
    else cout<<0<<endl;
    return 0;
}

Submission Info

Judge Result