# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
148677 | 서울대학교 연구공원 944동 삼성전자서울대연구소 (#200) | List of Unique Integers (FXCUP4_unique) | C++17 | 6 ms | 512 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "unique.h"
using namespace std;
int chk[205];
std::vector<int> PickUnique(int N) {
vector<int> ans(N);
for(int i = 0; i < N; i++) ans[i] = 1;
int prv = UniqueCount(0, N-1), tmp = prv;
for(int i = N-1; i >= 0; i--){
int nxt;
if(i == 0) nxt = 0;
else nxt = UniqueCount(0, i-1);
if(nxt >= prv) ans[i] = 0;
prv = nxt;
}
prv = tmp;
for(int i = 0; i < N; i++){
int nxt;
if(i == N-1) nxt = 0;
else nxt = UniqueCount(i+1, N-1);
if(nxt >= prv) ans[i] = 0;
prv = nxt;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |