oj.uz

Submission #532444

# Submission time Handle Problem Language Result Execution time Memory
532444 2022-03-02T21:53:39 Z OttoTheDino Swap (BOI16_swap) C++17
68 / 100
 990 ms 262148 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 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];

    rrep (i,n,1) {
        vi aff;
        aff.pb(a[i]);
        int p = i/2;
        while (p) {
            if (aff.back()==a[2*p+1]) aff.pb(a[2*p]);
            aff.pb(a[p]);
            p = p/2;
        }
        for (int x : aff) {
            int mi = min(x, min(a[i*2], a[2*i+1]));
            if (x==mi) dp[{i,x}] = 1;
            else if (a[i*2]==mi) dp[{i,x}] = dp[{2*i,x}]+1;
            else {
                if (a[2*i]<x) {
                    if (dp[{2*i, a[2*i]}] <= dp[{2*i+1, a[2*i]}]) dp[{i,x}] = dp[{2*i+1,x}]+1; 
                    else dp[{i,x}] = dp[{2*i,x}]+1;
                }
                else dp[{i,x}] = min(dp[{2*i,x}], dp[{2*i+1,x}])+1;
            }
        }
    }

    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]);
            a[2*i] = mi2;
            a[2*i+1] = ma;
            if (dp[{2*i,mi2}]>dp[{2*i+1,mi2}]) 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 1884 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 1884 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 1884 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 1884 KB Output is correct
6 Correct 1 ms 1868 KB Output is correct
7 Correct 1 ms 1880 KB Output is correct
8 Correct 1 ms 1868 KB Output is correct
9 Correct 1 ms 1868 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 1884 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 1884 KB Output is correct
6 Correct 1 ms 1868 KB Output is correct
7 Correct 1 ms 1880 KB Output is correct
8 Correct 1 ms 1868 KB Output is correct
9 Correct 1 ms 1868 KB Output is correct
10 Correct 1 ms 1868 KB Output is correct
11 Correct 5 ms 2648 KB Output is correct
12 Correct 5 ms 2604 KB Output is correct
13 Correct 5 ms 2680 KB Output is correct
14 Correct 6 ms 2588 KB Output is correct
15 Correct 5 ms 2636 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 1884 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 1884 KB Output is correct
6 Correct 1 ms 1868 KB Output is correct
7 Correct 1 ms 1880 KB Output is correct
8 Correct 1 ms 1868 KB Output is correct
9 Correct 1 ms 1868 KB Output is correct
10 Correct 1 ms 1868 KB Output is correct
11 Correct 5 ms 2648 KB Output is correct
12 Correct 5 ms 2604 KB Output is correct
13 Correct 5 ms 2680 KB Output is correct
14 Correct 6 ms 2588 KB Output is correct
15 Correct 5 ms 2636 KB Output is correct
16 Correct 292 ms 69148 KB Output is correct
17 Correct 303 ms 69164 KB Output is correct
18 Correct 301 ms 69184 KB Output is correct
19 Correct 326 ms 69216 KB Output is correct
20 Correct 329 ms 69332 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 1884 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 1884 KB Output is correct
6 Correct 1 ms 1868 KB Output is correct
7 Correct 1 ms 1880 KB Output is correct
8 Correct 1 ms 1868 KB Output is correct
9 Correct 1 ms 1868 KB Output is correct
10 Correct 1 ms 1868 KB Output is correct
11 Correct 5 ms 2648 KB Output is correct
12 Correct 5 ms 2604 KB Output is correct
13 Correct 5 ms 2680 KB Output is correct
14 Correct 6 ms 2588 KB Output is correct
15 Correct 5 ms 2636 KB Output is correct
16 Correct 292 ms 69148 KB Output is correct
17 Correct 303 ms 69164 KB Output is correct
18 Correct 301 ms 69184 KB Output is correct
19 Correct 326 ms 69216 KB Output is correct
20 Correct 329 ms 69332 KB Output is correct
21 Runtime error 990 ms 262148 KB Execution killed with signal 9
22 Halted 0 ms 0 KB -