Submission #148370

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
148370	2019-09-01 04:11:32	강력한 한방 필살기 (#200)	함수컵 박물관 (FXCUP4_museum)	C++17	100 / 100	92 ms	9196 KiB

museum

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "museum.h"
#include <string.h>
long long CountSimilarPairs(std::vector<int> B, std::vector<int> T, std::vector<int> G) {
  static int a[100],b[100][100],c[100][100][100];
  int n = B.size();
  long long ans=0;
  for(int i=0;i<n;i++)B[i]--,T[i]--,G[i]--;
  
  memset(a,0,sizeof(a));
  for(int i=0;i<n;i++)a[B[i]]++;
  for(int i=0;i<100;i++)ans+=1LL*a[i]*(a[i]-1)/2;
  
  memset(a,0,sizeof(a));
  for(int i=0;i<n;i++)a[T[i]]++;
  for(int i=0;i<100;i++)ans+=1LL*a[i]*(a[i]-1)/2;
  
  memset(a,0,sizeof(a));
  for(int i=0;i<n;i++)a[G[i]]++;
  for(int i=0;i<100;i++)ans+=1LL*a[i]*(a[i]-1)/2;
  
  memset(b,0,sizeof(b));
  for(int i=0;i<n;i++)b[B[i]][T[i]]++;
  for(int i=0;i<100;i++)for(int j=0;j<100;j++)ans-=1LL*b[i][j]*(b[i][j]-1)/2;
  memset(b,0,sizeof(b));
  for(int i=0;i<n;i++)b[G[i]][T[i]]++;
  for(int i=0;i<100;i++)for(int j=0;j<100;j++)ans-=1LL*b[i][j]*(b[i][j]-1)/2;
  memset(b,0,sizeof(b));
  for(int i=0;i<n;i++)b[B[i]][G[i]]++;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 27 / 27
• Subtask 2: 73 / 73