oj.uz

답안 #148743

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
148743 2019-09-01T05:01:46 Z TLEWA맞(#3625, H_Squad, sungjune222, str0ct) 함수컵 박물관 (FXCUP4_museum) C++17
0 / 100
 10 ms 512 KB 
#include "museum.h"
#include <bits/stdc++.h>
using namespace std;
int n,check[103][103][103],brr[103],trr[103],grr[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]]++;
	} for(int i=1;i<=100;i++)
	{
		for(int j=1;j<=100;j++)
		{
			int imsi=0;
			for(int k=1;k<=100;k++)
			{
				ans-=combi(check[i][j][k]);
				imsi+=check[i][j][k];
			} ans-=combi(imsi);
		}
	} for(int j=1;j<=100;j++)
	{
		for(int k=1;k<=100;k++)
		{
			int imsi=0;
			for(int i=1;i<=100;i++)
			imsi+=check[i][j][k];
			ans-=combi(imsi);
		}
	} for(int i=1;i<=100;i++)
	{
		for(int k=1;k<=100;k++)
		{
			int imsi=0;
			for(int j=1;j<=100;j++)
			imsi+=check[i][j][k];
			ans-=combi(imsi);
		}
	}
	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;
}

Subtask #1
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 384 KB Output is correct
2 Correct 10 ms 384 KB Output is correct
3 Incorrect 9 ms 512 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 73.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 384 KB Output is correct
2 Correct 10 ms 384 KB Output is correct
3 Incorrect 9 ms 512 KB Output isn't correct
4 Halted 0 ms 0 KB -