제출 #890848

#제출 시각아이디문제언어결과실행 시간메모리
890848Muhammad_AneeqPairs (IOI07_pairs)C++17
29 / 100
4090 ms2652 KiB
/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/
#include <iostream>
using namespace std;
#define int long long
inline void solve()
{
  int B,N,D,M;
  cin>>B>>N>>D>>M;
  int a[N][B];
  for (int i=0;i<N;i++)
    for (int j=0;j<B;j++)
      cin>>a[i][j];
  int ans=0;
  for (int i=0;i<N;i++)
    for (int j=i+1;j<N;j++)
    {
      int z=0;
      for (int k=0;k<B;k++)
        z+=abs(a[i][k]-a[j][k]);
      ans+=(z<=D);
    }
  cout<<ans<<endl;
}
signed main()
{
  ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
        solve();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...