結果

問題 No.2378 Cards and Subsequences
コンテスト
ユーザー eQe
提出日時 2025-02-09 02:14:10
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 172 ms / 2,000 ms
コード長 6,809 bytes
コンパイル時間 6,862 ms
コンパイル使用メモリ 333,004 KB
実行使用メモリ 34,944 KB
最終ジャッジ日時 2025-02-09 02:14:22
合計ジャッジ時間 9,549 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 6
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
namespace my{
using ml=atcoder::modint998244353;
auto&operator>>(istream&i,ml&x){int t;i>>t;x=t;return i;}
auto&operator<<(ostream&o,const ml&x){return o<<(int)x.val();}
#define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__)
#define VL(n,...) vec<ll>__VA_ARGS__;setsize({n},__VA_ARGS__);lin(__VA_ARGS__)
#define FO(n) for(ll ij=n;ij-->0;)
#define FOR(i,...) for(auto[i,i##stop,i##step]=range(0,__VA_ARGS__);i<i##stop;i+=i##step)
#define fo(i,...) FO##__VA_OPT__(R)(i __VA_OPT__(,__VA_ARGS__))
#define fe(a,i,...) for(auto&&__VA_OPT__([)i __VA_OPT__(,__VA_ARGS__]):a)
#define single_testcase void solve();}int main(){my::io();my::solve();}namespace my{
void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<<fixed<<setprecision(15);}
using ll=long long;
constexpr auto range(bool s,auto...a){array<ll,3>r{0,0,1};ll I=0;((r[I++]=a),...);if(!s&&I==1)swap(r[0],r[1]);r[0]-=s;if(s)r[2]*=-1;return r;}
constexpr char newline=10;
constexpr char space=32;
auto max(auto...a){return max(initializer_list<common_type_t<decltype(a)...>>{a...});}

template<class A,class B>struct pair{
  A a;B b;
  pair()=default;
  pair(A a,B b):a(a),b(b){}
  pair(const std::pair<A,B>&p):a(p.first),b(p.second){}
  auto operator<=>(const pair&)const=default;
  pair operator+(const pair&p)const{return{a+p.a,b+p.b};}
  friend istream&operator>>(istream&i,pair&p){return i>>p.a>>p.b;}
  friend ostream&operator<<(ostream&o,const pair&p){return o<<p.a<<space<<p.b;}
};

template<class F=less<>>auto&sort(auto&a,F f={}){ranges::sort(a,f);return a;}
auto&unique(auto&a){sort(a).erase(ranges::unique(a).begin(),a.end());return a;}

template<ll k>auto pack_kth(const auto&...a){return get<k>(make_tuple(a...));}
template<class T,ll n>auto pack_slice(const auto&...a){return[&]<size_t...I>(index_sequence<I...>){return array<T,n>{get<I>(forward_as_tuple(a...))...};}(make_index_sequence<n>{});}

template<class V>concept vectorial=is_base_of_v<vector<typename V::value_type>,V>;
template<class T>struct vec_attr{using core_type=T;static constexpr int rank=0;};
template<vectorial V>struct vec_attr<V>{using core_type=typename vec_attr<typename V::value_type>::core_type;static constexpr int rank=vec_attr<typename V::value_type>::rank+1;};
template<class T>using core_t=vec_attr<T>::core_type;
template<class V>istream&operator>>(istream&i,vector<V>&v){fe(v,e)i>>e;return i;}
template<class V>ostream&operator<<(ostream&o,const vector<V>&v){fe(v,e)o<<e<<string(&e!=&v.back(),vectorial<V>?newline:space);return o;}

template<class V>struct vec;
template<ll rank,class T>struct tensor_helper{using type=vec<typename tensor_helper<rank-1,T>::type>;};
template<class T>struct tensor_helper<0,T>{using type=T;};
template<ll rank,class T>using tensor=typename tensor_helper<rank,T>::type;

