# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
122986 | thebes | Swap (BOI16_swap) | C++14 | 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 <bits/stdc++.h>
using namespace std;
const int MN = 2e5+5;
vector<int> tmp;
int arr[MN], n, i, j, p[MN];
int main(){
for(scanf("%d",&n),i=1;i<=n;i++)
scanf("%d",&arr[i]);
for(i=1;i<=n;i++){
p[i]=1<<30;
if(2*i<=n) p[i]=min(p[i],arr[2*i]);
if(2*i+1<=n) p[i]=min(p[i],arr[2*i+1]);
}
for(i=1;i<=n;i++){
if(2*i>n) continue;
else if(2*i+1>n){
if(arr[2*i]<arr[i]) swap(arr[i],arr[2*i]);
}
else{
if(arr[2*i+1]<arr[i]&&arr[2*i+1]<arr[2*i]){
swap(arr[i],arr[2*i+1]);
int a = min(arr[2*i],arr[2*i+1]), b = max(arr[2*i],arr[2*i+1]);
if(a<p[2*i]) arr[2*i]=a,arr[2*i+1]=b;
else if(a<p[2*i+1]) arr[2*i+1]=a,arr[2*i]=b;
else arr[2*i]=a,arr[2*i+1]=b;
}
else{
if(arr[2*i]<arr[i]) swap(arr[2*i],arr[i]);
if(arr[2*i+1]<arr[i]) swap(arr[2*i+1],arr[i]);
}
}
}
for(i=1;i<=n;i++)
printf("%d ",arr[i]);
printf("\n");
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |