Pizza

#include <bits/stdc++.h>

#define i64 long long
#define u64 unsigned long long
#define i32 int
#define u32 unsigned int

#define pii pair<int, int>
#define pll pair<long long, long long>

#define defmod 1000000007
using namespace std;
int s[200][200][26] = {0};

vector<int> sum(int a, int b, int c, int d){
	vector<int> re(26, 0);
	for(int k = 0; k < 26; k++)
		re[k] = s[c][d][k];
	if(a > 0){
		for(int k = 0; k < 26; k++)
			re[k]-=s[a-1][d][k];
	}
	if(b > 0){
		for(int k = 0; k < 26; k++)
			re[k]-=s[c][b-1][k];
	}
	if(a > 0 && b > 0){
		for(int k = 0; k < 26; k++)
			re[k]+=s[a-1][b-1][k];
	}
	return re;
	
}
int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	
	int n, m; cin >> n >> m;
	string t[202];
	for(int i = 0; i < n; i++){
		cin >> t[i];
		int rivi[26] = {0};
		for(int j = 0; j < m; j++){
			rivi[t[i][j]-'A']++;
			for(int k = 0; k < 26; k++)
				s[i][j][k] = rivi[k];
			if(i > 0){
				for(int k = 0; k < 26; k++)
					s[i][j][k]+=s[i-1][j][k];
			}
		}
	}

	int re = 0;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			for(int jj = j; jj < m; jj++){
				for(int ii = i; ii < n; ii++){
					vector<int> lol = sum(i, j, ii, jj);
					bool suur = false;
					bool ok = true;
					for(int k = 0; k < 26; k++){
						if(lol[k] > 1){
							suur = true;
							ok = false;
							break;
						}
						
					}
					if(suur)
						break;
					if(ok)
						re++;
				}
			}
		}
	}
	cout << re <<  endl;
	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED