oj.uz

Submission #796989

# Submission time Handle Problem Language Result Execution time Memory
796989 2023-07-29T03:11:07 Z That_Salamander Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 492 KB 
#include <bits/stdc++.h>

using namespace std;

void add_element(string x);
bool check_element(string x);
void compile_set();

void bruh(int n, int l, int r) {
    if (l+1 == r) return;

    string s;
    s.resize(n, '0');

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

    int m = (l + r) / 2;

    for (int i = l; i < m; i++) {
        s[i] = '1';
        add_element(s);
        s[i] = '0';
    }

    bruh(n, l, m);
    bruh(n, m, r);
}

vector<int> res;

void find(int n, int l, int r, string mask) {
    vector<bool> found(n);

    for (int i = 0; i < n; i++) {
        if (mask[i] == '1') continue;

        mask[i] = '1';
        found[i] = check_element(mask);
        mask[i] = '0';
    }

    if (r - l == 2) {
        for (int i = 0; i < n; i++) {
            if (mask[i] != '1') {
                if (found[i]) {
                    res[i] = l;
                } else {
                    res[i] = r-1;
                }
            }
        }
        return;
    }

    string maskA = mask;
    string maskB = mask;

    for (int i = 0; i < n; i++) {
        if (mask[i] == '1') continue;

        if (found[i]) {
            maskB[i] = '1';
        } else {
            maskA[i] = '1';
        }
    }

    //cout << l << " " << r << endl;
    //cout << mask << endl << maskA << endl << maskB << endl;

    int m = (l + r) / 2;

    find(n, l, m, maskA);
    find(n, m, r, maskB);
}

vector<int> restore_permutation(int n, int w, int r) {
    res.resize(n);
    string s;
    s.resize(n, '0');

    bruh(n, 0, n);

    compile_set();
    
    find(n, 0, n, s);

    return res;
}

#ifdef BRUH
namespace helper {

    set<string> set_;
    bool compiled = false;
    int n;
    vector<int> p;
    int w;
    int r;

    int read_int() {
        int x;
        cin >> x;
        return x;
    }

}

using namespace helper;


// A convenience function.
int get_p(int i) {
    int ret = p[i];
    return ret;
}

int main() {
    n = read_int();
    w = read_int();
    r = read_int();
    p = vector<int>(n);
    for (int i = 0; i < n; i++) {
        p[i] = i;
    }

    random_device rd;
    mt19937 g(rd());
    shuffle(p.begin(), p.end(), g);

    printf("CORRECT:\n%d", p[0]);

    for (int i = 1; i < n; i++) {
        printf(" %d", p[i]);
    }
    printf("\n");

    vector<int> answer = restore_permutation(n, w, r);
    
    if (answer.size() != n) {
        printf("WA\n");
        return 0;
    }


    printf("ANSWER:\n%d", answer[0]);

    for (int i = 1; i < n; i++) {
        printf(" %d", answer[i]);
    }
    printf("\n");

    return 0;
}

void wa() {
    printf("WA\n");
    printf("%d %d\n", w, r);
    exit(0);
}

bool check(const string& x) {
    if ((int)x.length() != n) {
        return false;
    }
    for (int i = 0; i < n; i++) {
        if (x[i] != '0' && x[i] != '1') {
            return false;
        }
    }
    return true;
}

void add_element(string x) {
    if (--w < 0 || compiled || !check(x)) {
        wa();
    }
    set_.insert(x);
}

bool check_element(string x) {
    if (--r < 0 || !compiled || !check(x)) {
        wa();
    }
    return set_.count(x);
}

void compile_set() {
    if (compiled) {
        wa();
    }
    compiled = true;
    set<string> compiledSet;
    string compiledElement = string(n, ' ');
    for (set<string>::iterator it = set_.begin(); it != set_.end(); it++) {
        string s = *it;
        for (int i = 0; i < n; i++) {
            compiledElement[i] = s[get_p(i)];
        }
        compiledSet.insert(compiledElement);
    }
    set_ = compiledSet;
}
#endif

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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