题目
https://codeforces.com/problemset/problem/1296/D
大神解法:
将h[i]设置为还要额外加打的次数,比如怪14血,我攻击力2,队友攻击力3,那么取模后还剩4血,我再来一招,剩2血,这是正常打法,无需用技能换顺序,之和若再按正常打法则被队友打死,但又可能会因为需要加打的次数太多而不确定是否放技能,所以将额外加打次数存下,为1.
然后对加打次数排序,无需加打(加打次数为0)则直接++,否则优先给加打次数小的(贪心?)
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define pll pair<LL,LL>
#define x first
#define y second
#define pi acosl(-1)
#define sqr(x) ((x)*(x))
#define pdd pair<double,double>
#define MEMS(x) memset(x,-1,sizeof(x))
#define MEM(x) memset(x,0,sizeof(x))
#define less Less
#define EPS 1e-4
#define arg ARG
#define cpdd const pdd
#define ld long double
//#define N 6000005
#define rank Rank
#define index Index
int main() {
int n,a,b,k;
scanf("%d %d %d %d",&n,&a,&b,&k);
int h[200005];
for(int i = 0;i<n;i++){
int x;
scanf("%d",&x);
x--;
x%=(a+b);
x++;
x-=a;
h[i]=(x+a-1)/a;
// printf("%d ",h[i]);
}
// printf("\n");
sort(h,h+n);
int ans=0;
int tmp=0;
for(int i = 0;i<n;i++){
if(tmp+h[i]>k)break;
ans++;
tmp+=h[i];
}
printf("%d\n",ans);
}
本智障写法:
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n, a, b, k;
cin >> n >> a >> b >> k;
int cnt = 0;
vector<int>lose;
while (n--) {
int hp;
cin >> hp;
hp = hp % (a + b);
if (hp == 0) {
if (k > 0 && a >= b) {
k--;
cnt++;
}
else
lose.push_back(a+b);
continue;
}
if (hp <= a)
{
cnt++;
continue;
}
if (k > 0&&hp<=a*2) {
k--;
cnt++;
continue;
}
lose.push_back(hp % (a + b));
}
if (k > 0) {
sort(lose.begin(), lose.end());
for (int i = 0; i < lose.size() && k>0; i++) {
int h = lose[i];
if (k * a >= lose[i]-a) {
k -= (lose[i] - 1) / a;
cnt++;
continue;
}
else
break;
}
}
cout << cnt;
}
因为逻辑太复杂(zhizhang)而wa了三次,最后在0.34分写出,提交时网站爆炸而比赛结束,今早重新提交原代码居然是AC。。。🥶