結果

問題 No.2375 watasou and hibit's baseball
ユーザー kiyoshi0205kiyoshi0205
提出日時 2024-03-19 21:20:57
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,351 bytes
コンパイル時間 4,883 ms
コンパイル使用メモリ 287,028 KB
実行使用メモリ 20,096 KB
最終ジャッジ日時 2024-09-30 05:42:43
合計ジャッジ時間 6,577 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 28 ms
11,100 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 1 ms
5,248 KB
testcase_06 AC 97 ms
19,840 KB
testcase_07 AC 1 ms
5,248 KB
testcase_08 AC 8 ms
7,040 KB
testcase_09 AC 1 ms
5,248 KB
testcase_10 AC 1 ms
5,248 KB
testcase_11 AC 3 ms
5,248 KB
testcase_12 AC 43 ms
19,968 KB
testcase_13 WA -
testcase_14 AC 2 ms
5,248 KB
testcase_15 AC 8 ms
5,248 KB
testcase_16 AC 4 ms
5,248 KB
testcase_17 WA -
testcase_18 AC 2 ms
5,248 KB
testcase_19 AC 2 ms
5,248 KB
testcase_20 AC 3 ms
5,248 KB
testcase_21 WA -
testcase_22 AC 2 ms
5,248 KB
testcase_23 AC 33 ms
19,968 KB
testcase_24 WA -
testcase_25 AC 2 ms
5,248 KB
testcase_26 WA -
testcase_27 WA -
testcase_28 AC 67 ms
19,968 KB
testcase_29 WA -
testcase_30 AC 58 ms
19,968 KB
testcase_31 AC 57 ms
19,968 KB
testcase_32 AC 57 ms
19,840 KB
testcase_33 AC 57 ms
19,968 KB
testcase_34 WA -
testcase_35 AC 68 ms
19,968 KB
testcase_36 AC 65 ms
19,968 KB
testcase_37 WA -
testcase_38 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#ifdef DEBUG
#include"stdlibrary.h"
#else
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#endif
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using ll=long long;
using datas=std::pair<ll,ll>;
using ddatas=std::pair<long double,long double>;
using tdata=std::pair<ll,datas>;
using vec=std::vector<ll>;
using mat=std::vector<vec>;
using pvec=std::vector<datas>;
using pmat=std::vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) std::begin(v),std::end(v)
#define allr(v) std::rbegin(v),std::rend(v)
#define vsort(v) std::sort(all(v))
#define vrsort(v) std::sort(allr(v))
#define uniq(v) vsort(v),(v).erase(std::unique(all(v)),std::end(v))
#define endl "\n"
#define popcount __builtin_popcountll
#define print(x) std::cout<<x<<endl
#define printyes print("Yes")
#define printno print("No")
#define printYES print("YES")
#define printNO print("NO")
#define output(v) do{bool f=0;for(auto outi:v){std::cout<<(f?" ":"")<<outi;f=1;}std::cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
// constexpr ll mod=1000000007;
constexpr ll mod=998244353;
constexpr ll inf=1LL<<60;
constexpr long double eps=1e-9;
const long double PI=acosl(-1);
template<class T,auto x=T::mod()> std::ostream& operator<<(std::ostream& os,const T& v){return os<<v.val();}
template<class T> std::ostream& operator<<(std::ostream& os,const std::vector<T>& v);
template<class T,class F> std::ostream& operator<<(std::ostream& os,const std::set<T,F>& v);
template<class T,class F> std::ostream& operator<<(std::ostream& os,const std::multiset<T,F>& v);
template<class T,class E,class F> std::ostream& operator<<(std::ostream& os,const std::map<T,E,F>& v);
template<class T,class E> std::ostream& operator<<(std::ostream& os,const std::pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}
template<class T> std::ostream& operator<<(std::ostream& os,const std::vector<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T,class F> std::ostream& operator<<(std::ostream& os,const std::set<T,F>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T,class F> std::ostream& operator<<(std::ostream& os,const std::multiset<T,F>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T,class E,class F> std::ostream& operator<<(std::ostream& os,const std::map<T,E,F>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> inline bool chmax(T& a,const T b){bool x=a<b;if(x)a=b;return x;}
template<class T> inline bool chmin(T& a,const T b){bool x=a>b;if(x)a=b;return x;}
#ifdef DEBUG
void debugg(){std::cout<<endl;}
template<class T,class... Args>void debugg(const T& x,const Args&... args){std::cout<<" "<<x;debugg(args...);}
#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif

inline void startupcpp(void) noexcept{
  cin.tie(0)->sync_with_stdio(0);
  cout<<fixed<<setprecision(15);
}

ll modinv(ll a,const ll m=mod) noexcept{
  ll b=m,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+m)%m;
}

ll moddevide(const ll a,const ll b) noexcept{return (a*modinv(b))%mod;}

vec modncrlistp,modncrlistm;

ll modncr(const ll n,const ll r){
  if(n<r||r<0)return 0;
  ll i,size=modncrlistp.size();
  if(size<=n){
    modncrlistp.resize(n+1);
    modncrlistm.resize(n+1);
    if(!size){
      modncrlistp[0]=modncrlistm[0]=1;
      size++;
    }
    For(i,size,n+1)modncrlistp[i]=modncrlistp[i-1]*i%mod;
    modncrlistm[n]=modinv(modncrlistp[n]);
    for(i=n;i>size;--i)modncrlistm[i-1]=modncrlistm[i]*i%mod;
  }
  return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}

ll modpow(ll a,ll n,const ll m=mod){
  if(n<0)return 0;
  ll res=1;
  while(n>0){
    if(n&1)res=res*a%m;
    a=a*a%m;
    n>>=1;
  }
  return res;
}

constexpr ll gcd(const ll a,const ll b) noexcept{return (!b)?abs(a):(a%b==0)?abs(b):gcd(b,a%b);}
constexpr ll lcm(const ll a,const ll b) noexcept{return a/gcd(a,b)*b;}

// #include<atcoder/all>
// using mint=atcoder::modint998244353;
// void operator>>(istream& is,mint& v){long long x;is>>x;v=x;}

ll solve(const vec& a){
  ll N=a.size();
  ll i,j,A=0;
  rep(i,N)chmax(A,a[i]);
  mat cnt(N+1,vec(A+1,0));
  rep(i,N){
    rep(j,A+1)cnt[i+1][j]=cnt[i][j];
    cnt[i+1][a[i]]++;
  }
  ll ans=0;
  rep(i,N)rep(j,i){
    ll K=a[j]-a[i];
    if(K<=0||0>a[j]-K-10||a[i]+K+1>A)continue;
    ans+=cnt[j][a[j]-K-10]*(cnt[N][a[i]+K+1]-cnt[i+1][a[i]+K+1]);
  }
  return ans;
}
ll judge(const vec& a){
  ll N=a.size();
  ll i,j,k,l;
  ll ans=0;
  rep(l,N)rep(k,l)rep(j,k)rep(i,j){
    ll K=a[j]-a[i]-10;
    if(a[k]==a[j]-K&&a[l]==a[k]+K+1)++ans;
  }
  return ans;
}

ll N,M,K,H,W,Q,A,B,C,D;
string s,t;
ll ans;
int main(){
  startupcpp();
// int codeforces;cin>>codeforces;while(codeforces--){
  ll i,j;
  cin>>N>>A>>B;
  vector<tuple<ll,ll,ll>> v(N);
  for(auto&[x,y,k]:v){
    cin>>x>>y>>k;
  }
  auto dist=[&](ll i,ll j){
    auto[x1,y1,k1]=v[i];
    auto[x2,y2,k2]=v[j];
    return abs(x1-x2)+abs(y1-y2);
  };
  vector dp(1<<N,vector(N,vector(N,false)));
  rep(i,N)rep(j,i){
    if(dist(i,j)>=A||abs(get<2>(v[i])-get<2>(v[j]))>=B){
      dp[1<<i|1<<j][i][j]=true;
      dp[1<<i|1<<j][j][i]=true;
    }
  }
  ll bit;
  ans=1;
  rep(bit,1<<N)rep(i,N)rep(j,N){
    if(!dp[bit][i][j])continue;
    chmax(ans,(ll)popcount(bit));
    ll k;
    rep(k,N){
      if(bit>>k&1)continue;
      if(dist(j,k)+dist(i,k)>=A||abs(get<2>(v[j])-get<2>(v[k]))>=B){
        dp[bit|1<<k][j][k]=true;
        dp[bit|1<<k][k][j]=true;
      }
    }
  }
  print(ans);
}
0