結果

問題 No.102 トランプを奪え
ユーザー heno239heno239
提出日時 2020-04-08 23:41:22
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 557 ms / 5,000 ms
コード長 3,978 bytes
コンパイル時間 1,170 ms
コンパイル使用メモリ 116,280 KB
実行使用メモリ 274,816 KB
最終ジャッジ日時 2024-07-19 05:53:39
合計ジャッジ時間 2,945 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 5 ms
7,552 KB
testcase_01 AC 5 ms
7,680 KB
testcase_02 AC 16 ms
16,256 KB
testcase_03 AC 4 ms
7,680 KB
testcase_04 AC 6 ms
8,448 KB
testcase_05 AC 45 ms
36,352 KB
testcase_06 AC 43 ms
32,896 KB
testcase_07 AC 19 ms
17,536 KB
testcase_08 AC 75 ms
54,528 KB
testcase_09 AC 557 ms
274,816 KB
testcase_10 AC 451 ms
232,576 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
ll mod = 100003;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll a, ll n, ll m = mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };

bool used[14][14][14][14][53][53][2];
int memo[14][14][14][14][53][53][2];
int dfs(vector<int> a, vector<int> s,int id) {
	bool &ub = used[a[0]][a[1]][a[2]][a[3]][s[0]][s[1]][id];
	int &mb = memo[a[0]][a[1]][a[2]][a[3]][s[0]][s[1]][id];
	if (ub) {
		return mb;
	}
	ub = true;
	int res = id^1;
	if (a[0]+a[1]+a[2]+a[3]==0) {
		if (s[0]>s[1])res = 0;
		else if (s[0]==s[1])res = 2;
		else res = 1;
		return mb = res;
	}
	rep(i, 4) {
		rep1(t, 3) {
			if (a[i] < t)continue;
			if (a[i] == t) {
				vector<int> na = a; na[i] = 0;
				vector<int> ns = s;
				ns[id] += t;
				ns[id] += (ns[id ^ 1]+1) / 2;
				ns[id ^ 1] -= (ns[id ^ 1] + 1) / 2;
				int to = dfs(na, ns, id ^ 1);
				if (to == id) {
					return mb = id;
				}
				else if (to == 2)res = to;
			}
			else if (a[i] > t) {
				vector<int> na = a; na[i]-=t;
				vector<int> ns = s;
				ns[id] += t;
				int to = dfs(na, ns, id ^ 1);
				if (to == id) {
					return mb = id;
				}
				else if (to == 2)res = to;
			}
		}
	}
	return mb = res;
}

void solve() {
	vector<int> a(4);
	rep(i, 4)cin >> a[i];
	vector<int> s(2, 0);
	int g = dfs(a, s, 0);
	if (g == 0) {
		cout << "Taro\n";
	}
	else if (g == 1) {
		cout << "Jiro\n";
	}
	else {
		cout << "Draw\n";
	}
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(7);
	//init_f();
	//init();
	//int t; cin >> t; rep(i, t)solve();
	solve();
	stop
		return 0;
}
0