# LA 3708 - Graveyard

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 (2n1000, 1m1000) . 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.

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
• 2015年08月13日 08:36
• 597

## LA 3708 Graveyard

• weilehuozhe
• 2015年09月04日 21:39
• 173

## la 3708 Graveyard

• kthsdwwl
• 2013年11月15日 14:27
• 593

## LA -- 3708 Graveyard 【思维】

• 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
• 2016年02月28日 19:47
• 185

## LA 3708 Graveyard -

• qq_34446253
• 2016年10月11日 13:02
• 73

## LA 3708 GRAVEYARD

• 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
• 2017年09月04日 18:18
• 73

## LA 3708 Graveyard,NEERC 2006

z
• 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
• 2013年09月23日 00:22
• 787

举报原因： 您举报文章：LA 3708 - Graveyard 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)