oj.uz

답안 #850156

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
850156 2023-09-15T22:06:06 Z angels 함수컵 박물관 (FXCUP4_museum) C++17
27 / 100
 40 ms 10456 KB 
#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 b[101]={}, t[101]={}, g[101]={}, bt[101][101]={}, bg[101][101]={}, tg[101][101]={}, btg[101][101][101]={};
	long long result=0;
	for(int i=0; i<N; i++)
    {
        b[B[i]]++;
        t[T[i]]++;
        g[G[i]]++;
        bg[B[i]][G[i]]++;
        bt[B[i]][T[i]]++;
        tg[T[i]][G[i]]++;
        btg[B[i]][T[i]][G[i]]++;
    }
    for(int i=1; i<=100; i++)
    {
        result+=((b[i])*(b[i]-1))/2;
        result+=((t[i])*(t[i]-1))/2;
        result+=((g[i])*(g[i]-1))/2;
    }
    for(int i=1; i<=100; i++)
    {
        for(int j=1; j<=100; j++)
        {
            result-=((bt[i][j])*(bt[i][j]-1))/2;
            result-=((tg[i][j])*(tg[i][j]-1))/2;
            result-=((bg[i][j])*(bg[i][j]-1))/2;
        }
    }
	for(int i=1; i<=100; i++)
    {
        for(int j=1; j<=100; j++)
        {
            for(int k=1; k<=100; k++)
                result+=((btg[i][j][k])*(btg[i][j][k]-1))/2;
        }
    }
	return result;
}

Subtask #1
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4444 KB Output is correct
2 Correct 3 ms 4444 KB Output is correct
3 Correct 3 ms 4444 KB Output is correct
4 Correct 3 ms 4444 KB Output is correct
5 Correct 4 ms 4444 KB Output is correct
6 Correct 4 ms 4440 KB Output is correct
7 Correct 4 ms 4444 KB Output is correct
8 Correct 4 ms 4444 KB Output is correct
9 Correct 4 ms 4444 KB Output is correct
10 Correct 4 ms 4444 KB Output is correct

Subtask #2
0 / 73.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4444 KB Output is correct
2 Correct 3 ms 4444 KB Output is correct
3 Correct 3 ms 4444 KB Output is correct
4 Correct 3 ms 4444 KB Output is correct
5 Correct 4 ms 4444 KB Output is correct
6 Correct 4 ms 4440 KB Output is correct
7 Correct 4 ms 4444 KB Output is correct
8 Correct 4 ms 4444 KB Output is correct
9 Correct 4 ms 4444 KB Output is correct
10 Correct 4 ms 4444 KB Output is correct
11 Correct 4 ms 4700 KB Output is correct
12 Correct 9 ms 5468 KB Output is correct
13 Correct 14 ms 6364 KB Output is correct
14 Correct 19 ms 7140 KB Output is correct
15 Correct 27 ms 8652 KB Output is correct
16 Incorrect 40 ms 10456 KB Output isn't correct
17 Halted 0 ms 0 KB -