結果

問題 No.1696 Nonnil
ユーザー LayCurseLayCurse
提出日時 2021-10-01 21:52:36
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 354 ms / 3,500 ms
コード長 10,879 bytes
コンパイル時間 3,194 ms
コンパイル使用メモリ 228,520 KB
実行使用メモリ 18,096 KB
最終ジャッジ日時 2023-09-26 17:05:06
合計ジャッジ時間 6,765 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 5 ms
12,188 KB
testcase_01 AC 4 ms
12,160 KB
testcase_02 AC 4 ms
12,184 KB
testcase_03 AC 7 ms
12,268 KB
testcase_04 AC 4 ms
12,160 KB
testcase_05 AC 4 ms
12,388 KB
testcase_06 AC 5 ms
12,224 KB
testcase_07 AC 5 ms
12,164 KB
testcase_08 AC 8 ms
12,184 KB
testcase_09 AC 10 ms
12,948 KB
testcase_10 AC 13 ms
13,476 KB
testcase_11 AC 11 ms
13,208 KB
testcase_12 AC 12 ms
13,164 KB
testcase_13 AC 10 ms
13,080 KB
testcase_14 AC 33 ms
17,600 KB
testcase_15 AC 23 ms
14,884 KB
testcase_16 AC 37 ms
17,912 KB
testcase_17 AC 21 ms
14,448 KB
testcase_18 AC 27 ms
17,320 KB
testcase_19 AC 5 ms
12,320 KB
testcase_20 AC 5 ms
12,192 KB
testcase_21 AC 16 ms
13,748 KB
testcase_22 AC 27 ms
15,120 KB
testcase_23 AC 26 ms
17,256 KB
testcase_24 AC 27 ms
17,344 KB
testcase_25 AC 37 ms
17,644 KB
testcase_26 AC 25 ms
14,928 KB
testcase_27 AC 28 ms
17,300 KB
testcase_28 AC 37 ms
18,096 KB
testcase_29 AC 22 ms
14,620 KB
testcase_30 AC 19 ms
14,156 KB
testcase_31 AC 21 ms
14,176 KB
testcase_32 AC 22 ms
14,580 KB
testcase_33 AC 37 ms
17,796 KB
testcase_34 AC 19 ms
13,988 KB
testcase_35 AC 24 ms
15,012 KB
testcase_36 AC 40 ms
17,820 KB
testcase_37 AC 41 ms
17,848 KB
testcase_38 AC 42 ms
17,824 KB
testcase_39 AC 354 ms
17,880 KB
testcase_40 AC 202 ms
17,804 KB
testcase_41 AC 37 ms
17,888 KB
testcase_42 AC 8 ms
12,424 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("inline")
#include<bits/stdc++.h>
using namespace std;
#define MD (998244353U)
template<class T> struct cLtraits_identity{
  using type = T;
}
;
template<class T> using cLtraits_try_make_signed =
  typename conditional<
    is_integral<T>::value,
    make_signed<T>,
    cLtraits_identity<T>
    >::type;
template <class S, class T> struct cLtraits_common_type{
  using tS = typename cLtraits_try_make_signed<S>::type;
  using tT = typename cLtraits_try_make_signed<T>::type;
  using type = typename common_type<tS,tT>::type;
}
;
void*wmem;
char memarr[96000000];
template<class S, class T> inline auto max_L(S a, T b)
-> typename cLtraits_common_type<S,T>::type{
  return (typename cLtraits_common_type<S,T>::type) a >= (typename cLtraits_common_type<S,T>::type) b ? a : b;
}
template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){
  static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
  (*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned long long)(*mem)) & 15] );
  (*arr)=(T*)(*mem);
  (*mem)=((*arr)+x);
}
template<class T> inline void walloc1d(T **arr, int x1, int x2, void **mem = &wmem){
  walloc1d(arr, x2-x1, mem);
  (*arr) -= x1;
}
template<class T1> void sortA_L(int N, T1 a[], void *mem = wmem){
  sort(a, a+N);
}
template<class T1, class T2> void sortA_L(int N, T1 a[], T2 b[], void *mem = wmem){
  int i;
  pair<T1, T2>*arr;
  walloc1d(&arr, N, &mem);
  for(i=(0);i<(N);i++){
    arr[i].first = a[i];
    arr[i].second = b[i];
  }
  sort(arr, arr+N);
  for(i=(0);i<(N);i++){
    a[i] = arr[i].first;
    b[i] = arr[i].second;
  }
}
struct Modint{
  unsigned val;
  Modint(){
    val=0;
  }
  Modint(int a){
    val = ord(a);
  }
  Modint(unsigned a){
    val = ord(a);
  }
  Modint(long long a){
    val = ord(a);
  }
  Modint(unsigned long long a){
    val = ord(a);
  }
  inline unsigned ord(unsigned a){
    return a%MD;
  }
  inline unsigned ord(int a){
    a %= (int)MD;
    if(a < 0){
      a += MD;
    }
    return a;
  }
  inline unsigned ord(unsigned long long a){
    return a%MD;
  }
  inline unsigned ord(long long a){
    a %= (int)MD;
    if(a < 0){
      a += MD;
    }
    return a;
  }
  inline unsigned get(){
    return val;
  }
  inline Modint &operator++(){
    val++;
    if(val >= MD){
      val -= MD;
    }
    return *this;
  }
  inline Modint &operator--(){
    if(val == 0){
      val = MD - 1;
    }
    else{
      --val;
    }
    return *this;
  }
  inline Modint operator++(int a){
    Modint res(*this);
    val++;
    if(val >= MD){
      val -= MD;
    }
    return res;
  }
  inline Modint operator--(int a){
    Modint res(*this);
    if(val == 0){
      val = MD - 1;
    }
    else{
      --val;
    }
    return res;
  }
  inline Modint &operator+=(Modint a){
    val += a.val;
    if(val >= MD){
      val -= MD;
    }
    return *this;
  }
  inline Modint &operator-=(Modint a){
    if(val < a.val){
      val = val + MD - a.val;
    }
    else{
      val -= a.val;
    }
    return *this;
  }
  inline Modint &operator*=(Modint a){
    val = ((unsigned long long)val*a.val)%MD;
    return *this;
  }
  inline Modint &operator/=(Modint a){
    return *this *= a.inverse();
  }
  inline Modint operator+(Modint a){
    return Modint(*this)+=a;
  }
  inline Modint operator-(Modint a){
    return Modint(*this)-=a;
  }
  inline Modint operator*(Modint a){
    return Modint(*this)*=a;
  }
  inline Modint operator/(Modint a){
    return Modint(*this)/=a;
  }
  inline Modint operator+(int a){
    return Modint(*this)+=Modint(a);
  }
  inline Modint operator-(int a){
    return Modint(*this)-=Modint(a);
  }
  inline Modint operator*(int a){
    return Modint(*this)*=Modint(a);
  }
  inline Modint operator/(int a){
    return Modint(*this)/=Modint(a);
  }
  inline Modint operator+(long long a){
    return Modint(*this)+=Modint(a);
  }
  inline Modint operator-(long long a){
    return Modint(*this)-=Modint(a);
  }
  inline Modint operator*(long long a){
    return Modint(*this)*=Modint(a);
  }
  inline Modint operator/(long long a){
    return Modint(*this)/=Modint(a);
  }
  inline Modint operator-(void){
    Modint res;
    if(val){
      res.val=MD-val;
    }
    else{
      res.val=0;
    }
    return res;
  }
  inline operator bool(void){
    return val!=0;
  }
  inline operator int(void){
    return get();
  }
  inline operator long long(void){
    return get();
  }
  inline Modint inverse(){
    int a = val;
    int b = MD;
    int u = 1;
    int v = 0;
    int t;
    Modint res;
    while(b){
      t = a / b;
      a -= t * b;
      swap(a, b);
      u -= t * v;
      swap(u, v);
    }
    if(u < 0){
      u += MD;
    }
    res.val = u;
    return res;
  }
  inline Modint pw(unsigned long long b){
    Modint a(*this);
    Modint res;
    res.val = 1;
    while(b){
      if(b&1){
        res *= a;
      }
      b >>= 1;
      a *= a;
    }
    return res;
  }
  inline bool operator==(int a){
    return ord(a)==val;
  }
  inline bool operator!=(int a){
    return ord(a)!=val;
  }
}
;
inline Modint operator+(int a, Modint b){
  return Modint(a)+=b;
}
inline Modint operator-(int a, Modint b){
  return Modint(a)-=b;
}
inline Modint operator*(int a, Modint b){
  return Modint(a)*=b;
}
inline Modint operator/(int a, Modint b){
  return Modint(a)/=b;
}
inline Modint operator+(long long a, Modint b){
  return Modint(a)+=b;
}
inline Modint operator-(long long a, Modint b){
  return Modint(a)-=b;
}
inline Modint operator*(long long a, Modint b){
  return Modint(a)*=b;
}
inline Modint operator/(long long a, Modint b){
  return Modint(a)/=b;
}
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(int x){
  int s=0;
  int m=0;
  char f[10];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
inline void wt_L(Modint x){
  int i;
  i = (int)x;
  wt_L(i);
}
template<class T, class S> inline T pow_L(T a, S b){
  T res = 1;
  res = 1;
  for(;;){
    if(b&1){
      res *= a;
    }
    b >>= 1;
    if(b==0){
      break;
    }
    a *= a;
  }
  return res;
}
inline double pow_L(double a, double b){
  return pow(a,b);
}
template<class S> inline void arrInsert(const int k, int &sz, S a[], const S aval){
  int i;
  sz++;
  for(i=sz-1;i>k;i--){
    a[i] = a[i-1];
  }
  a[k] = aval;
}
template<class S, class T> inline void arrInsert(const int k, int &sz, S a[], const S aval, T b[], const T bval){
  int i;
  sz++;
  for(i=sz-1;i>k;i--){
    a[i] = a[i-1];
  }
  for(i=sz-1;i>k;i--){
    b[i] = b[i-1];
  }
  a[k] = aval;
  b[k] = bval;
}
template<class S, class T, class U> inline void arrInsert(const int k, int &sz, S a[], const S aval, T b[], const T bval, U c[], const U cval){
  int i;
  sz++;
  for(i=sz-1;i>k;i--){
    a[i] = a[i-1];
  }
  for(i=sz-1;i>k;i--){
    b[i] = b[i-1];
  }
  for(i=sz-1;i>k;i--){
    c[i] = c[i-1];
  }
  a[k] = aval;
  b[k] = bval;
  c[k] = cval;
}
template<class S, class T, class U, class V> inline void arrInsert(const int k, int &sz, S a[], const S aval, T b[], const T bval, U c[], const U cval, V d[], const V dval){
  int i;
  sz++;
  for(i=sz-1;i>k;i--){
    a[i] = a[i-1];
  }
  for(i=sz-1;i>k;i--){
    b[i] = b[i-1];
  }
  for(i=sz-1;i>k;i--){
    c[i] = c[i-1];
  }
  for(i=sz-1;i>k;i--){
    d[i] = d[i-1];
  }
  a[k] = aval;
  b[k] = bval;
  c[k] = cval;
  d[k] = dval;
}
int main(){
  wmem = memarr;
  int N;
  rd(N);
  int K;
  rd(K);
  int M;
  rd(M);
  int L[M];
  int R[M];
  int cnt[K];
  int i;
  int j;
  int k;
  int s;
  Modint res = 0;
  Modint dp[1501][1501] = {};
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(M);Lj4PdHRW++){
      rd(L[Lj4PdHRW]);L[Lj4PdHRW] += (-1);
      rd(R[Lj4PdHRW]);R[Lj4PdHRW] += (-1);
    }
  }
  sortA_L(M,L,R);
  k = 0;
  for(i=(0);i<(M);i++){
    if(k && L[i] == L[k-1]){
      continue;
    }
    while(k && R[i] <= R[k-1]){
      k--;
    }
    arrInsert(k, k, L, L[i], R, R[i]);
  }
  M = k;
  for(i=(0);i<(K);i++){
    cnt[i] = 0;
  }
  for(i=(0);i<(M);i++){
    for(j=(L[i]);j<(R[i]+1);j++){
      cnt[j] = 1;
    }
  }
  for(i=(1);i<(K);i++){
    cnt[i] += cnt[i-1];
  }
  for(i=(0);i<(M);i++){
    auto YREPHmFM = ((cnt[L[i]])- 1);
    auto jZyWAPpY = (( cnt[R[i]])- 1);
    L[i]=YREPHmFM;
    R[i]=jZyWAPpY;
  }
  s = 0;
  dp[0][0] = 1;
  for(k=(0);k<(M);k++){
    while(s < L[k]){
      for(j=(0);j<(R[k]+1);j++){
        dp[s+1][j+1] += dp[s][j];
        dp[s][j] = 0;
      }
      s++;
    }
    for(i=(R[k]+1)-1;i>=(s);i--){
      for(j=(R[k]+1)-1;j>=(0);j--){
        dp[R[k]+1][j+max_L(0, L[k]-i)] -= dp[i][j];
      }
    }
  }
  for(i=(0);i<(K+1);i++){
    for(j=(0);j<(K+1);j++){
      if(dp[i][j]){
        res += dp[i][j] *(pow_L(Modint(K-i+j),N));
      }
    }
  }
  wt_L(res);
  wt_L('\n');
  return 0;
}
// cLay version 20210926-1

