New Year and North Pole
2018-02-12 22:53
387 查看
[align=center]New Year and North Pole[/align]In this problem we assume the Earth to be a completely round ball and its surface a perfect sphere. The length of the equator and any meridian is considered to be exactly 40 000 kilometers. Thus, travelling from North Pole to South Pole or vice versa takes exactly 20 000 kilometers. Limak, a polar bear, lives on the North Pole. Close to the New Year, he helps somebody with delivering packages all around the world. Instead of coordinates of places to visit, Limak got a description how he should move, assuming that he starts from the North Pole. The description consists of n parts. In the i-th part of his journey, Limak should move ti kilometers in the direction represented by a string diri that is one of: "North", "South", "West", "East". Limak isn’t sure whether the description is valid. You must help him to check the following conditions: If at any moment of time (before any of the instructions or while performing one of them) Limak is on the North Pole, he can move only to the South.If at any moment of time (before any of the instructions or while performing one of them) Limak is on the South Pole, he can move only to the North.The journey must end on the North Pole.Check if the above conditions are satisfied and print "YES" or "NO" on a single line. Input The first line of the input contains a single integer n (1 ≤ n ≤ 50). The i-th of next n lines contains an integer ti and a string diri (1 ≤ ti ≤ 106,
) — the length and the direction of the i-th part of the journey, according to the description Limak got. Output Print "YES" if the description satisfies the three conditions, otherwise print "NO", both without the quotes. Example Input ![](https://odzkskevi.qnssl.com/8484bd9b10440abaf8ff8c45cce3052c?v=1518433225)
5 7500 South 10000 East 3500 North 4444 West 4000 NorthOutput
YESInput
2 15000 South 4000 EastOutput
NOInput
5 20000 South 1000 North 1000000 West 9000 North 10000 NorthOutput
YESInput
3 20000 South 10 East 20000 NorthOutput
NOInput
2 1000 North 1000 SouthOutput
NOInput
4 50 South 50 North 15000 South 15000 NorthOutput
YESNote Drawings below show how Limak's journey would look like in first two samples. In the second sample the answer is "NO" because he doesn't end on the North Pole.
#include <iostream> #include <stdio.h> #include <string.h> using namespace std; int main() { int n,x,sum=20000,flag=0; string s; cin>>n; while(n--) { cin>>x>>s; if(s=="South") { sum-=x; if(sum<0) flag=1; } if(s=="East") { if(sum==0||sum==20000) flag=1; } if(s=="West") { if(sum==0||sum==20000) flag=1; } if(s=="North") { sum+=x; if(sum>20000) flag=1; } } if(sum==20000&&flag!=1) cout<<"YES"<<endl; else cout<<"NO"<<endl; return 0; }
相关文章推荐
- CodeFroces--Good Bye 2016-B--New Year and North Pole(水题-模拟)
- B. New Year and North Pole
- New Year and North Pole
- 【Codeforces 750 B New Year and North Pole 】+ 手速
- codeforces Good Bye 2016-B New Year and North Pole
- E - New Year and North Pole CodeForces - 750B(状态处理下就好了)
- 【codeforces 750B】New Year and North Pole
- goodbye 2016 B New Year and North Pole
- New Year and North Pole CodeForces - 750B
- codeforces GoodBye2015 D.New Year and Ancient Prophecy (dp+lcp+树状数组)
- Codeforces_611D:New_Year_and_Ancient_Prophecy(DP+树状数组)
- [CodeForces750G]New Year and Binary Tree Paths
- Codeforces Good Bye 2015 C. New Year and Domino 前缀和
- CF Good Bye 2015 A- New Year and Days(CF611A)
- Codeforces GoodBye2015 New Year and Three Musketeers Codeforces 611E(贪心)
- A. New Year and Days
- Good Bye 2016 F.New Year and Finding Roots(交互)
- 【Codeforces Good Bye 2015】D. New Year and Ancient Prophecy
- Codeforces Good Bye 2017: F. New Year and Rainbow Roads(模拟)
- Good Bye 2017 D. New Year and Arbitrary Arrangement