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"
using namespace std;
long long CountSimilarPairs(int N, vector<int> B, vector<int> T, vector<int> G) {
long long cnt=0;
for(int i=0; i<N; i++){
for(int j=0; j<i; 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... |