Submission #432586
Source Code Expand
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <tuple>
using namespace std;
//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<vector<PII> > VVPII;
typedef priority_queue<PII, vector<PII>, greater<PII> > PQPII;
//container util
//------------------------------------------
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int DX[] = {0, 1, 0, -1};
const int DY[] = {-1, 0, 1, 0};
//other
//--------------------------------------------
#define RANGE(a, c, b) ((a <= b) && (b < c))
//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))
//debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
int main(int argc, char const *argv[])
{
int n, a, b;
cin >> n >> a >> b;
VI row(201, 0);
int pos = 0;
REP(i, n){
string s;
int d;
cin >> s >> d;
if(d < a){
d = a;
}
if(b < d){
d = b;
}
if(s == "East"){
pos += d;
}else{
pos -= d;
}
}
if(pos < 0){
cout << "West " << -pos << endl;
}else if(pos > 0){
cout << "East " << pos << endl;
}else{
cout << 0 << endl;
}
return 0;
}
Submission Info
Submission Time |
|
Task |
B - 双子とスイカ割り |
User |
xyz |
Language |
C++11 (GCC 4.9.2) |
Score |
100 |
Code Size |
2724 Byte |
Status |
AC |
Exec Time |
29 ms |
Memory |
928 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
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 |
26 ms |
808 KB |
sample-02.txt |
AC |
25 ms |
928 KB |
sample-03.txt |
AC |
25 ms |
804 KB |
test-01.txt |
AC |
24 ms |
800 KB |
test-02.txt |
AC |
25 ms |
928 KB |
test-03.txt |
AC |
27 ms |
924 KB |
test-04.txt |
AC |
26 ms |
800 KB |
test-05.txt |
AC |
26 ms |
804 KB |
test-06.txt |
AC |
26 ms |
800 KB |
test-07.txt |
AC |
26 ms |
800 KB |
test-08.txt |
AC |
26 ms |
804 KB |
test-09.txt |
AC |
26 ms |
924 KB |
test-10.txt |
AC |
26 ms |
800 KB |
test-11.txt |
AC |
27 ms |
800 KB |
test-12.txt |
AC |
27 ms |
924 KB |
test-13.txt |
AC |
27 ms |
800 KB |
test-14.txt |
AC |
26 ms |
800 KB |
test-15.txt |
AC |
26 ms |
796 KB |
test-16.txt |
AC |
27 ms |
800 KB |
test-17.txt |
AC |
26 ms |
920 KB |
test-18.txt |
AC |
29 ms |
804 KB |
test-19.txt |
AC |
28 ms |
796 KB |
test-20.txt |
AC |
28 ms |
924 KB |
test-21.txt |
AC |
28 ms |
804 KB |
test-22.txt |
AC |
27 ms |
800 KB |
test-23.txt |
AC |
26 ms |
928 KB |
test-24.txt |
AC |
26 ms |
928 KB |
test-25.txt |
AC |
24 ms |
928 KB |
test-26.txt |
AC |
24 ms |
924 KB |
test-27.txt |
AC |
24 ms |
924 KB |
test-28.txt |
AC |
26 ms |
808 KB |
test-29.txt |
AC |
26 ms |
800 KB |
test-30.txt |
AC |
26 ms |
808 KB |