LA 3708 - Graveyard

最新推荐文章于 2017-04-25 22:29:02 发布

原创最新推荐文章于 2017-04-25 22:29:02 发布 · 426 阅读

0 ·

CC 4.0 BY-SA版权

数学找规律专栏收录该内容

9 篇文章

订阅专栏

本文深入探讨了AI音视频处理领域中的视频分割与语义识别技术，介绍了视频分割的基本概念、算法及其应用，并详细阐述了语义识别在自动驾驶、AR、SLAM等场景中的实现与优化策略。

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

Sample Output

#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;
}