oj.uz

Submission #96120

# Submission time Handle Problem Language Result Execution time Memory
96120 2019-02-06T09:10:16 Z lyc Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 4 ms 640 KB 
#include <vector>
#include <bits/stdc++.h>
using namespace std;

#include "messy.h"
int N;

void add(int l, int r) {
    if (l == r) return;

    int m = (l+r)/2;
    string temp(N, '0');
    for (int i = 0; i < l; ++i) temp[i] = '1';
    for (int i = r+1; i < N; ++i) temp[i] = '1';

    for (int i = l; i <= m; ++i) {
        temp[i] = '1';
        //cout << "INSERT " << temp << endl;
        add_element(temp);
        temp[i] = '0';
    }

    add(l, m);
    add(m+1, r);
}

vector<int> check(int l, int r, string temp) {
    if (l == r) {
        vector<int> v;
        for (int i = 0; i < N; ++i) {
            if (temp[i] == '0') {
                v.push_back(i);
                break;
            }
        }
        return move(v);
    }

    int m = (l+r)/2;
    string a(temp), b(temp);
    for (int i = 0; i < N; ++i) {
        if (temp[i] == '0') {
            temp[i] = '1';
            bool exist = check_element(temp);
            //cout << "CHECK " << temp << ": " << exist << endl;
            temp[i] = '0';

            if (exist) b[i] = '1';
            else a[i] = '1';
        }
    }
   
    vector<int> lt = check(l, m, a);
    vector<int> rt = check(m+1, r, b);
    lt.insert(lt.end(), rt.begin(), rt.end());
    return lt;
}

std::vector<int> restore_permutation(int n, int w, int r) {
    N = n;
    add(0, n-1);
    compile_set();
    vector<int> goes = check(0, n-1, string(n, '0'));
    vector<int> perm(n);
    for (int i = 0; i < n; ++i) perm[goes[i]] = i;
    return perm;
}

/**
    10000000
    01000000
    00100000
    00010000
            8
    10001111
    01001111
            4
    10111111
            2
    11101111
            2

    11111000
    11110100
            4
    11111011
            2
    11111110
            2

    Total 24
 **/

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB n = 8
2 Correct 2 ms 256 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 256 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 256 KB n = 8
11 Correct 2 ms 384 KB n = 8
12 Correct 2 ms 384 KB n = 8
13 Correct 2 ms 384 KB n = 8
14 Correct 2 ms 256 KB n = 8
15 Correct 2 ms 384 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 256 KB n = 32
6 Correct 2 ms 256 KB n = 32
7 Correct 2 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 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 256 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 384 KB n = 32
8 Correct 2 ms 356 KB n = 32
9 Correct 2 ms 384 KB n = 32
10 Correct 2 ms 384 KB n = 32
11 Correct 2 ms 432 KB n = 32
12 Correct 3 ms 384 KB n = 32
13 Correct 2 ms 384 KB n = 32
14 Correct 2 ms 256 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 3 ms 512 KB n = 128
2 Correct 3 ms 512 KB n = 128
3 Correct 3 ms 512 KB n = 128
4 Correct 3 ms 512 KB n = 128
5 Correct 3 ms 512 KB n = 128
6 Correct 3 ms 512 KB n = 128
7 Correct 3 ms 512 KB n = 128
8 Correct 3 ms 512 KB n = 128
9 Correct 3 ms 512 KB n = 128
10 Correct 3 ms 512 KB n = 128
11 Correct 3 ms 512 KB n = 128
12 Correct 3 ms 512 KB n = 128
13 Correct 3 ms 512 KB n = 128
14 Correct 3 ms 512 KB n = 128
15 Correct 3 ms 640 KB n = 128

Subtask #5
30.0 / 30.0

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