oj.uz

Submission #524260

# Submission time Handle Problem Language Result Execution time Memory
524260 2022-02-08T23:39:48 Z tabr Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 460 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif

#ifdef tabr
function<void(string)> add_element;
function<void()> compile_set;
function<bool(string)> check_element;
#else
#include "messy.h"
#endif

vector<int> restore_permutation(int n, int, int) {
    int k = __builtin_ctz(n);
    for (int i = 0; i < k; i++) {
        string s(n, '0');
        s[i] = '1';
        add_element(s);
    }
    for (int i = 0; i < k - 1; i++) {
        string s(n, '0');
        s[i] = s[i + 1] = '1';
        add_element(s);
    }
    vector<vector<int>> cnt(k, vector<int>(n));
    for (int i = k; i < n; i++) {
        for (int j = 0; j < k; j++) {
            if (i & (1 << j)) {
                string s(n, '0');
                s[i] = s[j] = '1';
                add_element(s);
            }
        }
        int pp = 0;
        for (int j = k - 1; j >= 0; j--) {
            pp |= i & (1 << j);
            cnt[j][pp]++;
        }
    }
    {
        string s(n, '1');
        s[0] = '0';
        add_element(s);
    }
    compile_set();
    vector<int> p(n, -1);
    set<int> st;
    for (int i = 0; i < n; i++) {
        string s(n, '0');
        s[i] = '1';
        if (check_element(s)) {
            st.emplace(i);
        }
    }
    vector<int> q(k);
    for (int i : st) {
        string s(n, '1');
        s[i] = '0';
        if (check_element(s)) {
            q[0] = i;
            st.erase(i);
            break;
        }
    }
    for (int i = 1; i < k - 1; i++) {
        for (int j : st) {
            string s(n, '0');
            s[q[i - 1]] = s[j] = '1';
            if (check_element(s)) {
                q[i] = j;
                st.erase(j);
                break;
            }
        }
    }
    q[k - 1] = *st.begin();
    for (int i = 0; i < k; i++) {
        p[q[i]] = i;
    }
    for (int j = k - 1; j >= 0; j--) {
        for (int i = 0; i < n; i++) {
            if (p[i] >= 0) {
                continue;
            }
            int pp = ~p[i];
            if (cnt[j][pp] == 0) {
                p[i] ^= 1 << j;
                cnt[j][~p[i]]--;
                continue;
            }
            pp ^= 1 << j;
            if (cnt[j][pp] == 0) {
                cnt[j][~p[i]]--;
                continue;
            }
            string s(n, '0');
            s[i] = s[q[j]] = '1';
            if (check_element(s)) {
                p[i] ^= 1 << j;
            }
            cnt[j][~p[i]]--;
        }
    }
    for (int i = 0; i < n; i++) {
        p[i] = max(p[i], ~p[i]);
    }
    return p;
}

#ifdef tabr
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    mt19937 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
    vector<int> p(n);
    iota(p.begin(), p.end(), 0);
    shuffle(p.begin(), p.end(), rng);
    vector<string> t;
    int cnt0 = 0;
    int cnt1 = 0;
    add_element = [&](string x) {
        cnt0++;
        t.emplace_back(x);
    };
    compile_set = [&]() {
        for (string& x : t) {
            string y = x;
            for (int i = 0; i < n; i++) {
                x[p[i]] = y[i];
            }
        }
        sort(t.begin(), t.end());
    };
    check_element = [&](string x) {
        cnt1++;
        return binary_search(t.begin(), t.end(), x);
    };
    auto q = restore_permutation(n, 0, 0);
    for (int i = 0; i < n; i++) {
        assert(q[p[i]] == i);
    }
    debug(cnt0, cnt1);
    return 0;
}
#endif

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB n = 8
2 Correct 0 ms 204 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 204 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 204 KB n = 8
12 Correct 0 ms 204 KB n = 8
13 Correct 0 ms 204 KB n = 8
14 Correct 0 ms 204 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 204 KB n = 32
3 Correct 1 ms 204 KB n = 32
4 Correct 1 ms 204 KB n = 32
5 Correct 1 ms 204 KB n = 32
6 Correct 1 ms 204 KB n = 32
7 Correct 0 ms 204 KB n = 32
8 Correct 1 ms 204 KB n = 32
9 Correct 0 ms 204 KB n = 32
10 Correct 0 ms 204 KB n = 32
11 Correct 1 ms 204 KB n = 32
12 Correct 1 ms 204 KB n = 32
13 Correct 0 ms 204 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 1 ms 204 KB n = 32
3 Correct 1 ms 204 KB n = 32
4 Correct 1 ms 204 KB n = 32
5 Correct 0 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 0 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 0 ms 204 KB n = 32
14 Correct 1 ms 204 KB n = 32
15 Correct 1 ms 204 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 460 KB n = 128
4 Correct 1 ms 460 KB n = 128
5 Correct 1 ms 372 KB n = 128
6 Correct 2 ms 460 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 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 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 1 ms 412 KB n = 128
3 Correct 1 ms 460 KB n = 128
4 Correct 1 ms 460 KB n = 128
5 Correct 1 ms 420 KB n = 128
6 Correct 1 ms 460 KB n = 128
7 Correct 1 ms 420 KB n = 128
8 Correct 2 ms 460 KB n = 128
9 Correct 1 ms 460 KB n = 128
10 Correct 1 ms 420 KB n = 128
11 Correct 1 ms 460 KB n = 128
12 Correct 2 ms 376 KB n = 128
13 Correct 1 ms 460 KB n = 128
14 Correct 2 ms 460 KB n = 128
15 Correct 2 ms 460 KB n = 128