結果
問題 | No.2375 watasou and hibit's baseball |
ユーザー |
|
提出日時 | 2023-07-07 23:06:02 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 201 ms / 2,000 ms |
コード長 | 3,439 bytes |
コンパイル時間 | 4,398 ms |
コンパイル使用メモリ | 263,860 KB |
最終ジャッジ日時 | 2025-02-15 08:22:03 |
ジャッジサーバーID (参考情報) |
judge2 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 36 |
ソースコード
#include<bits/stdc++.h>#include<atcoder/all>using namespace std;using namespace atcoder;using lint = long long;using ulint = unsigned long long;#define endl '\n'int const INF = 1<<30;lint const INF64 = 1LL<<61;// lint const mod = 1e9+7;// using mint = modint1000000007;long const mod = 998244353;using mint = modint998244353;lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}lint Sqrt(lint x){lint upper = 1e9;lint lower = 0;while(upper - lower > 0){lint mid = (1+upper + lower)/2;if(mid * mid > x){upper = mid-1;}else{lower= mid;}}return upper;}lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}lint chmin(vector<lint>&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;}lint chmax(vector<lint>&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;}double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c +ans;}}return ans;}string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j]<= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}lint Kai[20000001]; bool firstCallnCr = true;lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ Kai[0] = 1; for(int i=1;i<=20000000;i++){ Kai[i] = Kai[i-1] * i; Kai[i] %= mod;} firstCallnCr =false;} if(n<0)return 0;if(n < r)return 0;if(n==0)return 1;lint ans = Kai[n];lint tmp = (Kai[r] * Kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p;}tmp*= tmp;tmp %= p;}return ans;}#define rep(i, n) for(int i = 0; i < n; i++)#define repp(i, x, y) for(int i = x; i < y; i++)#define vec vector#define pb push_back#define se second#define fi first#define all(x) x.begin(),x.end()struct edge{int to;};using graph = vector<vector<edge>>;int main(){int n,a,b;cin >> n >> a >> b;queue<vec<int>>que;vec<vec<vec<bool>>>went(1<<n, vec<vec<bool>>(n+1, vec<bool>(n+1, false)));rep(i, n) {que.push({1<<i, i, n});went[1<<i][i][n] = true;}int ans = 1;vec<lint>x(n), y(n), k(n);rep(i, n) {cin >> x[i] >> y[i] >> k[i];}while(!que.empty()) {auto q = que.front();que.pop();int c = 0;rep(i, n) {if(q[0] & (1<<i))c++;}ans = max(ans, c);rep(i, n) {bool chk = false;if(q[0] & (1<<i))continue;if(went[q[0] | (1<<i)][i][q[1]]) continue;if(q[1] < n && b <= abs(k[q[1]] - k[i])) chk = true;if(q[2] < n && a <= abs(x[i] - x[q[1]]) + abs(y[i] - y[q[1]]) + abs(x[i] - x[q[2]]) + abs(y[i] - y[q[2]])) chk = true;if(q[2] == n && a <= abs(x[i] - x[q[1]]) + abs(y[i] - y[q[1]])) chk = true;if(chk) {que.push({q[0]+(1<<i), i, q[1]});went[q[0] | (1<<i)][i][q[1]] = true;}}}cout << ans << endl;}