template<class V>struct vec:vector<V>{
  using vector<V>::vector;
  vec(const vector<V>&v){vector<V>::operator=(v);}

  template<class...A>requires(sizeof...(A)>=3)vec(A...a){const ll n=sizeof...(a)-1;auto t=pack_slice<ll,n>(a...);ll s[n];fo(i,n)s[i]=t[i];*this=make_vec(s,pack_kth<n>(a...));}
  template<class T,ll n,ll i=0>static auto make_vec(const ll(&s)[n],T x){if constexpr(i==n-1)return vec<T>(s[i],x);else{auto X=make_vec<T,n,i+1>(s,x);return vec<decltype(X)>(s[i],X);}}

  vec&operator^=(const vec&u){this->insert(this->end(),u.begin(),u.end());return*this;}
  vec operator^(const vec&u)const{return vec{*this}^=u;}
  vec&operator+=(const vec&u){vec&v=*this;fo(i,v.size())v[i]+=u[i];return v;}
  vec&operator-=(const vec&u){vec&v=*this;fo(i,v.size())v[i]-=u[i];return v;}
  vec operator+(const vec&u)const{return vec{*this}+=u;}
  vec operator-(const vec&u)const{return vec{*this}-=u;}
  vec&operator++(){fe(*this,e)++e;return*this;}
  vec&operator--(){fe(*this,e)--e;return*this;}
  vec operator-()const{vec v=*this;fe(v,e)e=-e;return v;}

  vec&operator%=(auto M){vec&v=*this;fe(v,e)e%=M;return v;}
  vec operator%(auto M)const{return vec{*this}%=M;}

  ll size()const{return vector<V>::size();}
  template<class T=ll>auto iota()const{vec<T>r(size());fo(i,size())r[i]=i;return r;}

  void emplace_front(const V&x={}){this->emplace(this->begin(),x);}

  auto lower_bound(const V&x)const{return std::lower_bound(this->begin(),this->end(),x);}
  ll arg_lower_bound(const V&x)const{return lower_bound(x)-this->begin();}

  auto scan(const auto&f)const{pair<core_t<V>,bool>r{};fe(*this,e)if constexpr(!vectorial<V>)r.b?f(r.a,e),r:r={e,1};else if(auto s=e.scan(f);s.b)r.b?f(r.a,s.a),r:r=s;return r;}
  auto max()const{return scan([](auto&a,const auto&b){a<b?a=b:0;}).a;}

  template<class F=less<>>auto sort(F f={})const{vec v=*this;ranges::sort(v,f);return v;}

  template<class T=ll,class F=less<>>auto sort_index(F f={})const{const vec&v=*this;return iota<T>().sort([&](ll i,ll j){return!f(v[i],v[j])&&!f(v[j],v[i])?i<j:f(v[i],v[j]);});}

  template<class T=ll,class F=less<>>auto rank(F f={})const{auto o=sort_index<T>(f);vec<T>r(size());fo(i,size())r[o[i]]=i;return r;}

  auto unique()const{auto r=sort();r.erase(ranges::unique(r).begin(),r.end());return r;}
  auto zip()const{auto v=unique();vec<ll>r(size());fo(i,size())r[i]=v.arg_lower_bound((*this)[i]);return r;}

  auto pre_enumerate()const requires(!vectorial<V>){
    auto z=zip();
    vec<ll>pre(z.max()+1,-1);
    vec<ll>res(size());
    fo(i,size()){
      res[i]=pre[z[i]];
      pre[z[i]]=i;
    }
    return res;
  }

  auto rectangle_sum(ll a,ll b,ll c,ll d)const requires(vec_attr<vec<V>>::rank==2){
    static_assert(is_same_v<V,vec<core_t<V>>>);
    assert(0<=a&&a<=b&&b<=size());
    assert(0<=c&&c<=d&&d<=(*this)[0].size());
    core_t<V>r{};
    if(b&&d)r+=(*this)[b-1][d-1];
    if(a&&d)r-=(*this)[a-1][d-1];
    if(b&&c)r-=(*this)[b-1][c-1];
    if(a&&c)r+=(*this)[a-1][c-1];
    return r;
  }
};
template<class...A>requires(sizeof...(A)>=2)vec(A...a)->vec<tensor<sizeof...(a)-2,remove_reference_t<decltype(get<sizeof...(a)-1>(declval<tuple<A...>>()))>>>;
vec(ll)->vec<ll>;

template<ll n,class...A>void setsize(const ll(&l)[n],A&...a){((a=vec<void*>::make_vec(l,core_t<A>{})),...);}

void lin(auto&...a){(cin>>...>>a);}
template<char c=space>void pp(const auto&...a){ll n=sizeof...(a);((cout<<a<<string(--n>0,c)),...);cout<<newline;}

single_testcase
void solve(){
  LL(N,M,K);
  VL(N,s);--s;
  VL(M,a,b);

  vec dp(N+1,K+1,ml{});
  vec su(N+1,K+1,ml{});
  dp[0][0]=su[0][0]=1;

  auto pre=s.pre_enumerate();
  s.emplace_front();
  ++pre;
  pre.emplace_front();
  fo(i,N+1){
    fo(j,K+1){
      if(i==0&&j==0)continue;
      if(j-a[s[i]]>=0)dp[i][j]+=su.rectangle_sum(pre[i],i,j-a[s[i]],j-a[s[i]]+1);
      if(j-b[s[i]]>=0)dp[i][j]+=su.rectangle_sum(pre[i],i,j-b[s[i]],j-b[s[i]]+1);
      su[i][j]=dp[i][j]+(i?su[i-1][j]:0)+(j?su[i][j-1]:0)-(i&&j?su[i-1][j-1]:0);
    }
  }
  pp(su.rectangle_sum(1,N+1,K,K+1));
}}
0