Submission #432489
Source Code Expand
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<int,P> P1;
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i,x) for(int i=0;i<x;i++)
#define rep1(i,x) for(int i=1;i<=x;i++)
#define rrep(i,x) for(int i=x-1;i>=0;i--)
#define rrep1(i,x) for(int i=x;i>0;i--)
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(vec,a) lower_bound(vec.begin(),vec.end(),a)
#define ub(vec,a) upper_bound(vec.begin(),vec.end(),a)
#define uniq(vec) vec.erase(unique(vec.begin(),vec.end()),vec.end())
#define mp1(a,b,c) P1(a,P(b,c))
const int INF=1000000000;
const int dir_4[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
const int dir_8[8][2]={{1,0},{1,1},{0,1},{-1,1},{-1,0},{-1,-1},{0,-1},{1,-1}};
int main(){
int n,a,b;
cin >> n >> a >> b;
int x = 0;
rep(i,n){
string s;
int d;
cin >> s >> d;
d = max ( d , a );
d = min ( d , b );
if(s == "East"){
x += d;
}
else {
x -= d;
}
}
if(x > 0)printf("East %d\n",x);
else if(x < 0)printf("West %d\n",-x);
else puts("0");
}
Submission Info
Submission Time |
|
Task |
B - 双子とスイカ割り |
User |
yokozuna57 |
Language |
C++11 (GCC 4.9.2) |
Score |
100 |
Code Size |
1328 Byte |
Status |
AC |
Exec Time |
27 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 |
800 KB |
sample-02.txt |
AC |
25 ms |
920 KB |
sample-03.txt |
AC |
25 ms |
732 KB |
test-01.txt |
AC |
25 ms |
924 KB |
test-02.txt |
AC |
25 ms |
728 KB |
test-03.txt |
AC |
26 ms |
920 KB |
test-04.txt |
AC |
26 ms |
804 KB |
test-05.txt |
AC |
25 ms |
788 KB |
test-06.txt |
AC |
26 ms |
676 KB |
test-07.txt |
AC |
26 ms |
920 KB |
test-08.txt |
AC |
26 ms |
736 KB |
test-09.txt |
AC |
26 ms |
912 KB |
test-10.txt |
AC |
26 ms |
920 KB |
test-11.txt |
AC |
26 ms |
796 KB |
test-12.txt |
AC |
24 ms |
928 KB |
test-13.txt |
AC |
23 ms |
792 KB |
test-14.txt |
AC |
24 ms |
924 KB |
test-15.txt |
AC |
22 ms |
928 KB |
test-16.txt |
AC |
26 ms |
812 KB |
test-17.txt |
AC |
24 ms |
924 KB |
test-18.txt |
AC |
24 ms |
800 KB |
test-19.txt |
AC |
24 ms |
804 KB |
test-20.txt |
AC |
24 ms |
804 KB |
test-21.txt |
AC |
25 ms |
844 KB |
test-22.txt |
AC |
27 ms |
924 KB |
test-23.txt |
AC |
24 ms |
804 KB |
test-24.txt |
AC |
24 ms |
928 KB |
test-25.txt |
AC |
23 ms |
916 KB |
test-26.txt |
AC |
25 ms |
804 KB |
test-27.txt |
AC |
24 ms |
796 KB |
test-28.txt |
AC |
23 ms |
876 KB |
test-29.txt |
AC |
25 ms |
920 KB |
test-30.txt |
AC |
25 ms |
928 KB |