| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 149071 | Outfraware Boat People (#200) | FunctionCup Museum (FXCUP4_museum) | C++17 | 0 ms | 0 KiB |
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 <string>
#include <algorithm>
#include <map>
void score(std::map<std::string, int>& m, int i, int j) {
std::string s;
s.append(to_string(i));
s.append(to_string(j));
sort(s.begin(), s.end());
m[s]++;
}
long long CountSimilarPairs(std::vector<int> B, std::vector<int> T, std::vector<int> G) {
int N = B.size();
std::map<std::string, int> m;
for (int i = 0; i < N; i++) {
int candB = B[i];
int candT = T[i];
int candG = G[i];
for (int j = 0; j < N; j++) {
// 같으면 continue
if (i == j) {
continue;
}
if (candB == B[j]) {
score(m, i, j);
continue;
}
if (candT == T[j]) {
score(m, i, j);
continue;
}
if (candG == G[j]) {
score(m, i, j);
continue;
}
}
}
return m.size();
}