oj.uz

Submission #148462

# Submission time Handle Problem Language Result Execution time Memory
148462 2019-09-01T04:28:26 Z Little Piplup(#3742, gratus907, DHdroid, coffeetea99) FunctionCup Museum (FXCUP4_museum) C++17
0 / 100
 6 ms 384 KB 
#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;
}

Subtask #1
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 73.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -