Codeforces Round #346 (Div. 2)(D)计算几何
2016-04-01 00:36
351 查看
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.
题意:问人在骑车的时候会不会拐进多边形里面
题解:查了一下题解,这一题使用叉积去做,(并不是很懂),通过判断向量的正负来判断拐弯的方向,而判断危险的拐点
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<string>
#include<bitset>
#include<utility>
#include<functional>
#include<iomanip>
#include<sstream>
#include<ctime>
using namespace std;
#define N int(1e4+10)
#define inf int(0x3f3f3f3f)
#define mod int(1e9+7)
typedef long long LL;
vector<pair<int, int> >v;
typedef pair<int, int> pp;
bool check(pp &A, pp& B, pp& C)
{
return (B.first - A.first)*(C.second - B.second) - (C.first - B.first)*(B.second - A.second)>0;
}
int main()
{
#ifdef CDZSC
freopen("i.txt", "r", stdin);
//freopen("o.txt","w",stdout);
int _time_jc = clock();
#endif
int n,x,y;
while (~scanf("%d", &n))
{
int ans = 0;
v.clear();
for (int i = 0; i <n+1; i++)
{
scanf("%d%d", &x, &y);
v.push_back(make_pair(x, y));
}
for (int i = 2; i <n+1; i++)
{
if (check(v[i - 2], v[i - 1], v[i]))ans++;
}
printf("%d\n", ans);
}
return 0;
}
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<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<string>
#include<bitset>
#include<utility>
#include<functional>
#include<iomanip>
#include<sstream>
#include<ctime>
using namespace std;
#define N int(1e4+10)
#define inf int(0x3f3f3f3f)
#define mod int(1e9+7)
typedef long long LL;
vector<pair<int, int> >v;
typedef pair<int, int> pp;
bool check(pp &A, pp& B, pp& C)
{
return (B.first - A.first)*(C.second - B.second) - (C.first - B.first)*(B.second - A.second)>0;
}
int main()
{
#ifdef CDZSC
freopen("i.txt", "r", stdin);
//freopen("o.txt","w",stdout);
int _time_jc = clock();
#endif
int n,x,y;
while (~scanf("%d", &n))
{
int ans = 0;
v.clear();
for (int i = 0; i <n+1; i++)
{
scanf("%d%d", &x, &y);
v.push_back(make_pair(x, y));
}
for (int i = 2; i <n+1; i++)
{
if (check(v[i - 2], v[i - 1], v[i]))ans++;
}
printf("%d\n", ans);
}
return 0;
}
相关文章推荐
- 23we
- UVa 10763 - Foreign Exchange
- LeetCode Remove Linked List Elements
- 8628 相亲
- hdu4542 求反素数
- 算法训练 区间k大数查询
- 【Unity3D游戏开发】性能优化之如何将包大小减少到极致(三六)
- 访问修饰符的真正理解
- 浮生记 (一)基础框架搭建
- 文本中寻找某一单词出现次数
- 《HTTP权威指南》读书笔记(第一章~第三章)
- git 搭建服务器
- OSChina 愚人节乱弹 ——愚人节新技能!快来点满整蛊技能树!
- LED灯的任意操纵
- 无法定位程序输入点 Can't load package
- 【Google Code Jam】Problem A. Store Credit
- Android消息机制Handler解析(源码+Demo)
- Linux 僵尸进程查杀
- 关于阿里、优酷面试总结
- 第二次作业