Submission #432562


Source Code Expand

#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std; using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using SS = stringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }
template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; };
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };

#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &e : c )
#define ALL( c ) ( c ).begin(), ( c ).end()
#define AALL( a, t ) ( t* )a, ( t* )a + sizeof( a ) / sizeof( t )
#define DRANGE( c, p ) ( c ).begin(), ( c ).begin() + ( p ), ( c ).end()

#define SZ( v ) ( (int)( v ).size() )
#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );

	int N, A, B;
	cin >> N >> A >> B;

	int cur = 0;
	REP( iteration, N )
	{
		string s;
		int d;
		cin >> s >> d;

		d = max( A, min( B, d ) );

		cur += d * ( s == "East" ? 1 : -1  );
	}

	if ( cur == 0 )
	{
		cout << 0 << endl;
	}
	else
	{
		cout << ( 0 < cur ? "East" : "West" ) << ' ' << abs( cur ) << endl;
	}

	return 0;
}

Submission Info

Submission Time
Task B - 双子とスイカ割り
User torus711
Language C++11 (GCC 4.9.2)
Score 100
Code Size 2637 Byte
Status AC
Exec Time 27 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 24 ms 800 KB
sample-02.txt AC 22 ms 928 KB
sample-03.txt AC 22 ms 932 KB
test-01.txt AC 22 ms 924 KB
test-02.txt AC 22 ms 932 KB
test-03.txt AC 22 ms 924 KB
test-04.txt AC 24 ms 800 KB
test-05.txt AC 24 ms 928 KB
test-06.txt AC 22 ms 924 KB
test-07.txt AC 23 ms 796 KB
test-08.txt AC 22 ms 928 KB
test-09.txt AC 22 ms 928 KB
test-10.txt AC 26 ms 932 KB
test-11.txt AC 24 ms 808 KB
test-12.txt AC 24 ms 928 KB
test-13.txt AC 22 ms 804 KB
test-14.txt AC 22 ms 800 KB
test-15.txt AC 24 ms 796 KB
test-16.txt AC 23 ms 932 KB
test-17.txt AC 25 ms 912 KB
test-18.txt AC 24 ms 928 KB
test-19.txt AC 27 ms 768 KB
test-20.txt AC 24 ms 916 KB
test-21.txt AC 27 ms 764 KB
test-22.txt AC 24 ms 916 KB
test-23.txt AC 25 ms 724 KB
test-24.txt AC 24 ms 920 KB
test-25.txt AC 24 ms 916 KB
test-26.txt AC 25 ms 924 KB
test-27.txt AC 24 ms 912 KB
test-28.txt AC 25 ms 728 KB
test-29.txt AC 26 ms 924 KB
test-30.txt AC 24 ms 920 KB