E. Eat the Chip

合集 - 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-16

29.E. Eat the Chip2024-01-17

30.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-2850.B. Monsters Attack!2024-02-2851.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.求谁能把谁吃掉
事实2.当$dx$为奇数时，如果非平局一定是alice吃掉bob，偶数同理
事实3.当吃掉事件发生时，两颗棋子的$x$和$y$一定相同
事实4.由于已知谁会吃谁会被吃，被吃的棋子要使二者的$dy$尽可能的大,吃的棋子要使$dy$尽可能地小，这样就有点像你追我赶的样子了
事实5.当碰到墙壁时，无法再逃脱，只能直线行驶

总结

根据y的初始位置作出你追我赶模型，看看经过$\frac{d}{2}$次移动后能不能追上，其中如果是alice追bob，alice的d要加一因为是先手

code

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int h,w,x1,x2,y1,y2;
        cin>>h>>w>>x1>>y1>>x2>>y2;
        if(x1>=x2)
        {
            puts("Draw");
            continue;
        }

        if((x2-x1)%2)
        {
            int d=(x2-x1+1)/2;
            if(y1<y2)
            {
                y1=min(w,d+y1);
                y2=min(w,d-1+y2);
                if(y1>=y2)puts("Alice");
                    else puts("Draw");
            }
            else
            {
                y1=max(1,y1-d);
                y2=max(1,y2-d+1);
                 if(y1<=y2)puts("Alice");
                    else puts("Draw");
            }

        }
        else
        {
            int d=(x2-x1)/2;
            if(y1>y2)
            {
                y1=min(w,d+y1);
                y2=min(w,d+y2);
                 if(y2>=y1)puts("Bob");
                    else puts("Draw");
            }
            else
            {
                y1=max(1,y1-d);
                y2=max(1,y2-d);
                 if(y2<=y1)puts("Bob");
                    else puts("Draw");
            }

        }
    }
    return 0;
}