# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
150933 | nvmdava | List of Unique Integers (FXCUP4_unique) | C++17 | 3 ms | 632 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;
vector<int> res;
int ans[204][204];
int get(int l, int r){
if(l > r) return 0;
if(ans[l][r] == -1){
ans[l][r] = UniqueCount(l, r);
}
return ans[l][r];
}
vector<int> PickUnique(int N) {
memset(ans, -1, sizeof ans);
res = std::vector<int>(N, 0);
for(int i = 0; i < N; i++){
if(get(0, i - 1) + 1 == get(0, i) && get(i, N - 1) == get(i + 1, N - 1) + 1)
res[i] = 1;
}
return res;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |