結果

問題 No.2375 watasou and hibit's baseball
ユーザー heno239heno239
提出日時 2023-07-16 21:29:17
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 46 ms / 2,000 ms
コード長 7,115 bytes
コンパイル時間 1,976 ms
コンパイル使用メモリ 153,740 KB
実行使用メモリ 14,876 KB
最終ジャッジ日時 2024-09-17 16:33:31
合計ジャッジ時間 3,791 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 8 ms
12,564 KB
testcase_01 AC 7 ms
12,176 KB
testcase_02 AC 8 ms
13,032 KB
testcase_03 AC 13 ms
14,728 KB
testcase_04 AC 8 ms
12,008 KB
testcase_05 AC 7 ms
11,796 KB
testcase_06 AC 46 ms
14,768 KB
testcase_07 AC 7 ms
12,056 KB
testcase_08 AC 8 ms
11,864 KB
testcase_09 AC 8 ms
13,628 KB
testcase_10 AC 8 ms
12,468 KB
testcase_11 AC 7 ms
12,212 KB
testcase_12 AC 14 ms
13,852 KB
testcase_13 AC 10 ms
13,328 KB
testcase_14 AC 8 ms
12,856 KB
testcase_15 AC 10 ms
12,320 KB
testcase_16 AC 9 ms
12,624 KB
testcase_17 AC 12 ms
13,528 KB
testcase_18 AC 7 ms
12,100 KB
testcase_19 AC 8 ms
12,776 KB
testcase_20 AC 7 ms
12,012 KB
testcase_21 AC 12 ms
13,820 KB
testcase_22 AC 7 ms
11,860 KB
testcase_23 AC 12 ms
13,008 KB
testcase_24 AC 11 ms
12,016 KB
testcase_25 AC 7 ms
11,948 KB
testcase_26 AC 17 ms
14,584 KB
testcase_27 AC 19 ms
14,876 KB
testcase_28 AC 21 ms
14,684 KB
testcase_29 AC 22 ms
14,864 KB
testcase_30 AC 26 ms
14,760 KB
testcase_31 AC 24 ms
14,692 KB
testcase_32 AC 29 ms
14,752 KB
testcase_33 AC 22 ms
14,792 KB
testcase_34 AC 18 ms
14,732 KB
testcase_35 AC 25 ms
14,744 KB
testcase_36 AC 23 ms
14,868 KB
testcase_37 AC 20 ms
14,228 KB
testcase_38 AC 12 ms
13,312 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#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<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

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

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const int mod17 = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#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;

using ld = long double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
    a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
    a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
    vector<T> res;
    int ida = 0, idb = 0;
    while (ida < a.size() || idb < b.size()) {
        if (idb == b.size()) {
            res.push_back(a[ida]); ida++;
        }
        else if (ida == a.size()) {
            res.push_back(b[idb]); idb++;
        }
        else {
            if (a[ida] < b[idb]) {
                res.push_back(a[ida]); ida++;
            }
            else {
                res.push_back(b[idb]); idb++;
            }
        }
    }
    return res;
}
template<typename T>
void cinarray(vector<T>& v) {
    rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
    rep(i, v.size()) {
        if (i > 0)cout << " "; cout << v[i];
    }
    cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
    if (n < 0) {
        ll res = mod_pow(x, -n, m);
        return mod_pow(res, m - 2, m);
    }
    if (abs(x) >= m)x %= m;
    if (x < 0)x += m;
    //if (x == 0)return 0;
    ll res = 1;
    while (n) {
        if (n & 1)res = res * x % m;
        x = x * x % m; n >>= 1;
    }
    return res;
}
//mod should be <2^31
struct modint {
    int n;
    modint() :n(0) { ; }
    modint(ll m) {
        if (m < 0 || mod <= m) {
            m %= mod; if (m < 0)m += mod;
        }
        n = m;
    }
    operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.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 -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)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, ll 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)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
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];
}
modint combP(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
    a = abs(a); b = abs(b);
    if (a < b)swap(a, b);
    while (b) {
        ll r = a % b; a = b; b = r;
    }
    return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
    if (loc >= v.size())v.resize(loc + 1, 0);
    v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
    fill(isp + 2, isp + mn, true);
    for (int i = 2; i < mn; i++) {
        if (!isp[i])continue;
        ps.push_back(i);
        for (int j = 2 * i; j < mn; j += i) {
            isp[j] = false;
        }
    }
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    if (res == st.begin())return st.end();
    res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
    return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
    a = a + b; return a;
}
mP operator-(mP a, mP b) {
    return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
    a = a - b; return a;
}
LP operator+(LP a, LP b) {
    return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
    a = a + b; return a;
}
LP operator-(LP a, LP b) {
    return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
    a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//-----------------------------------------

int dist[14][14];
bool can[1 << 14][14][14];
void solve() {
    int n, a, b; cin >> n >> a >> b;
    vector<int> x(n), y(n), k(n);
    rep(i, n)cin >> x[i] >> y[i] >> k[i];
    auto ck = k;
    rep(i, n)rep(j, n)dist[i][j] = abs(x[i] - x[j]) + abs(y[i] - y[j]);
    int ans = 1;
    rep(i, n)rep(j, n)if (i != j) {
        if (a <= dist[i][j] || b <= abs(k[i] - k[j])) {
            //cout << "! " << i << " " << j << "\n";
            can[(1 << i) | (1 << j)][i][j] = true;
        }
    }
    rep(i, (1 << n)) {
        int cnt = 0;
        rep(j, n)if (i & (1 << j))cnt++;
        rep(j, n)rep(k, n) {
            if (!can[i][j][k])continue;
            //cout << i << " " << j << " " << k << "\n";
            chmax(ans, cnt);
            rep(t, n) {
                if (i & (1 << t))continue;
                bool valid = false;
                if (b <= abs(ck[k] - ck[t]))valid = true;
                if (a <= dist[j][t] + dist[k][t])valid = true;
                if (valid)can[i | (1 << t)][k][t] = true;
            }
        }
    }
    cout << ans << "\n";
}





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