# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
103039 | rzbt | medians (balkan11_medians) | C++14 | 35 ms | 2424 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 <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define MAXN 200005
using namespace std;
int n,q;
bool dodat[MAXN];
int prvi=1,poslednji,prosli;
void dp(){
while(dodat[prvi])prvi++;
dodat[prvi]=true;
printf("%d ",prvi);
}
void dk(){
while(dodat[poslednji])poslednji--;
dodat[poslednji]=true;
printf("%d ",poslednji);
}
int main()
{
int n;
scanf("%d", &n);
poslednji=n+n-1;
scanf("%d",&prosli);
dodat[prosli]=true;
printf("%d ",prosli);
for(int i=2;i<=n;i++){
int t;
scanf("%d", &t);
if(t==prosli){
dp();
dk();
}else if(prosli<t){
if(dodat[t])dk();
else{
dodat[t]=true;
printf("%d ",t);
}
dk();
}else{
if(dodat[t])dp();
else{
dodat[t]=true;
printf("%d ",t);
}
dp();
}
prosli=t;
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |