Submission #7879358

Source Code Expand

#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct mint{
  static unsigned md;
  static unsigned W;
  static unsigned R;
  static unsigned Rinv;
  static unsigned mdninv;
  static unsigned RR;
  unsigned val;
  mint(){
  }
  mint(int a){
    val = mulR(a);
  }
  mint(unsigned a){
    val = mulR(a);
  }
  mint(long long a){
    val = mulR(a);
  }
  mint(unsigned long long a){
    val = mulR(a);
  }
  int get_inv(long long a, int md){
    long long t=a;
    long long s=md;
    long long u=1;
    long long v=0;
    long long e;
    while(s){
      e=t/s;
      t-=e*s;
      u-=e*v;
      swap(t,s);
      swap(u,v);
    }
    if(u<0){
      u+=md;
    }
    return u;
  }
  void setmod(unsigned m){
    int i;
    unsigned t;
    W = 32;
    md = m;
    R = (1ULL << W) % md;
    RR = (unsigned long long)R*R % md;
    switch(m){
      case 104857601:
      Rinv = 2560000;
      mdninv = 104857599;
      break;
      case 998244353:
      Rinv = 232013824;
      mdninv = 998244351;
      break;
      case 1000000007:
      Rinv = 518424770;
      mdninv = 2226617417U;
      break;
      case 1000000009:
      Rinv = 171601999;
      mdninv = 737024967;
      break;
      case 1004535809:
      Rinv = 234947584;
      mdninv = 1004535807;
      break;
      case 1007681537:
      Rinv = 236421376;
      mdninv = 1007681535;
      break;
      case 1012924417:
      Rinv = 238887936;
      mdninv = 1012924415;
      break;
      case 1045430273:
      Rinv = 254466304;
      mdninv = 1045430271;
      break;
      case 1051721729:
      Rinv = 257538304;
      mdninv = 1051721727;
      break;
      default:
      Rinv = get_inv(R, md);
      mdninv = 0;
      t = 0;
      for(i=(0);i<((int)W);i++){
        if(t%2==0){
          t+=md;
          mdninv |= (1U<<i);
        }
        t /= 2;
      }
    }
  }
  unsigned mulR(unsigned a){
    return (unsigned long long)a*R%md;
  }
  unsigned mulR(int a){
    if(a < 0){
      a = a%((int)md)+(int)md;
    }
    return mulR((unsigned)a);
  }
  unsigned mulR(unsigned long long a){
    return mulR((unsigned)(a%md));
  }
  unsigned mulR(long long a){
    a %= md;
    if(a < 0){
      a += md;
    }
    return mulR((unsigned)a);
  }
  unsigned reduce(unsigned T){
    unsigned m = T * mdninv;
    unsigned t = (unsigned)((T + (unsigned long long)m*md) >> W);
    if(t >= md){
      t -= md;
    }
    return t;
  }
  unsigned reduce(unsigned long long T){
    unsigned m = (unsigned)T * mdninv;
    unsigned t = (unsigned)((T + (unsigned long long)m*md) >> W);
    if(t >= md){
      t -= md;
    }
    return t;
  }
  unsigned get(){
    return reduce(val);
  }
  mint &operator+=(mint a){
    val += a.val;
    if(val >= md){
      val -= md;
    }
    return *this;
  }
  mint &operator-=(mint a){
    if(val < a.val){
      val = val + md - a.val;
    }
    else{
      val -= a.val;
    }
    return *this;
  }
  mint &operator*=(mint a){
    val = reduce((unsigned long long)val*a.val);
    return *this;
  }
  mint &operator/=(mint a){
    return *this *= a.inverse();
  }
  mint operator+(mint a){
    return mint(*this)+=a;
  }
  mint operator-(mint a){
    return mint(*this)-=a;
  }
  mint operator*(mint a){
    return mint(*this)*=a;
  }
  mint operator/(mint a){
    return mint(*this)/=a;
  }
  mint operator+(int a){
    return mint(*this)+=mint(a);
  }
  mint operator-(int a){
    return mint(*this)-=mint(a);
  }
  mint operator*(int a){
    return mint(*this)*=mint(a);
  }
  mint operator/(int a){
    return mint(*this)/=mint(a);
  }
  mint operator+(long long a){
    return mint(*this)+=mint(a);
  }
  mint operator-(long long a){
    return mint(*this)-=mint(a);
  }
  mint operator*(long long a){
    return mint(*this)*=mint(a);
  }
  mint operator/(long long a){
    return mint(*this)/=mint(a);
  }
  mint operator-(void){
    mint res;
    if(val){
      res.val=md-val;
    }
    else{
      res.val=0;
    }
    return res;
  }
  operator bool(void){
    return val!=0;
  }
  operator int(void){
    return get();
  }
  operator long long(void){
    return get();
  }
  mint inverse(){
    int a = val;
    int b = md;
    int u = 1;
    int v = 0;
    int t;
    mint 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 = (unsigned long long)u*RR % md;
    return res;
  }
  mint pw(unsigned long long b){
    mint a(*this);
    mint res;
    res.val = R;
    while(b){
      if(b&1){
        res *= a;
      }
      b >>= 1;
      a *= a;
    }
    return res;
  }
  bool operator==(int a){
    return mulR(a)==val;
  }
  bool operator!=(int a){
    return mulR(a)!=val;
  }
}
;
unsigned mint::md;
unsigned mint::W;
unsigned mint::R;
unsigned mint::Rinv;
unsigned mint::mdninv;
unsigned mint::RR;
mint operator+(int a, mint b){
  return mint(a)+=b;
}
mint operator-(int a, mint b){
  return mint(a)-=b;
}
mint operator*(int a, mint b){
  return mint(a)*=b;
}
mint operator/(int a, mint b){
  return mint(a)/=b;
}
mint operator+(long long a, mint b){
  return mint(a)+=b;
}
mint operator-(long long a, mint b){
  return mint(a)-=b;
}
mint operator*(long long a, mint b){
  return mint(a)*=b;
}
mint operator/(long long a, mint b){
  return mint(a)/=b;
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void rd(char &c){
  int i;
  for(;;){
    i = getchar_unlocked();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c = i;
}
inline int rd(char c[]){
  int i;
  int sz = 0;
  for(;;){
    i = getchar_unlocked();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c[sz++] = i;
  for(;;){
    i = getchar_unlocked();
    if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF){
      break;
    }
    c[sz++] = i;
  }
  c[sz]='\0';
  return sz;
}
inline void wt_L(char a){
  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){
    putchar_unlocked('-');
  }
  while(s--){
    putchar_unlocked(f[s]+'0');
  }
}
inline void wt_L(mint x){
  int i;
  i = (int)x;
  wt_L(i);
}
template<class T> inline T GCD_L(T a,T b){
  T r;
  while(a){
    r=b;
    b=a;
    a=r%a;
  }
  return b;
}
#define MD 998244353
int N;
char X[200002];
mint cnt[10000];
int y[10000];
int sz;
int main(){
  {
    mint x;
    x.setmod(MD);
  }
  int i;
  int j;
  int k;
  int d;
  mint res;
  rd(N);
  rd(X);
  for(i=(0);i<(N);i++){
    X[i] -= '0';
  }
  int Lj4PdHRW = N+1;
  for(k=(1);k<(Lj4PdHRW);k++){
    if(N % k == 0 && (N / k) % 2 == 1){
      y[sz] = k;
      d =GCD_L(N, 2*k);
      for(i=(0);i<(d);i++){
        cnt[sz] = 2* cnt[sz] + X[i];
      }
      cnt[sz] += 1;
      for(i=(d);i<(N);i++){
        j = 1 - X[i-d];
        if(j > X[i]){
          cnt[sz] -= 1;
          break;
        }
        if(j < X[i]){
          break;
        }
      }
      sz++;
    }
  }
  for(i=(0);i<(sz);i++){
    for(j=(0);j<(i);j++){
      if(y[i] % y[j] == 0){
        cnt[i] -= cnt[j];
      }
    }
  }
  res = 0;
  for(i=(0);i<(sz);i++){
    res += 2 * y[i] * cnt[i];
  }
  wt_L(res);
  wt_L('\n');
  return 0;
}
// cLay varsion 20191006-1

// --- original code ---
// #define MD 998244353
// int N;
// char X[200002];
// mint cnt[1d4]; int y[1d4], sz;
// {
//   int i, j, k, d;
//   mint res;
//   rd(N,X);
//   rep(i,N) X[i] -= '0';
// 
//   REP(k,1,N+1) if(N % k == 0 && (N / k) % 2 == 1){
//     y[sz] = k;
//     d = gcd(N, 2k);
//     rep(i,d) cnt[sz] = 2 cnt[sz] + X[i];
//     cnt[sz] += 1;
//     rep(i,d,N){
//       j = 1 - X[i-d];
//       if(j > X[i]) cnt[sz] -= 1, break;
//       if(j < X[i]) break;
//     }
//     sz++;
//   }
// 
//   rep(i,sz) rep(j,i) if(y[i] % y[j] == 0) cnt[i] -= cnt[j];
// 
//   res = 0;
//   rep(i,sz) res += 2 * y[i] * cnt[i];
// 
//   wt(res);
// }

Submission Info

Submission Time
Task C - Division by Two with Something
User LayCurse
Language C++14 (GCC 5.4.1)
Score 800
Code Size 8659 Byte
Status AC
Exec Time 14 ms
Memory 512 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 800 / 800
Status
AC × 3
AC × 49
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 7 ms 384 KiB
02.txt AC 5 ms 512 KiB
03.txt AC 4 ms 384 KiB
04.txt AC 7 ms 512 KiB
05.txt AC 5 ms 384 KiB
06.txt AC 5 ms 384 KiB
07.txt AC 4 ms 384 KiB
08.txt AC 4 ms 384 KiB
09.txt AC 4 ms 384 KiB
10.txt AC 5 ms 384 KiB
11.txt AC 7 ms 384 KiB
12.txt AC 5 ms 512 KiB
13.txt AC 4 ms 384 KiB
14.txt AC 7 ms 384 KiB
15.txt AC 5 ms 384 KiB
16.txt AC 5 ms 384 KiB
17.txt AC 4 ms 384 KiB
18.txt AC 4 ms 384 KiB
19.txt AC 4 ms 384 KiB
20.txt AC 5 ms 384 KiB
21.txt AC 7 ms 384 KiB
22.txt AC 5 ms 384 KiB
23.txt AC 4 ms 384 KiB
24.txt AC 8 ms 512 KiB
25.txt AC 5 ms 384 KiB
26.txt AC 6 ms 384 KiB
27.txt AC 4 ms 384 KiB
28.txt AC 4 ms 384 KiB
29.txt AC 4 ms 512 KiB
30.txt AC 14 ms 384 KiB
31.txt AC 7 ms 384 KiB
32.txt AC 5 ms 384 KiB
33.txt AC 4 ms 384 KiB
34.txt AC 8 ms 384 KiB
35.txt AC 7 ms 384 KiB
36.txt AC 5 ms 384 KiB
37.txt AC 4 ms 384 KiB
38.txt AC 4 ms 384 KiB
39.txt AC 4 ms 384 KiB
40.txt AC 14 ms 384 KiB
41.txt AC 7 ms 384 KiB
42.txt AC 5 ms 384 KiB
43.txt AC 1 ms 256 KiB
44.txt AC 1 ms 256 KiB
45.txt AC 1 ms 256 KiB
46.txt AC 1 ms 256 KiB
s1.txt AC 1 ms 256 KiB
s2.txt AC 1 ms 256 KiB
s3.txt AC 1 ms 256 KiB