#759195 (C++17) No.102 トランプを奪え

提出ソース

結果

問題	No.102 トランプを奪え
ユーザー	Demystify
提出日時	2022-05-08 11:14:14
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	171 ms / 5,000 ms
コード長	6,777 bytes
コンパイル時間	1,890 ms
コンパイル使用メモリ	204,968 KB
実行使用メモリ	214,272 KB
最終ジャッジ日時	2024-07-07 22:32:34
合計ジャッジ時間	4,207 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	139 ms 214,144 KB
testcase_01	AC	139 ms 214,144 KB
testcase_02	AC	137 ms 214,144 KB
testcase_03	AC	136 ms 214,272 KB
testcase_04	AC	135 ms 214,144 KB
testcase_05	AC	136 ms 214,144 KB
testcase_06	AC	139 ms 214,144 KB
testcase_07	AC	139 ms 214,144 KB
testcase_08	AC	141 ms 214,272 KB
testcase_09	AC	171 ms 214,272 KB
testcase_10	AC	164 ms 214,144 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// --------------------------------------------------------
#define FOR(i,l,r) for (ll i = (l); i < (r); ++i)
#define RFOR(i,l,r) for (ll i = (r)-1; (l) <= i; --i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define SUM(c) accumulate(ALL(c), 0LL)
#define COUNT(c,v) count(ALL(c),(v))
#define SZ(c) ((ll)(c).size())
#define BIT(b,i) (((b)>>(i)) & 1)
#define PCNT(b) __builtin_popcountll(b)
#define P0(i) (((i) & 1) == 0)
#define P1(i) (((i) & 1) == 1)
#ifdef _LOCAL
    #define debug_bar cerr << "--------------------\n";
    #define debug(x) cerr << "l." << __LINE__ << " : " << #x << " = " << (x) << '\n'
    #define debug_pair(x) cerr << "l." << __LINE__ << " : " << #x << " = (" << x.first << "," << x.second << ")\n";
    template<class T> void debug_line(const vector<T>& ans, int l, int r, int L = 0) { cerr << "l." << L << " :"; for (int i = l; i < r; i++) { cerr << ' ' << ans[i]; } cerr << '\n'; }
#else
    #define cerr if (false) cerr
    #define debug_bar
    #define debug(x)
    #define debug_pair(x)
    template<class T> void debug_line([[maybe_unused]] const vector<T>& ans, [[maybe_unused]] int l, [[maybe_unused]] int r, [[maybe_unused]] int L = 0) {}
#endif
template<class... T> void input(T&... a) { (cin >> ... >> a); }
void print() { cout << '\n'; }
template<class T> void print(const T& a) { cout << a << '\n'; }
template<class T, class... Ts> void print(const T& a, const Ts&... b) { cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T> void cout_line(const vector<T>& ans, int l, int r) { for (int i = l; i < r; i++) { if (i != l) { cout << ' '; } cout << ans[i]; } cout << '\n'; }
template<class T> bool chmin(T& a, const T b) { if (b < a) { a = b; return 1; } return 0; }
template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
pair<ll,ll> divmod(ll a, ll b) { assert(a >= 0 && b > 0); return make_pair(a / b, a % b); }
ll mod(ll x, ll m) { assert(m != 0); return (x % m + m) % m; }
ll ceil(ll a, ll b) { if (b < 0) { return ceil(-a, -b); } assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }
ll floor(ll a, ll b) { if (b < 0) { return floor(-a, -b); } assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }
ll powint(ll x, ll n) { assert(n >= 0); if (n == 0) { return 1; }; ll res = powint(x, n>>1); res *= res; if (n & 1) { res *= x; } return res; }
ll bitlen(ll b) { if (b <= 0) { return 0; } return (64LL - __builtin_clzll(b)); }
ll digit_len(ll n) { assert(n >= 0); if (n == 0) { return 1; } ll sum = 0; while (n > 0) { sum++; n /= 10; } return sum; }
ll digit_sum(ll n) { assert(n >= 0); ll sum = 0; while (n > 0) { sum += n % 10; n /= 10; } return sum; }
ll digit_prod(ll n) { assert(n >= 0); if (n == 0) { return 0; } ll prod = 1; while (n > 0) { prod *= n % 10; n /= 10; } return prod; }
ll xor_sum(ll x) { assert(0 <= x); switch (x % 4) { case 0: return x; case 1: return 1; case 2: return x ^ 1; case 3: return 0; } assert(false); }
string toupper(const string& S) { string T(S); for (int i = 0; i < (int)T.size(); i++) { T[i] = toupper(T[i]); } return T; }
string tolower(const string& S) { string T(S); for (int i = 0; i < (int)T.size(); i++) { T[i] = tolower(T[i]); } return T; }
int a2i(const char& c) { assert(islower(c)); return (c - 'a'); }
int A2i(const char& c) { assert(isupper(c)); return (c - 'A'); }
int d2i(const char& d) { assert(isdigit(d)); return (d - '0'); }
char i2a(const int& i) { assert(0 <= i && i < 26); return ('a' + i); }
char i2A(const int& i) { assert(0 <= i && i < 26); return ('A' + i); }
char i2d(const int& i) { assert(0 <= i && i <= 9); return ('0' + i); }
using P = pair<ll,ll>;
using VP = vector<P>;
using VVP = vector<VP>;
using VS = vector<string>;
using VVS = vector<VS>;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
using VVVLL = vector<VVLL>;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
using VLD = vector<ld>;
using VVLD = vector<VLD>;
using VVVLD = vector<VVLD>;
const ld EPS = 1e-10;
const ld PI  = acosl(-1.0);
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;
constexpr int inf = (1 << 30) - 1;   // 1073741824 - 1
constexpr ll INF = (1LL << 62) - 1;  // 4611686018427387904 - 1
// --------------------------------------------------------
// #include <atcoder/all>
// using namespace atcoder;


const int N = 13;
using i8 = __int8_t;
i8   memo[N+1][N+1][N+1][N+1][4*N+1][4*N+1];
bool flag[N+1][N+1][N+1][N+1][4*N+1][4*N+1];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    ll N1, N2, N3, N4; input(N1, N2, N3, N4);

    // +1: a win
    //  0: draw
    // -1: b win
    memset(memo, 0, sizeof(memo));
    memset(flag, 0, sizeof(flag));
    auto dp = [&](auto&& self, int n1, int n2, int n3, int n4, int a, int b) -> int {
        if (n1 + n2 + n3 + n4 == 0) {
            if (a > b) return 1;
            if (a == b) return 0;
            return -1;
        }

        if (flag[n1][n2][n3][n4][a][b]) return memo[n1][n2][n3][n4][a][b];
        flag[n1][n2][n3][n4][a][b] = true;
        auto& res = memo[n1][n2][n3][n4][a][b];
        res = -1;

        FOR(i,1,4) if (0 <= n1 - i) {
            int c = (n1-i == 0 ? ceil(b, 2) : 0);
            int tmp = self(self, n1-i, n2, n3, n4, b-c, a+i+c);
            if (tmp == -1) return res = +1;
            if (tmp == 0) res = 0;
        }
        FOR(i,1,4) if (0 <= n2 - i) {
            int c = (n2-i == 0 ? ceil(b, 2) : 0);
            int tmp = self(self, n1, n2-i, n3, n4, b-c, a+i+c);
            if (tmp == -1) return res = +1;
            if (tmp == 0) res = 0;
        }
        FOR(i,1,4) if (0 <= n3 - i) {
            int c = (n3-i == 0 ? ceil(b, 2) : 0);
            int tmp = self(self, n1, n2, n3-i, n4, b-c, a+i+c);
            if (tmp == -1) return res = +1;
            if (tmp == 0) res = 0;
        }
        FOR(i,1,4) if (0 <= n4 - i) {
            int c = (n4-i == 0 ? ceil(b, 2) : 0);
            int tmp = self(self, n1, n2, n3, n4-i, b-c, a+i+c);
            if (tmp == -1) return res = +1;
            if (tmp == 0) res = 0;
        }
        return res;
    };

    int res = dp(dp, N1, N2, N3, N4, 0, 0);

    string ans = "";
    if (res == +1) ans = "Taro";
    if (res ==  0) ans = "Draw";
    if (res == -1) ans = "Jiro";
    print(ans);

    return 0;
}

yukicoder

結果

テストケース

ソースコード