oj.uz

Submission #53130

# Submission time Handle Problem Language Result Execution time Memory
53130 2018-06-28T14:58:04 Z aome Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 6 ms 640 KB 
#include <bits/stdc++.h>

#include "messy.h"

using namespace std;

const int N = 128;

int n;
int res[N];
bool a[N];

void add() {
    string s;
    for (int i = 0; i < n; ++i) {
        s.push_back(a[i] + '0');
    }
    // cout << "add " << s << '\n';
    add_element(s);
}

bool check() {
    string s;
    for (int i = 0; i < n; ++i) {
        s.push_back(a[i] + '0');
    }
    // cout << "check " << s << '\n';
    return check_element(s);
}

void add(int p, vector<int> vecx, vector<int> vecy) {
    if (vecx.size() == 1) return;
    vector<int> vec0, vec1;
    for (auto i : vecx) {
        if ((i / (1 << p)) & 1) {
            memset(a, 0, sizeof a);
            a[i] = 1;
            for (auto j : vecy) a[j] = 1;
            add();
            vec1.push_back(i);
        }
        else vec0.push_back(i);
    }
    add(p + 1, vec0, vec1);
    add(p + 1, vec1, vec0);
}

void check(int p, int mask, vector<int> vecx, vector<int> vecy) {
    if (vecx.size() == 1) {
        res[vecx[0]] = mask; return;
    }
    vector<int> vec0, vec1;
    for (auto i : vecx) {
        memset(a, 0, sizeof a);
        a[i] = 1;
        for (auto j : vecy) a[j] = 1;
        if (check()) vec1.push_back(i);
        else vec0.push_back(i);
    }
    check(p + 1, mask, vec0, vec1);
    check(p + 1, mask | (1 << p), vec1, vec0);
} 

vector<int> restore_permutation(int _n, int w, int r) {
    n = _n;
    int m = 0;
    while ((1 << m) != n) m++;
    vector<int> vec0, vec1;
    for (int i = 0; i < n; i += 2) {
        vec0.push_back(i);
    }
    for (int i = 1; i < n; i += 2) {
        memset(a, 0, sizeof a);
        a[i] = 1, add();
        vec1.push_back(i);
    }
    add(1, vec0, vec1);
    add(1, vec1, vec0);
    compile_set();
    vec0.clear(), vec1.clear();
    for (int i = 0; i < n; ++i) {
        memset(a, 0, sizeof a);
        a[i] = 1;
        if (check()) vec1.push_back(i);
        else vec0.push_back(i);
    }
    check(1, 0, vec0, vec1);
    check(1, 1, vec1, vec0);
    vector<int> vec;
    for (int i = 0; i < n; ++i) vec.push_back(res[i]);
    return vec;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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