제출 #148798

#제출 시각아이디문제언어결과실행 시간메모리
148798TLEWA맞 (#200)FunctionCup Museum (FXCUP4_museum)C++17
100 / 100
88 ms9448 KiB
#include "museum.h"
#include <bits/stdc++.h>
using namespace std;
int n,check[103][103][103],brr[103],trr[103],grr[103];
int check1[103][103], check2[103][103], check3[103][103];
long long combi(int p)
{
	return (long long)p*(p-1)/2;
}
long long CountSimilarPairs(std::vector<int> B, std::vector<int> T, std::vector<int> G)
{
	n=B.size();
	long long ans=0;
	for(int i=0;i<n;i++)
	{
		check[B[i]][T[i]][G[i]]++;
		check1[B[i]][T[i]]++;
		check2[T[i]][G[i]]++;
		check3[B[i]][G[i]]++;
	} for(int i=1;i<=100;i++)
	{
		for(int j=1;j<=100;j++)
		{
			ans-=combi(check1[i][j])+combi(check2[i][j])+combi(check3[i][j]);
			for(int k=1;k<=100;k++)
			ans+=combi(check[i][j][k]);
		}
	} for(int i=0;i<n;i++)
	{
		brr[B[i]]++; trr[T[i]]++; grr[G[i]]++;
	} for(int i=1;i<=100;i++)
	{
		ans+=combi(brr[i])+combi(trr[i])+combi(grr[i]);
	} return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...