#include <bits/stdc++.h>
using namespace std;
long long int h,v,k,sum=0;
    
long long dis1[1505],dis2[1505];
map <int, int> cnt;
void solve (){
    for (int i=1; i<h; i++){
        for (int j=0; j<i; j++){
        	cnt[dis1[j] - dis1[i]]++;
        }
    }
    for (int i=1; i<v; i++){
        for (int j=0; j<i; j++){
			sum += cnt[dis2[j] - dis2[i]];
        }
    }  
}
int main(){
    cin>>h>>v;
    for (int i=0; i<h; i++){cin>>dis1[i];}
    for (int i=0; i<v; i++){cin>>dis2[i];}    
    solve();
    
    long long t=0;
    cout<<sum;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |