제출 #148570

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
148570	2019-09-01 04:41:08	mit한의대지망생 (#200)	함수컵 박물관 (FXCUP4_museum)	C++17	100 / 100	100 ms	15844 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 <stdio.h>
#include "museum.h"
typedef long long lli;
lli a[101], b[101], c[101];
lli ab[101][101], ac[101][101], bc[101][101];
lli abc[101][101][101];
lli c2(lli x) {
  return x*(x-1)/2;
}
int n, x[200000], y[200000], z[200000];
long long CountSimilarPairs(std::vector<int> B, std::vector<int> T, std::vector<int> G) {
  n=B.size();
  for(int i=0;i<n;i++) {
    x[i]=B[i]; y[i]=T[i]; z[i]=G[i];
    a[x[i]]++; b[y[i]]++; c[z[i]]++;
    ab[x[i]][y[i]]++; ac[x[i]][z[i]]++; bc[y[i]][z[i]]++;
    abc[x[i]][y[i]][z[i]]++;
  }
  lli res=0;
  for(int i=1;i<=100;i++) {
    res+=c2(a[i]);
    res+=c2(b[i]);
    res+=c2(c[i]);
  }
  for(int i=1;i<=100;i++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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