oj.uz

Submission #532410

# Submission time Handle Problem Language Result Execution time Memory
532410 2022-03-02T21:11:13 Z OttoTheDino Swap (BOI16_swap) C++17
68 / 100
 74 ms 20380 KB 
#include <bits/stdc++.h>
using namespace std;

#define rep(i,s,e)                  for (int i = s; i <= e; ++i)
#define rrep(i,s,e)                 for (int i = s; i >= e; --i)
#define pb                          push_back
#define pf                          push_front
#define fi                          first
#define se                          second
#define all(a)                      a.begin(), a.end()
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;

const int mx = 2e5;
int a[2*mx+1];
map<ii, int> dp;

int dfs (int u, int val) {
    if (dp[{u,val}]) return dp[{u,val}];
    int mi = min(val, min(a[2*u], a[2*u+1]));
    if (mi==a[2*u+1]) {
        if (val < a[2*u]) dp[{u,val}] = min (dfs(2*u, val), dfs(2*u+1, val)) + 1;
        else if (dfs(2*u, a[2*u]) <= dfs (2*u+1, a[2*u])) dp[{u,val}] = dfs (2*u+1, val) + 1;
        else dp[{u,val}] = dfs (2*u, val) + 1;
    }
    else if (mi==a[2*u]) dp[{u,val}] = dfs (2*u, val) + 1;
    else dp[{u,val}] = 1;
    return dp[{u,val}];
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    rep (i,1,2*mx) a[i] = 1e9;

    int n; cin >> n;
    rep (i,1,n) cin >> a[i];

    rep (i,1,n) {
        int mi = min(a[i], min(a[2*i], a[2*i+1]));
        if (a[2*i+1]==mi) {
            int mi2 = min(a[i], a[2*i]), ma = max(a[i], a[2*i]);
            int l = dfs (2*i, mi2), r = dfs (2*i+1, mi2);
            a[2*i] = mi2;
            a[2*i+1] = ma;
            if (l>r) swap (a[2*i], a[2*i+1]);
        }
        else if (a[2*i]==mi) a[2*i] = a[i];
        a[i] = mi;
    }

    rep (i,1,n) cout << a[i] << " \n"[i==n];

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1868 KB Output is correct
2 Correct 1 ms 1868 KB Output is correct
3 Correct 1 ms 1868 KB Output is correct
4 Correct 1 ms 1868 KB Output is correct
5 Correct 1 ms 1868 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1868 KB Output is correct
2 Correct 1 ms 1868 KB Output is correct
3 Correct 1 ms 1868 KB Output is correct
4 Correct 1 ms 1868 KB Output is correct
5 Correct 1 ms 1868 KB Output is correct
6 Correct 1 ms 1868 KB Output is correct
7 Correct 1 ms 1868 KB Output is correct
8 Correct 1 ms 1868 KB Output is correct
9 Correct 1 ms 1876 KB Output is correct
10 Correct 1 ms 1868 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1868 KB Output is correct
2 Correct 1 ms 1868 KB Output is correct
3 Correct 1 ms 1868 KB Output is correct
4 Correct 1 ms 1868 KB Output is correct
5 Correct 1 ms 1868 KB Output is correct
6 Correct 1 ms 1868 KB Output is correct
7 Correct 1 ms 1868 KB Output is correct
8 Correct 1 ms 1868 KB Output is correct
9 Correct 1 ms 1876 KB Output is correct
10 Correct 1 ms 1868 KB Output is correct
11 Correct 2 ms 1868 KB Output is correct
12 Correct 2 ms 1868 KB Output is correct
13 Correct 2 ms 1868 KB Output is correct
14 Correct 2 ms 1996 KB Output is correct
15 Correct 3 ms 1996 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1868 KB Output is correct
2 Correct 1 ms 1868 KB Output is correct
3 Correct 1 ms 1868 KB Output is correct
4 Correct 1 ms 1868 KB Output is correct
5 Correct 1 ms 1868 KB Output is correct
6 Correct 1 ms 1868 KB Output is correct
7 Correct 1 ms 1868 KB Output is correct
8 Correct 1 ms 1868 KB Output is correct
9 Correct 1 ms 1876 KB Output is correct
10 Correct 1 ms 1868 KB Output is correct
11 Correct 2 ms 1868 KB Output is correct
12 Correct 2 ms 1868 KB Output is correct
13 Correct 2 ms 1868 KB Output is correct
14 Correct 2 ms 1996 KB Output is correct
15 Correct 3 ms 1996 KB Output is correct
16 Correct 23 ms 4704 KB Output is correct
17 Correct 23 ms 4672 KB Output is correct
18 Correct 23 ms 4684 KB Output is correct
19 Correct 51 ms 8596 KB Output is correct
20 Correct 52 ms 8556 KB Output is correct

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1868 KB Output is correct
2 Correct 1 ms 1868 KB Output is correct
3 Correct 1 ms 1868 KB Output is correct
4 Correct 1 ms 1868 KB Output is correct
5 Correct 1 ms 1868 KB Output is correct
6 Correct 1 ms 1868 KB Output is correct
7 Correct 1 ms 1868 KB Output is correct
8 Correct 1 ms 1868 KB Output is correct
9 Correct 1 ms 1876 KB Output is correct
10 Correct 1 ms 1868 KB Output is correct
11 Correct 2 ms 1868 KB Output is correct
12 Correct 2 ms 1868 KB Output is correct
13 Correct 2 ms 1868 KB Output is correct
14 Correct 2 ms 1996 KB Output is correct
15 Correct 3 ms 1996 KB Output is correct
16 Correct 23 ms 4704 KB Output is correct
17 Correct 23 ms 4672 KB Output is correct
18 Correct 23 ms 4684 KB Output is correct
19 Correct 51 ms 8596 KB Output is correct
20 Correct 52 ms 8556 KB Output is correct
21 Runtime error 74 ms 20380 KB Execution killed with signal 11
22 Halted 0 ms 0 KB -