oj.uz

Submission #839126

# Submission time Handle Problem Language Result Execution time Memory
839126 2023-08-28T18:29:59 Z PanosPask Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 592 KB 
#include <vector>
#define pb push_back
#include "messy.h"

using namespace std;

int N;

// Insert elements in [l..r)
void insert_elements(int l, int r)
{
    if (l == r - 1) {
        return;
    }

    string x;

    x.resize(N);
    for (int i = 0; i < l; i++)
        x[i] = '0';
    for (int i = r; i < N; i++)
        x[i] = '0';
    for (int i = l; i < r; i++)
        x[i] = '1';

    int mid = (l + r) / 2;
    for (int i = l; i < mid; i++) {
        x[i] = '0';
        add_element(x);
        x[i] = '1';
    }

    insert_elements(l, mid);
    insert_elements(mid, r);
}

vector<int> p;

// Half of the possible positions will be in the first half
void find_half(int l, int r, vector<int> possible)
{
    if (l == r - 1) {
        p[possible.front()] = l;
        return;
    }

    string x;
    x.resize(N);
    for (int i = 0; i < N; i++)
        x[i] = '0';

    for (auto i : possible) {
        x[i] = '1';
    }
    vector<int> p1, p2;
    for (auto i : possible) {
        x[i] = '0';
        if (check_element(x))
            p1.push_back(i);
        else
            p2.push_back(i);

        x[i] = '1';
    }

    int mid = (l + r) / 2;
    find_half(l, mid, p1);
    find_half(mid, r, p2);
}

vector<int> restore_permutation(int n, int w, int r)
{
    N = n;
    p.resize(N);

    insert_elements(0, N);
    compile_set();

    vector<int> init;
    for (int i = 0; i < N; i++)
        init.pb(i);
    find_half(0, N, init);

    return p;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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