CF613B Skills

洛谷评测传送门

题目描述

Lesha plays the recently published new version of the legendary game hacknet. In this version character skill mechanism was introduced. Now, each player character has exactly nn skills. Each skill is represented by a non-negative integer a_{i}a**i — the current skill level. All skills have the same maximum level AA .

Along with the skills, global ranking of all players was added. Players are ranked according to the so-called Force. The Force of a player is the sum of the following values:

  • The number of skills that a character has perfected (i.e., such that a_{i}=Aa**i=A ), multiplied by coefficient c_{f}c**f .
  • The minimum skill level among all skills ( min\ a_{i}min a**i ), multiplied by coefficient c_{m}c**m .

Now Lesha has mm hacknetian currency units, which he is willing to spend. Each currency unit can increase the current level of any skill by 11 (if it's not equal to AA yet). Help him spend his money in order to achieve the maximum possible value of the Force.

输入格式

The first line of the input contains five space-separated integers nn , AA , c_{f}c**f , c_{m}c**m and mm ( 1<=n<=1000001<=n<=100000 , 1<=A<=10^{9}1<=A<=109 , 0<=c_{f},c_{m}<=10000<=c**f,c**m<=1000 , 0<=m<=10^{15}0<=m<=1015 ).

The second line contains exactly nn integers a_{i}a**i ( 0<=a_{i}<=A0<=a**i<=A ), separated by spaces, — the current levels of skills.

输出格式

On the first line print the maximum value of the Force that the character can achieve using no more than mm currency units.

On the second line print nn integers a'{i}a**i′ ( a{i}<=a'_{i}<=Aa**i<=a**i′<=A ), skill levels which one must achieve in order to reach the specified value of the Force, while using no more than mm currency units. Numbers should be separated by spaces.

输入输出样例

输入 #1复制

输出 #1复制

输入 #2复制

输出 #2复制

说明/提示

In the first test the optimal strategy is to increase the second skill to its maximum, and increase the two others by 1.

In the second test one should increase all skills to maximum.

题解:

2019.11.5模拟赛T2 15分场

题意:

学技能,一共有\(n\)个技能,每个技能的初始等级是\(a[i]\),满级是\(A\)级,你一共可以为你的技能提升\(m\)级,提升完毕之后的战力为:

\[force=x\times c_m+y\times c_f
\]

(\(x\)为提升完毕之后这些技能中最小的等级,\(y\)为满级技能数量)

现在问一共能获得的最大战力是多少。

解析:

一开始看到这道题觉得是贪心。怎么想都没想到贪心策略。以为是自己太笨了(事实上的确是)

后来搞了一个明知必假的贪心交了上去,骗到了15分。感谢出题人@littleseven

因为没什么意义,我就不放最开始的代码了。

正解:二分+贪心枚举

让我们分析一下:

这个战力只和两个事情有关:满级技能有多少个,级别最低的技能级别有多低。

那么对于我们手中的\(m\)个技能点,我们可以选择先给一些技能加满,也可以选择尽可能地提升所有技能的最低技能级别。然后我们自然而然地想到,那到底是先给技能点满更优呢?还是先提升技能整体素质更优呢?

然后我们就死在这个思路里了。

为什么不能这么想呢?因为这个思路的两个关键字性质并不一样。什么意思呢?你看,这个战力的计算式,与\(c_f\)有关的是满级技能的数量,而与\(c_m\)有关的则是最低等级,我们要满足其中一个条件,必然要牺牲第二个条件,就导致了没有办法确定到底怎么分配技能点才能得出最优解。

怎么办呢?

都试一下子不就好了?

是的,既然我们的两个条件是“此消彼长”的,那么就“一定一动”,枚举一个条件,然后在这个条件下再枚举第二个条件,持续更新答案即可。

也就是说:先把这个等级从小到大排好序,在技能点够用的情况下,从后向前开始枚举点满的技能个数,然后在剩下的技能中用剩下的技能点尽可能地提升最低等级,得出答案。

一算时间复杂度,是\(O(n^2)\)的,超时了。

于是我们想到了“枚举伴侣”——二分

用二分来优化枚举,二分的就是最低等级,一个个判合不合法,然后更新答案即可。

至于怎么判断这个合不合法,可以跑一个前缀和。至于输出最后的方案,可以在更新答案处做一个标记,然后按这个标记分配技能点即可。

代码:

