TLE 73pts 求卡常

#include<bits/stdc++.h>
using namespace std;
#define fi first
#define sc second
#define pii pair<int,int>
#define pb push_back
#define umap unordered_map
#define mset multiset
#define pq priority_queue
#define ull unsigned long long
#define i128 __int128
const int maxn=1e6+10;
int n,sa[maxn],rk[maxn],tmp[maxn],p,t[62],cnt,x[maxn];
string s;
vector<int> vec[maxn];
int id(char c){
    if('0'<=c&&c<='9') return c-'0';
    else if('A'<=c&&c<='Z') return c-'A'+10;
    else return c-'a'+36;
}
void Radixsort(){
    for(int i=1;i<=n;i++) vec[rk[i+p]].pb(i);
    int cnt=0;
    for(int i=0;i<=n;i++){
        for(int num:vec[i]) x[++cnt]=num;
        vec[i].clear(); 
    }cnt=0;
    for(int i=1;i<=n;i++) vec[rk[x[i]]].pb(x[i]);
    for(int i=0;i<=n;i++){
        for(int num:vec[i]) x[++cnt]=num;
        vec[i].clear();
    }
}
void solve(){
    cin>>s,n=s.size(),s=" "+s,p=1;
    for(int i=1;i<=n;i++) t[id(s[i])]=1;
    for(int i=1;i<62;i++) t[i]+=t[i-1];
    for(int i=1;i<=n;i++) rk[i]=t[id(s[i])];
    // for(int i=1;i<=n;i++) cout<<rk[i]<<" ";cout<<endl;
    for(int i=1;i<=n;i*=2,p=i){
        for(int j=1;j<=n;j++) tmp[j]=x[j]=j;
        // for(int j=1;j<=n;j++) cout<<rk[j]<<rk[j+p]<<" ";cout<<endl;
        Radixsort();
        // for(int j=1;j<=n;j++) cout<<x[j]<<" ";cout<<endl;
        // sort(x+1,x+n+1,[](int x1,int x2){return rk[x1]==rk[x2]?rk[x1+p]<rk[x2+p]:rk[x1]<rk[x2];});
        // for(int j=1;j<=n;j++) cout<<x[j]<<" ";cout<<endl;
        for(int j=1;j<=n;j++) tmp[x[j]]=j;
        for(int j=2;j<=n;j++) if(rk[x[j]]==rk[x[j-1]]&&rk[x[j]+i]==rk[x[j-1]+i]) tmp[x[j]]=tmp[x[j-1]];
        // cout<<"111"<<endl;
        for(int j=1;j<=n;j++) rk[j]=tmp[j];
        // cout<<i<<endl;
    }
    for(int i=1;i<=n;i++) sa[rk[i]]=i;
    for(int i=1;i<=n;i++) cout<<sa[i]<<" ";
    cout<<endl;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--) solve();
    return 0;
}