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 "museum.h"
long long CountSimilarPairs(std::vector<int> B, std::vector<int> T, std::vector<int> G) {
long long n = B.size();
long long cnt=0;
for (int i=0;i<n-1;i++)
{
for (int j=i+1;j<n;j++)
{
if (B[i]==B[j] || T[i]==T[j] || G[i]==G[j])
cnt++;
}
}
return cnt;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |