# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
149000 | 요까할 로뭘 은명팀 (#200) | List of Unique Integers (FXCUP4_unique) | C++17 | 6 ms | 384 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;
int a[205][205],x;
vector<int> PickUnique(int n)
{
vector <int> ans;
for(int i = 0;i < n;i++)
{
ans.push_back(1);
a[0][i] = UniqueCount(0,i);
a[i][n-1] = UniqueCount(i,n-1);
}
int l = 1;
for(int i = 1;i < n;i++)
{
x = a[0][i];
if(l == x+1) ans[i] = 0;
if(l == x) ans[i] = 0;
l = x;
}
l = 1;
for(int i = n-2;i >= 0;i--)
{
x = a[i][n-1];
if(l == x+1) ans[i] = 0;
if(l == x) ans[i] = 0;
l = x;
}
for(int i : ans) cout << i << " ";
cout << "\n";
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |