B. Monsters Attack!

合集 - codeforces(57)

1.C. Insert and Equalize2023-12-062.C. Removal of Unattractive Pairs2023-12-063.D. Jumping Through Segments2023-12-084.E. Good Triples2023-12-085.F. Shift and Reverse2023-12-086.D. Yet Another Monster Fight2023-12-117.A. Constructive Problems2023-12-188.C. Game with Multiset2023-12-199.A. Rating Increase2023-12-1910.B. Swap and Delete2023-12-1911.A. Problemsolving Log2023-12-2012.B. Preparing for the Contest2023-12-2013.C. Quests2023-12-2014.D. Three Activities2023-12-2015.E2. Game with Marbles (Hard Version)2023-12-2016.cf刷题有感2023-12-2017.A. Anonymous Informant2023-12-2118.A. Forked!2023-12-2319.B. Make Almost Equal With Mod2023-12-2720.C. Heavy Intervals2023-12-2721.D. Split Plus K2023-12-2822.A. 20232023-12-3123.B. Two Divisors2023-12-3124.C. Training Before the Olympiad2023-12-3125.D. Mathematical Problem2024-01-0226.F. Greetings2024-01-0227.C. Partitioning the Array2024-01-1528.G. Bicycles2024-01-1629.E. Eat the Chip2024-01-1730.G. Lights2024-01-1731.D. Array Repetition2024-01-1732.D. Berserk Monsters2024-01-2233.E. Increasing Subsequences2024-01-2334.D. Very Different Array2024-01-2435.G. Mischievous Shooter2024-01-2536.B. Plus-Minus Split2024-01-2737.B. A Balanced Problemset2024-01-2838.C. Did We Get Everything Covered2024-01-2839.D. Find the Different Ones!2024-02-0840.C. Grouping Increases2024-02-1041.D. Good Trip2024-02-1242.C. Physical Education Lesson2024-02-1243.E. Final Countdown2024-02-1844.D. Divisible Pairs2024-02-1945.G. Vlad and Trouble at MIT2024-02-2046.A. Brick Wall2024-02-2847.B. Minimize Inversions2024-02-2848.C. XOR-distance2024-02-2849.A. Moving Chips2024-02-28

50.B. Monsters Attack!2024-02-28

51.C. Find B2024-02-2852.D. Slimes2024-02-2853.C. Turtle Fingers: Count the Values of k2024-02-2854.D. Turtle Tenacity: Continual Mods2024-02-2855.D. Vlad and Division2024-02-2856.C. LR-remainders2024-02-2857.D. Lonely Mountain Dungeons2024-03-12

收起

原题链接

题解

什么时候会输？
首先我们要贪心一次性把离自己最近的怪物消灭掉，但是一回合内消灭掉了一个怪物之后还有剩余，我么就把剩余的扣在第二个离自己最近的怪物上
如果我当前回合没有消灭怪物，并且怪物下一回合就到零点，那我就输了
我们可以想象成这样的动画：我们每回合一次性往怪物身上丢出所有的手雷，手雷依次爆炸，直到怪物被炸死，剩余的手雷会返回
所以我们有两个从1开始的线性变量，一个是回合数，一个是怪物下标
然而回合数不确定，所以不能以回合数作为循环主体，然后一个回合可能可以砍掉多个怪兽，也有可能多个回合砍掉一个怪兽，所以我们不能用for循环
然后观察样例发现，进攻时是回合开始时，怪兽移动实在回合结束时，所以判断怪兽在当前回合会不会到零点要在进攻之后判断
当当前怪兽没死，且回合数大于x时，失败

code

#include<bits/stdc++.h>
using namespace std;
struct unit
{
    int a,x;
}mon[300005];

bool cmp(unit a,unit b)
{
    return abs(a.x)<abs(b.x);
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,k;
        cin>>n>>k;
        for(int i=1;i<=n;i++) cin>>mon[i].a;
        for(int i=1;i<=n;i++) cin>>mon[i].x;
        sort(mon+1,mon+1+n,cmp);

        int r=1,i=1,en=k;
        while(i<=n)
        {
            mon[i].a-=en;
            if(mon[i].a<=0)
            {
                en=-mon[i].a;
                i++;
            }
            else
            {
                if(abs(mon[i].x)<=r) break;
                r++;
                en=k;
            }
        }

        if(i==n+1) puts("YES");
        else puts("NO");
    }
    return 0;
}