oj.uz

답안 #148580

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
148580 2019-09-01T04:42:32 Z =SUM(D1:D9)(#3629, ydk1104, stet_stet, Hyperbolic) 함수컵 박물관 (FXCUP4_museum) C++17
0 / 100
 12 ms 8448 KB 
#include "museum.h"

long long CountSimilarPairs(std::vector<int> B, std::vector<int> T, std::vector<int> G) {
	int MAX = 100;
	long long a[MAX+1]={0, }, b[MAX+1]={0, }, c[MAX+1]={0, }, ab[MAX*MAX+1] = {0, }, bc[MAX*MAX+1] = {0,}, ac[MAX*MAX+1] = {0,}, abc[MAX*MAX*MAX+1] = {0,};
	int N = B.size();
	for(int i=0; i<N; i++){
		int na = B[i], nb = T[i], nc = G[i];
		a[na]++, b[nb]++, c[nc]++;
		ab[na*MAX+nb]++, ac[na*MAX+nc]++, bc[nb*MAX+nc]++;
		abc[na*MAX*MAX + nb*MAX + nc]++;
	}
	long long ans = 0;
	for(int i=0; i<=MAX; i++){
		ans += (a[i] * (a[i]-1) / 2);
		ans += (b[i] * (b[i]-1) / 2);
		ans += (c[i] * (c[i]-1) / 2);
	}
	for(int i=0; i<=MAX*MAX; i++){
		ans -= (ab[i] * (ab[i]-1) / 2);
		ans -= (ac[i] * (ac[i]-1) / 2);
		ans -= (bc[i] * (bc[i]-1) / 2);
	}
	for(int i=0; i<=MAX*MAX*MAX; i++){
		ans += (abc[i] * (abc[i]-1) / 2);
	}
	return ans;
}

Subtask #1
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 8448 KB Output is correct
2 Correct 12 ms 8448 KB Output is correct
3 Correct 11 ms 8448 KB Output is correct
4 Correct 12 ms 8448 KB Output is correct
5 Incorrect 12 ms 8192 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 73.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 8448 KB Output is correct
2 Correct 12 ms 8448 KB Output is correct
3 Correct 11 ms 8448 KB Output is correct
4 Correct 12 ms 8448 KB Output is correct
5 Incorrect 12 ms 8192 KB Output isn't correct
6 Halted 0 ms 0 KB -