oj.uz

Submission #370040

# Submission time Handle Problem Language Result Execution time Memory
370040 2021-02-23T03:50:58 Z KoD Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 632 KB 
#include <bits/stdc++.h>
#include "messy.h"

template <class T>
using Vec = std::vector<T>;

Vec<int> restore_permutation(int n, int w, int r) {
    {
        std::queue<std::pair<int, int>> que;
        que.emplace(0, n);
        while (!que.empty()) {
            const auto left = que.front().first;
            const auto right = que.front().second;
            que.pop();
            if (right - left == 1) {
                continue;
            }
            const auto mid = (left + right) / 2;
            std::string add(n, '1');
            std::fill(add.begin() + left, add.begin() + right, '0');
            for (int i = mid; i < right; ++i) {
                add[i] = '1';
                add_element(add);
                add[i] = '0';
            }
            que.emplace(left, mid);
            que.emplace(mid, right);
        }
    }
    compile_set();
    Vec<int> ret(n);
    {
        std::queue<std::tuple<int, int, Vec<int>>> que;
        {
            Vec<int> tmp(n);
            std::iota(tmp.begin(), tmp.end(), 0);
            que.emplace(0, n, std::move(tmp));
        }
        while (!que.empty()) {
            const auto left = std::get<0>(que.front());
            const auto right = std::get<1>(que.front());
            const auto idx = std::get<2>(que.front());
            que.pop();
            if (right - left == 1) {
                for (const auto i: idx) {
                    ret[i] = left;
                }
                continue;
            }
            std::string check(n, '1');
            for (const auto x: idx) {
                check[x] = '0';
            }      
            const auto mid = (left + right) / 2;
            Vec<int> v1, v2;
            for (const auto x: idx) {
                check[x] = '1';
                if (check_element(check)) {
                    v2.push_back(x);
                }
                else {
                    v1.push_back(x);
                }
                check[x] = '0';
            }
            que.emplace(left, mid, std::move(v1));
            que.emplace(mid, right, std::move(v2));
        }
    }
    return ret;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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