# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
148439 | test team (#200) | List of Unique Integers (FXCUP4_unique) | C++17 | 7 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;
int tmp[201][2];
vector<int> PickUnique(int n) {
vector<int> ret;
for(int i=0;i<n;i++)
tmp[i][1]=UniqueCount(i,n-1);
for(int i=0;i<n;i++)
tmp[i][0]=UniqueCount(0,i);
if(tmp[0][1]-tmp[1][1]==1)
ret.push_back(1);
else
ret.push_back(0);
for(int i=1;i<n-1;i++)
{
if(tmp[i][0]-tmp[i-1][0]==1&&tmp[i][1]-tmp[i+1][1]==1)
ret.push_back(1);
else
ret.push_back(0);
}
if(tmp[n-1][0]-tmp[n-2][0]==1)
ret.push_back(1);
else
ret.push_back(0);
return ret;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |