# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
150253 | 2019-09-01T07:59:35 Z | Aliensoft(#3636, computerbox) | 함수컵 박물관 (FXCUP4_museum) | C++17 | 1000 ms | 132600 KB |
#include "museum.h" #include <bits/stdc++.h> #define ll long long using namespace std; vector<ll>cveta[110]; map<pair<ll,ll>,ll>used; ll cnt=0; void op(vector<int>&nuj) { for(ll i=0;i<(ll)nuj.size()-1;i++) { for(ll j=i+1;j<(ll)nuj.size();j++) { if(nuj[i]==nuj[j] && !used[make_pair(i,j)]) { used[make_pair(i,j)]=1; cnt++; } } } } long long CountSimilarPairs(vector<int> B,vector<int> T,vector<int> G) { int N = B.size(); op(B); op(T); op(G); return cnt; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 384 KB | Output is correct |
2 | Correct | 5 ms | 384 KB | Output is correct |
3 | Correct | 6 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 | 10 ms | 1152 KB | Output is correct |
7 | Correct | 12 ms | 1280 KB | Output is correct |
8 | Correct | 257 ms | 34296 KB | Output is correct |
9 | Correct | 35 ms | 4088 KB | Output is correct |
10 | Correct | 38 ms | 4088 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 384 KB | Output is correct |
2 | Correct | 5 ms | 384 KB | Output is correct |
3 | Correct | 6 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 | 10 ms | 1152 KB | Output is correct |
7 | Correct | 12 ms | 1280 KB | Output is correct |
8 | Correct | 257 ms | 34296 KB | Output is correct |
9 | Correct | 35 ms | 4088 KB | Output is correct |
10 | Correct | 38 ms | 4088 KB | Output is correct |
11 | Correct | 259 ms | 29304 KB | Output is correct |
12 | Execution timed out | 1107 ms | 132600 KB | Time limit exceeded |
13 | Halted | 0 ms | 0 KB | - |