若是凉夜已成梦

青春里 总有些事情要努力去做 总有些梦想要拼命去追。


  • 运维

  • 前端

  • 编程

  • 随笔

  • hust-oj

1202: Meltdown

发表于 2017-10-06   |   分类于 HUSTOJ   |   阅读次数 1,312

题目描述

A polygon is lowered at a constant speed of v metres per minute from the air into a liquid that dissolves it at a constant speed of c metres per minute from all sides. Given a point (x,y) inside the polygon that moves with the polygon, determine when the liquid reaches the point.
The border between air and liquid always has y-coordinate 0, and the liquid only eats away from the sides of the polygon in 2 dimensions. The polygon does not rotate as it is lowered into the liquid, and at time 0, it is not touching the liquid.
Unlike the polygon, which is flat (2-dimensional), the liquid exists in three dimensions. Therefore, the liquid seeps into cavities in the polygon. For example, if the polygon is "cup-shaped", the liquid can get "inside" the cup, as in the diagram below.

输入

The input consists of several test cases.
The first line of each test case contains the five integers N, x, y, v, and c, where 3 <= N <= 30, -100 <= x <= 100, 1 <= y <= 100, and 1 <= c < v <= 10.
The following N lines of the test case each contain one vertex of the polygon. The ith line contains the two integers x, y, where -100 <= x <= 100, 1 <= y <= 100.
The vertices of the polygon are given in counter-clockwise order. The border of the polygon does not intersect or touch itself, and the point (x,y) lies strictly inside the polygon—it does not lie on the border of the polygon.
Input is terminated by a line containing 0 0 0 0 0. These zeros are not a test case and should not be processed.

输出

For each test case, output the first time in minutes that the liquid reaches the specified point, rounded to four decimal places.

样例输入

4 0 50 2 1
-1 10
1 10
1 90
-1 90
0 0 0 0 0

样例输出

25.8660

参考代码

#include<stdio.h>
#include<math.h>
int main() 
{
    int n,a[1000001];
    double i,x,y,z;
    a[0]=1;
    for (i=1;i<=1000000;i++) 
    {
        x=i-sqrt(i);
        y=log(i);
        z=i*sin(i)*sin(i);
        a[(int)i]=(a[(int)x]+a[(int)y]+a[(int)z])%1000000;
    }
    while(scanf("%d",&n)!=EOF,n!=-1)
            printf("%dn",a[n]);
    return 0;
}

解析

暂无

hustoj

发表评论 取消回复

邮箱地址不会被公开。 必填项已用*标注

*
*


hoxis wechat
著作权归作者所有
站点更新说明
  • 文章目录
  • 站点概览
若是凉夜已成梦

若是凉夜已成梦

青春里 总有些事情要努力去做 总有些梦想要拼命去追。

1904 日志
6 分类
12 标签
RSS
weibo github twitter facebook

友情链接

Dreams孤独患者 Skip 原站点
© 2017 若是凉夜已成梦
Powered by WordPress | 已运行
Theme By NexT.Mist