On the way to Rio de Janeiro Ostap kills time playing with a grasshopper he took with him in a special box. Ostap builds a line of length nsuch that some cells of this line are empty and some contain obstacles. Then, he places his grasshopper to one of the empty cells and a small insect in another empty cell. The grasshopper wants to eat the insect.
Ostap knows that grasshopper is able to jump to any empty cell that is exactly k cells away from the current (to the left or to the right). Note that it doesn't matter whether intermediate cells are empty or not as the grasshopper makes a jump over them. For example, if k = 1 the grasshopper can jump to a neighboring cell only, and if k = 2 the grasshopper can jump over a single cell.
Your goal is to determine whether there is a sequence of jumps such that grasshopper will get from his initial position to the cell with an insect.
The first line of the input contains two integers n and k (2 ≤ n ≤ 100, 1 ≤ k ≤ n - 1) — the number of cells in the line and the length of one grasshopper's jump.
The second line contains a string of length n consisting of characters '.', '#', 'G' and 'T'. Character '.' means that the corresponding cell is empty, character '#' means that the corresponding cell contains an obstacle and grasshopper can't jump there. Character 'G' means that the grasshopper starts at this position and, finally, 'T' means that the target insect is located at this cell. It's guaranteed that characters 'G' and 'T' appear in this line exactly once.
If there exists a sequence of jumps (each jump of length k), such that the grasshopper can get from his initia
#include<stdio.h>
#include<algorithm>
#include<queue>
#include<math.h>
#include<vector>
#include<string.h>
#define inf 0x3f3f3f3f
using namespace std;
int main()
{
char ch[300];
int n,k,i,be,en,len,t;
scanf("%d %d",&n,&k);
getchar();
scanf("%s",ch);
for(i=0;i<n;i++)
{
if(ch[i]=='G')
be=i;
else if(ch[i]=='T')
en=i;
}
if(be>en)
{
t=en;
en=be;
be=t;
}
int flog=0;
for(i=be;i<=en;i+=k)
{
if(i==en)
{
flog=1;
printf("YES\n");
}
else if(ch[i]=='#')
{
break;
}
}
if(!flog)
printf("NO\n");
return 0;
} Local authorities have heard a lot about combinatorial abilities of Ostap Bender so they decided to ask his help in the question of urbanization. There are n people who plan to move to the cities. The wealth of the i of them is equal to ai. Authorities plan to build two cities, first for n1 people and second for n2 people. Of course, each of n candidates can settle in only one of the cities. Thus, first some subset of candidates of size n1 settle in the first city and then some subset of size n2 is chosen among the remaining candidates and the move to the second city. All other candidates receive an official refuse and go back home.
To make the statistic of local region look better in the eyes of their bosses, local authorities decided to pick subsets of candidates in such a way that the sum of arithmetic mean of wealth of people in each of the cities is as large as possible. Arithmetic mean of wealth in one city is the sum of wealth ai among all its residents divided by the number of them (n1 or n2 depending on the city). The division should be done in real numbers without any rounding.
Please, help authorities find the optimal way to pick residents for two cities.
The first line of the input contains three integers n, n1 and n2 (1 ≤ n, n1, n2 ≤ 100 000, n1 + n2 ≤ n) — the number of candidates who want to move to the cities, the planned number of residents of the first city and the planned number of residents of the second city.
The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 100 000), the i-th of them is equal to the wealth of the i-th candidate.
Print one real value — the maximum possible sum of arithmetic means of wealth of cities' residents. You answer will be considered correct if its absolute or relative error does not exceed 10 - 6.
Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if 
.
2 1 1 1 5
6.00000000
4 2 1 1 4 2 3
6.50000000
In the first sample, one of the optimal solutions is to move candidate 1 to the first city and candidate 2 to the second.
In the second sample, the optimal solution is to pick candidates 3 and 4 for the first city, and candidate 2 for the second one. Thus we obtain (a3 + a4) / 2 + a2 = (3 + 2) / 2 + 4 = 6.5
题意从n个数里选N1, N2 个数，再把这两堆数分别求平均值，把大的数放在数量少的堆里，sort一下就好了
#include<stdio.h>
#include<algorithm>
#include<queue>
#include<math.h>
#include<vector>
#include<string.h>
#define inf 0x3f3f3f3f
using namespace std;
int num[100005];
int cmp(int a,int b)
{
return a>b;
}
int main()
{
int n,n1,n2,i,t=0;
double sum=0,ans=0;
scanf("%d %d %d",&n,&n1,&n2);
for(i=0;i<n;i++)
scanf("%d",&num[i]);
sort(num,num+n,cmp);
if(n1>n2)
{
t=n1;
n1=n2;
n2=t;
}
int flog=0;
for(t=0,i=0;i<n;i++)
{
t++;
sum+=num[i];
if(t==n1&&!flog)
{
ans+=(sum/n1*1.0);
sum=0;
t=0;
flog=1;
}
else if(t==n2)
{
// printf("%lf ",ans);
ans+=(sum/n2*1.0);
break;
}
}
printf("%.8lf\n",ans);
return 0;
}
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
