結果

問題 No.1314 N言っちゃダメゲーム (5)
ユーザー satashunsatashun
提出日時 2020-12-11 00:47:38
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 5 ms / 1,000 ms
コード長 4,210 bytes
コンパイル時間 2,165 ms
コンパイル使用メモリ 195,012 KB
最終ジャッジ日時 2025-01-16 21:49:20
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
6,816 KB
testcase_01 AC 3 ms
6,820 KB
testcase_02 AC 4 ms
6,820 KB
testcase_03 AC 5 ms
6,820 KB
testcase_04 AC 4 ms
6,816 KB
testcase_05 AC 4 ms
6,912 KB
testcase_06 AC 4 ms
6,912 KB
testcase_07 AC 5 ms
6,820 KB
testcase_08 AC 4 ms
6,820 KB
testcase_09 AC 4 ms
6,912 KB
testcase_10 AC 4 ms
6,824 KB
testcase_11 AC 3 ms
6,816 KB
testcase_12 AC 4 ms
6,816 KB
testcase_13 AC 3 ms
7,040 KB
testcase_14 AC 4 ms
6,820 KB
testcase_15 AC 5 ms
6,820 KB
testcase_16 AC 4 ms
6,820 KB
testcase_17 AC 4 ms
6,824 KB
testcase_18 AC 4 ms
6,816 KB
testcase_19 AC 4 ms
7,040 KB
testcase_20 AC 4 ms
6,912 KB
testcase_21 AC 4 ms
6,820 KB
testcase_22 AC 4 ms
6,816 KB
testcase_23 AC 4 ms
6,820 KB
testcase_24 AC 4 ms
6,816 KB
testcase_25 AC 4 ms
6,912 KB
testcase_26 AC 4 ms
6,820 KB
testcase_27 AC 3 ms
6,816 KB
testcase_28 AC 4 ms
6,820 KB
testcase_29 AC 4 ms
7,040 KB
testcase_30 AC 4 ms
6,820 KB
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T, class U>
void chmin(T& t, const U& u) {
if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
if (t < u) t = u;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
rep(i, v.size()) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define debug(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
template <unsigned int MOD>
struct ModInt {
using uint = unsigned int;
using ull = unsigned long long;
using M = ModInt;
uint v;
ModInt(ll _v = 0) { set_norm(_v % MOD + MOD); }
M& set_norm(uint _v) { //[0, MOD * 2)->[0, MOD)
v = (_v < MOD) ? _v : _v - MOD;
return *this;
}
explicit operator bool() const { return v != 0; }
M operator+(const M& a) const { return M().set_norm(v + a.v); }
M operator-(const M& a) const { return M().set_norm(v + MOD - a.v); }
M operator*(const M& a) const { return M().set_norm(ull(v) * a.v % MOD); }
M operator/(const M& a) const { return *this * a.inv(); }
M& operator+=(const M& a) { return *this = *this + a; }
M& operator-=(const M& a) { return *this = *this - a; }
M& operator*=(const M& a) { return *this = *this * a; }
M& operator/=(const M& a) { return *this = *this / a; }
M operator-() const { return M() - *this; }
M& operator++(int) { return *this = *this + 1; }
M& operator--(int) { return *this = *this - 1; }
M pow(ll n) const {
if (n < 0) return inv().pow(-n);
M x = *this, res = 1;
while (n) {
if (n & 1) res *= x;
x *= x;
n >>= 1;
}
return res;
}
M inv() const {
ll a = v, b = MOD, p = 1, q = 0, t;
while (b != 0) {
t = a / b;
swap(a -= t * b, b);
swap(p -= t * q, q);
}
return M(p);
}
bool operator==(const M& a) const { return v == a.v; }
bool operator!=(const M& a) const { return v != a.v; }
friend ostream& operator<<(ostream& os, const M& a) { return os << a.v; }
static uint get_mod() { return MOD; }
};
using Mint = ModInt<998244353>;
const int maxv = 300010;
V<Mint> fact(maxv), ifact(maxv), inv(maxv);
void init() {
fact[0] = 1;
for (int i = 1; i < maxv; ++i) {
fact[i] = fact[i - 1] * i;
}
ifact[maxv - 1] = fact[maxv - 1].inv();
for (int i = maxv - 2; i >= 0; --i) {
ifact[i] = ifact[i + 1] * (i + 1);
}
for (int i = 1; i < maxv; ++i) {
inv[i] = ifact[i] * fact[i - 1];
}
}
Mint comb(int n, int r) {
if (n < 0 || r < 0 || r > n) return Mint(0);
return fact[n] * ifact[r] * ifact[n - r];
}
int main() {
int M, K;
cin >> M >> K;
int sc = (M - 1) / (K + 1);
int fs = M - 1 - sc;
debug(fs, sc);
int a = (fs + 1) / 2 + (fs % 2 == 0 ? 0 : sc);
int b = M - 1 - a;
debug(a, b);
if (a < b) {
cout << "Lose" << endl;
} else if (a == b) {
cout << "Draw" << endl;
} else {
cout << "Win" << endl;
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0