Submission #3974644
Source Code Expand
#include<iostream> #include<vector> #include<algorithm> #include<utility> #include<string> #include<cmath> #include<cstring> #include<queue> #include<map> #include<climits> #include<queue> #define REP(i, n) for(int i = 0;i < n;i++) #define REPR(i, n) for(int i = n;i >= 0;i--) #define FOR(i, m, n) for(int i = m;i < n;i++) #define FORR(i, m, n) for(int i = m;i >= n;i--) #define SORT(v, n) sort(v, v+n); #define VSORT(v) sort(v.begin(), v.end()); #define llong long long #define pb(a) push_back(a) using namespace std; typedef pair<int, int> P; typedef long long int ll; typedef pair<ll,ll> LLP; int dx[4] = {1,0,0,-1}; int dy[4] = {0,1,-1,0}; #define INF 1000000007 #define MOD 1000000007 #define ARRAY_MAX 100005 int main(){ int n,A,B,distance; int ans = 0;//Eastを正 cin >> n >> A >> B; string s; REP(i,n){ cin >> s >> distance; if(s.substr(0,4) == "East"){ //int distance = stoi(s.substr(6,1)); if(distance < A){ ans += A; }else if(distance > B){ ans += B; }else{ ans += distance; } }else{ //int distance = stoi(s.substr(6,1)); if(distance < A){ ans -= A; }else if(distance > B){ ans -= B; }else{ ans -= distance; } } } if(ans == 0){ cout << "0" << endl; }else if(ans > 0){ cout << "East " << abs(ans) << endl; }else{ cout << "West " << abs(ans) << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 双子とスイカ割り |
User | punipuni |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1663 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 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 | sample-01.txt, sample-02.txt, sample-03.txt, 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 | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |
sample-03.txt | AC | 1 ms | 256 KB |
test-01.txt | AC | 1 ms | 256 KB |
test-02.txt | AC | 1 ms | 256 KB |
test-03.txt | AC | 1 ms | 256 KB |
test-04.txt | AC | 1 ms | 256 KB |
test-05.txt | AC | 1 ms | 256 KB |
test-06.txt | AC | 1 ms | 256 KB |
test-07.txt | AC | 1 ms | 256 KB |
test-08.txt | AC | 1 ms | 256 KB |
test-09.txt | AC | 1 ms | 256 KB |
test-10.txt | AC | 1 ms | 256 KB |
test-11.txt | AC | 1 ms | 256 KB |
test-12.txt | AC | 1 ms | 256 KB |
test-13.txt | AC | 1 ms | 256 KB |
test-14.txt | AC | 1 ms | 256 KB |
test-15.txt | AC | 1 ms | 256 KB |
test-16.txt | AC | 1 ms | 256 KB |
test-17.txt | AC | 1 ms | 256 KB |
test-18.txt | AC | 1 ms | 256 KB |
test-19.txt | AC | 1 ms | 256 KB |
test-20.txt | AC | 1 ms | 256 KB |
test-21.txt | AC | 1 ms | 256 KB |
test-22.txt | AC | 1 ms | 256 KB |
test-23.txt | AC | 1 ms | 256 KB |
test-24.txt | AC | 1 ms | 256 KB |
test-25.txt | AC | 1 ms | 256 KB |
test-26.txt | AC | 1 ms | 256 KB |
test-27.txt | AC | 1 ms | 256 KB |
test-28.txt | AC | 1 ms | 256 KB |
test-29.txt | AC | 1 ms | 256 KB |
test-30.txt | AC | 1 ms | 256 KB |