Submission #148462

#TimeUsernameProblemLanguageResultExecution timeMemory
148462Little Piplup (#200)FunctionCup Museum (FXCUP4_museum)C++17
0 / 100
6 ms384 KiB
#include "museum.h"

bool graph[2020][2020];
long long CountSimilarPairs(std::vector<int> B, std::vector<int> T, std::vector<int> G) {
	int N = B.size();
	for (int i = 0; i<N; i++)
	{
		for (int j = i+1; j<N; j++)
		{
			if (B[i]==B[j] || T[i]==T[j] || G[i] == G[j])
			{
				graph[i][j] = true;
			}	
		}
	}

	long long ans = 0;
	for (int i = 0; i<N; i++)
	{
		for (int j = i+1; j<N; j++)
		{
			ans += graph[i][j];
		}
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...