1941. Scary Martian Word

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <string>
#include <sstream>
using namespace std;
typedef long long ll;
const double ESP = 10e-8;
const int MAXN = 2000000 + 10;

int vis[MAXN];
int num[MAXN];
int arr[MAXN];
int n;
char word[MAXN*3+1];
int main(){
//    freopen("input.txt","r",stdin);

    int ans = 0;
    memset(num,0,sizeof(num));
    n = 0;
    gets(word);
    int len = strlen(word);
    for(int i = 0;i < len;i+=4){
        int tt = (word[i]-33) + (word[i+1]-33)*10+(word[i+2]-33)*100;
        num[tt]++;
        if(num[tt] == 1){
            n++;
        }
    }
    gets(word);
    len = strlen(word);
    memset(arr,-1,sizeof(arr));
    int cnt = 0;
    for(int i = 0;i < len;i+=4){
        int tt = (word[i]-33) + (word[i+1]-33)*10+(word[i+2]-33)*100;
        if(num[tt]){
            arr[cnt++] = tt;
        }
    }
    int l = 0;
    int r = 0;
    memset(vis,0,sizeof(vis));
    int nn = 0;
    while(l < cnt && r < cnt){
        if(arr[r] != -1){
            vis[ arr[r] ]++;
            if(vis[arr[r]] == num[arr[r] ]){
                nn++;
            }else if(vis[ arr[r] ] > num[ arr[r] ]){
                while(l < cnt && arr[l] != arr[r]){
                    if(vis[arr[l] ] == num[arr[l] ]){
                        nn--;
                    }
                    vis[ arr[l] ]--;
                    l++;
                }
                vis[ arr[l]]--;
                l++;
            }
            if(nn == n){
                ans++;
                vis[arr[l]]--;
                nn--;
                l++;
            }
            r++;
        }else{
            nn = 0;
            memset(vis,0,sizeof(vis));
            r++;
            l = r;
        }
    }
    printf("%d\n",ans);
    return 0;
}