Niitty

input/code.cpp: In function 'int main()':
input/code.cpp:53:87: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   53 |                                         if(i)st[r][c][i][j]=(st[r][c][i-1][j]|st[r+P(i-1)][c][i-1][j]);
      |                                                                                      ~^~
input/code.cpp:6:18: note: in definition of macro 'P'
    6 | #define P(x) (1<<x)
      |                  ^
input/code.cpp:54:90: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   54 |                                         else st[r][c][i][j]=(st[r][c][i][j-1]|st[r][c+P(j-1)][i][j-1]);
      |                                                                                         ~^~
input/code.cpp:6:18: note: in definition of macro 'P'
    6 | #define P(x) (1<<x)
      |                  ^
input/code.cpp:84:18: warning: format '%d' expects argument of type 'int', but argument 2 has type 'll' {aka 'long long int'} [-Wformat=]...

#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))

typedef long long ll;
const ll N=509;
const ll LN=12;
const ll F=26;
ll n,ans;
ll idx[F+1];//char-int list
ll total;

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

ll g[N][N];
ll st[N][N][LN][LN];

bool check(ll x1,ll y1,ll x2,ll y2){
	ll tx=LG(x2-x1+1);
	ll ty=LG(y2-y1+1);
	ll m1=st[x1][y1][tx][ty];
	ll m2=st[x2-P(tx)+1][y1][tx][ty];
	ll m3=st[x1][y2-P(ty)+1][tx][ty];
	ll m4=st[x2-P(tx)+1][y2-P(ty)+1][tx][ty];
	ll s=(m1|m2|m3|m4);
	return (s^total)==0;
}

int main(){
	cin>>n;
	for(ll i=1;i<=n;i++)
		for(ll j=1;j<=n;j++){
			char c;
			cin>>c;
			ll id=IC(c);
			g[i][j]=P(id);
			total=(total|P(id));
		}
	for(ll i=1;i<=n;i++)
		for(ll j=1;j<=n;j++)
			st[i][j][0][0]=g[i][j];
	ll t=LG(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[r][c][i][j]=(st[r][c][i-1][j]|st[r+P(i-1)][c][i-1][j]);
					else st[r][c][i][j]=(st[r][c][i][j-1]|st[r][c+P(j-1)][i][j-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++;
			}
		}
	}

	printf("%d\n",ans);
	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: TIME LIMIT EXCEEDED

Test 23

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 25

Group: 6

Verdict: WRONG ANSWER