Submission #93440

#	Time	Username	Problem	Language	Result	Execution time	Memory
93440		popovicirobert	Swap (BOI16_swap)	C++14	100 / 100	222 ms	17020 KiB

swap

#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#define ld long double
// 217
// 44

using namespace std;

const int INF = 1e9;
const int MAXN = (int) 2e5;

int arr[3 * MAXN + 1];

map < pair <int, int>, int > mp;

int solve(int pos, int val) {
    if(mp.count({pos, val})) {
        return mp[{pos, val}];
    }
    if(val < min(arr[2 * pos], arr[2 * pos + 1])) {
        return pos;
    }
    if(arr[2 * pos] < arr[2 * pos + 1]) {
        return mp[{pos, val}] = solve(2 * pos, val);
    }
    int mn = min(arr[2 * pos], val);
    // b c a
    if(solve(2 * pos, mn) < solve(2 * pos + 1, mn)) {
        if(mn == val) return mp[{pos, val}] = solve(2 * pos, val);
        return mp[{pos, val}] = solve(2 * pos + 1, val);
    }
    else { // c b a
        if(mn == val) return mp[{pos, val}] = solve(2 * pos + 1, val);
        return mp[{pos, val}] = solve(2 * pos, val);
    }
}

int main() {
    //ifstream cin("A.in");
    //ofstream cout("A.out");
    int i, n;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> n;
    for(i = 1; i <= n; i++) {
        cin >> arr[i];
    }
    for(i = n + 1; i <= 2 * n + 5; i++) {
        arr[i] = INF;
    }
    for(i = 2; i <= n; i += 2) {
        int pos = i / 2;
        int a = min(arr[pos], min(arr[i], arr[i + 1]));
        int c = max(arr[pos], max(arr[i], arr[i + 1]));
        int b = arr[pos] + arr[i] + arr[i + 1] - a - c;
        if(arr[pos] == a) {

        }
        else if(arr[pos] == b) {
            if(arr[i] == a) {
                swap(arr[pos], arr[i]);
            }
            else {
                //cerr << min(arr[2 * i], arr[2 * i + 1]) << " " << b << " " << min(arr[2 * i + 2], arr[2 * i + 3]) << "\n";
                //b c a
                if(solve(i, b) < solve(i + 1, b)) {
                    swap(arr[pos], arr[i]);
                    swap(arr[pos], arr[i + 1]);
                }
                else {
                    swap(arr[pos], arr[i + 1]);
                }
            }
        }
        else if(arr[pos] == c) {
            if(arr[i] == a) {
                swap(arr[pos], arr[i]);
            }
            else {
                //c b a
                if(solve(i, b) < solve(i + 1, b)) {
                    swap(arr[pos], arr[i + 1]);
                }
                else {
                    swap(arr[pos], arr[i]);
                    swap(arr[pos], arr[i + 1]);
                }
            }
        }
    }
    for(i = 1; i <= n; i++) {
        cout << arr[i] << " ";
    }
    //cin.close();
    //cout.close();
    return 0;
}

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