Codeforces Round #180 (Div. 2) B. Sail 【模拟】
来源:互联网 发布:mac 远程控制 windows 编辑:程序博客网 时间:2024/06/03 00:03
The polar bears are going fishing. They plan to sail from (sx, sy) to (ex, ey). However, the boat can only sail by wind. At each second, the wind blows in one of these directions: east, south, west or north. Assume the boat is currently at (x, y).
- If the wind blows to the east, the boat will move to (x + 1, y).
- If the wind blows to the south, the boat will move to (x, y - 1).
- If the wind blows to the west, the boat will move to (x - 1, y).
- If the wind blows to the north, the boat will move to (x, y + 1).
Alternatively, they can hold the boat by the anchor. In this case, the boat stays at (x, y). Given the wind direction for t seconds, what is the earliest time they sail to (ex, ey)?
The first line contains five integers t, sx, sy, ex, ey (1 ≤ t ≤ 105, - 109 ≤ sx, sy, ex, ey ≤ 109). The starting location and the ending location will be different.
The second line contains t characters, the i-th character is the wind blowing direction at the i-th second. It will be one of the four possibilities: "E" (east), "S" (south), "W" (west) and "N" (north).
If they can reach (ex, ey) within t seconds, print the earliest time they can achieve it. Otherwise, print "-1" (without quotes).
5 0 0 1 1SESNW
4
10 5 3 3 6NENSWESNEE
-1
In the first sample, they can stay at seconds 1, 3, and move at seconds 2, 4.
In the second sample, they cannot sail to the destination.
原题链接:http://codeforces.com/problemset/problem/298/B
题意:一艘帆船要从一点到达另外一个点。每一秒钟都会有东南西北四个中的一种风,你可以选择动或不动,问你到达终点的最短时间。
直接模拟:如果某一时刻的风与你目标方向相同,则走,否则不动。
AC代码:
#include <bits/stdc++.h>using namespace std;const int maxn=1e5+5;char a[maxn];int main(){ int n,sx,sy,ex,ey; while(cin>>n>>sx>>sy>>ex>>ey) { cin>>a; bool flag=false; for(int i=0;i<n;i++) { if(a[i]=='N'&&sy<ey) sy++; else if(a[i]=='S'&&sy>ey) sy--; else if(a[i]=='E'&&sx<ex) sx++; else if(a[i]=='W'&&sx>ex) sx--; if(sx==ex&&sy==ey) { flag=true; cout<<i+1<<endl; break; } } if(!flag) cout<<"-1"<<endl; } return 0;}
- Codeforces Round #180 (Div. 2) B. Sail 【模拟】
- Codeforces Round #180 (Div. 2) B. Sail 【模拟】
- Codeforces Round #180 (Div. 2)-B. Sail
- Codeforces Round #323 (Div. 2) B 模拟
- Codeforces Round #362 (Div. 2) B 模拟
- Codeforces Round #315 (Div. 2) B 模拟
- Codeforces Round #105 (Div. 2) B 模拟
- Codeforces Round #392 (Div. 2)B (模拟)
- Codeforces Round #256 (Div. 2) B. Suffix Structures(模拟)
- Codeforces Round #107 (Div. 2) B (简单模拟)
- Codeforces Round #265 (Div. 2) B. Inbox (100500)(模拟)
- Codeforces Round #295 (Div. 2) -- B. Two Buttons (模拟)
- Codeforces Round #249 (Div. 2) B. Pasha Maximizes(模拟)
- Codeforces Round #252 (Div. 2) B. Valera and Fruits(模拟)
- Codeforces Round #279 (Div. 2) B. Queue 模拟
- Codeforces Round #316 (Div. 2) B. Simple Game (模拟)
- Codeforces Round #335 (Div. 2) B. Testing Robots 模拟
- Codeforces Round #335 (Div. 2) 606B Testing Robots(模拟)
- 关于方向
- 猴子吃桃-经典问题
- 操作系统概念性题目总结
- 享元模式(Flyweight)
- 结构体实验
- Codeforces Round #180 (Div. 2) B. Sail 【模拟】
- 单链表相邻两个节点之间交换顺序
- android如何查找控件属性名称
- 兔子产子
- leetcode(67).237. Delete Node in a Linked List
- 命令格式和常见权限
- VS2010配置opengl
- poj2253 Frogger(各种图论基础算法都能搞)&&poj1797 Heavy Transportation
- QT Creator 图文详细安装部署教程(含三种方式)