Submission #432305
Source Code Expand
#include <string> #include <vector> #include <algorithm> #include <numeric> #include <set> #include <map> #include <queue> #include <iostream> #include <sstream> #include <cstdio> #include <cmath> #include <ctime> #include <cstring> #include <cctype> #include <cassert> #include <limits> #include <functional> #define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i)) #define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i)) #define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i)) #if defined(_MSC_VER) || __cplusplus > 199711L #define aut(r,v) auto r = (v) #else #define aut(r,v) __typeof(v) r = (v) #endif #define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it) #define all(o) (o).begin(), (o).end() #define pb(x) push_back(x) #define mp(x,y) make_pair((x),(y)) #define mset(m,v) memset(m,v,sizeof(m)) #define INF 0x3f3f3f3f #define INFL 0x3f3f3f3f3f3f3f3fLL using namespace std; typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll; template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; } template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; } int main() { int N, A, B; while(cin >> N >> A >> B) { int t = 0; rep(i, N) { string s; int d; cin >> s >> d; int p = s == "East" ? 1 : -1; t += min(B, max(d, A)) * p; } if(t > 0) cout << "East "; if(t < 0) cout << "West "; cout << abs(t) << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 双子とスイカ割り |
User | anta |
Language | C++ (GCC 4.9.2) |
Score | 100 |
Code Size | 1513 Byte |
Status | AC |
Exec Time | 26 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 | 26 ms | 728 KB |
sample-02.txt | AC | 23 ms | 920 KB |
sample-03.txt | AC | 26 ms | 728 KB |
test-01.txt | AC | 24 ms | 920 KB |
test-02.txt | AC | 25 ms | 920 KB |
test-03.txt | AC | 25 ms | 732 KB |
test-04.txt | AC | 26 ms | 728 KB |
test-05.txt | AC | 26 ms | 728 KB |
test-06.txt | AC | 23 ms | 920 KB |
test-07.txt | AC | 25 ms | 732 KB |
test-08.txt | AC | 25 ms | 916 KB |
test-09.txt | AC | 24 ms | 796 KB |
test-10.txt | AC | 25 ms | 916 KB |
test-11.txt | AC | 25 ms | 924 KB |
test-12.txt | AC | 23 ms | 920 KB |
test-13.txt | AC | 22 ms | 928 KB |
test-14.txt | AC | 22 ms | 800 KB |
test-15.txt | AC | 22 ms | 804 KB |
test-16.txt | AC | 24 ms | 928 KB |
test-17.txt | AC | 24 ms | 800 KB |
test-18.txt | AC | 24 ms | 924 KB |
test-19.txt | AC | 22 ms | 812 KB |
test-20.txt | AC | 23 ms | 924 KB |
test-21.txt | AC | 23 ms | 920 KB |
test-22.txt | AC | 22 ms | 808 KB |
test-23.txt | AC | 22 ms | 920 KB |
test-24.txt | AC | 23 ms | 932 KB |
test-25.txt | AC | 22 ms | 800 KB |
test-26.txt | AC | 22 ms | 928 KB |
test-27.txt | AC | 22 ms | 800 KB |
test-28.txt | AC | 22 ms | 928 KB |
test-29.txt | AC | 22 ms | 808 KB |
test-30.txt | AC | 22 ms | 804 KB |