結果

問題 No.1702 count good string
ユーザー 👑Zack Ni👑Zack Ni
提出日時 2021-10-11 11:33:59
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 48 ms / 2,000 ms
コード長 9,168 bytes
コンパイル時間 2,398 ms
コンパイル使用メモリ 189,936 KB
実行使用メモリ 59,872 KB
最終ジャッジ日時 2023-10-13 12:17:45
合計ジャッジ時間 5,293 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,352 KB
testcase_01 AC 2 ms
4,352 KB
testcase_02 AC 2 ms
4,352 KB
testcase_03 AC 1 ms
4,348 KB
testcase_04 AC 2 ms
4,352 KB
testcase_05 AC 2 ms
4,348 KB
testcase_06 AC 2 ms
4,348 KB
testcase_07 AC 1 ms
4,352 KB
testcase_08 AC 1 ms
4,348 KB
testcase_09 AC 2 ms
4,356 KB
testcase_10 AC 1 ms
4,348 KB
testcase_11 AC 2 ms
4,348 KB
testcase_12 AC 2 ms
4,348 KB
testcase_13 AC 47 ms
59,816 KB
testcase_14 AC 47 ms
59,856 KB
testcase_15 AC 47 ms
59,760 KB
testcase_16 AC 46 ms
59,720 KB
testcase_17 AC 48 ms
59,768 KB
testcase_18 AC 47 ms
59,816 KB
testcase_19 AC 46 ms
59,716 KB
testcase_20 AC 46 ms
59,716 KB
testcase_21 AC 46 ms
59,748 KB
testcase_22 AC 46 ms
59,792 KB
testcase_23 AC 2 ms
4,348 KB
testcase_24 AC 2 ms
4,352 KB
testcase_25 AC 2 ms
4,348 KB
testcase_26 AC 2 ms
4,348 KB
testcase_27 AC 2 ms
4,348 KB
testcase_28 AC 2 ms
4,348 KB
testcase_29 AC 3 ms
4,348 KB
testcase_30 AC 3 ms
4,348 KB
testcase_31 AC 3 ms
4,352 KB
testcase_32 AC 3 ms
4,352 KB
testcase_33 AC 40 ms
59,748 KB
testcase_34 AC 40 ms
59,728 KB
testcase_35 AC 40 ms
59,856 KB
testcase_36 AC 39 ms
59,732 KB
testcase_37 AC 39 ms
59,772 KB
testcase_38 AC 40 ms
59,748 KB
testcase_39 AC 40 ms
59,696 KB
testcase_40 AC 40 ms
59,700 KB
testcase_41 AC 40 ms
59,872 KB
testcase_42 AC 40 ms
59,728 KB
testcase_43 AC 35 ms
59,728 KB
testcase_44 AC 35 ms
59,728 KB
testcase_45 AC 2 ms
4,352 KB
testcase_46 AC 2 ms
4,348 KB
testcase_47 AC 2 ms
4,352 KB
testcase_48 AC 2 ms
4,348 KB
testcase_49 AC 2 ms
4,352 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("inline")
#include<bits/stdc++.h>
using namespace std;
#define MD (1000000007U)
void*wmem;
char memarr[96000000];
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 T> inline void walloc2d(T ***arr, int x, int y, void **mem = &wmem){
  int i;
  walloc1d(arr, x, mem);
  for(i=(0);i<(x);i++){
    walloc1d(&((*arr)[i]), y, mem);
  }
}
template<class T> inline void walloc2d(T ***arr, int x1, int x2, int y1, int y2, void **mem = &wmem){
  int i;
  walloc1d(arr, x1, x2, mem);
  for(i=(x1);i<(x2);i++){
    walloc1d(&((*arr)[i]), y1, y2, mem);
  }
}
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(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread(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();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline int rd(char c[]){
  int i;
  int sz = 0;
  for(;;){
    i = my_getchar();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c[sz++] = i;
  for(;;){
    i = my_getchar();
    if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF){
      break;
    }
    c[sz++] = i;
  }
  c[sz]='\0';
  return sz;
}
inline void rd(string &x){
  char*buf = (char *)wmem;
  rd(buf);
  x = buf;
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite(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(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('-');
  }
  while(s--){
    my_putchar(f[s]+'0');
  }
}
inline void wt_L(Modint x){
  int i;
  i = (int)x;
  wt_L(i);
}
int N;
string s;
string ours = "yukicoder";
char opr[100];
vector<string> dictionary;
template<class T1, class T2> int DPcountsubseqoccur(int n1, T1 arr1[], int n2, T2 arr2[]){
  int j;
  Modint** f;
  walloc2d(&f, n1+4, n2 + 3);
  for(j=(0);j<(n1+2);j++){
    int k;
    for(k=(0);k<(n2+2);k++){
      f[j][k] = 0;
    }
  }
  f[0][0] = 1;
  for(j=(0);j<(n1);j++){
    int k;
    for(k=(0);k<(n2+1);k++){
      f[j+1][k] += f[j][k];
      if(k < n2 && arr2[k] == arr1[j]){
        f[j+1][k+1] += f[j][k];
      }
    }
  }
  return f[N][n2];
}
char opA[100000];
char opB[100000];
int main(){
  int i;
  wmem = memarr;
  rd(N);
  rd(s);
  dictionary.push_back(ours);
  int ns =  ours.length();
  for(i=(0);i<(ns);i++){
    memcpy(opr, ours.c_str(), ns);
    opr[ns] = 0;
    opr[i] = '?';
    dictionary.push_back((string)(opr));
  }
  int ms = dictionary.size();
  Modint ans;
  ans = 0;
  memcpy(opA, s.c_str(),  s.length());
  for(i=(0);i<(ms);i++){
    memcpy(opB, dictionary[i].c_str(), dictionary[i].length());
    ans += DPcountsubseqoccur(N, opA, dictionary[i].length(), opB );
  }
  wt_L(ans);
  wt_L('\n');
  return 0;
}
// cLay version 20210926-1

// --- original code ---
// //no-unlocked
// int N;
// string s;
// string ours = "yukicoder";
// char opr[1d2];
// 
// vector<string> dictionary;
// 
// //counting the occurence of a sequence (arr2) appearing as a subsequence in sequence (arr1) 
// template<class T1, class T2>
// int DPcountsubseqoccur(int n1, T1 arr1[], int n2, T2 arr2[]){
//     Modint** f;
//     walloc2d(&f, n1+4, n2 + 3);
//     rep(j, n1+2) rep(k, n2+2) f[j][k] = 0;
//     f[0][0] = 1;
//     rep(j, n1) {
//         rep(k, n2+1){
//             f[j+1][k] += f[j][k];
//             if(k < n2 && arr2[k] == arr1[j]) f[j+1][k+1] += f[j][k];
//         }
//     }
//     return f[N][n2];
// }
// 
// char opA[1d5];
// char opB[1d5];
// 
// { 
//     rd(N, s);
//     dictionary.push_back(ours);
//     int ns =  ours.length();
//     rep(i, ns){
//         memcpy(opr, ours.c_str(), ns);
//         opr[ns] = 0;
//         opr[i] = '?';
//         dictionary.push_back((string)(opr));
//     }
//     int ms = dictionary.size();
//     Modint ans;
//     ans = 0;
//     memcpy(opA, s.c_str(),  s.length());
//     
//     rep(i, ms){
//         memcpy(opB, dictionary[i].c_str(), dictionary[i].length());    
//         ans += DPcountsubseqoccur(N, opA, dictionary[i].length(), opB );
//     }
//     wt(ans);
// }
0