結果

問題 No.2454 Former < Latter
ユーザー asaringoasaringo
提出日時 2023-09-01 22:50:22
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 71 ms / 2,000 ms
コード長 5,553 bytes
コンパイル時間 2,697 ms
コンパイル使用メモリ 207,432 KB
最終ジャッジ日時 2025-02-16 17:07:48
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#define overload2(a, b, c, ...) c
#define overload3(a, b, c, d, ...) d
#define overload4(a, b, c, d, e ...) e
#define overload5(a, b, c, d, e, f ...) f
#define overload6(a, b, c, d, e, f, g ...) g
#define fast_io ios::sync_with_stdio(false); cin.tie(nullptr);
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
typedef long long ll;
typedef long double ld;
#define chmin(a,b) a = min(a,b);
#define chmax(a,b) a = max(a,b);
#define bit_count(x) __builtin_popcountll(x)
#define leading_zero_count(x) __builtin_clz(x)
#define trailing_zero_count(x) __builtin_ctz(x)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a / gcd(a,b) * b
#define rep(...) overload3(__VA_ARGS__, rrep, rep1)(__VA_ARGS__)
#define rep1(i,n) for(int i = 0 ; i < n ; i++)
#define rrep(i,a,b) for(int i = a ; i < b ; i++)
#define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++)
#define pt(a) cout << a << endl;
#define print(...) printall(__VA_ARGS__);
#define debug(a) cout << #a << " " << a << endl;
#define all(a) a.begin(), a.end()
#define endl "\n";
#define v1(T,n,a) vector<T>(n,a)
#define v2(T,n,m,a) vector<vector<T>>(n,v1(T,m,a))
#define v3(T,n,m,k,a) vector<vector<vector<T>>>(n,v2(T,m,k,a))
#define v4(T,n,m,k,l,a) vector<vector<vector<vector<T>>>>(n,v3(T,m,k,l,a))
template<typename T,typename U>istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<typename T,typename U>ostream &operator<<(ostream&os,const pair<T,U>&p){os<<p.first<<" "<<p.second;return os;}
template<typename T>istream &operator>>(istream&is,vector<T>&v){for(T &in:v){is>>in;}return is;}
template<typename T>ostream &operator<<(ostream&os,const vector<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return
    os;}
template<typename T>istream &operator>>(istream&is,vector<vector<T>>&v){for(T &in:v){is>>in;}return is;}
template<typename T>ostream &operator<<(ostream&os,const vector<vector<T>>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?"\n":""
    );}return os;}
template<typename T>ostream &operator<<(ostream&os,const set<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<typename T>ostream &operator<<(ostream&os,const multiset<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return
    os;}
template<class... Args> void printall(Args... args){for(auto i:initializer_list<common_type_t<Args...>>{args...}) cout<<i<<" ";cout<<endl;}
template<typename T> struct Z_Algorithm{
private:
int n, m;
vector<T> S, U;
vector<int> A, Z;
void init_(vector<T> S_, vector<T> U_){
S = S_;
U = U_;
n = S.size();
m = U.size();
A.resize(m,0);
Z.resize(n,0);
}
void build1(){
int from = -1, last = -1;
for(int i = 1 ; i < m ; i++){
int now = 0;
if(from != -1){
now = min(A[i-from], max(last-i,0));
}
while(i + now < m && U[now] == U[i+now]) now++;
if(last < i + now){
last = i + now;
from = i;
}
A[i] = now;
}
A[0] = m;
}
void build2(){
int from = -1, last = -1;
for(int i = 0 ; i < n ; i++){
int now = 0;
if(from != -1){
now = min(A[i-from], max(last-i,0));
}
while(now < m && i + now < n && U[now] == S[i+now]) now++;
if(last < i + now){
last = i + now;
from = i;
}
Z[i] = now;
}
}
void build_(){
build1();
build2();
}
public:
Z_Algorithm() {}
Z_Algorithm(vector<T> S_, vector<T> U_): n(S_.size()), m(U_.size()), S(S_), U(U_) { Z.resize(n,0); A.resize(m,0); }
void init(vector<T> S_, vector<T> U_){ init_(S_, U_); }
void build(){ build_(); }
vector<int> get_prefix_info(){ return Z; }
vector<int> get_z_algorithm(){ return A; }
};
// function : return : description
// -----------------------------------------------------------------
// constructor(vector<T> S, U) : : vector U vector S
// constructor() : :
// init(vector<T> S, U) : void : vector U vector S
// build() : void : , S[i] U
// get_prefix_info(u,v) : vector<T> : build
// ------------------------------------------------------------------
void solve(){
int n;
string Z;
cin >> n >> Z;
vector<int> A(n);
rep(i,n) A[i] = Z[i]-'a';
Z_Algorithm zal(A,A);
zal.build();
auto v = zal.get_prefix_info();
int res = 0;
rrep(i,1,n){
int p = v[i];
if(p > i) {
res++;
continue;
}
if(p == i){
if(p + i < n) res++;
continue;
}
if(i+p==n) continue;
if(A[i+p] > A[p]) res++;
}
pt(res)
}
int main(){
fast_io
int t = 1;
cin >> t;
rep(i,t) solve();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0