Submission #432478
Source Code Expand
#include <cassert> #include <functional> #include <set> #include <ctime> #include <cmath> #include <climits> #include <cstring> #include <string> #include <queue> #include <map> #include <vector> #include <algorithm> #include <iostream> #include <cstdio> #ifndef ONLINE_JUDGE //POJ # include <complex> # include <random> # include <array> # define mkt make_tuple # define empb emplace_back #endif #ifdef _LOCAL # include "for_local.h" #endif using namespace std; typedef unsigned int uint; typedef long long ll; typedef unsigned long long ull; #define repi(_I, _B, _E) for(int _I = (_B); (_I) < (_E); ++ (_I)) #define rep(_I, _N) for(int _I = 0; (_I) < (_N); ++ (_I)) #define mkp make_pair #define all(_X) (_X).begin(), (_X).end() inline int scani() { int n; scanf("%d", &n); return n; } int n, a, b; signed main() { cin >> n >> a >> b; ll p = 0; rep(i, n) { int d; string s; cin >> s >> d; int sg = (s == "East" ? 1 : -1); p += sg * max(min(d, b), a); } if ( p == 0 ) { cout << '0' << endl; } else { cout << (p > 0 ? "East" : "West") << ' ' << abs(p) << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 双子とスイカ割り |
User | vain0 |
Language | C++11 (GCC 4.9.2) |
Score | 100 |
Code Size | 1162 Byte |
Status | AC |
Exec Time | 27 ms |
Memory | 932 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 | 25 ms | 924 KB |
sample-02.txt | AC | 23 ms | 928 KB |
sample-03.txt | AC | 23 ms | 920 KB |
test-01.txt | AC | 24 ms | 804 KB |
test-02.txt | AC | 25 ms | 748 KB |
test-03.txt | AC | 23 ms | 796 KB |
test-04.txt | AC | 23 ms | 804 KB |
test-05.txt | AC | 23 ms | 804 KB |
test-06.txt | AC | 26 ms | 744 KB |
test-07.txt | AC | 24 ms | 932 KB |
test-08.txt | AC | 23 ms | 928 KB |
test-09.txt | AC | 23 ms | 796 KB |
test-10.txt | AC | 24 ms | 800 KB |
test-11.txt | AC | 23 ms | 932 KB |
test-12.txt | AC | 24 ms | 928 KB |
test-13.txt | AC | 25 ms | 924 KB |
test-14.txt | AC | 25 ms | 924 KB |
test-15.txt | AC | 23 ms | 800 KB |
test-16.txt | AC | 23 ms | 928 KB |
test-17.txt | AC | 25 ms | 924 KB |
test-18.txt | AC | 26 ms | 924 KB |
test-19.txt | AC | 25 ms | 928 KB |
test-20.txt | AC | 27 ms | 760 KB |
test-21.txt | AC | 25 ms | 920 KB |
test-22.txt | AC | 23 ms | 924 KB |
test-23.txt | AC | 24 ms | 928 KB |
test-24.txt | AC | 23 ms | 924 KB |
test-25.txt | AC | 22 ms | 796 KB |
test-26.txt | AC | 23 ms | 804 KB |
test-27.txt | AC | 24 ms | 924 KB |
test-28.txt | AC | 26 ms | 928 KB |
test-29.txt | AC | 25 ms | 804 KB |
test-30.txt | AC | 25 ms | 812 KB |