Submission #148518

#TimeUsernameProblemLanguageResultExecution timeMemory
148518HSNU (#200)FunctionCup Museum (FXCUP4_museum)C++17
0 / 100
5 ms128 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...