Submission #810978

#	Time	Username	Problem	Language	Result	Execution time	Memory
810978		Hakiers	Swap (BOI16_swap)	C++17	0 / 100	0 ms	212 KiB

swap

#include <iostream>
using namespace std;
const int MAXN = 2e5 + 7;
int t[MAXN];
int n;

void solve(int v){

    int l = 2*v, r = 2*v + 1;

    if(t[l] > t[v] && t[r] < t[v] && l <= n && r <= n){
        if(!(t[2*l] < t[l] && 2*l <= n) && !(t[2*l + 1] < t[l] && 2*l + 1 <= n)){
            swap(t[v], t[l]);
            swap(t[v], t[r]);

            solve(l);
            solve(r);
        }
        else{
            if(l <= n){
                if(t[v] > t[l]) swap(t[v], t[l]);
                solve(l);
            }
            if(r <= n){
                if(t[v] > t[r]) swap(t[v], t[r]);
                solve(r);
            }
        }
    }
    
    else{
        if(l <= n){
            if(t[v] > t[l]) swap(t[v], t[l]);
            solve(l);
        }
        if(r <= n){
            if(t[v] > t[r]) swap(t[v], t[r]);
            solve(r);
        }
    }

    
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for(int i = 1; i <= n; i++)
        cin >> t[i];

    solve(1);

    for(int i = 1; i <= n; i++)
        cout << t[i] << " ";
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 11
• Subtask 3: 0 / 27
• Subtask 4: 0 / 20
• Subtask 5: 0 / 32