Submission #432419


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0;i<(n);++i)
#define loop for(;;)
#define trace(var) cerr<<">>> "<<#var<<" = "<<var<<endl;
#define inf (1e9)
#define eps (1e-9)
using Integer = long long;
using Real = long double;
const Real PI = acos(-1);

template<class S, class T> inline
ostream& operator<<(ostream&os, pair<S,T> p) {
  return os << '(' << p.first << ", " << p.second << ')';
}

template<class S, class T, class U> inline
ostream& operator<<(ostream&os, tuple<S,T,U> t) {
  return os << '('
    << get<0>(t) << ", "
    << get<1>(t) << ", "
    << get<2>(t) << ')';
}

template<class T> inline
ostream& operator<<(ostream&os, vector<T> v) {
  if (v.size() == 0) { return os << "(empty)"; }
  os << v[0];
  for (int i=1, len=v.size(); i<len; ++i) os << ' ' << v[i];
  return os;
}

template<class T> inline
istream& operator>>(istream&is, vector<T>&v) {
  rep (i, v.size()) is >> v[i];
  return is;
}

int dx[] = { -1, 0, 1, 0 };
int dy[] = {  0, -1, 0, 1 };

using vi = vector<int>;
using vvi = vector<vi>;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout.setf(ios::fixed);
  cout.precision(10);
  random_device dev;
  mt19937 rand(dev());

  int x = 0;

  int n; cin >> n;
  int a, b; cin >> a >> b;
  rep (i, n) {
    string s; int d;
    cin >> s >> d;

    d = min(max(d, a), b);
    int dir = (s[0] == 'E') ? 1 : -1;

    x += dir * d;
  }

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

  return 0;
}

Submission Info

Submission Time
Task B - 双子とスイカ割り
User cympfh
Language C++11 (GCC 4.9.2)
Score 100
Code Size 1641 Byte
Status AC
Exec Time 28 ms
Memory 932 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 33
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 AC 25 ms 796 KB
sample-02.txt AC 28 ms 920 KB
sample-03.txt AC 27 ms 928 KB
test-01.txt AC 25 ms 792 KB
test-02.txt AC 24 ms 796 KB
test-03.txt AC 25 ms 800 KB
test-04.txt AC 23 ms 924 KB
test-05.txt AC 24 ms 928 KB
test-06.txt AC 25 ms 800 KB
test-07.txt AC 24 ms 924 KB
test-08.txt AC 24 ms 800 KB
test-09.txt AC 23 ms 808 KB
test-10.txt AC 25 ms 920 KB
test-11.txt AC 26 ms 736 KB
test-12.txt AC 24 ms 796 KB
test-13.txt AC 23 ms 796 KB
test-14.txt AC 24 ms 924 KB
test-15.txt AC 23 ms 932 KB
test-16.txt AC 25 ms 916 KB
test-17.txt AC 24 ms 800 KB
test-18.txt AC 24 ms 792 KB
test-19.txt AC 24 ms 924 KB
test-20.txt AC 25 ms 924 KB
test-21.txt AC 27 ms 924 KB
test-22.txt AC 26 ms 920 KB
test-23.txt AC 26 ms 796 KB
test-24.txt AC 26 ms 796 KB
test-25.txt AC 24 ms 748 KB
test-26.txt AC 25 ms 928 KB
test-27.txt AC 25 ms 920 KB
test-28.txt AC 24 ms 800 KB
test-29.txt AC 25 ms 800 KB
test-30.txt AC 23 ms 928 KB