# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
148501 | 맞WATLE (#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"
#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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |