CodeForces - 659D Bicycle Race （数学几何&技巧转换）

CodeForces - 659D Bicycle Race Time Limit: 1000MS   Memory Limit: 262144KB   64bit IO Format: %I64d & %I64u Submit Status Description 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. Sample Input Input 6 0 0 0 1 1 1 1 2 2 2 2 0 0 0 Output 1 Input 16 1 1 1 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 1 1 1 Output 6 //题意：自行车每次行走都只有四个方向上，下，左，右；如果内角大于等于270度，自行车就会掉海里。 骑自行车旅行，第一个点为起点坐标，最后一个点还是起点坐标（表示自行车绕了一圈又回来了），问在骑行过程中总共掉海里几次？ //思路： 因为是直角拐弯，所以内角要么是90度，要么是270度，设270的角的个数为x，则可得方程180*(n-2)=270*x+(n-x)*90; 化简得：x=(n-4)/2; #include<stdio.h> #include<string.h> #include<algorithm> #include<iostream> #define INF 0x3f3f3f3f #define ull unsigned long long #define ll long long #define IN __int64 #define N 100010 #define M 1000000007 using namespace std; struct zz { int x; int y; }p[N]; int main() { int t,n,m,i,j,k; while(scanf("%d",&n)!=EOF) { for(i=0;i<=n;i++) scanf("%d%d",&p[i].x,&p[i].y); printf("%d\n",(n-4)/2); } return 0; }