oj.uz

답안 #148548

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
148548 2019-09-01T04:38:28 Z HSNU(#3687, joylintp, 147, wiwiho) 함수컵 박물관 (FXCUP4_museum) C++17
27 / 100
 1000 ms 156280 KB 
#include<bits/stdc++.h>
#include "museum.h"

using namespace std;

long long CountSimilarPairs(vector<int> B, vector<int> T, vector<int> G)
{
	int N = B.size();

	set<pair<int, int>> sim;
	for (int i = 0; i < N; i++)
        for (int j = i + 1; j < N; j++)
            if (B[i] == B[j] || T[i] == T[j] || G[i] == G[j])
                sim.insert({i, j});

	return (int)sim.size();
}

Subtask #1
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 7 ms 512 KB Output is correct
6 Correct 9 ms 896 KB Output is correct
7 Correct 12 ms 1024 KB Output is correct
8 Correct 167 ms 25848 KB Output is correct
9 Correct 27 ms 3200 KB Output is correct
10 Correct 29 ms 3192 KB Output is correct

Subtask #2
0 / 73.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 7 ms 512 KB Output is correct
6 Correct 9 ms 896 KB Output is correct
7 Correct 12 ms 1024 KB Output is correct
8 Correct 167 ms 25848 KB Output is correct
9 Correct 27 ms 3200 KB Output is correct
10 Correct 29 ms 3192 KB Output is correct
11 Correct 187 ms 22008 KB Output is correct
12 Execution timed out 1107 ms 156280 KB Time limit exceeded
13 Halted 0 ms 0 KB -