提出 #50471607

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define rep(i,a,n) for (ll i=a;i<(ll)(n);i++)
#define per(i,a,n) for (ll i=n;i-->(ll)(a);)

ll read(){ll r;scanf("%lld",&r);return r;}
const int N=500000;
char s[N+10];
vector<int> ch[N+10];
int cut(const vector<char>&t){
  // for(auto c:t) printf("%c",c);
  // printf("\n");
  int sz=t.size();
  assert(sz>=2);
  vector<int> cyc(sz,0); // cyc[长度]=最小循环节
  iota(begin(cyc),end(cyc),1);
  int ret = 1;
  rep(i,1,sz-1) {
    for(int l:ch[i+1]) {
      if(l == cyc[i-l]){// 需要 l % cyc[i-l], 但是如果 cyc[i-l] 更小且 下面相等，那么应该有更小的周期
        bool ok = true;
        rep(j,0,l) if(t[j] != t[i+1-l+j]) {
          ok = false;
          break;
        }
        if(ok) {
          cyc[i]=l;
          break;
        }
      }
    }
    ret += cyc[i]==i+1;
  }
  return ret;
}

int main(){
  rep(i,1,N+1) rep(j,2,N+1) {
    if(i*j > N) break;
    ch[i*j].push_back(i);
  }
  scanf("%s",s);
  int sz = strlen(s);
  if(sz == 1) {
    printf("1\n1\n");
    return 0;
  }
  for(auto i:ch[sz]) {
    bool cycle = true;
    rep(j,0,sz) if(s[j] != s[j%i]) {cycle = false;};
    if(cycle) {
      if(i == 1) {
        printf("%d\n1\n",sz);
      }else{
        ll ways = 0;
        if(sz/i > 2) {
          ways += (sz/i-2)*(i-1); // 中间的非两段
        }else{
          ways += 1; // 只能切成2段
        }
        vector<char> t;
        rep(j,0,i) t.push_back(s[j]);
        ways += cut(t);
        t={};
        rep(j,0,i) t.push_back(s[sz-1-j]);
        ways += cut(t);
        printf("2\n%lld\n",ways);
      }
      return 0;
    }
  }
  printf("1\n1\n");
  return 0;
}

提出情報

コンパイルエラー

Main.cpp: In function ‘ll read()’:
Main.cpp:8:21: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
    8 | ll read(){ll r;scanf("%lld",&r);return r;}
      |                ~~~~~^~~~~~~~~~~
Main.cpp: In function ‘int main()’:
Main.cpp:44:8: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   44 |   scanf("%s",s);
      |   ~~~~~^~~~~~~~

ジャッジ結果