# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
148501 | 2019-09-01T04:33:42 Z | 맞WATLE(#3593, arnold518, ksmzzang2003, songc) | List of Unique Integers (FXCUP4_unique) | C++17 | 6 ms | 512 KB |
#include "unique.h" #include <bits/stdc++.h> using namespace std; const int MAXN = 200; int N; int A[MAXN+10], B[MAXN+10]; vector<int> ans; vector<int> PickUnique(int _N) { int i, j; N=_N; ans.resize(N); for(i=1; i<=N; i++) A[i]=UniqueCount(0, i-1); for(i=N; i>=1; i--) B[i]=UniqueCount(i-1, N-1); for(i=1; i<=N; i++) { if(A[i-1]<A[i] && B[i]>B[i+1]) ans[i-1]=1; } return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 384 KB | Correct : C = 4 |
2 | Correct | 6 ms | 256 KB | Correct : C = 10 |
3 | Correct | 5 ms | 384 KB | Correct : C = 50 |
4 | Correct | 5 ms | 384 KB | Correct : C = 100 |
5 | Correct | 6 ms | 384 KB | Correct : C = 100 |
6 | Correct | 6 ms | 384 KB | Correct : C = 154 |
7 | Correct | 6 ms | 384 KB | Correct : C = 200 |
8 | Correct | 6 ms | 512 KB | Correct : C = 300 |
9 | Correct | 6 ms | 512 KB | Correct : C = 356 |
10 | Correct | 6 ms | 512 KB | Correct : C = 400 |
11 | Correct | 5 ms | 512 KB | Correct : C = 400 |
12 | Correct | 6 ms | 512 KB | Correct : C = 400 |
13 | Correct | 5 ms | 512 KB | Correct : C = 400 |
14 | Correct | 6 ms | 512 KB | Correct : C = 400 |
15 | Correct | 5 ms | 512 KB | Correct : C = 400 |