| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 148363 | (대충 적당한 팀명) (#200) | FunctionCup Museum (FXCUP4_museum) | C++17 | 6 ms | 1152 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 similar[200001]={};
int ans = 0;
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){
if(B[i] == B[j] && !similar[i]){
similar[i] = 1;
ans++;
continue;
}
if(T[i] == T[j] && !similar[i]){
similar[i] = 1;
ans++;
continue;
}
if(G[i] == G[j] && !similar[i]){
similar[i] = 1;
ans++;
continue;
}
}
}
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||