// #define _GLIBCXX_DEBUG #include #include #define rep(i,b) for(int i=0;i=0;i--) #define rep1(i,b) for(int i=1;i=x;i--) #define fore(i,a) for(auto i:a) #define fore1(i,a) for(auto &i:a) #define rng(x) (x).begin(), (x).end() #define rrng(x) (x).rbegin(), (x).rend() #define sz(x) ((int)(x).size()) #define pb push_back #define fi first #define se second #define pcnt __builtin_popcountll using namespace std; using namespace atcoder; using ll = long long; using ld = long double; template using mpq = priority_queue, greater>; template bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (b ll sumv(const vector&a){ll res(0);for(auto&&x:a)res+=x;return res;} bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}} #define dame { cout << "No" << endl; return;} #define dame1 { cout << -1 << endl; return;} #define test(x) cout << "test" << x << endl; #define deb(x,y) cout << x << " " << y << endl; #define debp(p) cout << p.fi << " " << p.se << endl; #define deb3(x,y,z) cout << x << " " << y << " " << z << endl; #define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl; #define out cout << ans << endl; #define outd cout << fixed << setprecision(20) << ans << endl; #define outm cout << ans.val() << endl; #define outv fore(yans , ans) cout << yans << "\n"; #define outdv fore(yans , ans) cout << yans.val() << "\n"; #define show(x) cerr<<#x<<" = "<;using pil = pair;using pli = pair;using pii = pair;using pdd = pair; using tp = tuple; using vi = vector;using vd = vector;using vl = vector;using vs = vector;using vb = vector; using vpii = vector;using vpli = vector;using vpll = vector;using vpil = vector; using vvi = vector>;using vvl = vector>;using vvs = vector>;using vvb = vector>; using vvpii = vector>;using vvpli = vector>;using vvpll = vector;using vvpil = vector; using mint = modint998244353; using vm = vector; using vvm = vector>; vector dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1}; ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;} ll lcm(ll a, ll b) { return a/gcd(a,b)*b;} #define yes {cout <<"Yes"<>x>>y>>k>>p; int l = (x+y) - k; if (l == 1){ cout << "Alice" << endl; return; } string ans; auto f = [&](int x,int y,int k,int p)->bool{ string ans; int l = (x+y) - k; if (y > l/2){ if (x > l/2){ ans = "Bob"; }else{ if (k%2 == 0){ if (p == 1) ans = "Alice"; else ans = "Bob"; }else{ ans = "Bob"; } } }else{ if (p == 1) ans = "Alice"; else ans = "Bob"; } return ans == "Alice"; }; auto f2 = [&](int x,int y,int k,int p)->bool{ string ans; int l = (x+y) - k; if (y > (l+1)/2){ if (x > (l+1)/2){ ans = "Alice"; }else{ if (k%2 == 0){ if (p == -1 && x != (l+1)/2) ans = "Bob"; else ans = "Alice"; }else{ ans = "Alice"; } } }else{ if (p == -1 && y != (l+1)/2) ans = "Bob"; else ans = "Alice"; } return ans == "Alice"; }; bool ret; if (l%2 == 0){ ret = f(x,y,k,p); }else{ ret = f2(x,y,k,p); } ret ? ans = "Alice" :ans = "Bob"; out; return; } int main(){ ios::sync_with_stdio(false); cin.tie(0); solve(); return 0; }