結果

問題 No.102 トランプを奪え
ユーザー fumiphysfumiphys
提出日時 2019-09-07 01:40:30
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 47 ms / 5,000 ms
コード長 3,992 bytes
コンパイル時間 1,608 ms
コンパイル使用メモリ 169,676 KB
実行使用メモリ 15,232 KB
最終ジャッジ日時 2024-06-25 00:41:34
合計ジャッジ時間 2,654 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 6 ms
15,036 KB
testcase_01 AC 6 ms
15,176 KB
testcase_02 AC 7 ms
14,976 KB
testcase_03 AC 5 ms
15,104 KB
testcase_04 AC 5 ms
15,104 KB
testcase_05 AC 10 ms
15,104 KB
testcase_06 AC 9 ms
15,232 KB
testcase_07 AC 7 ms
15,232 KB
testcase_08 AC 11 ms
15,052 KB
testcase_09 AC 47 ms
15,068 KB
testcase_10 AC 41 ms
15,076 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

int dp[50000][60];
int encode(int i1, int i2, int i3, int i4){
  return i1 + 14 * (i2 + 14 * (i3 + 14 * i4));
}
int nsum;

int calc(int i, int k){
  if(dp[i][k] >= 0)return dp[i][k];
  if(i == 0)return k;
  int I = i;
  int n[4];
  n[0] = i % 14; i /= 14;
  n[1] = i % 14; i /= 14;
  n[2] = i % 14; i /= 14;
  n[3] = i % 14;
  int res = nsum;
  int nj = 0;
  rep(j, 4)nj += n[j];
  rep(j, 4){
    int c = 1;
    rep(l, j)c *= 14;
    for(int l = 1; l <= 3; l++){
      if(n[j] < l)break;
      int II = I - c * l;
      if(n[j] - l > 0){
        int r = calc(II, nsum - nj - k);
        res = min(res, r);
      }else{
        int op = (nsum - nj - k + 1) / 2;
        int r = calc(II, nsum - nj - k - op);
        res = min(res, r);
      }
    }
  }
  return dp[I][k] = nsum - res;
}

int main(int argc, char const* argv[])
{
  int n[4];
  rep(i, 4)cin >> n[i];
  nsum = 0;
  rep(i, 4)nsum += n[i];
  rep(i, 50000)rep(j, 60)dp[i][j] = -1;
  int k = calc(encode(n[0], n[1], n[2], n[3]), 0);
  if(k > nsum - k)cout << "Taro";
  else if(k == nsum - k)cout << "Draw";
  else cout << "Jiro";
  cout << endl;
  return 0;
}
0