Codeforces Round #834 (Div. 3) E. The Humanoid

If we can absorb two astronauts with power x≤yx≤yx≤y, then we can always first absorb an astronaut with power xxx, and then an astronaut with power yyy;
If we can absorb some astronaut, it is effective for us to do it right now.
Let’s sort the astronauts powers in increasing order.

Now let’s lock the sequence of serums we use. There are only three of them: blue serum can be the first, second or third.

Let’s absorb the astronauts in increasing order of their powers, and if we can’t, then use the next serum in a locked sequence or stop.

This solution works for O(n)O(n)O(n).

#include<bits/stdc++.h>
using namespace std;int main()
{int T;cin>>T;while(T--){int n,h;cin>>n>>h;vector<int> a(n);for(int i=0;i<n;i++) cin>>a[i];sort(a.begin(),a.end());vector<int> b{2,2,3};int mx=0;do{long long res=h;int pos=0;for(int i=0,j=0;i<n;){if(res>a[i]) res+=a[i++]/2;else if(j<3) res*=b[j++];else break;pos=i;}mx=max(mx,pos);}while(next_permutation(b.begin(),b.end()));cout<<mx<<endl;}return 0;
}

Codeforces Round #834 (Div. 3) E. The Humanoid相关推荐

E. The Humanoid Codeforces Round #834 (Div. 3)（暴力dfs？）
题意:有一个怪兽和n个宇航员(怪兽有一个绿色药丸和一个蓝色药丸),怪兽和宇航员都有自己的一个力量值,怪兽在面对力量值小于他的宇航员时可以吃了他并且获得他的的力量(向下取整),怪兽可以在任意时刻吃他的小 ...
Codeforces Round #506 (Div. 3)
Codeforces Round #506 (Div. 3) 实习期间事不多,对div3 面向题解和数据编程了一波 A. Many Equal Substrings 题目链接 A题就是找后缀和前缀重合 ...
Codeforces Round #563 (Div. 2)/CF1174
Codeforces Round #563 (Div. 2)/CF1174 CF1174A Ehab Fails to Be Thanos 其实就是要\(\sum\limits_{i=1}^n a_i ...
构造 Codeforces Round #302 (Div. 2) B Sea and Islands
题目传送门 1 /* 2 题意:在n^n的海洋里是否有k块陆地 3 构造算法:按奇偶性来判断,k小于等于所有点数的一半,交叉输出L/S 4 输出完k个L后,之后全部输出S:) 5 5 10 的例子可以 ...
Codeforces Round #696 (Div. 2) （A ~ E）超高质量题解（每日训练 Day.16 ）
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划 Codeforces Round #696 (Div. 2) (A ~ E)超高质量题解比赛链接:h ...
Codeforces Round #712 Div.2（A ~ F）超高质量题解（每日训练 Day.15 ）
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划 Codeforces Round #712 Div.2(A ~ F) 题解比赛链接:https:// ...
Codeforces Round #701 (Div. 2) A ~ F ，6题全，超高质量良心题解【每日亿题】2021/2/13
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划目录 A - Add and Divide B - Replace and Keep Sorted C ...
Codeforces Round #700 (Div. 2) D2 Painting the Array II（最通俗易懂的贪心策略讲解）看不懂来打我 ~
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划整场比赛的A ~ E 6题全,全部题目超高质量题解链接: Codeforces Round #700 ...
Codeforces Round #699 (Div. 2) F - AB Tree（贪心、树上DP）超级清晰，良心题解，看不懂来打我 ~
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划 Codeforces Round #699 (Div. 2) F - AB Tree Problem ...

Codeforces Round #834 (Div. 3) E. The Humanoid

Codeforces Round #834 (Div. 3) E. The Humanoid

Codeforces Round #834 (Div. 3) E. The Humanoid相关推荐

最新文章

热门文章