#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 |
1 |
Correct |
5 ms |
128 KB |
Output is correct |
2 |
Incorrect |
5 ms |
128 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
128 KB |
Output is correct |
2 |
Incorrect |
5 ms |
128 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |