This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
#define co1 cout<<"-1\n"
#define sc(x) scanf("%lld",&x)
#define all(x) x.begin(),x.end()
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int SI=3e5+7;
ll INF=8e18+7;
int dx[] = {1 , -1 , 0 , 0};
int dy[] = {0 , 0 , 1 , -1};
int MOD=1e9+7;
ll n,m,a[SI],b[SI];
map  <ll,ll> mp;
int main()
{
   fast
   cin>>n>>m;
   for (int i=0;i<n;i++)
    cin>>a[i];
   for (int i=0;i<m;i++)
    cin>>b[i];
   for (int i=0;i<m;i++)
    for (int u=i+1;u<m;u++)
       mp[b[u]-b[i]]++;
   ll ans=0;
   for (int i=0;i<n;i++)
    for (int u=i+1;u<n;u++)
       ans+=mp[a[u]-a[i]];
   cout << ans<<"\n";
   // use scanf not cin
   return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |