# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
150962 | computerbox | List of Unique Integers (FXCUP4_unique) | C++17 | 2 ms | 504 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>
#define ll long long
using namespace std;
ll preff[210];
ll suff[210];
vector<int> PickUnique(int N) {
vector<int>ans;
for(ll i=0;i<N;i++)
{
preff[i]=UniqueCount(i,N-1);
}
for(ll i=0;i<N;i++)
{
suff[i]=UniqueCount(0,i);
}
for(int i=0;i<N;i++)
{
ll sig=0;
ll sigg=0;
if(i==0)
{
ll cntR=preff[i];
ll cntR1=preff[i+1];
if(cntR1<cntR)sig=1;
if(sig)ans.push_back(1);
else ans.push_back(0);
}
else if(i==N-1)
{
ll cntL=suff[i];
ll cntL1=suff[i-1];
if(cntL1<cntL)sigg=1;
if(sigg)ans.push_back(1);
else ans.push_back(0);
}
else
{
ll cntR=preff[i];
ll cntR1=preff[i+1];
if(cntR1<cntR)sig=1;
ll cntL=suff[i];
ll cntL1=suff[i-1];
if(cntL1<cntL)sigg=1;
if(sigg && sig)ans.push_back(1);
else ans.push_back(0);
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |