Niitty

input/code.cpp: In function 'int main()':
input/code.cpp:48:101: warning: array subscript -1 is below array bounds of 'long long int [509]' [-Warray-bounds]
   48 |                                         else st[i][j][r][c]=(st[i][j-1][r][c]|st[i][j-1][r][c+FP[i-1]]);
      |                                                                                               ~~~~~~^
input/code.cpp:18:11: note: while referencing 'FP'
   18 | ll LOG[N],FP[N];
      |           ^~

#include <bits/stdc++.h>

using namespace std;

#define IC(c) (int)(c-'A')
#define P(x) (1<<(x))
#define LG(x) log((double)(x))/log(2.0)
#define ll long long

const ll N=509;
const ll LN=10;
ll n,ans;
int total;

//2D Sparse Table + State compression
//+ enum top bottom + double iterator

ll LOG[N],FP[N];
int st[LN][LN][N][N];

bool check(ll x1,ll y1,ll x2,ll y2){
	ll tx=LOG[x2-x1+1];
	ll ty=LOG[y2-y1+1];
	return (st[tx][ty][x1][y1]|st[tx][ty][x2-FP[tx]+1][y1]|st[tx][ty][x1][y2-FP[ty]+1]|st[tx][ty][x2-FP[tx]+1][y2-FP[ty]+1])==total;
}

int main(){
	ios::sync_with_stdio(0);cin.tie(0);
//	freopen("input.txt","r",stdin);
	for(int i=1;i<=500;i++)LOG[i]=LG(i);
	for(int i=0;i<=60;i++)FP[i]=P(i);
	cin>>n;
	for(ll i=1;i<=n;i++)
		for(ll j=1;j<=n;j++){
			char c;
			cin>>c;
			ll id=IC(c);
			st[0][0][i][j]=FP[id];
			total=(total|FP[id]);
		}
	ll t=LOG[n];
	for(ll i=0;i<=t;i++){
		for(ll j=0;j<=t;j++){
			if(i==0&&j==0)continue;
			for(ll r=1;r+P(i)-1<=n;r++){
				for(ll c=1;c+P(j)-1<=n;c++){
					if(i)st[i][j][r][c]=(st[i-1][j][r][c]|st[i-1][j][r+FP[i-1]][c]);
					else st[i][j][r][c]=(st[i][j-1][r][c]|st[i][j-1][r][c+FP[i-1]]);
				}
            }
		}
	}

	for(ll top=1;top<=n;top++){
		for(ll btm=top;btm<=n;btm++){//O(n^2)
			if(!check(top,1,btm,n)){
				if(btm==n){
					cout<<ans<<endl;
					return 0;
				}
				else continue;
			}
			ll l=1,r=1;
			bool tag=false;
			while(r<=n){//O(n)
				while(check(top,l+1,btm,r)&&l<r)l++;
				if(tag)ans+=l;
				else if(check(top,l,btm,r)){
					ans+=l;
					tag=true;
				}
				r++;
			}
		}
	}

	cout<<ans<<endl;
	return 0;
}

Test 1

Group: 1, 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 2

Group: 1, 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 3

Group: 1, 2, 3, 4, 5, 6

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 5

Group: 1, 2, 3, 4, 5, 6

Verdict: ACCEPTED

Test 6

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 7

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 8

Group: 2, 3, 4, 5, 6

Verdict: ACCEPTED

Test 9

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 10

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 11

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 12

Group: 3, 4, 5, 6

Verdict: ACCEPTED

Test 13

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 14

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 15

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 16

Group: 4, 5, 6

Verdict: ACCEPTED

Test 17

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 18

Group: 5, 6

Verdict: WRONG ANSWER

Test 19

Group: 5, 6

Verdict: WRONG ANSWER

Test 20

Group: 5, 6

Verdict: ACCEPTED

Test 21

Group: 5, 6

Verdict: WRONG ANSWER

Test 22

Group: 6

Verdict: WRONG ANSWER

Test 23

Group: 6

Verdict: WRONG ANSWER

Test 24

Group: 6

Verdict: ACCEPTED

Test 25

Group: 6

Verdict: WRONG ANSWER