oj.uz

Submission #639489

# Submission time Handle Problem Language Result Execution time Memory
639489 2022-09-10T08:42:40 Z piOOE Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 480 KB 
#include <bits/stdc++.h>
#include "messy.h"

using namespace std;

vector<int> restore_permutation(int n, int w, int r) {
    vector<int> p(n, -1);
    function<void(int, int)> init = [&](int l, int r) {
        if (l + 1 == r) {
            return;
        }
        string s(n, '1');
        int mid = (l + r) >> 1;
        fill(s.begin() + l, s.begin() + r, '0');
        for (int i = mid; i < r; ++i) {
            s[i] = '1';
            add_element(s);
            s[i] = '0';
        }
        init(l, mid);
        init(mid, r);
    };
    init(0, n);
    compile_set();
    function<void(int, int, vector<int>)> solve = [&](int l, int r, vector<int> a) {
        if (l + 1 == r) {
            p[a[0]] = l;
            return;
        }
        string s(n, '1');
        for (int i: a) {
            s[i] = '0';
        }
        vector<int> on, off;
        for (int i: a) {
            s[i] = '1';
            if (check_element(s)) {
                on.push_back(i);
            } else {
                off.push_back(i);
            }
            s[i] = '0';
        }
        int mid = (l + r) >> 1;
        solve(l, mid, off);
        solve(mid, r, on);
    };
    vector<int> a(n);
    iota(a.begin(), a.end(), 0);
    solve(0, n, a);
    return p;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB n = 8
6 Correct 0 ms 212 KB n = 8
7 Correct 0 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 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 1 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 0 ms 212 KB n = 32
12 Correct 0 ms 212 KB n = 32
13 Correct 0 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 1 ms 212 KB n = 32
3 Correct 0 ms 212 KB n = 32
4 Correct 1 ms 216 KB n = 32
5 Correct 1 ms 224 KB n = 32
6 Correct 1 ms 224 KB n = 32
7 Correct 1 ms 224 KB n = 32
8 Correct 1 ms 224 KB n = 32
9 Correct 1 ms 224 KB n = 32
10 Correct 1 ms 224 KB n = 32
11 Correct 1 ms 224 KB n = 32
12 Correct 0 ms 224 KB n = 32
13 Correct 0 ms 220 KB n = 32
14 Correct 1 ms 220 KB n = 32
15 Correct 1 ms 220 KB n = 32

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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