1921E - Eat the Chip - CodeForces Solution

#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define fastio()                      \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(__null);
using namespace std;

void sol()
{
    int n, m;
    cin >> n >> m;
    
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    
    if (x1 > x2) {
        cout << "DRAW" << endl;
        return;
    }
    
    if ((x2 - x1) % 2 == 1) {
        int left1 = max(1ll, y1 - ((x2 - x1) / 2) - 1);
        int right1 = min(m, y1 + ((x2 - x1) / 2) + 1);
        int left2 = max(1ll, y2 - ((x2 - x1) / 2));
        int right2 = min(m, y2 + ((x2 - x1) / 2));
        
        if (right1 >= right2 && left1 <= left2) {
            cout << "Alice" << endl;
        }
        else {
            cout << "Draw" << endl;
        }
    }
    else {
        int left2 = max(1ll, y2 - ((x2 - x1) / 2));
        int right2 = min(m, y2 + ((x2 - x1) / 2));
        int left1 = max(1ll, y1 - ((x2 - x1) / 2));
        int right1 = min(m, y1 + ((x2 - x1) / 2));
        
        if (right1 <= right2 && left1 >= left2) {
            cout << "Bob" << endl;
        }
        else {
            cout << "Draw" << endl;
        }
    }
    
}

signed main()
{
    fastio()

        int k;
    k = 1;
    cin >> k;
    while (k--)
        sol();
    return 0;
}