# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
148595 | 강력한 한방 필살기 (#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 = 6969;
int P[MAXN], S[MAXN];
std::vector<int> PickUnique(int N) {
for(int i=1; i<=N; i++){
P[i] = UniqueCount(0, i - 1);
S[i] = UniqueCount(i - 1, N - 1);
}
vector<int> A(N);
for(int i=1; i<=N; i++){
if(P[i-1] < P[i] && S[i] > S[i+1]) A[i-1] = 1;
}
return A;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |