Submission #22895582


Source Code Expand

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("inline")
#include<bits/stdc++.h>
using namespace std;
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;
}
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 int rd(char c[]){
  int i;
  int sz = 0;
  for(;;){
    i = my_getchar_unlocked();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c[sz++] = i;
  for(;;){
    i = my_getchar_unlocked();
    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_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(unsigned x){
  int s=0;
  char f[10];
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
inline void wt_L(long long x){
  int s=0;
  int m=0;
  char f[20];
  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(unsigned long long x){
  int s=0;
  char f[21];
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
int WRITER_DOUBLE_DIGIT = 15;
inline int writerDigit_double(){
  return WRITER_DOUBLE_DIGIT;
}
inline void writerDigit_double(int d){
  WRITER_DOUBLE_DIGIT = d;
}
inline void wt_L(double x){
  const int d = WRITER_DOUBLE_DIGIT;
  int k;
  int r;
  double v;
  if(x!=x || (x==x+1 && x==2*x)){
    my_putchar_unlocked('E');
    my_putchar_unlocked('r');
    my_putchar_unlocked('r');
    return;
  }
  if(x < 0){
    my_putchar_unlocked('-');
    x = -x;
  }
  x += 0.5 * pow(0.1, d);
  r = 0;
  v = 1;
  while(x >= 10*v){
    v *= 10;
    r++;
  }
  while(r >= 0){
    r--;
    k = floor(x / v);
    if(k >= 10){
      k = 9;
    }
    if(k <= -1){
      k = 0;
    }
    x -= k * v;
    v *= 0.1;
    my_putchar_unlocked(k + '0');
  }
  if(d > 0){
    my_putchar_unlocked('.');
    v = 1;
    for(r=(0);r<(d);r++){
      v *= 0.1;
      k = floor(x / v);
      if(k >= 10){
        k = 9;
      }
      if(k <= -1){
        k = 0;
      }
      x -= k * v;
      my_putchar_unlocked(k + '0');
    }
  }
}
inline void wt_L(const char c[]){
  int i=0;
  for(i=0;c[i]!='\0';i++){
    my_putchar_unlocked(c[i]);
  }
}
inline void wt_L(string &x){
  int i=0;
  for(i=0;x[i]!='\0';i++){
    my_putchar_unlocked(x[i]);
  }
}
string strReplace_L(string str, string bef, string aft, void *mem = wmem){
  int i = 0;
  int k;
  int*fail;
  char*m;
  string res;
  walloc1d(&fail, bef.size()+1, &mem);
  walloc1d(&m, str.size(), &mem);
  for(i=(0);i<(str.size());i++){
    m[i] = 0;
  }
  k = fail[0] = -1;
  for(i=(0);i<(bef.size());i++){
    while(k>=0 && bef[k] != bef[i]){
      k = fail[k];
    }
    fail[i+1] = ++k;
  }
  k = 0;
  for(i=(0);i<(str.size());i++){
    while(k >= 0 && bef[k] != str[i]){
      k = fail[k];
    }
    k++;
    if(k == bef.size()){
      m[i-bef.size()+1] = 1;
      k = fail[k];
    }
  }
  i = 0;
  while(i < str.size()){
    if(m[i]){
      res += aft;
      i += bef.size();
    }
    else{
      res += str[i++];
    }
  }
  return res;
}
string strReplace_L(string str, vector<string> bef, vector<string> aft, void *mem = wmem){
  int i = 0;
  int k;
  int q;
  int*fail;
  int*m;
  string res;
  walloc1d(&fail, bef.size()+1, &mem);
  walloc1d(&m, str.size(), &mem);
  for(i=(0);i<(str.size());i++){
    m[i] = -1;
  }
  for(q=(bef.size())-1;q>=(0);q--){
    k = fail[0] = -1;
    for(i=(0);i<(bef[q].size());i++){
      while(k>=0 && bef[q][k] != bef[q][i]){
        k = fail[k];
      }
      fail[i+1] = ++k;
    }
    k = 0;
    for(i=(0);i<(str.size());i++){
      while(k >= 0 && bef[q][k] != str[i]){
        k = fail[k];
      }
      k++;
      if(k == bef[q].size()){
        m[i-bef[q].size()+1] = q;
        k = fail[k];
      }
    }
  }
  i = 0;
  while(i < str.size()){
    if(m[i] >= 0){
      res += aft[m[i]];
      i += bef[m[i]].size();
    }
    else{
      res += str[i++];
    }
  }
  return res;
}
int main(){
  wmem = memarr;
  string s;
  rd(s);
  reverse(s.begin(), s.end());
  wt_L(strReplace_L(s,vector<string>({"6","9"}),vector<string>({"9","6"})).c_str());
  wt_L('\n');
  return 0;
}
// cLay version 20210524-1

// --- original code ---
// {
//   string @s;
//   reverse(s.begin(), s.end());
//   wt(strReplace(s,VS({"6","9"}),VS({"9","6"})).c_str());
// }

Submission Info

Submission Time
Task B - 180°
User LayCurse
Language C++ (GCC 9.2.1)
Score 200
Code Size 6210 Byte
Status AC
Exec Time 11 ms
Memory 4468 KiB

Compile Error

./Main.cpp: In function ‘std::string strReplace_L(std::string, std::string, std::string, void*)’:
./Main.cpp:233:14: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  233 |   for(i=(0);i<(str.size());i++){
      |             ~^~~~~~~~~~~~~
./Main.cpp:237:14: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  237 |   for(i=(0);i<(bef.size());i++){
      |             ~^~~~~~~~~~~~~
./Main.cpp:244:14: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  244 |   for(i=(0);i<(str.size());i++){
      |             ~^~~~~~~~~~~~~
./Main.cpp:249:10: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  249 |     if(k == bef.size()){
      |        ~~^~~~~~~~~~~~~
./Main.cpp:255:11: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  255 |   while(i < str.size()){
      |         ~~^~~~~~~~~~~~
./Main.cpp: In function ‘std::string strReplace_L(std::string, std::vector<std::__cxx11::basic_string<char> >, std::vector<std::__cxx11::basic_string<char> >, void*)’:
./Main.cpp:275:14: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  275 |   for(i=(0);i<(str.size());i++){
      |             ~^~~~~~~~~~~~~
./Main.cpp:280:16: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {ak...

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 17
Set Name Test Cases
Sample sample_00, sample_01, sample_02
All maximum_01, maximum_02, minimum_01, minimum_02, sample_00, sample_01, sample_02, test_00, test_01, test_02, test_03, test_04, test_05, test_06, test_07, test_08, test_09
Case Name Status Exec Time Memory
maximum_01 AC 11 ms 4468 KiB
maximum_02 AC 7 ms 4332 KiB
minimum_01 AC 3 ms 3628 KiB
minimum_02 AC 2 ms 3436 KiB
sample_00 AC 2 ms 3472 KiB
sample_01 AC 2 ms 3616 KiB
sample_02 AC 2 ms 3584 KiB
test_00 AC 7 ms 4320 KiB
test_01 AC 5 ms 3668 KiB
test_02 AC 3 ms 3572 KiB
test_03 AC 8 ms 4292 KiB
test_04 AC 9 ms 4396 KiB
test_05 AC 7 ms 4344 KiB
test_06 AC 2 ms 3636 KiB
test_07 AC 6 ms 3980 KiB
test_08 AC 2 ms 3604 KiB
test_09 AC 7 ms 4392 KiB