Codeforces Round #346 (Div. 2) D. Bicycle Race
2016-04-08 15:28
309 查看
D. Bicycle Race
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Maria participates in a bicycle race.
The speedway takes place on the shores of Lake Lucerne, just repeating its contour. As you know, the lake shore consists only of straight sections, directed to the north, south, east or west.
Let's introduce a system of coordinates, directing the Ox axis from west to east, and the Oy axis
from south to north. As a starting position of the race the southernmost point of the track is selected (and if there are several such points, the most western among them). The participants start the race, moving to the north. At all straight sections of the
track, the participants travel in one of the four directions (north, south, east or west) and change the direction of movement only in bends between the straight sections. The participants, of course, never turn back, that is, they do not change the direction
of movement from north to south or from east to west (or vice versa).
Maria is still young, so she does not feel confident at some turns. Namely, Maria feels insecure if at a failed or untimely turn, she gets into the water. In other words, Maria considers the turn dangerous if she immediately gets into the water if it is ignored.
Help Maria get ready for the competition — determine the number of dangerous turns on the track.
Input
The first line of the input contains an integer n (4 ≤ n ≤ 1000) —
the number of straight sections of the track.
The following (n + 1)-th line contains pairs of integers (xi, yi) ( - 10 000 ≤ xi, yi ≤ 10 000).
The first of these points is the starting position. The i-th straight section of the track begins at the point (xi, yi) and
ends at the point (xi + 1, yi + 1).
It is guaranteed that:
the first straight section is directed to the north;
the southernmost (and if there are several, then the most western of among them) point of the track is the first point;
the last point coincides with the first one (i.e., the start position);
any pair of straight sections of the track has no shared points (except for the neighboring ones, they share exactly one point);
no pair of points (except for the first and last one) is the same;
no two adjacent straight sections are directed in the same direction or in opposite directions.
Output
Print a single integer — the number of dangerous turns on the track.
Examples
input
output
input
output
Note
The first sample corresponds to the picture:
The picture shows that you can get in the water under unfortunate circumstances only at turn at the point (1, 1). Thus, the answer is 1.
在一个点上,不拐弯是否掉进湖里主要取决于当前点与前后点的相对位置关系;
找到规律后,很容易得出结果;
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Maria participates in a bicycle race.
The speedway takes place on the shores of Lake Lucerne, just repeating its contour. As you know, the lake shore consists only of straight sections, directed to the north, south, east or west.
Let's introduce a system of coordinates, directing the Ox axis from west to east, and the Oy axis
from south to north. As a starting position of the race the southernmost point of the track is selected (and if there are several such points, the most western among them). The participants start the race, moving to the north. At all straight sections of the
track, the participants travel in one of the four directions (north, south, east or west) and change the direction of movement only in bends between the straight sections. The participants, of course, never turn back, that is, they do not change the direction
of movement from north to south or from east to west (or vice versa).
Maria is still young, so she does not feel confident at some turns. Namely, Maria feels insecure if at a failed or untimely turn, she gets into the water. In other words, Maria considers the turn dangerous if she immediately gets into the water if it is ignored.
Help Maria get ready for the competition — determine the number of dangerous turns on the track.
Input
The first line of the input contains an integer n (4 ≤ n ≤ 1000) —
the number of straight sections of the track.
The following (n + 1)-th line contains pairs of integers (xi, yi) ( - 10 000 ≤ xi, yi ≤ 10 000).
The first of these points is the starting position. The i-th straight section of the track begins at the point (xi, yi) and
ends at the point (xi + 1, yi + 1).
It is guaranteed that:
the first straight section is directed to the north;
the southernmost (and if there are several, then the most western of among them) point of the track is the first point;
the last point coincides with the first one (i.e., the start position);
any pair of straight sections of the track has no shared points (except for the neighboring ones, they share exactly one point);
no pair of points (except for the first and last one) is the same;
no two adjacent straight sections are directed in the same direction or in opposite directions.
Output
Print a single integer — the number of dangerous turns on the track.
Examples
input
6 0 0 0 1 1 1 1 2 2 2 2 0 0 0
output
1
input
161 11 5
3 5
3 7
2 7
2 9
6 9
6 7
5 7
5 3
4 3
4 4
3 4
3 2
5 2
5 11 1
output
6
Note
The first sample corresponds to the picture:
The picture shows that you can get in the water under unfortunate circumstances only at turn at the point (1, 1). Thus, the answer is 1.
在一个点上,不拐弯是否掉进湖里主要取决于当前点与前后点的相对位置关系;
找到规律后,很容易得出结果;
#include<bits/stdc++.h> using namespace std; struct Point { int x; int y; }point[1001]; int main() { int n; scanf("%d",&n); for(int i=0;i<=n;++i) { scanf("%d %d",&point[i].x,&point[i].y); } int ans=0; for(int i=0;i<=n-2;++i) { int x1=point[i+1].x-point[i].x; int y1=point[i+1].y-point[i].y; int x2=point[i+2].x-point[i+1].x; int y2=point[i+2].y-point[i+1].y; //相对位置的判定 if(x1>0&&y2>0) { ++ans; continue; } else if(y1<0&&x2>0) { ++ans; continue; } else if(x1<0&&y2<0) { ++ans; continue; } else if(y1>0&&x2<0) { ++ans; continue; } } printf("%d\n",ans); return 0; }
相关文章推荐
- 网络驱动和网卡如何通信
- Android开发,美到超乎你想象的android开源交互动画和视觉效果,外部库
- Swift大会PDF观看总结
- Ios二维码扫描
- UIImageView+WebCache.h
- iOS定位功能实现
- ios 通过调用系统摄像头拍照,…
- runtime
- 内存管理 - CocoaChina
- Apple Pay接入详细教程 - iOS开发
- 数据结构学习(1)
- 代码优化工具:Instruments学习&amp;nbs…
- java
- 常见Oracle HINT的用法
- YJX_Driver_031_再谈SSDT_HOOK驱动保护原理
- ElasticSearch集群配置
- codeforces 558C C. Amr and Chemistry(bfs)
- (总结)Nginx配置文件nginx.conf中文详解
- mac(Media Access Control)地址可以修改吗
- 一个关于android游戏下载静默安装功能的思路以及实现