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