poj 1265 Area(Pick定理)
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 5666 | Accepted: 2533 |
Description
Figure 1: Example area.
You are hired to write a program that calculates the area occupied
by the new facility from the movements of a robot along its walls. You
can assume that this area is a polygon with corners on a rectangular
grid. However, your boss insists that you use a formula he is so proud
to have found somewhere. The formula relates the number I of grid points
inside the polygon, the number E of grid points on the edges, and the
total area A of the polygon. Unfortunately, you have lost the sheet on
which he had written down that simple formula for you, so your first
task is to find the formula yourself.
Input
For each scenario, you are given the number m, 3 <= m < 100,
of movements of the robot in the first line. The following m lines
contain pairs 揹x dy�of integers, separated by a single blank, satisfying
.-100 <= dx, dy <= 100 and (dx, dy) != (0, 0). Such a pair means
that the robot moves on to a grid point dx units to the right and dy
units upwards on the grid (with respect to the current position). You
can assume that the curve along which the robot moves is closed and that
it does not intersect or even touch itself except for the start and end
points. The robot moves anti-clockwise around the building, so the area
to be calculated lies to the left of the curve. It is known in advance
that the whole polygon would fit into a square on the grid with a side
length of 100 units.
Output
output for every scenario begins with a line containing 揝cenario #i:�
where i is the number of the scenario starting at 1. Then print a single
line containing I, E, and A, the area A rounded to one digit after the
decimal point. Separate the three numbers by two single blanks.
Terminate the output for the scenario with a blank line.
Sample Input
2
4
1 0
0 1
-1 0
0 -1
7
5 0
1 3
-2 2
-1 0
0 -3
-3 1
0 -3
Sample Output
Scenario #1:
0 4 1.0 Scenario #2:
12 16 19.0
Source
【思路】
Pick定理
同上题。
【代码】
#include<cstdio>
using namespace std; struct Pt {
int x,y;
Pt(int x=,int y=) :x(x),y(y){};
};
Pt p[];
typedef Pt vec;
vec operator - (Pt a,Pt b) { return vec(a.x-b.x,a.y-b.y); } int abs(int x) { return x<? -x:x; }
int gcd(int a,int b) { return b==? a:gcd(b,a%b); }
int cross(Pt a,Pt b) { return a.x*b.y-a.y*b.x; }
int calc(Pt a,Pt b) { return gcd(abs(a.x-b.x),abs(a.y-b.y)); } int n;
int main() {
int T,kase=;
scanf("%d",&T);
while(T--) {
scanf("%d",&n);
n++;
p[]=Pt(,);
for(int i=;i<n;i++) {
scanf("%d%d",&p[i].x,&p[i].y);
p[i].x+=p[i-].x , p[i].y+=p[i-].y;
}
int S=,b=;
for(int i=;i<n-;i++) {
S += cross(p[i],p[i+]);
b += calc(p[i],p[i+]);
}
b += calc(p[n-],p[])+calc(p[],p[]);
printf("Scenario #%d:\n%d %d %.1f\n\n",++kase,(S-b+)/,b,0.5*S);
}
return ;
}
poj 1265 Area(Pick定理)的更多相关文章
- poj 1265 Area (Pick定理+求面积)
链接:http://poj.org/problem?id=1265 Area Time Limit: 1000MS Memory Limit: 10000K Total Submissions: ...
- POJ 1265 Area (Pick定理 & 多边形面积)
题目链接:POJ 1265 Problem Description Being well known for its highly innovative products, Merck would d ...
- poj 1265 Area(pick定理)
Area Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 4373 Accepted: 1983 Description Bein ...
- [poj 1265]Area[Pick定理][三角剖分]
题意: 给出机器人移动的向量, 计算包围区域的内部整点, 边上整点, 面积. 思路: 面积是用三角剖分, 边上整点与GCD有关, 内部整点套用Pick定理. S = I + E / 2 - 1 I 为 ...
- poj 1265 Area( pick 定理 )
题目:http://poj.org/problem?id=1265 题意:已知机器人行走步数及每一步的坐标 变化量 ,求机器人所走路径围成的多边形的面积.多边形边上和内部的点的数量. 思路:1.以 ...
- Area - POJ 1265(pick定理求格点数+求多边形面积)
题目大意:以原点为起点然后每次增加一个x,y的值,求出来最后在多边形边上的点有多少个,内部的点有多少个,多边形的面积是多少. 分析: 1.以格子点为顶点的线段,覆盖的点的个数为GCD(dx,dy),其 ...
- poj 1265 Area 面积+多边形内点数
Area Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 5861 Accepted: 2612 Description ...
- POJ 1265 Area POJ 2954 Triangle Pick定理
Area Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 5227 Accepted: 2342 Description ...
- POJ 1265 Area (pick定理)
题目大意:已知机器人行走步数及每一步的坐标变化量,求机器人所走路径围成的多边形的面积.多边形边上和内部的点的数量. 思路:叉积求面积,pick定理求点. pick定理:面积=内部点数+边上点数/2-1 ...
随机推荐
- [Caffe] ubuntu14.04下使用OpenBLAS加速Caffe
一.apt安装 sudo apt-get install libopenblas-dev 二.手动从source安装 1. 下载OpenBLAS并编译 git clone https://github ...
- 计算字符串和文件的MD5值
//计算字符串的MD5值 public string GetMD5(string sDataIn) { MD5CryptoServiceProvider md5 = new MD5CryptoServ ...
- css3实现垂直居中,水平
.box{ text-align:center; } .content{ margin-top:50%; transform:translateY(-50%);/**沿Y轴移动**/ } <di ...
- STM32系列命名规则
转自:STM32系列命名规则 STM32 F 103 C 6 T 7 xxx 1 2 3 4 5 6 7 8 第1部分:产品系列名,固定为STM32 第2部分:产品类型:F表示这是Flash产品,目前 ...
- FFMPEG视音频编解码零基础学习方法-b
感谢大神分享,虽然现在还看不懂,留着大家一起看啦 PS:有不少人不清楚“FFmpeg”应该怎么读.它读作“ef ef em peg” 0. 背景知识 本章主要介绍一下FFMPEG都用在了哪里(在这里仅 ...
- caffe之(一)卷积层
在caffe中,网络的结构由prototxt文件中给出,由一些列的Layer(层)组成,常用的层如:数据加载层.卷积操作层.pooling层.非线性变换层.内积运算层.归一化层.损失计算层等:本篇主要 ...
- String的一些细节
String 常量池问题 (1) 字符串常量的"+"号连接,在编译期字符串常量的值就确定下来, 拿"a" + 1来说,编译器优化后在class中就已经是a1. ...
- C语言利用va_list、va_start、va_end、va_arg宏定义可变参数的函数
在定义可变参数的函数之前,先来理解一下函数参数的传递原理: 1.函数参数是以栈这种数据结构来存取的,在函数参数列表中,从右至左依次入栈. 2.参数的内存存放格式:参数的内存地址存放在内存的堆栈段中,在 ...
- [JavaScript] js实现简单的代码运行框
<script type="text/javascript">// <![CDATA[ function runCode(obj) { var winname = ...
- bzoj 2852: 强大的区间 辗转相除
2852: 强大的区间 Time Limit: 5 Sec Memory Limit: 128 MBSubmit: 45 Solved: 12[Submit][Status][Discuss] D ...