#include "museum.h"
#include <set>
typedef std::pair<int, int> PII;
typedef std::set<PII> SETPAIR;
long long CountSimilarPairs(std::vector<int> B, std::vector<int> T, std::vector<int> G) {
int N = B.size();
long long count = 0;
SETPAIR set_pair;
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
if (B[i] == B[j]) {
set_pair.insert(PII(i, j));
++count;
continue;
}
if (T[i] == T[j]) {
set_pair.insert(PII(i, j));
++count;
continue;
}
if (G[i] == G[j]) {
set_pair.insert(PII(i, j));
++count;
continue;
}
}
}
return count;;
//return (long long)set_pair.size();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
6 ms |
384 KB |
Output is correct |
5 |
Correct |
6 ms |
512 KB |
Output is correct |
6 |
Correct |
9 ms |
896 KB |
Output is correct |
7 |
Correct |
10 ms |
1024 KB |
Output is correct |
8 |
Correct |
178 ms |
25848 KB |
Output is correct |
9 |
Correct |
27 ms |
3192 KB |
Output is correct |
10 |
Correct |
27 ms |
3200 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
6 ms |
384 KB |
Output is correct |
5 |
Correct |
6 ms |
512 KB |
Output is correct |
6 |
Correct |
9 ms |
896 KB |
Output is correct |
7 |
Correct |
10 ms |
1024 KB |
Output is correct |
8 |
Correct |
178 ms |
25848 KB |
Output is correct |
9 |
Correct |
27 ms |
3192 KB |
Output is correct |
10 |
Correct |
27 ms |
3200 KB |
Output is correct |
11 |
Correct |
175 ms |
22008 KB |
Output is correct |
12 |
Execution timed out |
1109 ms |
183032 KB |
Time limit exceeded |
13 |
Halted |
0 ms |
0 KB |
- |