# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
148965 | | usa1+samsung2 (#200) | 함수컵 박물관 (FXCUP4_museum) | C++17 | | 10 ms | 8704 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 <algorithm>
long long b[105] = { 0 }, t[105] = { 0 }, g[105] = { 0 };
long long bb[101 * 101] = { 0 }, tt[101 * 101] = { 0 }, gg[101 * 101] = { 0 };
long long tot[101 * 101 * 101] = { 0 };
long long CountSimilarPairs(std::vector<int> B, std::vector<int> T, std::vector<int> G) {
for (int i = 0; i < 101 * 101 * 101; i++) tot[i] = 0;
for (int i = 0; i < 101 * 101; i++) bb[i] = tt[i] = gg[i] = 0;
for (int i = 0; i < 105; i++) b[i] = t[i] = g[i] = 0;
long long n = B.size();
long long ans = 0;
for (int i = 0; i < n; i++) {
ans += b[B[i]] + t[T[i]] + g[G[i]] - bb[B[i] * T[i]] - tt[T[i] * G[i]] - gg[B[i] * G[i]] + tot[B[i] * T[i] * B[i]];
b[B[i]]++;
t[T[i]]++;
g[G[i]]++;
bb[B[i] * T[i]]++;
tt[T[i] * G[i]]++;
gg[B[i] * G[i]]++;
tot[B[i] * T[i] * B[i]]++;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |