이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
/*
بسم الله الرحمن الرحيم
Author:
(:Muhammad Aneeq:)
*/
#include <iostream>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
#define int long long
int dis(vector<int>&a,vector<int>&b)
{
int z=0;
for (int j=0;j<b.size();j++)
z+=abs(a[j]-b[j]);
return z;
}
inline void solve()
{
long long B,N,D,M;
cin>>B>>N>>D>>M;
int a[N][B];
vector<int>mi(B,1e9+10),ma(B,0);
map<vector<int>,int>d;
for (int i=0;i<N;i++)
{
for (int j=0;j<B;j++)
cin>>a[i][j];
for (int j=0;j<B;j++)
{
mi[j]=min(mi[j],a[i][j]);
ma[j]=max(ma[j],a[i][j]);
}
}
if (dis(mi,ma)<=D)
{
cout<<(N*(N-1))/2<<endl;
return;
}
if (B==1)
{
vector<int>z;
for (int i=0;i<N;i++)
z.push_back(a[i][0]);
sort(begin(z),end(z));
int ans=0;
for (int i=0;i<N;i++)
{
int x=upper_bound(begin(z),end(z),z[i]+D)-begin(z);
ans+=x-i-1;
}
cout<<ans<<endl;return;
}
int ans=0;
set<vector<int>>s;
for (int i=0;i<N;i++)
{
vector<int>g;
for (int j=0;j<B;j++)
g.push_back(a[i][j]);
d[g]++;
s.insert(g);
}
vector<vector<int>>z={begin(s),end(s)};
for (int i=0;i<z.size();i++)
{
int g=d[z[i]];
ans+=(g*(g-1))/2;
for (int j=i+1;j<z.size();j++)
{
int di=dis(z[i],z[j]);
if (di<=D)
ans+=d[z[i]]*d[z[j]];
}
}
cout<<ans<<endl;
}
signed main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
solve();
}
컴파일 시 표준 에러 (stderr) 메시지
pairs.cpp: In function 'long long int dis(std::vector<long long int>&, std::vector<long long int>&)':
pairs.cpp:16:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
16 | for (int j=0;j<b.size();j++)
| ~^~~~~~~~~
pairs.cpp: In function 'void solve()':
pairs.cpp:67:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
67 | for (int i=0;i<z.size();i++)
| ~^~~~~~~~~
pairs.cpp:71:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
71 | for (int j=i+1;j<z.size();j++)
| ~^~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |