ratar

input/code.cpp: In function 'void calc(int, int, int, int)':
input/code.cpp:44:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i=1; i<sms1[x1][y1].size(); ++i){
                                     ^
input/code.cpp:50:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i=1; i<sms2[x2][y2].size(); ++i){
                                     ^
input/code.cpp:56:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while (i1<s1.size() && i2<s2.size()){
                     ^
input/code.cpp:56:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while (i1<s1.size() && i2<s2.size()){
                                     ^

#include <iostream>
#include <vector>
#include <algorithm>
#define MP make_pair
#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];
}


vector<int> sms1[55][55];
vector<int> sms2[55][55];


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;

vector<pair<int, int> > s1;
vector<pair<int, int> > s2;

void calc(int x1, int y1, int x2, int y2){
  sort(sms1[x1][y1].begin(), sms1[x1][y1].end());
  sort(sms2[x2][y2].begin(), sms2[x2][y2].end());
  s1.clear(); s2.clear();
  
  s1.push_back(MP(sms1[x1][y1][0], 1));
  for (int i=1; i<sms1[x1][y1].size(); ++i){
    if (s1[s1.size()-1].F!=sms1[x1][y1][i]) s1.push_back(MP(sms1[x1][y1][i], 1));
    else ++s1[s1.size()-1].S;
  }
  
  s2.push_back(MP(sms2[x2][y2][0], 1));
  for (int i=1; i<sms2[x2][y2].size(); ++i){
    if (s2[s2.size()-1].F!=sms2[x2][y2][i]) s2.push_back(MP(sms2[x2][y2][i], 1));
    else ++s2[s2.size()-1].S;
  }
  
  int i1=0; int i2=0;
  while (i1<s1.size() && i2<s2.size()){
         if (s1[i1].F<s2[i2].F) ++i1;
    else if (s2[i2].F<s1[i1].F) ++i2;
    else{
      ans+=s1[i1].S*s2[i2].S;
      ++i1; ++i2;
    }
  }
}

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];
    }
  }
  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].push_back(smi);
	  sms2[x2][y2].push_back(smi);
	}
      }
    }
  }
  for (int x=1; x<N; ++x){
    for (int y=1; y<N; ++y){
      calc(x+1, y+1, x, y);
    }
  }
  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);
	  sms1[x1][y2].push_back(smi);
	  sms2[x2][y1].push_back(smi);
	}
      }
    }
  }
  for (int x=1; x<N; ++x){
    for (int y=2; y<=N; ++y){
      calc(x+1, y-1, x, y);
    }
  }
  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: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED