oj.uz

Submission #261609

# Submission time Handle Problem Language Result Execution time Memory
261609 2020-08-11T22:29:37 Z caoash Swap (BOI16_swap) C++14
21 / 100
 1000 ms 632 KB 
#include <bits/stdc++.h> 
using namespace std;

using ll = long long;

using vi = vector<int>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair

const int MX = 200005;

int n; int num[MX]; map<pi, vi> dp; 

vi merge(vi &a, int &x, vi &b) {
    // cout << "a" << "\n";
    // pr(a);
    // cout << "b" << "\n";
    // pr(b);
    vi ret;
    ret.pb(x);
    int p1 = 0, p2 = 0;
    for (int i = 0; i < 19; i++) {
        for (int j = 0; j < (1 << i); j++) {
            if (p1 < sz(a)) {
                ret.pb(a[p1++]);
            }
        } 
        for (int j = 0; j < (1 << i); j++) {
            if (p2 < sz(b)) {
                ret.pb(b[p2++]);
            } 
        }
    }
    // cout << "ret" << "\n";
    // pr(ret);
    return ret;
}

vi solve(int v, int c) {
    if (!dp[mp(v, c)].empty()) {
        // cout << "v: " << v << " " << c << endl;
        // pr(dp[mp(v, c)]);
        return dp[mp(v, c)];
    }
    int l = 2 * v + 1, r = 2 * v + 2;
    if (l >= n) {
        // cout << "v: " << v << " " << c << endl;
        // cout << c << '\n';
        return dp[mp(v, c)] = {c};
    }
    if (r >= n) {
        vi best; 
        vi fst = solve(l, num[l]);
        best.pb(c);
        for (int x : fst) best.pb(x);
        vi sec = solve(l, c);
        vi sbest;
        sbest.pb(num[l]);
        for (int x : sec) sbest.pb(x);
        return dp[mp(v, c)] = min(best, sbest);
    }
    // cout << "l, r" << " " << l << " " << r << '\n';
    vi best;
    // no swaps
    vi fst = solve(l, num[l]);
    vi scnd = solve(r, num[r]);
    best = merge(fst, c, scnd);

    // swap left
    if (l < n) {
        fst = solve(l, c), scnd = solve(r, num[r]);
        best = min(best, merge(fst, num[l], scnd));
    }

    // swap right
    if (r < n) {
        fst = solve(l, num[l]);
        scnd = solve(r, c);
        best = min(best, merge(fst, num[r], scnd));
    }

    // swap left, then right
    if (r < n) {
        fst = solve(l, c);
        scnd = solve(r, num[l]);
        best = min(best, merge(fst, num[r], scnd));
    }
    // cout << "v: " << v << " " << c << endl;
    // pr(best);
    return dp[mp(v, c)] = best;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> num[i];
    }
    solve(0, num[0]); 
    vi ans = dp[mp(0, num[0])];
    for (int i = 0; i < n; i++) {
        cout << ans[i] << ' ';
    }
    cout << '\n';
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 384 KB Output is correct
2 Correct 102 ms 384 KB Output is correct
3 Correct 101 ms 384 KB Output is correct
4 Correct 100 ms 384 KB Output is correct
5 Correct 105 ms 396 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 384 KB Output is correct
2 Correct 102 ms 384 KB Output is correct
3 Correct 101 ms 384 KB Output is correct
4 Correct 100 ms 384 KB Output is correct
5 Correct 105 ms 396 KB Output is correct
6 Correct 285 ms 384 KB Output is correct
7 Correct 289 ms 384 KB Output is correct
8 Correct 286 ms 384 KB Output is correct
9 Correct 288 ms 384 KB Output is correct
10 Correct 282 ms 384 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 384 KB Output is correct
2 Correct 102 ms 384 KB Output is correct
3 Correct 101 ms 384 KB Output is correct
4 Correct 100 ms 384 KB Output is correct
5 Correct 105 ms 396 KB Output is correct
6 Correct 285 ms 384 KB Output is correct
7 Correct 289 ms 384 KB Output is correct
8 Correct 286 ms 384 KB Output is correct
9 Correct 288 ms 384 KB Output is correct
10 Correct 282 ms 384 KB Output is correct
11 Execution timed out 1093 ms 632 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 384 KB Output is correct
2 Correct 102 ms 384 KB Output is correct
3 Correct 101 ms 384 KB Output is correct
4 Correct 100 ms 384 KB Output is correct
5 Correct 105 ms 396 KB Output is correct
6 Correct 285 ms 384 KB Output is correct
7 Correct 289 ms 384 KB Output is correct
8 Correct 286 ms 384 KB Output is correct
9 Correct 288 ms 384 KB Output is correct
10 Correct 282 ms 384 KB Output is correct
11 Execution timed out 1093 ms 632 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 384 KB Output is correct
2 Correct 102 ms 384 KB Output is correct
3 Correct 101 ms 384 KB Output is correct
4 Correct 100 ms 384 KB Output is correct
5 Correct 105 ms 396 KB Output is correct
6 Correct 285 ms 384 KB Output is correct
7 Correct 289 ms 384 KB Output is correct
8 Correct 286 ms 384 KB Output is correct
9 Correct 288 ms 384 KB Output is correct
10 Correct 282 ms 384 KB Output is correct
11 Execution timed out 1093 ms 632 KB Time limit exceeded
12 Halted 0 ms 0 KB -