# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
148407 | 잉여로운 고3 (#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 <bits/stdc++.h>
#include "unique.h"
using namespace std;
int L[222], R[222];
vector <int> PickUnique(int n)
{
vector <int> ans(n);
int i;
for(i=1; i<=n; i++){
L[i] = UniqueCount(0, i - 1);
R[i] = UniqueCount(i - 1, n - 1);
}
for(i=1; i<=n; i++){
ans[i - 1] = (L[i] == L[i - 1] + 1 && R[i] == R[i + 1] + 1);
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |