CodeForces
来源:互联网 发布:日语网络 编辑:程序博客网 时间:2024/05/31 06:23
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.
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.
Print “YES” if the description satisfies the three conditions, otherwise print “NO“, both without the quotes.
5
7500 South
10000 East
3500 North
4444 West
4000 North
YES
2
15000 South
4000 East
NO
5
20000 South
1000 North
1000000 West
9000 North
10000 North
YES
3
20000 South
10 East
20000 North
NO
2
1000 North
1000 South
NO
4
50 South
50 North
15000 South
15000 North
YES
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 <cstdio>#include <algorithm>#include <cstring>#include <queue>#include <stack>#include <map>#include <cmath>#include <vector>#define max_ 100010#define inf 0x3f3f3f3f#define ll long longusing namespace std;int main(int argc, char const *argv[]){ int n; scanf("%d",&n); ll sum=0; int d,f=1; char sent[10]; while(n--) { scanf("%d %s",&d,sent); if(sum==0&&sent[0]!='S') break; if(sum==20000&&sent[0]!='N') break; if(sent[0]=='N') sum-=d; else if(sent[0]=='S') sum+=d; if(sum<0||sum>20000) break; } if(n!=-1||sum!=0) printf("NO\n"); else printf("YES\n"); return 0;}
- codeforces~~~
- Codeforces
- codeforces
- Codeforces
- codeforces
- codeforces
- Codeforces
- Codeforces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- 通过modbus协议实现arduino与电能表串口通信
- 从头开始学算法:考研机试题练习(C/C++)–STL使用
- JavaSe——8、Set、List和Queue
- BZOJ2719
- [自制操作系统] JOS文件系统详解&支持工作路径&MSH
- CodeForces
- 一步一步来
- arpr
- 解决httpclient上传multipart form-data文件失败
- ReactNative进阶---Refs
- 进程间通信
- JSP Servlet 实现模糊动态查询并分页(拼接Sql)
- apache-comnons系列之commons-digester 3.3.2 学习笔记
- Windows屏保程序思考