oj.uz

Submission #412875

# Submission time Handle Problem Language Result Execution time Memory
412875 2021-05-27T18:05:29 Z Falcon Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 492 KB 
#include <vector>
#include <cassert>
#include <algorithm>
#include <iostream>

#include "messy.h"

using namespace std;

void add_interval(int l, int r, int n) {
    if(r - l == 1) return;

    string s(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) >> 1};
    for(int i{l}; i < m; ++i) {
        s[i] = '1';
        add_element(s);
        s[i] = '0';
    }

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

vector<int> p;
void solve_interval(int l, int r, int n, string s) {

    if(r - l == 1) {
        for(int i{}; i < n; ++i)
            if(s[i] == '0')
                p[i] = l;
        return;
    }

    vector<int> in, out;
    for(int i{}; i < n; ++i) {
        if(s[i] == '0') {
            s[i] = '1';
            if(check_element(s)) in.push_back(i);
            else out.push_back(i);
            s[i] = '0';
        }
    }


    for(int i: out) s[i] = '1';
    solve_interval(l, (l + r) >> 1, n, s);
    for(int i: out) s[i] = '0';
    for(int i: in) s[i] = '1';
    solve_interval((l + r) >> 1, r, n, s);
}

vector<int> restore_permutation(int n, int, int) {
    p.resize(n);

    add_interval(0, n, n);
    compile_set();
    solve_interval(0, n, n, string(n, '0'));

    return p;
}

Subtask #1
20.0 / 20.0

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

Subtask #5
30.0 / 30.0

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