結果
問題 | No.2375 watasou and hibit's baseball |
ユーザー |
|
提出日時 | 2023-07-07 22:33:11 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 122 ms / 2,000 ms |
コード長 | 3,511 bytes |
コンパイル時間 | 2,126 ms |
コンパイル使用メモリ | 208,316 KB |
最終ジャッジ日時 | 2025-02-15 07:52:38 |
ジャッジサーバーID (参考情報) |
judge2 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 36 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define fast_io ios::sync_with_stdio(false); cin.tie(nullptr);#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")typedef long long ll;typedef long double ld;#define chmin(a,b) a = min(a,b);#define chmax(a,b) a = max(a,b);#define bit_count(x) __builtin_popcountll(x)#define leading_zero_count(x) __builtin_clz(x)#define trailing_zero_count(x) __builtin_ctz(x)#define gcd(a,b) __gcd(a,b)#define lcm(a,b) a / gcd(a,b) * b#define rep(i,n) for(int i = 0 ; i < n ; i++)#define rrep(i,a,b) for(int i = a ; i < b ; i++)#define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++)#define pt(a) cout << a << endl;#define debug(a) cout << #a << " " << a << endl;#define all(a) a.begin(), a.end()#define endl "\n";#define v1(n,a) vector<bool>(n,a)#define v2(n,m,a) vector<vector<bool>>(n,v1(m,a))#define v3(n,m,k,a) vector<vector<vector<bool>>>(n,v2(m,k,a))#define v4(n,m,k,l,a) vector<vector<vector<vector<bool>>>>(n,v3(m,k,l,a))template<typename T,typename U>istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}template<typename T,typename U>ostream &operator<<(ostream&os,const pair<T,U>&p){os<<p.first<<" "<<p.second;return os;}template<typename T>istream &operator>>(istream&is,vector<T>&v){for(T &in:v){is>>in;}return is;}template<typename T>ostream &operator<<(ostream&os,const vector<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}template<typename T>istream &operator>>(istream&is,vector<vector<T>>&v){for(T &in:v){is>>in;}return is;}template<typename T>ostream &operator<<(ostream&os,const vector<vector<T>>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?"\n":"");}return os;}template<typename T>ostream &operator<<(ostream&os,const set<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}template<typename T>ostream &operator<<(ostream&os,const multiset<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}returnos;}#define dist(a,b,c,d) abs(a-c) + abs(b-d)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 dp = v3(1<<n,n,n,false);rep(i,n){rep(j,n){if(i == j) continue;if(abs(K[i] - K[j]) >= b) dp[(1 << i) | (1 << j)][i][j] = true;int x = X[i], y = Y[i];int nx = X[j], ny = Y[j];if(dist(x,y,nx,ny) >= a) dp[(1 << i) | (1 << j)][i][j] = true;}}rep(S,1<<n){if(bit_count(S) < 2) continue;rep(i,n) {if(!(S >> i & 1)) continue;rep(j,n){if(!(S >> j & 1)) continue;if(!dp[S][i][j]) continue;rep(x,n){if(S >> x & 1) continue;if(abs(K[x] - K[i]) >= b) dp[S | 1 << x][x][i] = true;int ppx = X[j], ppy = Y[j];int px = X[i], py = Y[i];int nx = X[x], ny = Y[x];if(dist(px,py,nx,ny) >= a) dp[S | 1 << x][x][i] = true;if(dist(px,py,nx,ny) + dist(ppx,ppy,nx,ny) >= a) dp[S | 1 << x][x][i] = true;}}}}int res = 1;rep(S,1<<n) rep(i,n) rep(j,n) {if(dp[S][i][j]) chmax(res,bit_count(S));}pt(res)}int main(){fast_ioint t = 1;// cin >> t;rep(i,t) solve();}