제출 #149114

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
149114	2019-09-01 05:46:01	distutpia (#200)	함수컵 박물관 (FXCUP4_museum)	C++17	100 / 100	113 ms	13288 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"
long long int numB[100];
long long int numT[100];
long long int numG[100];
long long int numBT[10000];
long long int numBG[10000];
long long int numTG[10000];
long long int numBTG[1000000];
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++){
    B[i]--;
    T[i]--;
    G[i]--;
    numB[B[i]]++;
    numT[T[i]]++;
    numG[G[i]]++;
    numBT[100*B[i]+T[i]]++;
    numBG[100*B[i]+G[i]]++;
    numTG[100*T[i]+G[i]]++;
    numBTG[10000*B[i]+100*T[i]+G[i]]++;
  }
  long long int ans=0;
  for(int i=0; i<100; i++){
    ans+=numB[i]*(numB[i]-1)/2;
    ans+=numT[i]*(numT[i]-1)/2;
    ans+=numG[i]*(numG[i]-1)/2;
  }
  for(int i=0; i<10000; i++){
    ans-=numBT[i]*(numBT[i]-1)/2;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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