ratar

#include <bits/stdc++.h>
using namespace std;
int t[55][55];
int getSum(int x1, int y1, int x2, int y2) {
    return t[x2+1][y2+1] - t[x2+1][y1] - t[x1][y2+1] + t[x1][y1];
}
unordered_map<int, int> st1[55][55];
unordered_map<int, int> st2[55][55];
unordered_map<int, int> st3[55][55];
unordered_map<int, int> st4[55][55];
int main() {
    int n;
    cin>>n;
    for(int i = 0; i < n ;++i) {
	for(int j = 0; j < n; ++j) {
	    cin>>t[i+1][j+1];
	    t[i+1][j+1] += t[i][j+1] + t[i+1][j] - t[i][j];
	    //cout<<t[i+1][j+1]<<' ';
	}
	//cout<<'\n';
    }
    for(int i = 0; i < n; ++i) {
	for(int j = 0; j < n ;++j) {
	    for(int k = i; k < n; ++k) {
		for(int l = j; l < n; ++l) {
		    int sum = getSum(i, j, k, l);
		    st1[i][j][sum]++;
		    st2[k+1][j][sum]++;//}}]++;
		    st3[k+1][l+1][sum]++;
		    st4[i][l+1][sum]++;
		}
	    }
	}
    }
    long long ans = 0;
    for(int i = 0; i < n; ++i) {
	for(int j = 0; j < n ;++j) {
	 //   cout<<getSum(i, j,i , j)<<' ';// st1[{getSum(i, j, i, j), {i, j}}]<<' ';
	    for(int k = i; k < n; ++k) {
		for(int l = j; l < n; ++l) {
		    int sum = getSum(i, j, k, l);
		    ans += st3[i][j][sum];
		    ans += st4[k+1][j][sum];
		    ans += st1[k+1][l+1][sum];
		    ans +=st2[i][l+1][sum];
		    continue;

/*
		    ans += st1[{sum, {k+1, l+1}}];
		    ans += st2[{sum, {i, l+1}}];
		    ans += st3[{sum, {i, j}}];
		    ans += st4[{sum, {k+1, j}}];
		    */
		}
	    }
	}
//	cout<<'\n';
    }
    cout<<ans/2<<'\n';
}

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: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: TIME LIMIT EXCEEDED

Test 13

Verdict: TIME LIMIT EXCEEDED