oj.uz

Submission #585341

# Submission time Handle Problem Language Result Execution time Memory
585341 2022-06-28T17:20:59 Z Drew_ Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 568 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

vector<int> restore_permutation(int n, int w, int r)
{
    const auto build = [&](const auto &self, int l, int r) -> void
    {
        if (l == r)
            return;

        int mid = (l + r) >> 1;
        for (int i = l; i <= mid; ++i)
        {
            string s = string(l, '1') + string(r-l+1, '0') + string(n-r-1, '1');
            s[i] = '1';
            add_element(s);
        }
        self(self, l, mid);
        self(self, mid+1, r);
    };
    build(build, 0, n-1);

    compile_set();
    
    vector<int> res(n);
    iota(res.begin(), res.end(), 0);

    const auto solve = [&](const auto &self, int l, int r) -> void
    {
        if (l == r)
            return;

        int mid = (l + r) >> 1;

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

        vector<int> lt, rt;
        for (int i = l; i <= r; ++i)
        {
            s[res[i]] = '1';
            if (check_element(s))
                lt.pb(res[i]);
            else rt.pb(res[i]);
            s[res[i]] = '0';
        }

        for (int i = l; i <= mid; ++i)
            res[i] = lt[i-l];
        for (int i = mid+1; i <= r; ++i)
            res[i] = rt[i-mid-1];

        self(self, l, mid);
        self(self, mid+1, r);
    };
    solve(solve, 0, n-1);

    vector<int> tmp(n);
    for (int i = 0; i < n; ++i)
        tmp[res[i]] = i; 

    return tmp;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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