# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
149145 | dragoon (#200) | FunctionCup Museum (FXCUP4_museum) | C++17 | 359 ms | 18296 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<map>
using namespace std;
long long count(std::vector<std::vector<int>> V) {
map<int, int> M;
for (int i = 0; i < V[0].size(); i++) {
int calc = 0;
for (int j = 0; j < V.size(); j++) {
calc = calc * 101 + V[j][i];
}
M[calc]++;
}
long long ret = 0;
for (auto p : M) {
ret += p.second * (p.second - 1LL) / 2;
}
return ret;
}
long long CountSimilarPairs(std::vector<int> B, std::vector<int> T, std::vector<int> G) {
long long sum = count({B}) + count({T}) + count({G});
sum -= count({B, T}) + count({T, G}) + count({B, G});
sum += count({B, T, G});
return sum;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |