Submission #4646158
Source Code Expand
#include <iostream> #include <fstream> #include <string> #include <vector> #include <map> #include <set> #include <unordered_map> #include <unordered_set> #include <queue> #include <stack> #include <array> #include <deque> #include <algorithm> #include <utility> #include <cstdint> #include <functional> #include <iomanip> #include <numeric> #include <assert.h> #include <bitset> #include <list> #include <math.h> using namespace std; int main() { int n, a, b; vector<string> s(n); vector<int> d(n); cin >> n >> a >> b; for (int i = 0; i < n; ++i) { cin >> s[i] >> d[i]; } int ans = 0; for (int i = 0; i < n; ++i) { int dir = 0; if (s[i] == "East") { dir = 1; } else { dir = -1; } if (d[i] < a) { ans += a * dir; } else if (d[i] > b) { ans += b * dir; } else { ans += d[i] * dir; } } if (ans < 0) { cout << "West " + to_string(ans * -1) << endl; } else if (ans > 0) { cout << "East " + to_string(ans) << endl; } else { cout << 0 << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 双子とスイカ割り |
User | HydrogenFluoride |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1066 Byte |
Status | RE |
Exec Time | 276 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | RE | 276 ms | 256 KB |
sample-02.txt | RE | 99 ms | 256 KB |
sample-03.txt | RE | 99 ms | 256 KB |
test-01.txt | RE | 99 ms | 256 KB |
test-02.txt | RE | 99 ms | 256 KB |
test-03.txt | RE | 99 ms | 256 KB |
test-04.txt | RE | 99 ms | 256 KB |
test-05.txt | RE | 98 ms | 256 KB |
test-06.txt | RE | 99 ms | 256 KB |
test-07.txt | RE | 100 ms | 256 KB |
test-08.txt | RE | 100 ms | 256 KB |
test-09.txt | RE | 99 ms | 256 KB |
test-10.txt | RE | 99 ms | 256 KB |
test-11.txt | RE | 99 ms | 256 KB |
test-12.txt | RE | 98 ms | 256 KB |
test-13.txt | RE | 100 ms | 256 KB |
test-14.txt | RE | 98 ms | 256 KB |
test-15.txt | RE | 98 ms | 256 KB |
test-16.txt | RE | 98 ms | 256 KB |
test-17.txt | RE | 100 ms | 256 KB |
test-18.txt | RE | 98 ms | 256 KB |
test-19.txt | RE | 99 ms | 256 KB |
test-20.txt | RE | 98 ms | 256 KB |
test-21.txt | RE | 98 ms | 256 KB |
test-22.txt | RE | 99 ms | 256 KB |
test-23.txt | RE | 98 ms | 256 KB |
test-24.txt | RE | 98 ms | 256 KB |
test-25.txt | RE | 99 ms | 256 KB |
test-26.txt | RE | 98 ms | 256 KB |
test-27.txt | RE | 98 ms | 256 KB |
test-28.txt | RE | 99 ms | 256 KB |
test-29.txt | RE | 99 ms | 256 KB |
test-30.txt | RE | 99 ms | 256 KB |