結果
問題 | No.2375 watasou and hibit's baseball |
ユーザー |
![]() |
提出日時 | 2023-07-07 21:59:50 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 117 ms / 2,000 ms |
コード長 | 2,533 bytes |
コンパイル時間 | 1,283 ms |
コンパイル使用メモリ | 122,768 KB |
最終ジャッジ日時 | 2025-02-15 07:21:02 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 36 |
ソースコード
#include <iostream>#include <algorithm>#include <iomanip>#include <vector>#include <queue>#include <deque>#include <set>#include <map>#include <tuple>#include <cmath>#include <numeric>#include <functional>#include <cassert>#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }using namespace std;typedef long long ll;template<typename T>vector<vector<T>> vec2d(int n, int m, T v){return vector<vector<T>>(n, vector<T>(m, v));}template<typename T>vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));}template<typename T>void print_vector(vector<T> v, char delimiter=' '){if(v.empty()) {cout << endl;return;}for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;cout << v.back() << endl;}int main(){ios::sync_with_stdio(false);cin.tie(0);cout << setprecision(10) << fixed;int n, a, b; cin >> n >> a >> b;vector<int> x(n), y(n), k(n);for(int i = 0; i < n; i++) cin >> x[i] >> y[i] >> k[i];auto dist = [&](int i, int j){return abs(x[i]-x[j]) + abs(y[i]-y[j]);};auto ok = [&](int i, int j){if(a <= dist(i, j)) return true;if(b <= abs(k[i]-k[j])) return true;return false;};auto dp = vec3d(1<<n, n, n, false);for(int i = 0; i < n; i++) {for(int j = 0; j < n; j++){if(i == j) continue;int s = (1<<i) | (1<<j);if(ok(i, j)){dp[s][i][j] = true;}}}int ans = 1;for(int s = 0; s < (1<<n); s++){for(int i = 0; i < n; i++){for(int j = 0; j < n; j++){if(!dp[s][i][j]) continue;assert(i != j);chmax(ans, __builtin_popcount(s));for(int k = 0; k < n; k++){if(i == k || j == k) continue;if(s&(1<<k)) continue;bool f = ok(j, k);f |= (a <= dist(j, k)+dist(i, k));if(f) dp[s|(1<<k)][j][k] = true;}}}}cout << ans << endl;}