Niitty

input/code.cpp: In function 'void input()':
input/code.cpp:23:31: warning: comparison of integer expressions of different signedness: 'int' and 'll' {aka 'long long unsigned int'} [-Wsign-compare]
   23 |         for(register int i=1;i<=n;++i)
      |                              ~^~~
input/code.cpp:24:39: warning: comparison of integer expressions of different signedness: 'int' and 'll' {aka 'long long unsigned int'} [-Wsign-compare]
   24 |                 for(register int j=1;j<=n;++j){
      |                                      ~^~~
input/code.cpp: In function 'void solve()':
input/code.cpp:49:35: warning: comparison of integer expressions of different signedness: 'int' and 'll' {aka 'long long unsigned int'} [-Wsign-compare]
   49 |         for(register int top=1;top<=n;++top)
      |                                ~~~^~~
input/code.cpp:50:45: warning: comparison of integer expressions of different signedness: 'int' and 'll' {aka 'long long unsigned int'} [-Wsign-compare]
   50...

#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;

const ll N=510;
const ll LN=10;
ll n,ans;

ll LG[N],P[N];
ll st[LN][LN][N][N];
ll total;

inline int check(ll x1,ll y1,ll x2,ll y2){
	const ll tx=LG[x2-x1+1],ty=LG[y2-y1+1];
	return (st[tx][ty][x1][y1]|
		st[tx][ty][x2-P[tx]+1][y1]|
		st[tx][ty][x1][y2-P[ty]+1]|
		st[tx][ty][x2-P[tx]+1][y2-P[ty]+1])==total;
}

void input(){
	cin>>n;
	for(register int i=1;i<=n;++i)
		for(register int j=1;j<=n;++j){
			char c;cin>>c;
			const ll id=(ll)(c-'A');
			st[0][0][i][j]=P[id];
			total|=P[id];
		}
}

void initst(){
	const int T=LG[n];
	for(register int i=0;i<=T;++i)
		for(register int j=0;j<=T;++j)if(i!=0||j!=0){
			for(register int r=1;r+P[i]-1<=n;++r)
				for(register int 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+P[i-1]][c]);
					else
						st[i][j][r][c]=(st[i][j-1][r][c]|
							st[i][j-1][r][c+P[j-1]]);
				}
		}
}

void solve(){
	for(register int top=1;top<=n;++top)
		for(register int btm=top;btm<=n;++btm){
			bool tag=false;
			for(register int r=1,l=1;r<=n;++r){
				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;
				}
			}
		}
}

void fileopen(){
	freopen("input.txt","r",stdin);
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	fileopen();
	for(register int i=1;i<=500;i++)LG[i]=log((double)(i))/log(2.0);
	for(register int i=0;i<=26;i++)P[i]=1<<i;
	input();
	initst();
	solve();
	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: WRONG ANSWER

Test 4

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

Verdict: WRONG ANSWER

Test 5

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

Verdict: WRONG ANSWER

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: WRONG ANSWER

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: WRONG ANSWER

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: WRONG ANSWER

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: WRONG ANSWER

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: WRONG ANSWER

Test 25

Group: 6

Verdict: WRONG ANSWER