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"
long long a[101], b[101], c[101];
long long d[101][101], e[101][101], f[101][101];
long long g[101][101][101];
inline long long F(long long x) {
return x * (x - 1) >> 1;
}
long long CountSimilarPairs(std::vector<int> B, std::vector<int> T, std::vector<int> G) {
int i, j, k, N = B.size();
for (i = 0; i < N; i++) {
a[B[i]]++;
b[T[i]]++;
c[G[i]]++;
d[B[i]][T[i]]++;
e[B[i]][G[i]]++;
f[T[i]][G[i]]++;
g[B[i]][T[i]][G[i]]++;
}
long long r = 0;
for (i = 1; i <= 100; i++) {
r += F(a[i]) + F(b[i]) + F(c[i]);
for (j = 1; j <= 100; j++) {
r -= F(d[i][j]) + F(e[i][j]) + F(f[i][j]);
for (k = 1; k <= 100; k++) r += F(g[i][j][k]);
}
}
return r;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |