LA 3708 - Graveyard

原创 2015年07月09日 10:12:16

Programming contests became so popular in the year 2397 that the governor of New Earck -- the largest human-inhabited planet of the galaxy -- opened a special Alley of Contestant Memories (ACM) at the local graveyard. The ACM encircles a green park, and holds the holographic statues of famous contestants placed equidistantly along the park perimeter. The alley has to be renewed from time to time when a new group of memorials arrives.

When new memorials are added, the exact place for each can be selected arbitrarily along the ACM, but the equidistant disposition must be maintained by moving some of the old statues along the alley.

Surprisingly, humans are still quite superstitious in 24th century: the graveyard keepers believe the holograms are holding dead people souls, and thus always try to renew the ACM with minimal possible movements of existing statues (besides, the holographic equipment is very heavy). Statues are moved along the park perimeter. Your work is to find a renewal plan which minimizes the sum of travel distances of all statues. Installation of a new hologram adds no distance penalty, so choose the places for newcomers wisely!

Input 

The input file contains several test cases, each of them consists of a a line that contains two integer numbers: n -- the number of holographic statues initially located at the ACM, and m -- the number of statues to be added (2$ \le$n$ \le$1000, 1$ \le$m$ \le$1000) . The length of the alley along the park perimeter is exactly 10 000 feet.

Output 

For each test case, write to the output a line with a single real number -- the minimal sum of travel distances of all statues (in feet). The answer must be precise to at least 4 digits after decimal point.

\epsfbox{p3708.eps}

Pictures show the first three examples. Marked circles denote original statues, empty circles denote new equidistant places, arrows denote movement plans for existing statues.

Sample Input 

2 1 
2 3 
3 1 
10 10

Sample Output 

1666.6667 
1000.0 
1666.6667 
0.0
#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
const double LEN = 10000;
int main()
{
    int n, m, i, j;
    double l, nl, ans, p1, p2;
    while(scanf("%d%d",&n,&m)!=EOF)
    { 
      ans = 0;
      l = LEN/n;
      nl = LEN/(n+m);
      for(i=1, j=1; i<n; i++)
      {
               while( (l*i - j*nl) * (l*i - (j+1)*nl) > 1e-8)
               {
                      j++;
               }
               p1 = l*i - j*nl;
               p2 = (j+1)*nl - l*i;
             //  cout << p1 << " ***** " << p2 << endl;
               if(p1 < p2)
               {
                   ans += p1;
                   
               }else{
                   ans += p2;
                   
                   
               }
      }
      printf("%0.4f\n", ans);
    }
    return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

LA 3708 Graveyard

LA  3708 在一个周长为 10000 的圆上等距分布着 n 个雕塑。现在又有 m 个新雕塑加入(位置可以随意摆放),希望所有 n + m 个雕塑能在圆周上均匀分布。这就需要移动一些原有的雕塑。要...
  • Ezereal
  • Ezereal
  • 2015年08月13日 08:36
  • 597

LA 3708 Graveyard

想了半天dp什么的 也毫无思路 结果看了书上的方法感觉碉堡了  但 对于不会有两点会更改到一个点 还是比较好理解的 因为本来2个点的间距是比较大的 所以不会出现2个距离一个目标点都小于0.5的状况 但...
  • weilehuozhe
  • weilehuozhe
  • 2015年09月04日 21:39
  • 173

la 3708 Graveyard

题目链接:点击打开链接 题目大意:在一个周长为10000的圆上等距离分布着n个雕塑,现在又有m个新雕塑加入,希望n+m个雕塑可以等距离摆放(需要移动一些原有雕塑).求n个雕塑移动的最小距离. ...
  • kthsdwwl
  • kthsdwwl
  • 2013年11月15日 14:27
  • 593

LA -- 3708 Graveyard 【思维】

传送门 //题意:子一个周长为10000的圆上等距分布着n个雕塑, 现在有m个雕塑需要加入, 使得(n+m)个雕塑在圆上等距分布, 问最少让原先的n个雕塑移动多少距离. 前三个样例解释如图. //...
  • Anxdada
  • Anxdada
  • 2017年08月23日 10:52
  • 153

LA 3708(p7)----Graveyard

#include using namespace std; int main() { int n,m; while(scanf("%d%d",&n,&m)!=EOF) { ...
  • wang2147483647
  • wang2147483647
  • 2016年02月28日 19:47
  • 185

LA 3708 Graveyard -

题目地址:http://vjudge.net/problem/UVALive-3708 找规律,因为原来的一个雕塑可以看作不动的,所以放置后的雕塑的位置和之前的位置都知道了,所以只需要判断要移动的每...
  • qq_34446253
  • qq_34446253
  • 2016年10月11日 13:02
  • 73

LA 3708 GRAVEYARD

题意:在一个具有n个等距建筑的圆形中插入m个,使得保持等距,求最短移动距离;代码:#include #include #include #include #include ...
  • u014427196
  • u014427196
  • 2015年06月05日 23:44
  • 333

LA 3708 Graveyard——思路题

#include #include using namespace std; int main(){ int n,m; while(~scanf("%d%d",&n,&m)){ ...
  • hao_zong_yin
  • hao_zong_yin
  • 2017年09月04日 18:18
  • 73

LA 3708 Graveyard,NEERC 2006

z
  • TIMELIMITE
  • TIMELIMITE
  • 2014年09月19日 22:37
  • 505

(LA 3708)墓地雕塑(Graveyard )

3708 - Graveyard Time limit: 3.000 seconds  Programming contests became so popular in the year 2...
  • u011785972
  • u011785972
  • 2013年09月23日 00:22
  • 787
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:LA 3708 - Graveyard
举报原因:
原因补充:

(最多只允许输入30个字)