結果

問題 No.2375 watasou and hibit's baseball
ユーザー jabeejabee
提出日時 2023-07-07 22:55:34
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 187 ms / 2,000 ms
コード長 5,293 bytes
コンパイル時間 5,344 ms
コンパイル使用メモリ 271,276 KB
実行使用メモリ 55,996 KB
最終ジャッジ日時 2023-09-29 00:31:59
合計ジャッジ時間 9,103 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 28 ms
18,752 KB
testcase_01 AC 27 ms
18,892 KB
testcase_02 AC 27 ms
18,568 KB
testcase_03 AC 61 ms
36,272 KB
testcase_04 AC 27 ms
18,572 KB
testcase_05 AC 27 ms
18,712 KB
testcase_06 AC 187 ms
55,828 KB
testcase_07 AC 27 ms
18,876 KB
testcase_08 AC 38 ms
25,948 KB
testcase_09 AC 27 ms
18,664 KB
testcase_10 AC 27 ms
18,596 KB
testcase_11 AC 28 ms
20,116 KB
testcase_12 AC 84 ms
55,760 KB
testcase_13 AC 51 ms
36,212 KB
testcase_14 AC 27 ms
18,776 KB
testcase_15 AC 37 ms
22,364 KB
testcase_16 AC 31 ms
20,044 KB
testcase_17 AC 81 ms
55,788 KB
testcase_18 AC 27 ms
18,652 KB
testcase_19 AC 28 ms
18,852 KB
testcase_20 AC 28 ms
20,048 KB
testcase_21 AC 82 ms
55,824 KB
testcase_22 AC 27 ms
18,680 KB
testcase_23 AC 80 ms
55,704 KB
testcase_24 AC 82 ms
55,752 KB
testcase_25 AC 27 ms
18,748 KB
testcase_26 AC 100 ms
55,876 KB
testcase_27 AC 105 ms
55,772 KB
testcase_28 AC 111 ms
55,680 KB
testcase_29 AC 117 ms
55,720 KB
testcase_30 AC 122 ms
55,704 KB
testcase_31 AC 116 ms
55,732 KB
testcase_32 AC 130 ms
55,748 KB
testcase_33 AC 107 ms
55,960 KB
testcase_34 AC 102 ms
55,756 KB
testcase_35 AC 128 ms
55,760 KB
testcase_36 AC 117 ms
55,996 KB
testcase_37 AC 102 ms
55,888 KB
testcase_38 AC 81 ms
55,760 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <atcoder/all>
#include <atcoder/dsu>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
#include <atcoder/modint>
#include <atcoder/scc>
#include <chrono>
#include <random>
#include <cassert>
#ifndef templete
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
 
//#include<boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace std;
using namespace atcoder;
//using atmint = modint998244353;
using atmint = modint;
using Graph = vector<vector<int>>;
using P = pair<long long,long long>;
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
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<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
    Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;
        ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}
    T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
    T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
    T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
        return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separator
    T pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));}
    // combination of paris for n com.aCb(h+w-2,h-1);
}; 
typedef ModInt<1000000007> mint;
//typedef ModInt<998244353> mint; 
//typedef ModInt<1000000000> mint; 
Comb<mint, 2010101> com;
//vector dp(n+1,vector(n+1,vector<ll>(n+1,0)));
//vector dp(n+1,vector<ll>(n+1,0));
  std::random_device seed_gen;
  std::mt19937 engine(seed_gen());
string ye = "Yes"; string no = "No"; string draw = "Draw";
 
#endif // templete
//---------------------------------------------------------------------------------------------------

void _main() {
    ll n,a,b;
    cin >> n >> a >> b;
    vector<ll>x(n),y(n),k(n);
    rep(i,0,n)cin >> x[i] >> y[i] >> k[i];
    vector dp(1<<n,vector(n+1,vector<ll>(n+1,0)));
    rep(i,0,n){
        dp[1<<i][i+1][0] = 1;
    }
    rep(msk,0,1<<n)rep(one,0,n+1)rep(two,0,n+1){
        ll cnt = __builtin_popcount(msk);
        if(dp[msk][one][two] == 0)continue;
        rep(i,0,n){
            if(msk>>i&1)continue;
            ll nmsk = msk | (1<<i);
            ll ncnt = __builtin_popcount(nmsk);
            ll dist1 = abs(x[one-1] - x[i]) + abs(y[one-1] - y[i]);
            if(ncnt == 2 && a <= dist1)dp[nmsk][i+1][one] |= dp[msk][one][two];
            ll kdist = abs(k[i] - k[one-1]);
            if(2 <= ncnt && b <= kdist)dp[nmsk][i+1][one] |= dp[msk][one][two];
            if(ncnt <= 2)continue;
            ll dist2 = abs(x[two-1] - x[i]) + abs(y[two-1] - y[i]);
            if(a <= dist1 + dist2)dp[nmsk][i+1][one] |= dp[msk][one][two];
        }
    }
    ll ans = 0;
    rep(msk,0,1<<n)rep(one,0,n+1)rep(two,0,n+1){
        ll cnt = __builtin_popcount(msk);
      //  cout << msk << " " << one << " " << two << " " << cnt << endl;
        if(dp[msk][one][two])chmax(ans,cnt);
    }
    cout << ans << endl;
}
0