Codeforces-298b H Sail
来源:互联网 发布:知乎匿名提问没人回答 编辑:程序博客网 时间:2024/06/11 20:43
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 fort 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, thei-th character is the wind blowing direction at thei-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) withint 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.
——————————————————亚历山大的分割线——————————————————
思路:上高中的时候,数学老师教过一种小明从家里去学校有多少种路径的排列组合。。。咳咳,本题跟排列组合是木有关系滴!但是这个想法是要有的。横坐标差值对应了N或者S,纵坐标差值对应了W或者E。当前风向并不是期望的风向之一的话,等待一秒。
代码如下:
#include <stdio.h>#include <stdlib.h>#include <string.h>char dir[100010];char c, d;int sx, sy, ex, ey;void jud(){//jud()函数用来储存期望的风向,c表示东西,d表示南北 if(ex > sx&&ey > sy) {d = 'N'; c = 'E';}else if(ex < sx&&ey > sy) {d = 'N'; c = 'W';}else if(ex < sx&&ey < sy) {d = 'S'; c = 'W';} else if(ex > sx&&ey < sy) {d = 'S'; c = 'E';} else if(sx == ex) {d = ey > sy ? 'N' : 'S'; c = ' ';} else {c = ex > sx ? 'E' : 'W'; d = ' ';}}int main(){int T, i, cou = 0;int stx, sty, step;scanf("%d%d%d%d%d", &T, &sx, &sy, &ex, &ey);scanf("%s", dir);stx = abs(sx - ex);//横坐标差值sty = abs(sy - ey);//纵坐标差值step = stx + sty;//一共需要的最少步数jud();for(i = 0; i < T; i++){ if(dir[i] != c&&dir[i] != d) cou++;//cou的大小表示需要等待的时间 else if(dir[i] == c){ if(stx) stx--; else cou++; } else if(dir[i] == d){ if(sty) sty--; else cou++; } if(!stx && !sty) break;} if(stx || sty) printf("-1\n"); else printf("%d\n", cou + step);return 0;}
- Codeforces-298b H Sail
- CodeForces 298B Sail
- Codeforces 298B Sail 题解
- codeforce 298 B Sail
- 298B Sail
- Codeforces Round #180 (Div. 2)-B. Sail
- Sail CodeForces
- B. Sail
- Codeforces Round #180 (Div. 2) B. Sail 【模拟】
- Codeforces Round #180 (Div. 2) B. Sail 【模拟】
- 文章标题 CoderForces 298B : Sail(分类)
- Sail
- Codeforces-298B 思维训练
- codeforces B
- codeforces B
- codeforces B
- codeforces B
- Codeforces Round #298 (Div. 2) A B
- 第四周 项目2三角形类2
- 【c/c++笔试题一】const变量通过指针修改问题
- What does job syspolicy_purge_history do?
- 使用java自带加密算法实现文本的md5加密算法
- 吝啬的国度
- Codeforces-298b H Sail
- C#加密概述
- 题目1092:Fibonacci
- centos图形界面和文本界面登陆切换设置
- 响应单击右键后的磁盘格式化都要处理哪些IRP呢?
- Scrapy爬虫笔记【6-连接数据库(一)】
- 如何获得线程的状态的方法
- CentOS 取 root 权限
- 天文物理学家如何展望未来医疗?