# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
764132 | idkhandle | FunctionCup Museum (FXCUP4_museum) | C++17 | 217 ms | 18052 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 <bits/stdc++.h>
using namespace std;
using ll = long long;
ll CountSimilarPairs(vector<int> B, vector<int> T, vector<int> G) {
int n = B.size();
auto add1 = [](vector<int>& x) -> ll {
map<int, int> one;
for (int i = 0; i < x.size(); i++) {
one[x[i]]++;
}
ll ret = 0;
for (auto& [i, j] : one) {
ret += (ll)j * (j - 1) / 2;
}
return ret;
};
auto add2 = [](vector<int>& x, vector<int>& y) -> ll {
map<pair<int, int>, int> two;
for (int i = 0; i < x.size(); i++) {
two[pair<int, int>(x[i], y[i])]++;
}
ll ret = 0;
for (auto& [i, j] : two) {
ret += (ll)j * (j - 1) / 2;
}
return ret;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |