結果
問題 | No.1267 Stop and Coin Game |
ユーザー |
![]() |
提出日時 | 2020-12-25 20:07:29 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 116 ms / 2,000 ms |
コード長 | 2,558 bytes |
コンパイル時間 | 2,153 ms |
コンパイル使用メモリ | 195,712 KB |
最終ジャッジ日時 | 2025-01-17 07:25:11 |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 43 |
ソースコード
//#include <tourist>#include <bits/stdc++.h>//#include <atcoder/all>using namespace std;//using namespace atcoder;typedef long long ll;typedef long double ld;typedef unsigned int uint;typedef unsigned long long ull;typedef pair<ll, ll> p;const int INF = 1e9;const double eps = 1e-7;const ll LINF = ll(1e18);const int MOD = 1000000007;const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};const long double pi = 4 * atan(1);#define yes cout << "Yes" << endl#define YES cout << "YES" << endl#define no cout << "No" << endl#define NO cout << "NO" << endl#define rep(i, n) for (int i = 0; i < n; i++)#define ALL(v) v.begin(), v.end()#define debug(v) \cout << #v << ":"; \for (auto x : v) \{ \cout << x << ' '; \} \cout << endl;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 (b < a){a = b;return 1;}return 0;}template <typename T>istream &operator>>(istream &is, vector<T> &v){for (T &x : v)is >> x;return is;}//cout<<fixed<<setprecision(15);有効数字15桁//-std=c++14//g++ yarudake.cpp -std=c++17 -I .ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }ll n, v;//0で使った//dp:0で負け 1でかち -1でわからんvoid dfs(ll cur, vector<int> &dp, vector<ll> &a){if (dp[cur] != -1){return;}ll sum = 0;rep(i, n){if (((1 << i) & cur) == 0){sum += a[i];}}ll sub = v - sum;bool res = false;rep(i, n){if (a[i] <= sub && ((1 << i) & cur)){dfs(cur - (1 << i), dp, a);if (dp[cur - (1 << i)] == 0){res = true;}}}if(res){dp[cur]=1;}else{dp[cur]=0;}}int main(){cin.tie(0);ios::sync_with_stdio(false);cin >> n >> v;vector<ll> a(n);cin >> a;ll sum = 0;rep(i,n){sum+=a[i];}if(sum<=v){return cout<<"Draw"<<"\n",0;}vector<int> dp(1 << n, -1);dfs((1 << n) - 1, dp, a);if(dp[(1<<n)-1]==1){cout<<"First"<<"\n";}else{cout<<"Second"<<"\n";}//debug(dp);}