oj.uz

Submission #500420

# Submission time Handle Problem Language Result Execution time Memory
500420 2021-12-31T03:38:22 Z CatalinT Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 464 KB 
#include <vector>
#include <iostream>
#include <string>
#include <numeric>
#include <cassert>

using namespace std;

#include "messy.h"

int W, R;

void rec_write(int l, int r, int n) {
    // use sz - 1 ones and 1 0
    // use the first half of the range

    int sz = r - l + 1;

    // cerr << "write: " << sz << " -> " << l << " " << r << "\n";

    if (sz == 1) {
        return;
    }

    int m = (l + r) >> 1;

    string t = string(n, '0');
    for (int i = l; i <= r; i++)
        t[i] = '1';

    for (int i = l; i <= m; i++) {
        auto q = t; 
        q[i] = '0';

        // cerr << q << "\n";

        W++;
        add_element(q);
    }

    rec_write(l, m, n);
    rec_write(m + 1, r, n); 
}

vector<int> sol;

void rec_read(int l, int r, const vector<int>& idx, int n) {
    // Range l ... r is known to be in indexes idx
    int sz = r - l + 1;

    // cerr << "read: " << sz << " -> " << l << " " << r << "\n";

    if (sz == 1) {
        // At this point we should know the answer for l .. r -> idx[0]
        assert(idx.size() == 1);
        sol[l] = idx[0];
        return;
    }

    int m = (l + r) >> 1;

    // 

    string t = string(n, '0');
    for (int i : idx)
        t[i] = '1';

    vector<int> left_idx;
    vector<int> right_idx;

    for (int i : idx) {
        auto q = t; 
        q[i] = '0';

        // cerr << q << "\n";

        R++;
        if (check_element(q)) {
            left_idx.push_back(i);
        } else {
            right_idx.push_back(i);
        }
    }

    rec_read(l, m, left_idx, n);
    rec_read(m + 1, r, right_idx, n); 
}

std::vector<int> restore_permutation(int n, int w, int r) {
    rec_write(0, n - 1, n);
    // cerr << "compiled\n";
    compile_set();

    vector<int> idx(n);
    iota(idx.begin(), idx.end(), 0);
    sol.assign(n, -1);
    rec_read(0, n - 1, idx, n);

    // cerr << "W: " << W << " R: " << R << "\n";

    // reverse
    vector<int> res(n);
    for (auto & x : sol)
        res[sol[x]] = x;

    return res;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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