oj.uz

Submission #130377

# Submission time Handle Problem Language Result Execution time Memory
130377 2019-07-15T05:32:35 Z darkkcyan Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 5 ms 632 KB 
#include <bits/stdc++.h>

#include "messy.h"

using namespace std;
typedef bitset<128> BS;

string reverse_string(string s) {
    reverse(s.begin(), s.end());
    return s;
}

void add_element(BS const& bs, int n) {
    add_element(reverse_string(bs.to_string()).substr(0, n));
}

bool check_element(BS const& bs, int n) {
    return check_element(reverse_string(bs.to_string()).substr(0, n));
}

int log2(int n) {
    if (n == 1) return 0;
    return 1 + log2(n / 2);
}

const BS one = 1;
void add_elements(int n) {
    BS prev;
    int n_bit = log2(n);
    for (int i = 1; i < n; i += 2) {
        prev[i] = 1;
        add_element(one << i, n);
    }

    for (int cur_bit = 1; cur_bit < n_bit;++ cur_bit) {
        BS cur;
        for (int i = 0; i < n; ++i) {
            if ((~i >> cur_bit) & 1) continue;
            cur[i] = 1;
            add_element((prev[i] ? ~prev : prev) | (one << i), n);
        }
        prev = move(cur);
    }
}

vector<int> do_restore(int n) {
    vector<int> ans(n);

    BS prev;
    for (int i = 0; i < n; ++i) {
        if (!check_element(one << i, n)) continue;
        prev[i] = 1;
        ans[i] = 1;
    }

    int n_bit = log2(n);
    for (int cur_bit = 1; cur_bit < n_bit; ++cur_bit) {
        BS cur;
        for (int i = 0; i < n; ++i) {
            if (!check_element((prev[i] ? ~prev : prev) | (one << i), n)) continue;
            cur[i] = 1;
            ans[i] |= 1 << cur_bit;
        }
        prev = move(cur);
    }
    return ans;
}

std::vector<int> restore_permutation(int n, int w, int r) {
    add_elements(n);
    compile_set();
    return do_restore(n);
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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