HDU 482 String

String

Time Limit: 1000ms

Memory Limit: 32768KB

This problem will be judged on HDU. Original ID: 4821
64-bit integer IO format: %I64d      Java class name: Main

 

Given a string S and two integers L and M, we consider a substring of S as “recoverable” if and only if
  (i) It is of length M*L;
  (ii) It can be constructed by concatenating M “diversified” substrings of S, where each of these substrings has length L; two strings are considered as “diversified” if they don’t have the same character for every position.

Two substrings of S are considered as “different” if they are cut from different part of S. For example, string "aa" has 3 different substrings "aa", "a" and "a".

Your task is to calculate the number of different “recoverable” substrings of S.

 

Input

The input contains multiple test cases, proceeding to the End of File.

The first line of each test case has two space-separated integers M and L.

The second ine of each test case has a string S, which consists of only lowercase letters.

The length of S is not larger than 10^5, and 1 ≤ M * L ≤ the length of S.

 

Output

For each test case, output the answer in a single line.

 

Sample Input

3 3
abcabcbcaabc

Sample Output

2

Source

2013 Asia Regional Changchun

 

解题：字符串hash+map

 

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <cmath>
 #include <algorithm>
 #include <climits>
 #include <vector>
 #include <queue>
 #include <cstdlib>
 #include <string>
 #include <set>
 #include <stack>
 #include <map>
 #define LL long long
 #define ULL unsigned long long
 #define pii pair<int,int>
 #define INF 0x3f3f3f3f
 #define seek 131
 using namespace std;
 const int maxn = ;
 map<ULL,int>mp;
 char str[maxn];
 ULL base[maxn],hs[maxn];
 int main() {
     int M,L,len,i,j,ans;
     ULL tmp;
     base[] = ;
     for(i = ; i < maxn; i++) base[i] = base[i-]*seek;
     while(~scanf("%d%d%s",&M,&L,str)){
         len = strlen(str);
         ans = ;
         hs[len] = ;
         for(i = len-; i >= ; i--)
             hs[i] = hs[i+]*seek+str[i]-'a';
         for(i = ; i < L && i + M*L <= len; i++){
             mp.clear();
             for(j = i; j < i+M*L; j += L){
                 tmp = hs[j] - hs[j+L]*base[L];
                 mp[tmp]++;
             }
             if(mp.size() == M) ans++;
             for(j = i+M*L; j+L <= len; j += L){
                 tmp = hs[j-M*L] - hs[j-M*L+L]*base[L];
                 mp[tmp]--;
                 if(!mp[tmp]) mp.erase(tmp);
                 tmp = hs[j] - hs[j+L]*base[L];
                 mp[tmp]++;
                 if(mp.size() == M) ans++;
             }
         }
         printf("%d\n",ans);
     }
     return ;
 }