제출 #148504

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
148504	2019-09-01 04:33:54	HSNU (#200)	함수컵 박물관 (FXCUP4_museum)	C++17	0 / 100	6 ms	384 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 <bits/stdc++.h>
using namespace std;
long long CountSimilarPairs(std::vector<int> B, std::vector<int> T, std::vector<int> G) {
  int N = B.size();
  int ans=0;
  bool b1[1010];
  for(int i=0;i<N;i++){
    for(int j=i+1;j<N;j++){
      if(b1[i*100+j]==0&&B[i]==B[j]){
        ans+=1;
        b1[i*100+j]=1;
      }
    }
  }for(int i=0;i<N;i++){
    for(int j=i+1;j<N;j++){
      if(b1[i*100+j]==0&&T[i]==T[j]){
        ans+=1;
        b1[i*100+j]=1;
      }
    }
  }for(int i=0;i<N;i++){
    for(int j=i+1;j<N;j++){
      if(b1[i*100+j]==0&&G[i]==G[j]){
        ans+=1;
        b1[i*100+j]=1;
      }
    }
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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