Codeforces Round #346 (Div. 2) D. Bicycle Race
来源:互联网 发布:网络教育和自考 编辑:程序博客网 时间:2024/05/02 04:41
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.
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.
Print a single integer — the number of dangerous turns on the track.
60 00 11 11 22 22 00 0
1
161 11 53 53 72 72 96 96 75 75 34 34 43 43 25 25 11 1
6
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;}
- Codeforces Round #346 (Div. 2) D. Bicycle Race
- Codeforces Round #346 (Div. 2) D. Bicycle Race
- Codeforces Round #346 (Div. 2) - D Bicycle Race
- Codeforces Round #346 (Div. 2) D. Bicycle Race
- Codeforces Round #346 (Div. 2) D Bicycle Race (叉积)
- Codeforces Round #346 (Div. 2) D. Bicycle Race(点在多边形内部)
- Codeforces Round #346 (Div. 2)-D. Bicycle Race(规律或暴力)
- codeforces 659 D. Bicycle Race
- D - Bicycle Race CodeForces 659D
- cf - #346 D-Bicycle Race
- Codeforces 659D Bicycle Race【计算几何】
- CodeForces 659D Bicycle Race(叉积)
- CodeForces - 659D Bicycle Race (数学几何&技巧转换)
- 简单数学题或者计算几何:Codeforces 659D-Bicycle Race
- CodeForces 659 D. Bicycle Race(计算几何 + 数学公式)
- Codeforces Round #131 (Div. 2) E. Relay Race
- Codeforces Round #328 (Div. 2) C. The Big Race
- Codeforces Round #328 (Div. 2)C. The Big Race
- 面试中的赋值运算符函数
- HTML页面头部信息
- Codeforces 639C Bear and Polynomials 【思维】
- c/c++浮点型数据转换成整型数据
- 网络驱动和网卡如何通信
- Codeforces Round #346 (Div. 2) D. Bicycle Race
- VS2005多语言支持
- 科学美国人:Raw Stone Age Meals Got Tenderizing Treatment
- fastjson 私有属性的坑
- 递归方法解决电话号码对应英文问题
- QT官网文档网址
- 【lingerui+ztree】springvc 中使用的例子
- JNI/NDK开发指南(二)——JVM查找java native方法的规则
- ElasticSearch集群配置