oj.uz

Submission #226851

# Submission time Handle Problem Language Result Execution time Memory
226851 2020-04-25T14:39:00 Z VEGAnn Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 6 ms 640 KB 
#include <bits/stdc++.h>
#include "messy.h"
#define PB push_back
using namespace std;
const int N = 128;
vector<int> seg[2][N], res, vc;
string s, l[N], r[N];
bool mrk[N];

std::vector<int> restore_permutation(int n, int w, int r) {
    int lg = 0;

    while ((1 << lg) < n)
        lg++;

    s = "";
    for (int i = 0; i < n; i++)
        s += "1";

    for (int it = 0; it < lg; it++){
        int len = n / (1 << (it + 1));

        for (int i = 0; i < n; i += len * 2){
            for (int j = 0; j < len + len; j++)
                s[i + j] = '0';

            for (int j = 0; j < len; j++){
                s[i + j] = '1';
                add_element(s);
                s[i + j] = '0';
            }

            for (int j = 0; j < len + len; j++)
                s[i + j] = '1';
        }
    }

    compile_set();

    for (int i = 0; i < n; i++)
        seg[0][0].PB(i);

    for (int it = 0; it < lg; it++){
        int par = (it & 1);
        int len = n / (1 << (it + 1));

        for (int i = 0; i < (1 << (it + 1)); i++)
            seg[par ^ 1][i].clear();

        fill(mrk, mrk + n, 0);

        for (int i = 0, id = 0; i < n; i += len * 2, id++){
            for (int x : seg[par][id])
                s[x] = '0';

            for (int x : seg[par][id]){
                s[x] = '1';

                if (check_element(s))
                    mrk[x] = 1;

                s[x] = '0';
            }

            for (int x : seg[par][id])
                s[x] = '1';
        }

        for (int id = 0, i = 0; i < n; id++, i += len * 2){
            int lf = id + id;
            int rt = id + id + 1;

            for (int x : seg[par][id])
                if (mrk[x])
                    seg[par ^ 1][lf].PB(x);
                else seg[par ^ 1][rt].PB(x);
        }
    }

    res.clear();
    vc.clear();

    for (int i = 0; i < n; i++)
        vc.PB(seg[lg & 1][i][0]);

    res.resize(n);

    for (int kl = 0; kl < 1; kl++){
        for (int i = 0; i < n; i++)
            res[vc[i]] = i;
        vc = res;
    }

    return res;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB n = 8
2 Correct 5 ms 256 KB n = 8
3 Correct 4 ms 384 KB n = 8
4 Correct 4 ms 384 KB n = 8
5 Correct 4 ms 384 KB n = 8
6 Correct 4 ms 384 KB n = 8
7 Correct 4 ms 384 KB n = 8
8 Correct 5 ms 256 KB n = 8
9 Correct 4 ms 384 KB n = 8
10 Correct 4 ms 384 KB n = 8
11 Correct 4 ms 384 KB n = 8
12 Correct 5 ms 384 KB n = 8
13 Correct 5 ms 384 KB n = 8
14 Correct 5 ms 384 KB n = 8
15 Correct 5 ms 384 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB n = 32
2 Correct 5 ms 384 KB n = 32
3 Correct 5 ms 384 KB n = 32
4 Correct 5 ms 384 KB n = 32
5 Correct 5 ms 384 KB n = 32
6 Correct 5 ms 384 KB n = 32
7 Correct 5 ms 384 KB n = 32
8 Correct 5 ms 384 KB n = 32
9 Correct 5 ms 384 KB n = 32
10 Correct 5 ms 384 KB n = 32
11 Correct 5 ms 384 KB n = 32
12 Correct 5 ms 384 KB n = 32
13 Correct 5 ms 384 KB n = 32
14 Correct 5 ms 384 KB n = 32
15 Correct 5 ms 384 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB n = 32
2 Correct 4 ms 384 KB n = 32
3 Correct 5 ms 384 KB n = 32
4 Correct 5 ms 384 KB n = 32
5 Correct 5 ms 384 KB n = 32
6 Correct 5 ms 384 KB n = 32
7 Correct 5 ms 384 KB n = 32
8 Correct 5 ms 384 KB n = 32
9 Correct 5 ms 384 KB n = 32
10 Correct 5 ms 384 KB n = 32
11 Correct 5 ms 384 KB n = 32
12 Correct 5 ms 384 KB n = 32
13 Correct 5 ms 384 KB n = 32
14 Correct 5 ms 384 KB n = 32
15 Correct 5 ms 384 KB n = 32

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 512 KB n = 128
2 Correct 6 ms 512 KB n = 128
3 Correct 6 ms 512 KB n = 128
4 Correct 6 ms 512 KB n = 128
5 Correct 6 ms 512 KB n = 128
6 Correct 6 ms 512 KB n = 128
7 Correct 6 ms 512 KB n = 128
8 Correct 6 ms 512 KB n = 128
9 Correct 6 ms 512 KB n = 128
10 Correct 6 ms 640 KB n = 128
11 Correct 6 ms 512 KB n = 128
12 Correct 6 ms 512 KB n = 128
13 Correct 6 ms 512 KB n = 128
14 Correct 6 ms 512 KB n = 128
15 Correct 6 ms 512 KB n = 128

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 512 KB n = 128
2 Correct 6 ms 512 KB n = 128
3 Correct 6 ms 512 KB n = 128
4 Correct 6 ms 512 KB n = 128
5 Correct 6 ms 512 KB n = 128
6 Correct 6 ms 512 KB n = 128
7 Correct 6 ms 512 KB n = 128
8 Correct 6 ms 512 KB n = 128
9 Correct 6 ms 512 KB n = 128
10 Correct 6 ms 512 KB n = 128
11 Correct 6 ms 512 KB n = 128
12 Correct 6 ms 512 KB n = 128
13 Correct 6 ms 512 KB n = 128
14 Correct 6 ms 512 KB n = 128
15 Correct 6 ms 512 KB n = 128