Submission #890848

#	Time	Username	Problem	Language	Result	Execution time	Memory
890848		Muhammad_Aneeq	Pairs (IOI07_pairs)	C++17	29 / 100	4090 ms	2652 KiB

pairs

/*
بسم الله الرحمن الرحيم
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();
}

• Subtask 1: 6 / 6
• Subtask 2: 6 / 6
• Subtask 3: 0 / 6
• Subtask 4: 0 / 6
• Subtask 5: 0 / 6
• Subtask 6: 7 / 7
• Subtask 7: 0 / 7
• Subtask 8: 0 / 8
• Subtask 9: 0 / 8
• Subtask 10: 10 / 10
• Subtask 11: 0 / 10
• Subtask 12: 0 / 10
• Subtask 13: 0 / 10