PBCWRI - Writing

Tác giả: happyboy99x

Ngôn ngữ: C++

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;

typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef vector<int> vi;
typedef vector<vi> vvi;

#define sz(a) int((a).size())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define tr(c,i) for(typeof((c).begin()) i = (c).begin(), _e = (c).end(); i != _e; ++i)
#define present(c,x) ((c).find(x) != (c).end())
#define cpresent(c,x) (find(all(c),x) != (c).end())
#define rep(i,n) for(int i = 0, _n = (n); i < _n; ++i)
#define repd(i,n) for(int i = (n)-1; i >= 0; --i )
#define fo(i,a,b) for(int i = (a), _b = (b); i <= _b; ++i)
#define fod(i,a,b) for(int i = (a), _b = (b); i >= _b; --i)

#define INF 1000000000
#define N

int ca[256], cb[256], n, m;
char a[3333], b[3000003];

int main() {
	//freopen( "input.txt", "r", stdin );
	//freopen( "output.txt", "w", stdout );
	scanf("%d%d%s%s",&n,&m,a,b);
	if(n > m) { printf("0\n"); return 0; }
	rep(i,n) { ++ca[a[i]]; ++cb[b[i]]; }
	int res = 1;
	fo(i,'A','z') if( ca[i] != cb[i] ) { res = 0; break; }
	fo(i,n,m-1) {
		++cb[b[i]]; --cb[b[i-n]]; ++res;
		fo(i,'A','z') if( ca[i] != cb[i] ) { --res; break; }
	}
	printf("%d\n", res);
	return 0;
}

Download