Submission #933193

#	Time	Username	Problem	Language	Result	Execution time	Memory
933193		LucaIlie	Swap (BOI16_swap)	C++17	0 / 100	1 ms	344 KiB

swap

#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1000;
int v[2 * MAX_N + 2], minn[MAX_N + 1], dp[MAX_N + 1][MAX_N + 1];

int main() {
    int n;

    cin >> n;
    for ( int i = 1; i <= n; i++ )
        cin >> v[i];
    for ( int i = n + 1; i <= 2 * n + 1; i++ )
        v[i] = n + 1;


    for ( int i = n; i >= 1; i-- ) {
        for ( int x = 1; x <= n; x++ ) {
            if ( x < v[2 * i] && x < v[2 * i + 1] )
                dp[i][x] = i;
            else if ( v[2 * i] < v[2 * i + 1] )
                dp[i][x] = dp[2 * i][x];
            else {
                if ( x < v[2 * i] )  {
                    if ( dp[2 * i][x] < dp[2 * i + 1][x] )
                        dp[i][x] = dp[2 * i][x];
                    else
                        dp[i][x] = dp[2 * i + 1][x];
                }
                else {
                    if ( dp[2 * i][v[2 * i]] < dp[2 * i + 1][v[2 * i]] )
                        dp[i][x] = dp[2 * i + 1][x];
                    else
                        dp[i][x] = dp[2 * i][x];
                }
            }
            printf( "%d %d: %d\n", i, x, dp[i][x] );
        }
    }

    for ( int i = 1; 2 * i + 1 <= n; i++ ) {
        if (  v[2 * i] < v[i] && v[2 * i] < v[2 * i + 1] )
            swap( v[i], v[2 * i] );
        else if ( v[2 * i + 1] < v[i] && v[2 * i + 1] < v[2 * i] ) {
            swap( v[i], v[2 * i + 1] );

            if ( v[2 * i] < v[2 * i + 1] ) {
                if ( dp[2 * i][v[2 * i]] > dp[2 * i + 1][v[2 * i]])
                    swap( v[2 * i], v[2 * i + 1] );
            } else {
                if ( dp[2 * i][v[2 * i + 1]] < dp[2 * i + 1][v[2 * i + 1]])
                    swap( v[2 * i], v[2 * i + 1] );
            }
        }
    }
    if ( v[n / 2] > v[n] )
        swap( v[n / 2], v[n] );

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

    return 0;
}

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