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"
#include <set>
typedef std::pair<int, int> PII;
typedef std::set<PII> SETPAIR;
long long CountSimilarPairs(std::vector<int> B, std::vector<int> T, std::vector<int> G) {
int N = B.size();
long long count = 0;
SETPAIR set_pair;
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
if (B[i] == B[j]) {
set_pair.insert(PII(i, j));
++count;
continue;
}
if (T[i] == T[j]) {
set_pair.insert(PII(i, j));
++count;
continue;
}
if (G[i] == G[j]) {
set_pair.insert(PII(i, j));
++count;
continue;
}
}
}
return count;;
//return (long long)set_pair.size();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |