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 <bits/stdc++.h>
using namespace std;
long long CountSimilarPairs(std::vector<int> B, std::vector<int> T, std::vector<int> G) {
int N = B.size();
int ans=0;
bool b1[1200];
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){
if(b1[i*100+j]==0&&B[i]==B[j]){
ans+=1;
b1[i*100+j]=1;
}
}
}for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){
if(b1[i*100+j]==0&&T[i]==T[j]){
ans+=1;
b1[i*100+j]=1;
}
}
}for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){
if(b1[i*100+j]==0&&G[i]==G[j]){
ans+=1;
b1[i*100+j]=1;
}
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |