Submission #68726310

---

Source Code Expand

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
/*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll _;cin>>_;
  while(_--){
    ll N,M,P;cin>>N>>M>>P;
    mint::set_mod(P);
    vl A(N);
    {
      ll ma=-1e18,mi=1e18;
      rep(i,0,N){
        ll y;cin>>y;
        chmin(mi,y);
        chmax(ma,y);
        A[i]=ma-mi;
      }
    }
    
    //最小値を、出す
    ll l=-1,r=M;
    while(r-l>1){
      ll m=(l+r)/2;
      vl H(N,N);
      H[0]=0;
      rep(i,1,N){
        rep(j,max((ll)i,H[i-1]),N)if(A[i]*j%M<=m){H[i]=j;break;}
      }
      if(H[N-1]!=N&&(N-1)*A[N-1]%M<=m)r=m;
      else l=m;
    }
    
    //やる
    vvm DP(N,vm(N));
    DP[0][0]=1;
    rep(i,1,N){
      vm C(N+1);
      rep(j,0,N)C[j+1]=C[j]+DP[i-1][j];
      rep(j,i,N)if(j*A[i]%M<=r){
        DP[i][j]+=C[j]*2;
        DP[i][j]+=DP[i-1][j]*(j+1-i);
      }
    }
    cout<<DP[N-1][N-1]<<endl;
  }
  return 0;
}

Submission Info

Judge Result