Submission #3602463
Source Code Expand
#include <bits/stdc++.h> #define rep(i,a,b) for(int i=a;i<(b);++i) #define erep(i,a,b) for(int i=a;i<=(int)(b);++i) #define per(i,a,b) for(int i=(a);i>(b);--i) #define eper(i,a,b) for(int i=(a);i>=b;--i) #define fore(x, a) for(auto &x : a) #define pb push_back #define mp make_pair #define INF 100100100100 #define inf 2001001001 #define MOD 1000000007 #define ALL(x) begin(x),end(x) using namespace std; using ll = long long; using pii = pair<int,int>; using vii = vector<int>; using vll = vector<ll>; template<class T>using vv = vector<T>; template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; } template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; } template<class T>void show(const vector<T> &a) { for (int i = 0; i < (int)a.size(); ++i) cout << a[i] << (i != (int)a.size()-1 ? " " : "\n"); } template<class T>T gcd(T a, T b){ return b ? gcd(b, a % b) : a; } template<class T>T lcm(T a, T b){ return a / gcd(a, b) * b; } int dy[]={0, 1, -1, 0}; int dx[]={1, 0, 0, -1}; int n, a, b, ans; int main() { cin.tie(0); ios::sync_with_stdio(false); cin >> n >> a >> b; rep(i, 0, n) { string s; int d; cin >> s >> d; if (s == "East") { ans += (d < a ? a : (d > b ? b : d)); } else { ans -= (d < a ? a : (d > b ? b : d)); } } if (ans < 0) cout << "West " << abs(ans) << endl; else if (ans > 0) cout << "East " << ans << endl; else cout << 0 << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 双子とスイカ割り |
User | kage |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1518 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 |