oj.uz

Submission #938833

# Submission time Handle Problem Language Result Execution time Memory
938833 2024-03-05T15:46:03 Z Alcabel Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 1 ms 856 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;

string query;

void rec_build(int l, int r) {
    if (r - l <= 1) { return; }
    int m = l + (r - l) / 2;
    for (int i = m; i < r; ++i) {
        query[i] = '1';
        add_element(query);
        query[i] = '0';
    }
    for (int i = l; i < m; ++i) {
        query[i] = '1';
    }
    rec_build(m, r);
    for (int i = l; i < m; ++i) {
        query[i] = '0';
    }
    for (int i = m; i < r; ++i) {
        query[i] = '1';
    }
    rec_build(l, m);
    for (int i = m; i < r; ++i) {
        query[i] = '0';
    }
}

void rec_find(vector<int>& rest, int bit, vector<int>& p) {
    if ((int)rest.size() <= 1) { return; }
    /*cerr << "rest:\n";
    for (const int& i : rest) {
        cerr << i << ' ';
    }
    cerr << "\nbit: " << bit << '\n';*/
    assert(bit >= 0);
    vector<int> on, off;
    for (const int& i : rest) {
        query[i] = '1';
        if (check_element(query)) {
            p[i] |= (1 << bit);
            on.emplace_back(i);
        } else {
            off.emplace_back(i);
        }
        query[i] = '0';
    }
    for (const int& i : off) {
        query[i] = '1';
    }
    rec_find(on, bit - 1, p);
    for (const int& i : off) {
        query[i] = '0';
    }
    for (const int& i : on) {
        query[i] = '1';
    }
    rec_find(off, bit - 1, p);
    for (const int& i : on) {
        query[i] = '0';
    }
}

vector<int> restore_permutation(int n, int w, int r) {
    vector<int> p(n);
    query = string(n, '0');
    rec_build(0, n);
    compile_set();
    int lg = 0;
    while ((1 << lg) < n) {
        ++lg;
    }
    vector<int> rest(n);
    iota(rest.begin(), rest.end(), 0);
    rec_find(rest, lg - 1, p);
    return p;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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