# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
148484 | (대충 적당한 팀명) (#200) | FunctionCup Museum (FXCUP4_museum) | C++17 | 5 ms | 384 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"
long long CountSimilarPairs(std::vector<int> B, std::vector<int> T, std::vector<int> G) {
int N = B.size();
int ans = 0;
int check[200001][200001]={};
std::vector<int> save;
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){
if(!check[i][j] || B[i] == B[j] || T[i] == T[j] || G[i] == G[j]){
ans++;
save.push_back(j);
check[i][j] = 1;
continue;
}
}
for(int k = 0;k<save.size();k++){
for(int l = k;l<save.size();l++){
ans++;
check[k][l]=1;
}
}
save.clear();
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |