Submission #432504


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define mem(a) memset(a,0,sizeof(a))
#define pb(a) push_back(a)
#define in(a) insert(a)
#define R cin>>
#define F first
#define S second
#define C class
#define ll long long
#define ln cout<<'\n'
#define _(_1,_2,_3,N,...)N
#define pr(...) _(__VA_ARGS__,pr3,pr2,pr1)(__VA_ARGS__)
template<C T>void pr1(T a){cout<<a;ln;}
template<C T,C T2>void pr2(T a,T2 b){cout<<a<<' '<<b;ln;}
template<C T,C T2,C T3>void pr3(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}
template<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;


void Main() {
  int n,a,b;
  cin >> n >> a >> b;
  int x=0;
  rep(i,n) {
    string s;
    int y;
    cin >> s >> y;
    if(y<a) y=a;
    if(y>b) y=b;
    if(s=="West") x-=y;
    else x+=y;
  }
  if(!x) pr(x);
  else if(x<0) pr("West",x);
  else pr("East",x);
}

int main() {
  ios::sync_with_stdio(0);cin.tie(0);Main();
  return 0;
}

Submission Info

Submission Time
Task B - 双子とスイカ割り
User kzyKT
Language C++ (GCC 4.9.2)
Score 0
Code Size 1392 Byte
Status WA
Exec Time 39 ms
Memory 924 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 2
WA × 1
AC × 24
WA × 9
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt
All test-01.txt, test-02.txt, test-03.txt, test-04.txt, test-05.txt, test-06.txt, test-07.txt, test-08.txt, test-09.txt, test-10.txt, test-11.txt, test-12.txt, test-13.txt, test-14.txt, test-15.txt, test-16.txt, test-17.txt, test-18.txt, test-19.txt, test-20.txt, test-21.txt, test-22.txt, test-23.txt, test-24.txt, test-25.txt, test-26.txt, test-27.txt, test-28.txt, test-29.txt, test-30.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
sample-01.txt WA 30 ms 864 KB
sample-02.txt AC 29 ms 832 KB
sample-03.txt AC 28 ms 920 KB
test-01.txt AC 28 ms 864 KB
test-02.txt AC 28 ms 824 KB
test-03.txt AC 28 ms 864 KB
test-04.txt AC 28 ms 920 KB
test-05.txt WA 29 ms 916 KB
test-06.txt AC 28 ms 868 KB
test-07.txt WA 27 ms 868 KB
test-08.txt AC 27 ms 860 KB
test-09.txt WA 28 ms 920 KB
test-10.txt AC 28 ms 860 KB
test-11.txt AC 28 ms 924 KB
test-12.txt WA 32 ms 872 KB
test-13.txt WA 29 ms 920 KB
test-14.txt AC 29 ms 848 KB
test-15.txt AC 29 ms 864 KB
test-16.txt WA 32 ms 868 KB
test-17.txt AC 28 ms 792 KB
test-18.txt AC 28 ms 860 KB
test-19.txt AC 28 ms 868 KB
test-20.txt AC 28 ms 924 KB
test-21.txt AC 30 ms 872 KB
test-22.txt AC 35 ms 856 KB
test-23.txt AC 31 ms 852 KB
test-24.txt AC 28 ms 924 KB
test-25.txt AC 29 ms 876 KB
test-26.txt WA 30 ms 876 KB
test-27.txt AC 39 ms 860 KB
test-28.txt AC 29 ms 916 KB
test-29.txt WA 28 ms 832 KB
test-30.txt AC 30 ms 924 KB