結果

問題 No.2103 ±1s Game
ユーザー ktr216ktr216
提出日時 2022-10-21 21:58:37
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 6 ms / 1,000 ms
コード長 3,577 bytes
コンパイル時間 1,696 ms
コンパイル使用メモリ 176,800 KB
実行使用メモリ 11,132 KB
最終ジャッジ日時 2024-07-01 06:32:18
合計ジャッジ時間 2,890 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
01_ AC * 3
other AC * 34
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#define double long double
using ll = long long;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VC = vector<char>;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
using VVVVI = vector<VVVI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
using VVVVL = vector<VVVL>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
//using P = pair<int, int>;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define ALL(a) (a).begin(),(a).end()
constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
constexpr int DX[] = {1, 0, -1, 0};
constexpr int DY[] = {0, 1, 0, -1};
template< typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); }
template< typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); }
const ll MOD = 998244353;
const int MAX_N = 200010;
int par[MAX_N];
int rnk[MAX_N];
int siz[MAX_N];
void init(int n) {
REP(i,n) {
par[i] = i;
rnk[i] = 0;
siz[i] = 1;
}
}
int find(int x) {
if (par[x] == x) {
return x;
} else {
return par[x] = find(par[x]);
}
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return;
int s = siz[x] + siz[y];
if (rnk[x] < rnk[y]) {
par[x] = y;
} else {
par[y] = x;
if (rnk[x] == rnk[y]) rnk[x]++;
}
siz[find(x)] = s;
}
bool same(int x, int y) {
return find(x) == find(y);
}
int size(int x) {
return siz[find(x)];
}
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
x %= mod;
while (n > 0) {
if (n & 1) res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll gcd(ll x, ll y) {
if (y == 0) return x;
return gcd(y, x % y);
}
typedef pair<ll, int> P0;
struct edge { int to; ll cost; };
const int MAX_V = 200000;
//const ll LINF = 1LL<<60;
int V;
vector<edge> G[MAX_V];
ll d[MAX_V];
void dijkstra(ll s) {
// greater<P>first
priority_queue<P0, vector<P0>, greater<P0> > que;
fill(d, d + V, LINF);
d[s] = 0;
que.push(P0(0, s));
while (!que.empty()) {
P0 p = que.top(); que.pop();
int v = p.second;
if (d[v] < p.first) continue;
REP(i,G[v].size()) {
edge e = G[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P0(d[e.to], e.to));
}
}
}
}
VL f(200001, 1);
ll C(ll n, ll k) {
return f[n] * mod_pow(f[k], MOD - 2, MOD) % MOD * mod_pow(f[n - k], MOD - 2, MOD) % MOD;
}
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
//REP(i, 200000) f[i + 1] = f[i] * (i + 1) % MOD;
int X, Y, K, P;
cin >> X >> Y >> K >> P;
int B = (X + Y - K) / 2, A = X + Y - K - B;
if (A > B) {
if (B >= X && K % 2 == 1 && P == 1) cout << "Bob\n";
else if (B >= X && K % 2 == 0 && P == -1) cout << "Bob\n";
else if (B >= Y && P == -1) cout << "Bob\n";
else cout << "Alice\n";
} else {
if (A >= X && K % 2 == 1 && P == -1) cout << "Alice\n";
else if (A >= X && K % 2 == 0 && P == 1) cout << "Alice\n";
else if (A >= Y && P == 1) cout << "Alice\n";
else cout << "Bob\n";
}
//cout << "A=" << A << " B=" << B << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0