ratar

#include <iostream>
#include <map>
#define F first
#define S second
using namespace std;
int N;
 
int tbl[55][55];
int sm[55][55];
 
int csm(int x1, int y1, int x2, int y2){
  return sm[x2][y2]-sm[x1-1][y2]-sm[x2][y1-1]+sm[x1-1][y1-1];
}
 
map<int, int> sms1[55][55];
map<int, int>::iterator it1;
map<int, int>::iterator it1e;
map<int, int> sms2[55][55];
map<int, int>::iterator it2;
map<int, int>::iterator it2e;
 
 
void clrsms(){
  for (int i=0; i<55; ++i) 
    for (int j=0; j<55; ++j) 
      for (int s=0; s<2552; ++s)
	sms1[i][j].clear(), sms2[i][j].clear();
}
 
 
 
 
 
long long ans;
 
 
void calc(){
  while (it1!=it1e && it2!=it2e){
    if (it1->F<it2->F) ++it1;
    else if (it1->F>it2->F) ++it2;
    else{
      ans+=it1->S*it2->S;
      ++it1; ++it2;
    }
  }
}
 
int main(){
  cin >>N;
  for (int i=1; i<=N; ++i){
    for (int j=1; j<=N; ++j){
      cin >> tbl[i][j];
    }
  }
  for (int i=1; i<=N; ++i){
    for (int j=1; j<=N; ++j){
      sm[i][j]=tbl[i][j]+sm[i-1][j]+sm[i][j-1]-sm[i-1][j-1];
    }
  }/*
  while (1){
    int x1, x2, y1, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    cout << csm(x1, y1, x2, y2) << endl;
  }*/
 
  
  for (int x1=1; x1<=N; ++x1){
    for (int y1=1; y1<=N; ++y1){
      for (int x2=x1; x2<=N; ++x2){
	for (int y2=y1; y2<=N; ++y2){
	  int smi=csm(x1, y1, x2, y2);
	  ++sms1[x1][y1][smi];
	  ++sms2[x2][y2][smi];
	}
      }
    }
  }
  for (int x=1; x<N; ++x){
    for (int y=1; y<N; ++y){
      it1=sms2[x][y].begin();
      it1e=sms2[x][y].end();
      it2=sms1[x+1][y+1].begin();
      it2e=sms1[x+1][y+1].end();
      calc();
    }
  }
  clrsms();
  for (int x1=1; x1<=N; ++x1){
    for (int y1=1; y1<=N; ++y1){
      for (int x2=x1; x2<=N; ++x2){
	for (int y2=y1; y2<=N; ++y2){
	  int smi=csm(x1, y1, x2, y2);
	  if (smi<0) smi+=5200;
	  ++sms1[x1][y2][smi];
	  ++sms2[x2][y1][smi];
	}
      }
    }
  }
  for (int x=1; x<N; ++x){
    for (int y=2; y<=N; ++y){
      it1=sms2[x][y].begin();
      it1e=sms2[x][y].end();
      it2=sms1[x+1][y-1].begin();
      it2e=sms1[x+1][y-1].end();
      calc();
    }
  }
  cout << ans << "\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: WRONG ANSWER

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