【HDOJ】4333 Revolving Digits

扩展KMP基础题目。

/* 4333 */
#include <iostream>
#include <sstream>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <deque>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <climits>
#include <cctype>
#include <cassert>
#include <functional>
#include <iterator>
#include <iomanip>
using namespace std;
//#pragma comment(linker,"/STACK:102400000,1024000")

#define sti                set<int>
#define stpii            set<pair<int, int> >
#define mpii            map<int,int>
#define vi                vector<int>
#define pii                pair<int,int>
#define vpii            vector<pair<int,int> >
#define rep(i, a, n)     for (int i=a;i<n;++i)
#define per(i, a, n)     for (int i=n-1;i>=a;--i)
#define clr                clear
#define pb                 push_back
#define mp                 make_pair
#define fir                first
#define sec                second
#define all(x)             (x).begin(),(x).end()
#define SZ(x)             ((int)(x).size())
#define lson            l, mid, rt<<1
#define rson            mid+1, r, rt<<1|1

const int maxl = 1e5+5;
char s[maxl], d[maxl*2];
int nxt[maxl];
int Next[maxl];
int Ext[maxl*2];
int slen, dlen;

void getNxt(char *s, int len) {
    int i = 0, j = -1;
    
    nxt[0] = -1;
    while (i < len) {
        if (j==-1 || s[i]==s[j]) {
            ++i;
            ++j;
            nxt[i] = j;
        } else {
            j = nxt[j];
        }
    }
}

void getNext(char *s, int len) {
    int i = 0, j, k, p;
    int L;
    
    Next[0] = len;
    while (i<len-1 && s[i]==s[i+1])
        ++i;
    Next[1] = i;
    k = 1;
    
    for (i=2; i<len; ++i) {
        p = k + Next[k] - 1;
        L = Next[i - k];
        if (i+L <= p) {
            Next[i] = L;
        } else {
            j = p-i+1>0 ? p-i+1:0;
            while (i+j<len && s[i+j]==s[j])
                ++j;
            Next[i] = j;
            k = i;
        }
    }
}

void getExtend(char *d, int dlen, char *s, int slen) {
    int i = 0, j, k, p;
    int L;
    int mnl = min(dlen, slen);
    
    while (i<mnl && d[i]==s[i])
        ++i;
    Ext[0] = i;
    k = 0;
    
    for (i=1; i<dlen; ++i) {
        p = k + Ext[k] - 1;
        L = Next[i - k];
        if (i+L <= p) {
            Ext[i] = L;
        } else {
            j = (p-i+1)>0 ? p-i+1:0;
            while (i+j<dlen && j<slen && d[i+j]==s[j])
                ++j;
            Ext[i] = j;
            k = i;
        }
    }
}

void solve() {    
    strcpy(d, s);
    strcat(d, s);
    slen = strlen(s);
    dlen = slen << 1;
    
    getNext(s, slen);
    getExtend(d, dlen, s, slen);
    getNxt(s, slen);
    
    int mod = slen - nxt[slen];
    int tmp = 1;
    if (slen%mod == 0)
        tmp = slen / mod;
    
    int ln, en, gn;
    
    ln = gn = en = 0;
    rep(i, 0, slen) {
        if (Ext[i] >= slen)
            ++en;
        else if (d[i+Ext[i]] < s[Ext[i]])
            ++ln;
        else
            ++gn;
    }
    
    ln /= tmp;
    en /= tmp;
    gn /= tmp;
    printf("%d %d %d
", ln, en, gn);
}

int main() {
    ios::sync_with_stdio(false);
    #ifndef ONLINE_JUDGE
        freopen("data.in", "r", stdin);
        freopen("data.out", "w", stdout);
    #endif
    
    int t;
    
    scanf("%d", &t);
    rep(tt, 1, t+1) {
        scanf("%s", s);
        printf("Case %d: ", tt);
        solve();
    }
    
    #ifndef ONLINE_JUDGE
        printf("time = %d.
", (int)clock());
    #endif
    
    return 0;
}