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<bits/stdc++.h>
#include "museum.h"
using namespace std;
long long CountSimilarPairs(vector<int> B, vector<int> T, vector<int> G)
{
int N = B.size();
set<long long> sim;
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])
sim.insert(i * 1000000 + j);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |