제출 #150934

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
150934	2019-09-01 12:19:54	nvmdava	함수컵 박물관 (FXCUP4_museum)	C++17	100 / 100	81 ms	11328 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"
 
int cnt[105][105][105];
long long res = 0;
long long get(long long s){
  return s * (s - 1) / 2;
}
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++){
    int a = B[i];
    int b = T[i];
    int c = G[i];
    cnt[a][0][0]++;
    cnt[0][b][0]++;
    cnt[0][0][c]++;
    cnt[a][b][0]++;
    cnt[0][b][c]++;
    cnt[a][0][c]++;
    cnt[a][b][c]++;
  }
 
  for(int i = 0; i <= 100; i++){
    for(int j = 0; j <= 100; j++){
      for(int l = 0; l <= 100; l++){
        int t = 3;
        if(i == 0) t--;
        if(j == 0) t--;
        if(l == 0) t--;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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