#include<cstdio>
#include<algorithm>
#define int long long
using namespace std;
const int maxn=1e5+10;
int high,cf,cm,n,m;
int level[maxn],b[maxn],s[maxn],ans,tmp1,tmp2;
bool cmp(int x,int y)
{
return level[x]<level[y];
}
int check(int x,int rr)
{
int l,r,mid;
l=0;r=rr;
while(l<r)
{
mid=(l+r+1)>>1;
if(level[b[mid]]<x)
l=mid;
else
r=mid-1;
}
return l;
}
signed main()
{
scanf("%lld%lld%lld%lld%lld",&n,&high,&cf,&cm,&m);
for(int i=1;i<=n;i++)
{
scanf("%lld",&level[i]);
b[i]=i;
}
sort(b+1,b+1+n,cmp);
for(int i=1;i<=n;i++)
s[i]=s[i-1]+level[b[i]];
m+=s[n];
ans=-1;
int i;
for(i=1;i<=n+1;i++)
{
if(high*(n-i+1)+s[i-1]>m)
continue;
if(i==1)
ans=cf*n+cm*high,tmp1=1;
if(i==1)
break;
int l=level[b[1]],r=high;
while(l<r)
{
int mid=(l+r+1)>>1;
int t=check(mid,i-1);
if(high*(n+1-i)+mid*t+s[i-1]-s[t]<=m)
l=mid;
else
r=mid-1;
}
if(ans<cf*(n+1-i)+l*cm)
ans=cf*(n+1-i)+l*cm,tmp1=i,tmp2=l;
}
printf("%lld\n",ans);
for(i=1;i<tmp1;i++)
if(level[b[i]]<tmp2)
level[b[i]]=tmp2;
for(i=tmp1;i<=n;i++)
level[b[i]]=high;
for(i=1;i<=n;i++)
printf("%lld ",level[i]);
return 0;
}

CF613B Skills的更多相关文章

  1. Skills - CF613B

    Lesha plays the recently published new version of the legendary game hacknet. In this version charac ...

  2. How to Develop blade and soul Skills

    How to Develop Skills Each skill can be improved for variation effects. Some will boost more strengt ...

  3. Top Five Communication Skills for Project Managers

    Research among project managers globally identifies top communication skills for leading teams. Lead ...

  4. codeforces 613B B. Skills(枚举+二分+贪心)

    题目链接: B. Skills time limit per test 2 seconds memory limit per test 256 megabytes input standard inp ...

  5. Computer skills one can learn within one day

    Computer related technical skills are usually thought as complicated and difficult to understand. It ...

  6. Advice on improving your programming skills

    Programming is cool. But behind the scenes it's also difficult for many people. Many people are defe ...

  7. Codeforces Round #322 (Div. 2) C. Developing Skills 优先队列

    C. Developing Skills Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/581/p ...

  8. cf581C Developing Skills

    Petya loves computer games. Finally a game that he's been waiting for so long came out! The main cha ...

  9. What skills are needed for machine learning jobs

    What skills are needed for machine learning jobs?机器学习工作必须技能 原文: http://www.quora.com/Machine-Learnin ...

随机推荐

  1. 201871010116-祁英红《面向对象程序设计(java)》第十五周学习总结

    博文正文开头格式:(2分) 项目 内容 <面向对象程序设计(java)> https://www.cnblogs.com/nwnu-daizh/ 这个作业的要求在哪里 https://ww ...

  2. 浅谈vue中的计算属性和侦听属性

    计算属性 计算属性用于处理复杂的业务逻辑 计算属性具有依赖性,计算属性依赖 data中的初始值,只有当初始值改变的时候,计算属性才会再次计算 计算属性一般书写为一个函数,返回了一个值,这个值具有依赖性 ...

  3. cartographer 3D scan matching 理解

    cartographer 3D scan matching没有论文和其它资料,因此尝试通过源码理解其处理方法,理解不当之处还请指正. 目录: 0.2D 匹配方法简介 1.real time corre ...

  4. golang数据结构之快速排序

    具体过程:黑色标记代表左指针,红色标记代表右指针,蓝色标记代表中间值.(依次从左往向下) //QuickSort 快速排序 func QuickSort(left ]int) { l := left ...

  5. Win32 程序开发入门:一个最简单的Win32程序

    一.什么是 Win32 Win32 是指 Microsoft Windows 操作系统的 32 位环境,与 Win64 都为 Windows 常见环境. 这里再介绍下 Win32 Applicatio ...

  6. mysql中的replace

    replace字面意思是替换,在mysql里面的运用是 如下图所示 1.  replace into test values(6, 'wowowo', 'new', 'japan') 这条语句则他会正 ...

  7. 纯js的统计图插件-统计图

    第一次写博客,写的不到望大家见谅! 今天给大家分享一个纯js的插件(统计图),有知道的可以在下面评论一起谈论一下,刚学着的时候,我是看了好久才看懂的一个基本结构,到后来我才知道原来直接去原网站上找到复 ...

  8. docker-mysql-使用docker运行mysql8

    1, 下载镜像, 我用的是8 docker pull mysql: 2, 启动镜像 docker run \ --name mysql8 \ -p : \ -v /Users/wenbronk/Con ...

  9. oracle学习笔记(十八) PL/SQL 游标

    游标 说明 查询结果的光标,相当于java中的一个迭代器,方便遍历操作 可使用的属性 %FOUND SQL语句查询或影响了一行或多行时为 TRUE.如:mycursor%FOUND %NOTFOUND ...

  10. git报错:fatal: bad config line 1 in file C:/Users/JIANGXIAOLIANG/.gitconfig

    在给git设置用户名和邮箱的时候报下面的错误:fatal: bad config line 1 in file C:/Users/JIANGXIAOLIANG/.gitconfig看提示的意思是git ...