結果

問題 No.1608 Yet Another Ants Problem
ユーザー 👑 PCTprobabilityPCTprobability
提出日時 2021-07-16 22:38:46
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 67 ms / 2,000 ms
コード長 5,542 bytes
コンパイル時間 6,831 ms
コンパイル使用メモリ 302,800 KB
実行使用メモリ 10,788 KB
最終ジャッジ日時 2023-09-20 14:59:30
合計ジャッジ時間 9,825 ms
ジャッジサーバーID
(参考情報)
judge14 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 10 ms
10,548 KB
testcase_01 AC 11 ms
10,504 KB
testcase_02 AC 11 ms
10,556 KB
testcase_03 AC 11 ms
10,596 KB
testcase_04 AC 11 ms
10,496 KB
testcase_05 AC 11 ms
10,652 KB
testcase_06 AC 11 ms
10,608 KB
testcase_07 AC 11 ms
10,776 KB
testcase_08 AC 11 ms
10,604 KB
testcase_09 AC 11 ms
10,648 KB
testcase_10 AC 11 ms
10,584 KB
testcase_11 AC 11 ms
10,552 KB
testcase_12 AC 11 ms
10,680 KB
testcase_13 AC 10 ms
10,496 KB
testcase_14 AC 65 ms
10,572 KB
testcase_15 AC 64 ms
10,556 KB
testcase_16 AC 64 ms
10,496 KB
testcase_17 AC 65 ms
10,556 KB
testcase_18 AC 65 ms
10,532 KB
testcase_19 AC 15 ms
10,472 KB
testcase_20 AC 34 ms
10,528 KB
testcase_21 AC 34 ms
10,576 KB
testcase_22 AC 26 ms
10,480 KB
testcase_23 AC 63 ms
10,580 KB
testcase_24 AC 64 ms
10,700 KB
testcase_25 AC 67 ms
10,588 KB
testcase_26 AC 67 ms
10,544 KB
testcase_27 AC 67 ms
10,544 KB
testcase_28 AC 67 ms
10,788 KB
testcase_29 AC 66 ms
10,716 KB
testcase_30 AC 55 ms
10,576 KB
testcase_31 AC 55 ms
10,572 KB
testcase_32 AC 55 ms
10,496 KB
testcase_33 AC 55 ms
10,492 KB
testcase_34 AC 55 ms
10,660 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = long long;
#define endl "\n"
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define all(s) (s).begin(),(s).end()
//#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
//#define rep(i, n) rep2(i, 0, n)
#define PB push_back 
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define fi first
#define se second
#define pb push_back
#define P pair<ll,ll>
#define NP next_permutation
const ll mod = 998244353;
//const ll mod = 1000000007;
const ll inf = 4500000000000000000ll;
static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
template<class T>
struct Sum{
  vector<T> data;
  Sum(const vector<T>& v):data(v.size()+1){
    for(ll i=0;i<v.size();i++) data[i+1]=data[i]+v[i];
  }
  T get(ll l,ll r) const {
    return data[r]-data[l];
  }
};
template<class T>
struct Sum2{
  vector<vector<T>> data;
  Sum2(const vector<vector<T>> &v):data(v.size()+1,vector<T>(v[0].size()+1)){
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]=data[i][j+1]+v[i][j];
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]+=data[i+1][j];
  }
  T get(ll x1,ll y1,ll x2,ll y2) const {
    return data[x2][y2]+data[x1][y1]-data[x1][y2]-data[x2][y1];
  }
};

void cincout(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(20);
}
using mint = modint998244353;
constexpr ll MAX = 300000;
ll fac[MAX],finv[MAX],inv[MAX];
void COMinit(){
  fac[0]=fac[1]=1;
  finv[0]=finv[1]=1;
  inv[1]=1;
  for(int i=2;i<MAX;i++){
    fac[i]=fac[i-1]*i%mod;
    inv[i]=mod-inv[mod%i]*(mod/i)%mod;
    finv[i]=finv[i-1]*inv[i]%mod;
  }
}
ll COM(ll n,ll k){
  if(n<k) return 0;
  if(n<0||k<0) return 0;
  return fac[n]*(finv[k]*finv[n-k]%mod)%mod;
}
ll HOM(ll n,ll k){
  if(n+k-1>=n-1&&n-1>=0){
  return COM(n+k-1,n-1);
  }
  else{
    return 0;
  }
}
int main() {
  cincout();
  ll n,l;
  cin>>n>>l;
  vector<ll> a(n);
  vcin(a);
  COMinit();
  vector<mint> ans(n);
  for(int i=0;i<n;i++){
    bool left=true;
    ll time=2*a[i]+1;
    ll tmp=0;
    for(int j=0;j<n;j++){
      if(i==j) continue;
      ll p=2*a[j]+1;
      ll q=2*(l-a[j]);
      ll u=min(p,q);
    //  cout<<i<<" "<<j<<" "<<time<<" "<<p<<" "<<q<<endl;
      if(i>j&&p<time&&q<time) tmp++;
      if(u>time){
        left=false;
        break;
      }
    }
 //   cout<<i<<" "<<int(left)<<" "<<tmp<<endl;
    if(left){
      for(int j=0;j<=i;j++) ans[j]+=COM(tmp,i-j);
    }
  }
 // for(auto e:ans) cout<<e.val()<<endl;
  for(int i=0;i<n;i++){
    bool right=true;
    ll time=2*(l-a[i]);
    ll tmp=0;
    for(int j=0;j<n;j++){
      if(i==j) continue;
      ll p=2*a[j]+1;
      ll q=2*(l-a[j]);
      ll u=min(p,q);
      if(i<j&&p<time&&q<time) tmp++;
      if(u>time){
        right=false;
        break;
      }
    }
    //cout<<i<<" "<<int(right)<<" "<<tmp<<endl;
    if(right){
      for(int j=i;j<n;j++) ans[j]+=COM(tmp,j-i);
    }
  }
  for(auto e:ans) cout<<e.val()<<endl;
}
0