UVALive 3708 Graveyard
2013-11-14 11:03
537 查看
Graveyard
[Submit]
[Go Back] [Status]
Description
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
n
1000,
1
m
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.
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
Source
Northeastern Europe & Russian Republic 2006-2007
保持一个点不动,剩下的点移动到距离它最近的位置上去。
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
const double eps=1e-8;
int n,m;
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
double ans=0;
for(int i=1;i<n;i++)
{
double temp=(double)i/n*(n+m);
double d1=(double)floor(temp),d2=(double)ceil(temp);
ans+=min(fabs(d1-temp),fabs(d2-temp));
}
printf("%.4lf\n",ans/(n+m)*10000);
}
return 0;
}
Time Limit: 3000MS | Memory Limit: Unknown | 64bit IO Format: %lld & %llu |
[Go Back] [Status]
Description
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
n
1000,
1
m
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.
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
Source
Northeastern Europe & Russian Republic 2006-2007
保持一个点不动,剩下的点移动到距离它最近的位置上去。
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
const double eps=1e-8;
int n,m;
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
double ans=0;
for(int i=1;i<n;i++)
{
double temp=(double)i/n*(n+m);
double d1=(double)floor(temp),d2=(double)ceil(temp);
ans+=min(fabs(d1-temp),fabs(d2-temp));
}
printf("%.4lf\n",ans/(n+m)*10000);
}
return 0;
}
相关文章推荐
- 例题1.4 Graveyard UVALive - 3708 数学思维题
- UVAlive 3708 Graveyard(最优化问题)
- 思维 UVALive 3708 Graveyard
- UVALive 3708_Graveyard
- UVALive 3708 Graveyard
- Graveyard UVALive - 3708(思维)
- UVAlive3708 UVA1388 POJ3154 Graveyard【水题】
- 指南第一章 例题4 UVALive 3708 Graveyard(参考系)
- Graveyard UVALive - 3708(思维)
- uvalive 3708 Graveyard
- UVALive - 3708 Graveyard
- uvalive 3708 墓地雕塑
- UVA-3708-Graveyard
- UVA 3708 [Graveyard]
- UVA 3708 Graveyard(思维)
- uva 3708 - Graveyard
- UVALive - 5135 Mining Your Own Business
- UVALive 7363 A Rational Sequence (二叉树)
- Graveyard,NEEEC 2006,LA 3708
- uvalive 10692 欧拉定理