# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
148814 | Aliensoft (#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>
#define ll long long
using namespace std;
vector<int> PickUnique(int N) {
vector<int>ans;
for(int i=0;i<N;i++)
{
ll sig=0;
ll sigg=0;
if(i==0)
{
ll cntR=UniqueCount(i,N-1);
ll cntR1=UniqueCount(i+1,N-1);
if(cntR1<cntR)sig=1;
if(sig)ans.push_back(1);
else ans.push_back(0);
}
else if(i==N-1)
{
ll cntL=UniqueCount(0,i);
ll cntL1=UniqueCount(0,i-1);
if(cntL1<cntL)sigg=1;
if(sigg)ans.push_back(1);
else ans.push_back(0);
}
else
{
ll cntR=UniqueCount(i,N-1);
ll cntR1=UniqueCount(i+1,N-1);
if(cntR1<cntR)sig=1;
ll cntL=UniqueCount(0,i);
ll cntL1=UniqueCount(0,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... |