답안 #152890

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
152890 2019-09-10T11:35:23 Z 2qbingxuan 함수컵 박물관 (FXCUP4_museum) C++17
27 / 100
1000 ms 1244 KB
#include <bits/stdc++.h>

using namespace std;
typedef int64_t ll;

int64_t CountSimilarPairs(vector<int> A,vector<int> B,vector<int> C) {
    int n = A.size();
    ll res = 0;
    for(int i = 0; i < n; i++) for(int j = 0; j < i; j++) {
        if(A[i]==A[j] || B[i]==B[j] || C[i]==C[j]) res++;
    }
    return res;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 12 ms 376 KB Output is correct
9 Correct 7 ms 300 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 12 ms 376 KB Output is correct
9 Correct 7 ms 300 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 37 ms 504 KB Output is correct
12 Execution timed out 1081 ms 1244 KB Time limit exceeded
13 Halted 0 ms 0 KB -