// --- original code ---
// #define MD 998244353
// int @N, @K, @M, L[M], R[M], cnt[K];
// int i, j, k, s;
// Modint res = 0, dp[1501][1501] = {};
// rd((L--,R--)(M));
// sortA(M,L,R);
// 
// k = 0;
// rep(i,M){
//   if(k && L[i] == L[k-1]) continue;
//   while(k && R[i] <= R[k-1]) k--;
//   arrInsert(k, k, L, L[i], R, R[i]);
// }
// M = k;
// 
// rep(i,K) cnt[i] = 0;
// rep(i,M) rep(j,L[i],R[i]+1) cnt[j] = 1;
// rep(i,1,K) cnt[i] += cnt[i-1];
// 
// rep(i,M) (L[i], R[i]) = (cnt[L[i]], cnt[R[i]]) - 1;
// 
// // wt(K);
// // rep(i,M) wt(L[i], R[i]);
// 
// s = 0;
// dp[0][0] = 1;
// rep(k,M){
//   while(s < L[k]){
//     rep(j,R[k]+1) dp[s+1][j+1] += dp[s][j], dp[s][j] = 0;
//     s++;
//   }
//   rrep(i,s,R[k]+1) rrep(j,R[k]+1){
//     dp[R[k]+1][j+max(0,L[k]-i)] -= dp[i][j];
//   }
// }
// 
// rep(i,K+1) rep(j,K+1) if(dp[i][j]){
//   res += dp[i][j] * Modint(K-i+j)**N;
// }
// 
// wt(res);
0