oj.uz

Submission #122986

# Submission time Handle Problem Language Result Execution time Memory
122986 2019-06-29T22:21:48 Z thebes Swap (BOI16_swap) C++14
0 / 100
 2 ms 504 KB 
#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

swap.cpp: In function 'int main()':
swap.cpp:9:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(scanf("%d",&n),i=1;i<=n;i++)
         ~~~~~~~~~~~~~~^~~~
swap.cpp:10:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&arr[i]);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Incorrect 2 ms 376 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Incorrect 2 ms 376 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Incorrect 2 ms 376 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Incorrect 2 ms 376 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Incorrect 2 ms 376 KB Output isn't correct
5 Halted 0 ms 0 KB -